Submission #347284
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashSet; import java.util.InputMismatchException; public class Main { FastScanner in = new FastScanner(System.in); PrintWriter out = new PrintWriter(System.out); int INF = 1000000001; public void run() { int n = in.nextInt(); int[] a = in.nextIntArray(n); Arrays.sort(a); HashSet<Integer> hash = new HashSet<Integer>(); int res = 0; for (int i = 0; i < n; i++) { if (!hash.contains(a[i])) { res++; for (int x = a[i]; x < INF; x *= 2) hash.add(x); } } System.out.println(res); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------"); System.out.println(); } public void debug(Object... obj) { System.out.println(Arrays.deepToString(obj)); } class FastScanner { private InputStream stream; private byte[] buf = new byte[1024]; private int curChar; private int numChars; public FastScanner(InputStream stream) { this.stream = stream; //stream = new FileInputStream(new File("dec.in")); } int read() { if (numChars == -1) throw new InputMismatchException(); if (curChar >= numChars) { curChar = 0; try { numChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (numChars <= 0) return -1; } return buf[curChar++]; } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } int[][] nextIntMap(int n, int m) { int[][] map = new int[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextIntArray(m); } return map; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } long[][] nextLongMap(int n, int m) { long[][] map = new long[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextLongArray(m); } return map; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } double[][] nextDoubleMap(int n, int m) { double[][] map = new double[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextDoubleArray(m); } return map; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | hiro116s |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 3840 Byte |
Status | AC |
Exec Time | 1490 ms |
Memory | 124452 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 30 / 30 | 50 / 50 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask1 | subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask2 | subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 294 ms | 20784 KB |
subtask0_1.txt | AC | 292 ms | 20768 KB |
subtask0_2.txt | AC | 299 ms | 20708 KB |
subtask1_0.txt | AC | 392 ms | 27440 KB |
subtask1_1.txt | AC | 433 ms | 28948 KB |
subtask1_10.txt | AC | 390 ms | 27624 KB |
subtask1_11.txt | AC | 381 ms | 26504 KB |
subtask1_12.txt | AC | 400 ms | 27380 KB |
subtask1_13.txt | AC | 375 ms | 26088 KB |
subtask1_14.txt | AC | 377 ms | 26012 KB |
subtask1_15.txt | AC | 378 ms | 26292 KB |
subtask1_16.txt | AC | 389 ms | 26692 KB |
subtask1_17.txt | AC | 379 ms | 26204 KB |
subtask1_18.txt | AC | 378 ms | 26088 KB |
subtask1_19.txt | AC | 377 ms | 26320 KB |
subtask1_2.txt | AC | 448 ms | 29184 KB |
subtask1_3.txt | AC | 453 ms | 29080 KB |
subtask1_4.txt | AC | 424 ms | 28484 KB |
subtask1_5.txt | AC | 460 ms | 29156 KB |
subtask1_6.txt | AC | 434 ms | 29028 KB |
subtask1_7.txt | AC | 432 ms | 28912 KB |
subtask1_8.txt | AC | 441 ms | 28268 KB |
subtask1_9.txt | AC | 438 ms | 28896 KB |
subtask2_0.txt | AC | 1485 ms | 124452 KB |
subtask2_1.txt | AC | 1297 ms | 90016 KB |
subtask2_2.txt | AC | 1283 ms | 90148 KB |
subtask2_3.txt | AC | 1295 ms | 90196 KB |
subtask2_4.txt | AC | 1420 ms | 90156 KB |
subtask2_5.txt | AC | 1377 ms | 90308 KB |
subtask2_6.txt | AC | 1445 ms | 89960 KB |
subtask2_7.txt | AC | 1319 ms | 90184 KB |
subtask2_8.txt | AC | 1413 ms | 90652 KB |
subtask2_9.txt | AC | 1407 ms | 90092 KB |
subtask3_0.txt | AC | 1490 ms | 124428 KB |
subtask3_1.txt | AC | 649 ms | 43532 KB |
subtask3_2.txt | AC | 660 ms | 45668 KB |
subtask3_3.txt | AC | 665 ms | 45692 KB |
subtask3_4.txt | AC | 679 ms | 45684 KB |
subtask3_5.txt | AC | 688 ms | 45816 KB |
subtask3_6.txt | AC | 677 ms | 45700 KB |
subtask3_7.txt | AC | 672 ms | 45736 KB |
subtask3_8.txt | AC | 653 ms | 45732 KB |
subtask3_9.txt | AC | 661 ms | 45780 KB |