結果
問題 | No.1594 Three Classes |
ユーザー | kyaneko999 |
提出日時 | 2021-07-09 21:28:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 134 ms / 2,000 ms |
コード長 | 3,256 bytes |
コンパイル時間 | 211 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 77,824 KB |
最終ジャッジ日時 | 2024-04-27 23:55:37 |
合計ジャッジ時間 | 3,027 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
77,696 KB |
testcase_01 | AC | 58 ms
64,384 KB |
testcase_02 | AC | 56 ms
64,640 KB |
testcase_03 | AC | 71 ms
74,624 KB |
testcase_04 | AC | 121 ms
77,696 KB |
testcase_05 | AC | 124 ms
77,440 KB |
testcase_06 | AC | 62 ms
66,944 KB |
testcase_07 | AC | 63 ms
70,784 KB |
testcase_08 | AC | 134 ms
77,568 KB |
testcase_09 | AC | 134 ms
77,312 KB |
testcase_10 | AC | 126 ms
77,312 KB |
testcase_11 | AC | 130 ms
77,568 KB |
testcase_12 | AC | 125 ms
77,440 KB |
testcase_13 | AC | 58 ms
64,768 KB |
testcase_14 | AC | 80 ms
77,696 KB |
testcase_15 | AC | 81 ms
77,824 KB |
testcase_16 | AC | 76 ms
77,056 KB |
testcase_17 | AC | 69 ms
73,216 KB |
testcase_18 | AC | 58 ms
64,384 KB |
testcase_19 | AC | 65 ms
67,584 KB |
testcase_20 | AC | 62 ms
67,840 KB |
ソースコード
from sys import exit, stdin, setrecursionlimit from collections import deque, defaultdict, Counter from copy import deepcopy from bisect import bisect_left, bisect_right, insort_left, insort_right from heapq import heapify, heappop, heappush from itertools import product, permutations, combinations, combinations_with_replacement from functools import reduce from math import gcd, sin, cos, tan, asin, acos, atan, atan2, degrees, radians, ceil, floor, sqrt, factorial from math import pi as PI from random import randint # from decimal import Decimal setrecursionlimit(500000) INF = (1<<61)-1 EPS = 1e-10 MOD = 10**9+7 # MOD = 998244353 def input(): return stdin.readline()[:-1] def intput(): return int(stdin.readline()) def minput(): return stdin.readline()[:-1].split() def linput(): return stdin.readline()[:-1].split() def mint(): return map(int,stdin.readline().split()) def lint(): return list(map(int,stdin.readline().split())) def ilint(): return int(stdin.readline()), list(map(int,stdin.readline().split())) def lcm(x,y): return x*y//gcd(x,y) def lgcd(l): return reduce(gcd,l) def llcm(l): return reduce(lcm,l) def powmod(n,i,mod=MOD): return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod) def div2(x): return x.bit_length() def div10(x): return len(str(x))-(x==0) def popcount(x): return bin(x).count('1') def digit(x,i,max_len=None): s = str(x) if max_len: i -= max_len-len(s) return int(s[i-1]) if i>0 else 0 def digitsum(x): ans = 0 for i in range(div10(x)): ans += digit(x,i+1) return ans def pf(x,mode='counter'): C = Counter() p = 2 while x>1: k = 0 while x%p==0: x //= p k += 1 if k>0: C[p] += k p = p+2-(p==2) if p*p<x else x if mode=='counter': return C S = set([1]) for k in C: T = set() for x in S: for i in range(C[k]+1): T.add(x*(k**i)) S = T if mode=='set': return S if mode=='list': return sorted(S) def isprime(x): if x<2: return False return len(pf(x,'set'))==2 def matmul(A, B): # import numpy A1, A2 = A >> 15, A & (1 << 15) - 1 B1, B2 = B >> 15, B & (1 << 15) - 1 X = np.dot(A1, B1) % MOD Y = np.dot(A2, B2) Z = np.dot(A1 + A2, B1 + B2) - X - Y return ((X << 30) + (Z << 15) + Y) % MOD def matpow(A, N): P = np.eye(A.shape[0], dtype=np.int64) while N: if N & 1: P = matmul(P, A) A = matmul(A, A) N >>= 1 return P def zash(S): lis = sorted(S) dic = {} for i,x in enumerate(lis): dic[x] = i return lis, dic def pr(*x): print(*x, sep='', end='') if len(x) else print() def lprint(l): for x in l: print(x) def ston(c, c0='a'): return ord(c)-ord(c0) def ntos(x, c0='a'): return chr(x+ord(c0)) def judge(x, l=['Yes', 'No']): print(l[0] if x else l[1]) def debug(*x, flag=1): if flag: print(*x) ###################################################### N,A=ilint() for v in product(range(3),repeat=N): s=[0]*3 for a,i in zip(A,v): s[i]+=a if s[0]==s[1]==s[2]: judge(1) exit() judge(0)