結果
問題 | No.182 新規性の虜 |
ユーザー | McGregorsh |
提出日時 | 2023-03-19 14:23:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 181 ms / 5,000 ms |
コード長 | 1,499 bytes |
コンパイル時間 | 162 ms |
コンパイル使用メモリ | 81,836 KB |
実行使用メモリ | 116,604 KB |
最終ジャッジ日時 | 2023-10-18 17:49:37 |
合計ジャッジ時間 | 6,315 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
88,472 KB |
testcase_01 | AC | 147 ms
88,476 KB |
testcase_02 | AC | 145 ms
88,480 KB |
testcase_03 | AC | 143 ms
88,480 KB |
testcase_04 | AC | 147 ms
88,480 KB |
testcase_05 | AC | 142 ms
88,484 KB |
testcase_06 | AC | 148 ms
88,476 KB |
testcase_07 | AC | 143 ms
88,480 KB |
testcase_08 | AC | 167 ms
103,000 KB |
testcase_09 | AC | 181 ms
113,792 KB |
testcase_10 | AC | 176 ms
110,732 KB |
testcase_11 | AC | 170 ms
105,676 KB |
testcase_12 | AC | 154 ms
93,212 KB |
testcase_13 | AC | 141 ms
88,480 KB |
testcase_14 | AC | 143 ms
88,476 KB |
testcase_15 | AC | 142 ms
88,480 KB |
testcase_16 | AC | 143 ms
88,476 KB |
testcase_17 | AC | 143 ms
88,476 KB |
testcase_18 | AC | 163 ms
98,580 KB |
testcase_19 | AC | 158 ms
95,080 KB |
testcase_20 | AC | 152 ms
91,468 KB |
testcase_21 | AC | 164 ms
100,204 KB |
testcase_22 | AC | 156 ms
92,964 KB |
testcase_23 | AC | 141 ms
88,480 KB |
testcase_24 | AC | 179 ms
116,604 KB |
testcase_25 | AC | 159 ms
100,588 KB |
testcase_26 | AC | 147 ms
89,260 KB |
testcase_27 | AC | 156 ms
88,476 KB |
evil01.txt | AC | 185 ms
117,384 KB |
evil02.txt | AC | 187 ms
117,384 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) A = i_list() co = Counter(A) ans = 0 for key, value in co.items(): if value == 1: ans += 1 print(ans) if __name__ == '__main__': main()