結果
問題 | No.182 新規性の虜 |
ユーザー | nCk_cv |
提出日時 | 2016-07-10 18:33:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 693 ms / 5,000 ms |
コード長 | 3,392 bytes |
コンパイル時間 | 3,388 ms |
コンパイル使用メモリ | 80,128 KB |
実行使用メモリ | 65,420 KB |
最終ジャッジ日時 | 2023-08-27 12:24:04 |
合計ジャッジ時間 | 15,009 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
56,068 KB |
testcase_01 | AC | 129 ms
55,724 KB |
testcase_02 | AC | 133 ms
55,888 KB |
testcase_03 | AC | 134 ms
55,996 KB |
testcase_04 | AC | 133 ms
56,016 KB |
testcase_05 | AC | 136 ms
55,480 KB |
testcase_06 | AC | 134 ms
55,512 KB |
testcase_07 | AC | 136 ms
56,052 KB |
testcase_08 | AC | 555 ms
62,984 KB |
testcase_09 | AC | 693 ms
65,420 KB |
testcase_10 | AC | 638 ms
65,016 KB |
testcase_11 | AC | 618 ms
63,184 KB |
testcase_12 | AC | 443 ms
60,792 KB |
testcase_13 | AC | 138 ms
55,680 KB |
testcase_14 | AC | 139 ms
55,892 KB |
testcase_15 | AC | 134 ms
56,232 KB |
testcase_16 | AC | 136 ms
55,680 KB |
testcase_17 | AC | 140 ms
55,852 KB |
testcase_18 | AC | 559 ms
60,400 KB |
testcase_19 | AC | 460 ms
60,336 KB |
testcase_20 | AC | 411 ms
60,396 KB |
testcase_21 | AC | 540 ms
60,464 KB |
testcase_22 | AC | 414 ms
60,176 KB |
testcase_23 | AC | 131 ms
55,832 KB |
testcase_24 | AC | 612 ms
65,200 KB |
testcase_25 | AC | 518 ms
60,396 KB |
testcase_26 | AC | 305 ms
60,184 KB |
testcase_27 | AC | 132 ms
55,988 KB |
evil01.txt | AC | 693 ms
68,252 KB |
evil02.txt | AC | 701 ms
68,360 KB |
ソースコード
import java.io.*; import java.math.*; import java.util.*; import java.util.Map.Entry; 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<>(); for(int i = 0; i < N; i++) { int a = sc.nextInt(); if(map.containsKey(a)) map.put(a, false); else map.put(a, true); } long ans = map.entrySet().parallelStream().filter(s -> {return s.getValue().booleanValue();}).count(); System.out.println(ans); } 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(); } } } }