結果
問題 | No.1972 Modulo Set |
ユーザー | McGregorsh |
提出日時 | 2022-07-29 13:35:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 597 ms / 2,000 ms |
コード長 | 2,163 bytes |
コンパイル時間 | 541 ms |
コンパイル使用メモリ | 87,100 KB |
実行使用メモリ | 125,340 KB |
最終ジャッジ日時 | 2023-09-26 10:08:56 |
合計ジャッジ時間 | 16,399 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
92,284 KB |
testcase_01 | AC | 249 ms
92,512 KB |
testcase_02 | AC | 252 ms
92,236 KB |
testcase_03 | AC | 273 ms
95,128 KB |
testcase_04 | AC | 275 ms
97,580 KB |
testcase_05 | AC | 276 ms
99,460 KB |
testcase_06 | AC | 294 ms
104,812 KB |
testcase_07 | AC | 305 ms
112,692 KB |
testcase_08 | AC | 266 ms
100,712 KB |
testcase_09 | AC | 260 ms
93,744 KB |
testcase_10 | AC | 278 ms
97,776 KB |
testcase_11 | AC | 305 ms
110,628 KB |
testcase_12 | AC | 272 ms
93,700 KB |
testcase_13 | AC | 264 ms
93,740 KB |
testcase_14 | AC | 268 ms
93,856 KB |
testcase_15 | AC | 367 ms
113,256 KB |
testcase_16 | AC | 402 ms
114,180 KB |
testcase_17 | AC | 295 ms
100,068 KB |
testcase_18 | AC | 244 ms
92,252 KB |
testcase_19 | AC | 380 ms
110,348 KB |
testcase_20 | AC | 420 ms
115,136 KB |
testcase_21 | AC | 309 ms
102,224 KB |
testcase_22 | AC | 367 ms
108,484 KB |
testcase_23 | AC | 535 ms
118,904 KB |
testcase_24 | AC | 357 ms
105,396 KB |
testcase_25 | AC | 405 ms
111,328 KB |
testcase_26 | AC | 395 ms
116,464 KB |
testcase_27 | AC | 563 ms
121,688 KB |
testcase_28 | AC | 352 ms
106,568 KB |
testcase_29 | AC | 405 ms
111,904 KB |
testcase_30 | AC | 478 ms
119,312 KB |
testcase_31 | AC | 257 ms
93,628 KB |
testcase_32 | AC | 450 ms
116,196 KB |
testcase_33 | AC | 588 ms
125,336 KB |
testcase_34 | AC | 582 ms
125,232 KB |
testcase_35 | AC | 585 ms
125,340 KB |
testcase_36 | AC | 597 ms
125,296 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 if m % 2 == 0: if key == m // 2: 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()