結果
問題 | No.1972 Modulo Set |
ユーザー | McGregorsh |
提出日時 | 2022-07-29 13:22:24 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,918 bytes |
コンパイル時間 | 1,077 ms |
コンパイル使用メモリ | 86,660 KB |
実行使用メモリ | 125,140 KB |
最終ジャッジ日時 | 2023-09-26 09:53:12 |
合計ジャッジ時間 | 15,147 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,316 KB |
testcase_01 | AC | 235 ms
92,172 KB |
testcase_02 | AC | 236 ms
92,108 KB |
testcase_03 | AC | 257 ms
94,800 KB |
testcase_04 | AC | 256 ms
97,484 KB |
testcase_05 | WA | - |
testcase_06 | AC | 267 ms
104,892 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 244 ms
93,468 KB |
testcase_10 | WA | - |
testcase_11 | AC | 282 ms
110,116 KB |
testcase_12 | AC | 252 ms
93,600 KB |
testcase_13 | AC | 245 ms
93,424 KB |
testcase_14 | AC | 246 ms
93,596 KB |
testcase_15 | AC | 341 ms
113,444 KB |
testcase_16 | AC | 365 ms
114,688 KB |
testcase_17 | AC | 272 ms
99,444 KB |
testcase_18 | AC | 228 ms
92,380 KB |
testcase_19 | AC | 359 ms
109,920 KB |
testcase_20 | AC | 388 ms
115,848 KB |
testcase_21 | AC | 287 ms
101,960 KB |
testcase_22 | AC | 350 ms
108,920 KB |
testcase_23 | AC | 515 ms
119,436 KB |
testcase_24 | AC | 340 ms
105,536 KB |
testcase_25 | AC | 388 ms
111,664 KB |
testcase_26 | WA | - |
testcase_27 | AC | 527 ms
121,012 KB |
testcase_28 | AC | 332 ms
106,324 KB |
testcase_29 | AC | 385 ms
111,544 KB |
testcase_30 | AC | 453 ms
119,200 KB |
testcase_31 | AC | 243 ms
93,460 KB |
testcase_32 | AC | 438 ms
116,740 KB |
testcase_33 | AC | 564 ms
125,020 KB |
testcase_34 | AC | 571 ms
125,016 KB |
testcase_35 | AC | 564 ms
125,140 KB |
testcase_36 | AC | 567 ms
124,864 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 >= 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()