結果
問題 | No.1972 Modulo Set |
ユーザー | McGregorsh |
提出日時 | 2022-07-29 13:30:22 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,982 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 125,088 KB |
最終ジャッジ日時 | 2023-09-26 10:02:33 |
合計ジャッジ時間 | 15,674 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,292 KB |
testcase_01 | AC | 237 ms
92,360 KB |
testcase_02 | AC | 235 ms
92,316 KB |
testcase_03 | AC | 262 ms
94,488 KB |
testcase_04 | AC | 266 ms
97,556 KB |
testcase_05 | WA | - |
testcase_06 | AC | 278 ms
104,444 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 250 ms
93,480 KB |
testcase_10 | WA | - |
testcase_11 | AC | 287 ms
110,384 KB |
testcase_12 | AC | 266 ms
93,544 KB |
testcase_13 | AC | 251 ms
93,552 KB |
testcase_14 | AC | 253 ms
93,388 KB |
testcase_15 | AC | 354 ms
113,492 KB |
testcase_16 | AC | 384 ms
114,608 KB |
testcase_17 | AC | 289 ms
99,468 KB |
testcase_18 | AC | 236 ms
92,136 KB |
testcase_19 | AC | 369 ms
109,848 KB |
testcase_20 | AC | 403 ms
115,860 KB |
testcase_21 | AC | 301 ms
101,620 KB |
testcase_22 | AC | 365 ms
108,268 KB |
testcase_23 | AC | 537 ms
119,412 KB |
testcase_24 | AC | 349 ms
105,236 KB |
testcase_25 | AC | 412 ms
111,748 KB |
testcase_26 | WA | - |
testcase_27 | AC | 540 ms
121,028 KB |
testcase_28 | AC | 350 ms
106,336 KB |
testcase_29 | AC | 403 ms
111,496 KB |
testcase_30 | AC | 472 ms
119,056 KB |
testcase_31 | AC | 250 ms
93,416 KB |
testcase_32 | AC | 449 ms
115,728 KB |
testcase_33 | AC | 609 ms
125,060 KB |
testcase_34 | AC | 602 ms
125,088 KB |
testcase_35 | AC | 597 ms
124,908 KB |
testcase_36 | AC | 600 ms
125,080 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 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() mod_a = [] for i in range(n): num = A[i] % m mod_a.append(num) #print(mod_a) count = Counter(mod_a) lines = [] for key, value in count.items(): yuu = value if key == 0: if value == n: print(0) exit() if value >= 2: yuu = 1 lines.append([yuu, key]) lines.sort(reverse=True) nums = set() ans = 0 for i in range(len(lines)): score, cost = lines[i] point = m - cost if point not in nums: ans += score nums.add(cost) print(ans) if __name__ == '__main__': main()