結果
問題 | No.1940 Escape through + - |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 22:18:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 265 ms / 2,000 ms |
コード長 | 1,479 bytes |
コンパイル時間 | 298 ms |
コンパイル使用メモリ | 87,156 KB |
実行使用メモリ | 107,936 KB |
最終ジャッジ日時 | 2023-08-18 00:48:19 |
合計ジャッジ時間 | 10,649 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
92,204 KB |
testcase_01 | AC | 247 ms
92,256 KB |
testcase_02 | AC | 241 ms
92,284 KB |
testcase_03 | AC | 244 ms
92,436 KB |
testcase_04 | AC | 244 ms
92,200 KB |
testcase_05 | AC | 244 ms
92,240 KB |
testcase_06 | AC | 245 ms
92,572 KB |
testcase_07 | AC | 246 ms
92,408 KB |
testcase_08 | AC | 248 ms
92,456 KB |
testcase_09 | AC | 248 ms
92,572 KB |
testcase_10 | AC | 245 ms
92,480 KB |
testcase_11 | AC | 245 ms
92,396 KB |
testcase_12 | AC | 251 ms
92,248 KB |
testcase_13 | AC | 247 ms
92,488 KB |
testcase_14 | AC | 248 ms
92,568 KB |
testcase_15 | AC | 248 ms
92,384 KB |
testcase_16 | AC | 249 ms
92,440 KB |
testcase_17 | AC | 249 ms
92,312 KB |
testcase_18 | AC | 249 ms
92,416 KB |
testcase_19 | AC | 247 ms
92,264 KB |
testcase_20 | AC | 250 ms
93,180 KB |
testcase_21 | AC | 251 ms
93,152 KB |
testcase_22 | AC | 246 ms
93,060 KB |
testcase_23 | AC | 249 ms
93,092 KB |
testcase_24 | AC | 265 ms
107,580 KB |
testcase_25 | AC | 262 ms
107,728 KB |
testcase_26 | AC | 262 ms
107,648 KB |
testcase_27 | AC | 263 ms
107,748 KB |
testcase_28 | AC | 264 ms
107,936 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, S = i_map() A = i_list() SA = sum(A) if (S - SA) % M == 0: print('Yes') else: print('No') if __name__ == '__main__': main()