結果
問題 | No.182 新規性の虜 |
ユーザー | YukimotoPG |
提出日時 | 2019-03-01 12:32:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 179 ms / 5,000 ms |
コード長 | 2,340 bytes |
コンパイル時間 | 2,274 ms |
コンパイル使用メモリ | 74,828 KB |
実行使用メモリ | 59,384 KB |
最終ジャッジ日時 | 2023-09-05 16:31:44 |
合計ジャッジ時間 | 6,276 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,336 KB |
testcase_01 | AC | 43 ms
49,272 KB |
testcase_02 | AC | 44 ms
49,352 KB |
testcase_03 | AC | 43 ms
49,080 KB |
testcase_04 | AC | 42 ms
49,540 KB |
testcase_05 | AC | 43 ms
49,088 KB |
testcase_06 | AC | 44 ms
49,428 KB |
testcase_07 | AC | 43 ms
49,088 KB |
testcase_08 | AC | 160 ms
56,756 KB |
testcase_09 | AC | 179 ms
57,124 KB |
testcase_10 | AC | 168 ms
56,952 KB |
testcase_11 | AC | 166 ms
57,740 KB |
testcase_12 | AC | 124 ms
54,560 KB |
testcase_13 | AC | 42 ms
47,224 KB |
testcase_14 | AC | 43 ms
49,132 KB |
testcase_15 | AC | 43 ms
49,380 KB |
testcase_16 | AC | 42 ms
49,080 KB |
testcase_17 | AC | 43 ms
49,160 KB |
testcase_18 | AC | 133 ms
54,312 KB |
testcase_19 | AC | 125 ms
54,816 KB |
testcase_20 | AC | 107 ms
51,984 KB |
testcase_21 | AC | 142 ms
54,352 KB |
testcase_22 | AC | 114 ms
54,724 KB |
testcase_23 | AC | 44 ms
49,136 KB |
testcase_24 | AC | 157 ms
59,384 KB |
testcase_25 | AC | 113 ms
52,512 KB |
testcase_26 | AC | 87 ms
51,960 KB |
testcase_27 | AC | 43 ms
49,128 KB |
evil01.txt | AC | 190 ms
59,268 KB |
evil02.txt | AC | 181 ms
59,076 KB |
ソースコード
import java.util.*; import static java.lang.System.*; import java.io.*; class Main { static int maxInt = Integer.MAX_VALUE; static int minInt = Integer.MIN_VALUE; static int max (int... ar) {Arrays.sort(ar);return ar[ar.length-1];} static int min (int... ar) {Arrays.sort(ar);return ar[0];} static FastScanner sc = new FastScanner(); public static void main(String[] args) { //MAIN---------------------------------------------------------- int n = sc.nextInt(); HashMap<Integer, Integer> map = new HashMap<>(); for (int i=0; i<n; i++) { int temp = sc.nextInt(); map.put(temp, map.getOrDefault(temp,0)+1); } int ans = 0; for (Map.Entry<Integer, Integer> e: map.entrySet()) { if (e.getValue() == 1) ans++; } out.println(ans); //-------------------------------------------------------------- } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0; private int p = 0; boolean hasNextByte () { if (p < length) return true; else { p = 0; try {length = in.read(buffer);} catch (Exception e) {e.printStackTrace();} if (length == 0) return false; } return true; } int readByte () { if (hasNextByte() == true) return buffer[p++]; return -1; } boolean isPrintable (int n) {return 33<=n&&n<=126;} void skip () { while (hasNextByte() && !isPrintable(buffer[p])) p++; } boolean hasNext () {skip(); return hasNextByte();} String next () { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt () { return (int) nextLong(); } public int[] nextInts (int n) { int[] ar = new int[n]; for (int i=0; i<n; i++) ar[i] = nextInt(); return ar; } public long nextLong () { if (!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp<'0' || '9'<temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0'<=temp && temp<='9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus? -n : n; } }