結果
問題 | No.182 新規性の虜 |
ユーザー | nCk_cv |
提出日時 | 2016-07-10 18:07:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 702 ms / 5,000 ms |
コード長 | 3,462 bytes |
コンパイル時間 | 4,260 ms |
コンパイル使用メモリ | 77,772 KB |
実行使用メモリ | 68,920 KB |
最終ジャッジ日時 | 2023-08-27 12:11:31 |
合計ジャッジ時間 | 13,671 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
55,908 KB |
testcase_01 | AC | 128 ms
55,648 KB |
testcase_02 | AC | 121 ms
55,436 KB |
testcase_03 | AC | 124 ms
56,060 KB |
testcase_04 | AC | 123 ms
55,700 KB |
testcase_05 | AC | 127 ms
55,916 KB |
testcase_06 | AC | 123 ms
55,880 KB |
testcase_07 | AC | 126 ms
56,320 KB |
testcase_08 | AC | 542 ms
65,048 KB |
testcase_09 | AC | 702 ms
67,040 KB |
testcase_10 | AC | 636 ms
67,220 KB |
testcase_11 | AC | 622 ms
64,792 KB |
testcase_12 | AC | 421 ms
63,140 KB |
testcase_13 | AC | 122 ms
55,796 KB |
testcase_14 | AC | 123 ms
55,852 KB |
testcase_15 | AC | 119 ms
56,000 KB |
testcase_16 | AC | 122 ms
55,664 KB |
testcase_17 | AC | 125 ms
55,740 KB |
testcase_18 | AC | 523 ms
60,696 KB |
testcase_19 | AC | 436 ms
60,264 KB |
testcase_20 | AC | 382 ms
60,000 KB |
testcase_21 | AC | 513 ms
60,460 KB |
testcase_22 | AC | 401 ms
60,184 KB |
testcase_23 | AC | 121 ms
55,516 KB |
testcase_24 | AC | 595 ms
68,920 KB |
testcase_25 | AC | 455 ms
60,364 KB |
testcase_26 | AC | 301 ms
60,328 KB |
testcase_27 | AC | 123 ms
55,920 KB |
evil01.txt | AC | 672 ms
68,136 KB |
evil02.txt | AC | 696 ms
68,672 KB |
ソースコード
import java.io.*; import java.math.*; import java.util.*; class Main { static int[] vy = {1,0,-1,0}; static int[] vx = {0,1,0,-1}; static long mod = 1000000007; static HashMap<String,Boolean> map = new HashMap<String,Boolean>(); public static void main(String[] args) { //FastScanner sc = new FastScanner(); Scanner sc = new Scanner(System.in); int N = sc.nextInt(); HashMap<Integer,Boolean> map = new HashMap<>(); ArrayList<Integer> list = new ArrayList<Integer>(); for(int i = 0; i < N; i++) { int a = sc.nextInt(); if(map.containsKey(a)) { map.put(a, false); } else { map.put(a,true); list.add(a); } } int count = 0; for(int i = 0; i < list.size(); i++) { if(map.get(list.get(i))) { count++; } } System.out.println(count); } static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } } }