結果
問題 | No.1972 Modulo Set |
ユーザー | McGregorsh |
提出日時 | 2022-07-29 13:18:00 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,839 bytes |
コンパイル時間 | 1,470 ms |
コンパイル使用メモリ | 87,256 KB |
実行使用メモリ | 125,308 KB |
最終ジャッジ日時 | 2023-09-26 09:48:37 |
合計ジャッジ時間 | 16,666 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,516 KB |
testcase_01 | AC | 237 ms
92,480 KB |
testcase_02 | AC | 231 ms
92,460 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 248 ms
93,600 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 252 ms
93,528 KB |
testcase_14 | AC | 253 ms
93,776 KB |
testcase_15 | WA | - |
testcase_16 | AC | 376 ms
114,544 KB |
testcase_17 | AC | 282 ms
99,664 KB |
testcase_18 | AC | 235 ms
92,532 KB |
testcase_19 | AC | 372 ms
110,156 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 355 ms
108,732 KB |
testcase_23 | AC | 523 ms
119,436 KB |
testcase_24 | AC | 339 ms
105,652 KB |
testcase_25 | AC | 390 ms
111,756 KB |
testcase_26 | WA | - |
testcase_27 | AC | 521 ms
120,920 KB |
testcase_28 | AC | 337 ms
107,072 KB |
testcase_29 | AC | 388 ms
111,948 KB |
testcase_30 | AC | 468 ms
119,312 KB |
testcase_31 | AC | 251 ms
93,668 KB |
testcase_32 | AC | 436 ms
116,512 KB |
testcase_33 | AC | 554 ms
125,064 KB |
testcase_34 | AC | 565 ms
125,092 KB |
testcase_35 | AC | 571 ms
125,092 KB |
testcase_36 | AC | 578 ms
125,308 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(): lines.append([value, 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()