結果
問題 | No.1692 Expectations |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 15:12:16 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,411 bytes |
コンパイル時間 | 391 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 145,096 KB |
最終ジャッジ日時 | 2023-08-17 20:24:23 |
合計ジャッジ時間 | 8,229 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
92,404 KB |
testcase_01 | AC | 243 ms
92,116 KB |
testcase_02 | AC | 238 ms
92,396 KB |
testcase_03 | AC | 238 ms
92,420 KB |
testcase_04 | AC | 239 ms
92,280 KB |
testcase_05 | AC | 242 ms
92,384 KB |
testcase_06 | AC | 242 ms
92,424 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 240 ms
92,116 KB |
testcase_10 | WA | - |
testcase_11 | AC | 274 ms
119,396 KB |
testcase_12 | AC | 239 ms
92,244 KB |
testcase_13 | AC | 240 ms
92,308 KB |
testcase_14 | AC | 242 ms
94,176 KB |
testcase_15 | AC | 298 ms
135,640 KB |
testcase_16 | AC | 245 ms
94,512 KB |
testcase_17 | AC | 271 ms
114,672 KB |
testcase_18 | AC | 247 ms
99,044 KB |
testcase_19 | AC | 299 ms
123,248 KB |
testcase_20 | AC | 289 ms
145,096 KB |
testcase_21 | AC | 290 ms
125,624 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, M = i_map() A = i_list() print(len(set(A)), 0) if __name__ == '__main__': main()