結果
問題 | No.1594 Three Classes |
ユーザー | McGregorsh |
提出日時 | 2022-07-21 19:55:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 271 ms / 2,000 ms |
コード長 | 1,721 bytes |
コンパイル時間 | 147 ms |
コンパイル使用メモリ | 82,104 KB |
実行使用メモリ | 90,624 KB |
最終ジャッジ日時 | 2024-04-28 00:51:10 |
合計ジャッジ時間 | 5,342 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 259 ms
90,624 KB |
testcase_01 | AC | 145 ms
89,588 KB |
testcase_02 | AC | 154 ms
89,168 KB |
testcase_03 | AC | 160 ms
90,092 KB |
testcase_04 | AC | 262 ms
90,300 KB |
testcase_05 | AC | 271 ms
90,460 KB |
testcase_06 | AC | 165 ms
89,548 KB |
testcase_07 | AC | 156 ms
90,144 KB |
testcase_08 | AC | 261 ms
90,268 KB |
testcase_09 | AC | 254 ms
90,476 KB |
testcase_10 | AC | 255 ms
90,468 KB |
testcase_11 | AC | 256 ms
90,260 KB |
testcase_12 | AC | 257 ms
90,276 KB |
testcase_13 | AC | 146 ms
89,700 KB |
testcase_14 | AC | 162 ms
90,136 KB |
testcase_15 | AC | 161 ms
90,416 KB |
testcase_16 | AC | 162 ms
89,736 KB |
testcase_17 | AC | 156 ms
90,016 KB |
testcase_18 | AC | 148 ms
89,408 KB |
testcase_19 | AC | 152 ms
90,052 KB |
testcase_20 | AC | 152 ms
89,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 = int(input()) e = i_list() for bit in product([0, 1, 2], repeat=n): a = 0 b = 0 c = 0 for i in range(n): if bit[i] == 0: a += e[i] elif bit[i] == 1: b += e[i] else: c += e[i] if a == b == c: print('Yes') exit() print('No') if __name__ == '__main__': main()