結果
問題 | No.1823 Tricolor Dango |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 17:02:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 380 ms / 2,000 ms |
コード長 | 1,640 bytes |
コンパイル時間 | 264 ms |
コンパイル使用メモリ | 87,320 KB |
実行使用メモリ | 119,728 KB |
最終ジャッジ日時 | 2023-08-17 21:29:24 |
合計ジャッジ時間 | 11,457 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 253 ms
92,512 KB |
testcase_01 | AC | 380 ms
95,180 KB |
testcase_02 | AC | 362 ms
95,260 KB |
testcase_03 | AC | 364 ms
95,076 KB |
testcase_04 | AC | 305 ms
94,096 KB |
testcase_05 | AC | 300 ms
94,508 KB |
testcase_06 | AC | 302 ms
93,964 KB |
testcase_07 | AC | 264 ms
93,532 KB |
testcase_08 | AC | 264 ms
93,564 KB |
testcase_09 | AC | 264 ms
93,844 KB |
testcase_10 | AC | 265 ms
93,648 KB |
testcase_11 | AC | 263 ms
93,796 KB |
testcase_12 | AC | 264 ms
93,648 KB |
testcase_13 | AC | 259 ms
94,332 KB |
testcase_14 | AC | 262 ms
94,064 KB |
testcase_15 | AC | 255 ms
94,184 KB |
testcase_16 | AC | 263 ms
97,196 KB |
testcase_17 | AC | 259 ms
97,456 KB |
testcase_18 | AC | 265 ms
105,172 KB |
testcase_19 | AC | 286 ms
119,728 KB |
testcase_20 | AC | 260 ms
105,096 KB |
testcase_21 | AC | 348 ms
96,564 KB |
testcase_22 | AC | 358 ms
95,212 KB |
testcase_23 | AC | 332 ms
94,856 KB |
testcase_24 | AC | 346 ms
96,512 KB |
testcase_25 | AC | 359 ms
95,156 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(): T = int(input()) for i in range(T): N = int(input()) A = i_list() B = sum(A) if B % 3 != 0: print('No') else: C = B // 3 D = max(A) if D > C: print('No') else: print('Yes') if __name__ == '__main__': main()