input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in range(n):
if a[i] < 0:
a[i] = 0
if i == n-1:
if b[i] <= a[i]+a[i+1]:
count += b[i]
else:
count += a[i]+a[i+1]
else:
if b[i] ... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in range(n):
if i == n-1:
if b[i] <= a[i]+a[i+1]:
count += b[i]
else:
count += a[i]+a[i+1]
else:
if b[i] <= a[i]:
count += b[i]
... | p02959 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in range(n):
if i == n-1:
if b[i] <= a[i]+a[i+1]:
count += b[i]
else:
count += a[i]+a[i+1]
else:
if b[i] <= a[i]:
count += b[i]
... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in range(n):
if b[i] <= a[i]:
count += b[i]
else:
p = b[i]-a[i]
count += a[i]
if p > a[i+1]:
count += a[i+1]
a[i+1] = 0
else... | p02959 |
def main():
N = int(eval(input()))
A = [int(f) for f in input().split()]
B = [int(f) for f in input().split()]
m = 0
for i in range(N):
while A[i] > 0 and B[i] > 0:
A[i] -= 1
B[i] -= 1
m += 1
if B[i] > 0:
while A[i+1] > 0 and B[i] > 0:
A[i+1] -= 1
B[i] -= 1
m += 1
... |
def main():
N = int(eval(input()))
A = [int(f) for f in input().split()]
B = [int(f) for f in input().split()]
m = 0
for i in range(N):
A[i] = A[i] - B[i]
m += B[i]
if A[i] < 0:
B[i] = -A[i]
m += A[i]
A[i] = 0
else:
continue
if B[i] > 0:
A[i+1] = A[i+1] - B[i]
m +=... | p02959 |
n = int(eval(input()))
alis = list(map(int, input().split()))
blis = list(map(int, input().split()))
ans = 0
for i in range(n):
if alis[i] + alis[i+1] > blis[i]:
ans += blis[i]
alis[i+1] = alis[i+1] - max(blis[i] - alis[i], 0)
else:
ans += alis[i] + alis[i+1]
alis[i+1] ... | n = int(eval(input()))
alis = list(map(int, input().split()))
blis = list(map(int, input().split()))
ans = 0
cross = 0
for i in range(n):
front = min(alis[i]-cross, blis[i])
cross = min(alis[i+1], blis[i]-front)
ans += front + cross
print(ans) | p02959 |
n=int(eval(input()))
monsters=[int(x) for x in input().split(' ')]
powers=[int(x) for x in input().split(' ')]
ans=0
for i in range(n):
t=min(monsters[i],powers[i])
ans+=t
t2=min(monsters[i+1],powers[i]-t)
ans+=t2
monsters[i+1]-=t2
print(ans) | n=int(eval(input()))
A=[int(x) for x in input().split(' ')]
B=[int(x) for x in input().split(' ')]
ans=0
for i in range(n):
if (A[i]>=B[i]):
ans+=B[i]
else:
ans+=A[i]
B[i]-=A[i]
if (A[i+1]>=B[i]):
ans+=B[i]
A[i+1]-=B[i]
else:
ans+=A[i+1]
A[i+1]=0
print(ans) | p02959 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
ans = 0
for i in range(N):
d = min(A[i], B[i])
ans += d
A[i] -= d
B[i] -= d
d = min(A[i + 1], B[i])
ans += d
A[i + 1] -= d
B[i] -= d
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
for i in range(N):
d = min(A[i], B[i])
ans += d
A[i] -= d
B[i] -= d
d = min(A[i + 1], B[i])
ans += d
A[i + 1] -= d
B[i] -= d
print(ans) | p02959 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
if A[i] >= B[i]:
ans += B[i]
A[i] -= B[i]
else:
ans += A[i]
B[i] -= A[i]
A[i] = 0
if A[i + 1] >= B[i]:
ans += B[i]
... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
if A[i] >= B[i]:
ans += B[i]
else:
ans += A[i]
B[i] -= A[i]
if A[i + 1] >= B[i]:
ans += B[i]
A[i + 1] -= B[i]
els... | p02959 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
St = sum(A)
for T in range(0,N):
if A[T]+A[T+1]<= B[T]:
A[T] = 0
A[T+1] = 0
if A[T]<=B[T]<A[T]+A[T+1]:
A[T+1] = A[T+1]-(B[T]-A[T])
A[T] = 0
if B[T]<A[T]:
A... | N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
Pre = sum(A)
for T in range(0,N):
if A[T]<=B[T]:
A[T+1] = max(A[T+1]-(B[T]-A[T]),0)
A[T] = 0
else:
A[T] -= B[T]
Aft = sum(A)
print((Pre-Aft)) | p02959 |
n=int(eval(input()))
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
ans=0
for i in range(n-1,-1,-1): #勇者を後ろから順にみていく
if arr1[i+1]>=arr2[i]: #i番目の勇者がi+1番目の町のモンスターしか倒せないとき
ans+=arr2[i]
continue
else: #i番目の勇者がi番目の町のモンスターも倒す余裕があるとき
ans+=arr1[i+1]
arr2[i]-=arr1[i+1]
if arr... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans, surplus = 0, 0
for i in range(N):
tmp = min(A[i], surplus)
ans += tmp
A[i] -= tmp
if B[i] > A[i]:
ans += A[i]
surplus = B[i] - A[i]
else:
ans += B[i]
sur... | p02959 |
#ABC-136-C
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
hunted_monsters = 0
for i in range(N):
#勇者iが街iのモンスターを全て倒しても余力がある場合
if A[i] < B[i]:
B[i] -= A[i]
hunted_monsters += A[i]
A[i] = 0
#街i+1のモンスターも全て倒せる場合
if ... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
# 勇者に余力がある場合
if B[i] >= A[i]:
ans += A[i]
B[i] -= A[i]
if B[i] >= A[i+1]:
ans += A[i+1]
A[i+1] = 0
else:
an... | p02959 |
import sys
sys.setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
G[a].append(b)
G[b].append(a)
# 0は未着色を表す
color = [0] * N
# 二部グラフ判定dfs
def dfs(v, c):
color[v] = c
... | # 忘れないように
import sys
sys.setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
# 0は未着色を表す
color = [0] * N
# 二部グラフ判定dfs
def dfs(v, c):
... | p03579 |
N,M=list(map(int,input().split()))
graph=[[] for _ in range(N)]
table=[[0]*N for _ in range(N)]
for _ in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
graph[a].append(b)
graph[b].append(a)
table[a][b]=1
table[b][a]=1
def steps(a,b,cnt=0):
global flag
global ... | import sys
sys.setrecursionlimit(10**7)
N,M=list(map(int,input().split()))
graph=[[] for _ in range(N)]
color=[-1]*N
for _ in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
graph[a].append(b)
graph[b].append(a)
def steps(v,col=0):
color[v]=col
for nv in graph[v]:
... | p03579 |
from collections import deque
n, m = list(map(int, input().split()))
connect = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
connect[a].append(b)
connect[b].append(a)
color = [-1]*n
color[0] = 0
explored = {0}
next = deque([0])
exploring =deque()
Yes = T... | from collections import deque
n, m = list(map(int, input().split()))
connect = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
connect[a].append(b)
connect[b].append(a)
color = [-1]*n
color[0] = 0
next = deque([0])
Yes = True
while next:
now = next.poplef... | p03579 |
from collections import deque
n, m = list(map(int, input().split()))
connect = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
connect[a].append(b)
connect[b].append(a)
color = [-1]*n
color[0] = 0
next = deque([0])
Yes = True
while next:
now = next.poplef... | from collections import deque
n, m = list(map(int, input().split()))
connect = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
connect[a].append(b)
connect[b].append(a)
color = [-1]*n
color[0] = 0
next = deque([0])
Yes = True
while next:
now = next.poplef... | p03579 |
N,M=list(map(int,input().split()))
from collections import defaultdict
branch=defaultdict(set)
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
branch[a]|={b}
branch[b]|={a}
dist=[-1]*N
dist[0]=0
check={0}
while len(check)>0:
now=check.pop()
for nex in branch[now... | N,M=list(map(int,input().split()))
from collections import defaultdict
branch=defaultdict(set)
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
branch[a]|={b}
branch[b]|={a}
dist=[-1]*N
dist[0]=0
check={0}
flag=False
while len(check)>0:
if flag:
break
n... | p03579 |
import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int,input().split()))
michi = [[] for i in range(N)]
for i in range(M):
tempa, tempb = list(map(int,input().split()))
michi[tempa-1].append(tempb-1)
michi[tempb-1].append(tempa-1)
#print(michi)
colors = [0 for i in range(N)]
def dfs(v,col... | import sys
sys.setrecursionlimit(10**7)
N,M = list(map(int,input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
a-=1;b-=1
edge[a].append(b)
edge[b].append(a)
#print(edge)
colors = [0 for i in range(N)]
def dfs(v,color):
colors[v] = color
fo... | p03579 |
from collections import Counter
import sys
sys.setrecursionlimit(1000000)
N,M = list(map(int, input().split()))
# 隣接リスト
l = [[] for i in range(N+1)]
for i in range(M):
a,b = list(map(int, input().split()))
l[a].append(b)
l[b].append(a)
nodes_color = {node:0 for node in range(1, N+1)}#set([a f... | from collections import Counter
import sys
sys.setrecursionlimit(1000000)
N,M = list(map(int, input().split()))
# 隣接リスト
l = [[] for i in range(N+1)]
for i in range(M):
a, b = list(map(int, input().split()))
l[a].append(b)
l[b].append(a)
nodes_color = {node:0 for node in range(1, N+1)}#set([a... | p03579 |
from collections import deque
n, m = list(map(int, input().split()))
g = [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
g[a].append(b)
g[b].append(a)
flag = True
color = [-1] * n
que = deque()
que.append((0,0))
while que:
u, c = que... | import sys
sys.setrecursionlimit(10**6)
def dfs(u, c):
color[u] = c
for v in g[u]:
if color[v] != -1:
if color[v] == c:
return False
else:
if not dfs(v, c ^ 1):
return False
return True
n, m = list(map(int, input().s... | p03579 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03579 |
def inpl(): return [int(i) for i in input().split()]
from collections import defaultdict
N,M = inpl()
edge = defaultdict(lambda: [])
for _ in range(M):
a, b = inpl()
edge[a-1].append(b-1)
edge[b-1].append(a-1)
Qu = [0]
ctr = 1
color = [0 for _ in range(N)]
color[0] = -1
while ctr < N:
... | def inpl(): return [int(i) for i in input().split()]
from collections import defaultdict
N,M = inpl()
edge = defaultdict(lambda: [])
for _ in range(M):
a, b = inpl()
edge[a-1].append(b-1)
edge[b-1].append(a-1)
Qu = [0]
ctr = 1
color = [0 for _ in range(N)]
color[0] = -1
while ctr < N:
... | p03579 |
#https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
from collections import deque
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
visit=[False]*N
color=[-1]*N
que=deq... | #https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
from collections import deque
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
visit=[False]*N
color=[-1]*N
que=deq... | p03579 |
from collections import defaultdict
import sys
sys.setrecursionlimit(10**7)
n, m = list(map(int, (input().split())))
dic = defaultdict(list)
seen = [False] * (n+1)
for _ in range(m):
a, b = list(map(int, input().split()))
dic[a].append(b)
dic[b].append(a)
def dfs(v, todo, depth):
if ... | from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = list(map(int, (input().split())))
dic = defaultdict(list)
seen = [-1] * (n+1)
for _ in range(m):
a, b = list(map(int, input().split()))
dic[a].append(b)
dic[b].append(a)
def dfs(v... | p03579 |
N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to = list(map(int, input().split()))
fr -= 1
to -= 1
edges[fr].append(to)
edges[to].append(fr)
def isBipartite():
sign = [-1] * N
st = [(0, 0)]
while st:
now, p = st.pop()... | N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to = list(map(int, input().split()))
fr -= 1
to -= 1
edges[fr].append(to)
edges[to].append(fr)
def isBipartite():
sign = [-1] * N
sign[0] = 0
st = [0]
while st:
now =... | p03579 |
import sys
sys.setrecursionlimit(100000)
N,M=[int(a) for a in input().split()]
AB=[[int(a) for a in input().split()] for _ in range(M)]
edges = [[] for _ in range(N)]
for a, b in AB:
edges[a-1].append(b-1)
edges[b-1].append(a-1)
visited = [False]*N
WH = [None]*N
def dfs(curr, is_white):
if ... | import sys
sys.setrecursionlimit(100000)
N,M=[int(a) for a in input().split()]
AB=[[int(a) for a in input().split()] for _ in range(M)]
edges = [[] for _ in range(N)]
for a, b in AB:
edges[a-1].append(b-1)
edges[b-1].append(a-1)
colors = [0]*N
def dfs(curr, c):
colors[curr] = c
for node i... | p03579 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,m=list(map(int,input().split()))
E=[[] for _ in range(n)]
for i in range(m):
u,v=list(map(int,input().split()))
u-=1; v-=1
E[u].append(v)
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,m=list(map(int,input().split()))
E=[[] for _ in range(n)]
for i in range(m):
u,v=list(map(int,input().split()))
u-=1; v-=1
E[u].append(v)
... | p03579 |
class UnionFindVerSize():
def __init__(self, N):
""" N個のノードのUnion-Find木を作成する """
# 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる
self._parent = [n for n in range(0, N)]
# グループのサイズ（個数）
self._size = [1] * N
self._even = [i%2 for i in range(0,N)]
self._od... | class UnionFindVerSize():
def __init__(self, N):
""" N個のノードのUnion-Find木を作成する """
# 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる
self._parent = [n for n in range(0, N)]
# グループのサイズ（個数）
self._size = [1] * N
self._even = [i%2 for i in range(0,N)]
self._od... | p03579 |
def bipartite():
color = {v: None for v in V}
stack = [(V[0], 0)]
parts = {0: set([]), 1: set([])}
while stack:
v, c = stack.pop()
color[v] = c
parts[c].add(v)
for u in E[v]:
if color[u] is None: # not visited yet
stack.append((u, c^1... | def bipartite():
color = {v: None for v in V}
stack = [(V[0], 0)]
parts = {0: [], 1:[]}
while stack:
v, c = stack.pop()
if color[v] is not None: # consistent
continue
color[v] = c
parts[c].append(v)
for u in E[v]:
if color[u] is ... | p03579 |
import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n, m = [int(i) for i in input().split()]
e = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
ok = False
tag = [-1] * n
def dfs(i... | import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n, m = [int(i) for i in input().split()]
e = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
ok = False
tag = [-1] * n
def dfs... | p03579 |
import sys
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(M)]
G = [[] for _ in range(N+1)]
for a,b in AB:
G[a].append(b)
G[b].append(a)
color = [None]*(N+1)
# 二部グラフ判定
def dfs(v, c):
color[v] = c
for e in G[v]:
i... | import sys
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(M)]
G = [[] for _ in range(N+1)]
for a,b in AB:
G[a].append(b)
G[b].append(a)
color = [None]*(N+1)
color[1] = 0
q = [1]
# 二部グラフ判定
while q:
x = q.pop()
for y... | p03579 |
# -*- coding: utf-8 -*-
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03579 |
n, m = list(map(int, input().split()))
g = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a-=1; b-=1
g[a].append(b)
g[b].append(a)
visited = [False] * n
def dfs(i, src, depth=0):
global ans
if depth==3:
if not i in g[src]:
g[s... | import sys
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
g = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a-=1; b-=1
g[a].append(b)
g[b].append(a)
# 2部グラフかどうかを判定する
# 色の初期化、0:未着色
colors = [0]*n
def dfs(v, color):
"""
pa... | p03579 |
import sys
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
graph = [[] for _ in range(N)]
for a, b in AB:
graph[a-1].append(b-1)
graph[b-1].append(a-1)
colors = [None] * N
# 二部グラフかどうかのチェック
colors[0] = 0
que = [0]
... | import sys
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) # applies to numbers only
rs = lambda: stdin.readline().rstrip() # ignores trailing space
N, M = rl()
graph = [[] for _ in range(N+1)] # 0は使わない、直接行ける頂点
for _ in range(M):
a, b = rl()
graph[... | p03579 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
return int(input())
def MI():
return map(int,input().sp... | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
return int(input())
def MI():
return map(int,input().sp... | p03579 |
import sys
sys.setrecursionlimit(100000)
N,M = list(map(int,input().split()))
adj_list = { i: [] for i in range(1, N+1) }
for i in range(M):
a,b = list(map(int, input().split()))
adj_list[a].append(b)
adj_list[b].append(a)
visited = [False]*(N+1)
colors = [None] * (N)
is_bipartite = True
## imp... | import sys
sys.setrecursionlimit(100000)
N,M = list(map(int,input().split()))
adj = [ [] for _ in range(N) ]
for _ in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
adj[u].append(v)
adj[v].append(u)
color = [None] * N
def dfs(n, c):
color[n] = c
for nei in adj[n]:
if co... | p03579 |
from collections import deque
n,m=list(map(int,input().split()))
e=[[] for _ in range(n+1)]
d=[-1]*(n+1)
for i in range(m):
a,b=list(map(int,input().split()))
e[a]+=[b]
e[b]+=[a]
q=deque([(1,0)])
d[1]=0
a,b=0,0
while q:
now,par=q.popleft()
for to in e[now]:
if to==par:continue
if d[to]=... | from collections import deque
n,m=list(map(int,input().split()))
e=[[] for _ in range(n+1)]
d=[-1]*(n+1)
for i in range(m):
a,b=list(map(int,input().split()))
e[a]+=[b]
e[b]+=[a]
q=deque([(1,0)])
d[1]=0
while q:
now,par=q.popleft()
for to in e[now]:
if to==par:continue
if d[to]==-1:
... | p03579 |
import sys
sys.setrecursionlimit(1000000)
def dfs(g: {}, v: int, path_list: [], added: {}):
path_list.append(v)
for next_v in g[v]:
# # next_v が探索済だったらスルー
if next_v in path_list:
continue
# 距離３なら追加可能か確認して次へ
if len(path_list) == 3:
if path_l... | import sys
sys.setrecursionlimit(100000000)
def dfs(g: {}, v: int, seen: [], current_color: int):
seen[v] = current_color
for next_v in g[v]:
# next_v が探索済だったらスルー
if seen[next_v] != -1:
if current_color == seen[next_v]:
return False
continue... | p03579 |
N,M = list(map(int,input().split()))
es = [[] for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
colors = [0 for i in range(N)]
def is_bipartite():
stack = [(0,1)]
while stack:
v,color = stack.pop()
colors[v] = col... | import sys
sys.setrecursionlimit(10**7)
N,M = list(map(int,input().split()))
es = [[] for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
colors = [0 for i in range(N)]
def dfs(v,color):
colors[v] = color
for to in es[v]:... | p03579 |
def is_biparate(links):
'''
0=white,1=blackとする
2部グラフなら黒に塗られている頂点の数を返す
2部グラフでないなら-1を返す。
'''
colors = [-1] * n
colors[0] = 0
q = [(0, 0)] #0=white, 1=blackとする
visited = set()
while q:
v, c = q.pop()
if v in visited:
if colors[v] != c:... | from sys import stdin, stdout
def readLine_int_list():return list(map(int, stdin.readline().split()))
def is_biparate(links):
'''
0=white,1=blackとする
2部グラフなら黒に塗られている頂点の数を返す
2部グラフでないなら-1を返す。
'''
colors = [-1] * n
colors[0] = 0
q = [(0, 0)] #0=white, 1=blackとする
visit... | p03579 |
N, M = list(map(int, input().split()))
edge = {}
for i in range(N):
edge[repr(i+1)] = {}
answers = set()
pre = set()
def add_edge(a, b):
if a == b or b in edge[a]:
return
edge[a][b] = edge[b][a] = 1
answers.add((min(a,b), max(a,b)))
adds = []
for n1 in edge[a].keys():
for n2 in ed... | N, M = list(map(int, input().split()))
edge = {}
for i in range(N):
edge[repr(i+1)] = {}
answers = set()
pre = set()
def add_edge(a, b):
edge[a][b] = edge[b][a] = 1
answers.add((min(a,b), max(a,b)))
adds = []
for n1 in edge[a].keys():
for n2 in edge[n1].keys():
if n2 != b and b not... | p03579 |
from collections import deque
N, M = list(map(int, input().split()))
adj = [ [] for _ in range(N)]
clr = [-1 for _ in range(N)]
#グラフ構築
for _ in range(1,M+1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
adj[u].append((v,1))
adj[v].append((u,1))
#二部グラフか否か判定
vis = [0 for _ in range(N... | import sys
N, M = list(map(int, input().split()))
sys.setrecursionlimit(10**6)
I = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
I[a].append(b)
I[b].append(a)
C = [-1 for _ in range(N)]
visited = set()
def DFS(p, c):
C[p] = c
flag = Tru... | p03579 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(200000)
N,M = list(map(int,input().split()))
edges = [[]for _ in range(N+1)]
for _ in range(M):
a,b = list(map(int,input().split()))
edges[a].append(b)
edges[b].append(a)
colors = [-... | import sys
sys.setrecursionlimit(200000)
N,M = list(map(int,input().split()))
edges = [[]for _ in range(N+1)]
for _ in range(M):
u,v = list(map(int,input().split()))
edges[u].append(v)
edges[v].append(u)
colors = [-1]*(N+1)
def choose(n,k):
import math
return math.factorial(n)//(math.... | p03579 |
import sys
sys.setrecursionlimit(200000)
N,M = list(map(int,input().split()))
edges = [[] for _ in range(N+1)]
for _ in range(M):
a,b = list(map(int,input().split()))
edges[a].append(b)
edges[b].append(a)
n = len(edges)
colors = [-1]*(n+1)
def paint(v,c):
if colors[v] == -1:
colo... | """
奇数本の辺で成り立つ閉路があれば、全ての頂点同士を1本の辺で結ぶことができる。
そうでない場合は、奇数本の辺をたどってたどり着ける頂点同士は全て1本の辺で結ぶことができる。
奇数本の閉路があるかどうかを、どうやって判定するか？
二部グラフ判定を行う。
二部グラフ判定ってどうやるんだっけ？→となりのノードに違う色をつけていって、矛盾がなければ二部グラフ。矛盾があれば二部グラフじゃない。
"""
import sys
sys.setrecursionlimit(200000)
N,M = list(map(int,input().split()))
edges = [[] for _ in range(N+1... | p03579 |
from functools import reduce
from operator import xor
R = lambda: list(map(int, input().split()))
n = int(eval(input()))
if n % 3:
ans = 'YNeos'[any(R())::2]
else:
a = sorted(R())
m = n // 3
if reduce(xor, a[::m]):
ans = 'No'
elif any(len(set(a[i:i + m])) > 1 for i in range(0... | R = lambda: list(map(int, input().split()))
n = int(eval(input()))
if n % 3:
ans = 'YNeos'[any(R())::2]
else:
a = sorted(R())
m = n // 3
if a[0] ^ a[m] ^ a[2 * m]:
ans = 'No'
elif any(len(set(a[i:i + m])) > 1 for i in range(0, n, m)):
ans = 'No'
else:
ans =... | p02975 |
import itertools
n = int(eval(input()))
a = [int(i) for i in input().split()]
p = list(itertools.permutations(a,len(a)))
y = 0
for l in p:
c = 0
for i in range(len(l)-1):
if l[i] != int(bin(l[i-1]^l[i+1]),0):
c=1
break
if c==0:
if l[-1] == int(bin(l[0]^l[-2]),0):
y=1
break
if y=... | n = int(eval(input()))
a = [int(i) for i in input().split()]
xor = []
for i in range(len(a)):
for k in range(i,len(a)):
xor.append(int(bin(a[i]^a[k]),0))
for i in a:
if i not in xor:
print("No")
exit()
print("Yes") | p02975 |
import random
n = int(eval(input()))
a = [int(i) for i in input().split()]
rc = 0
while rc != 1000:
c = 0
for i in range(len(a)-1):
if a[i] != int(bin(a[i-1]^a[i+1]),0):
c=1
random.shuffle(a)
rc+=1
break
if c==0:
if a[-1] != int(bin(a[0]^a[-2]),0):
random.shuffle(a)
rc+=1
... | n = int(eval(input()))
a = [int(i) for i in input().split()]
sum = 0
for i in a:
sum^=i
if sum == 0:
print("Yes")
else:
print("No") | p02975 |
n=int(eval(input()))
a=[int(x) for x in map(int,input().split()[:n])]
ret=a[0]
for x in range(1,n):
ret= a[x] ^ ret
if ret==0:
print("Yes")
else:
print("No") | n=int(eval(input()))
a=list(map(int,input().split()))
ret=a[0]
for x in range(1,n):
ret=a[x]^ret
if ret==0:
print("Yes")
else:
print("No") | p02975 |
N = int(eval(input()))
A = list(map(int, input().split()))
import copy
hats = A[:]
import queue
q = queue.Queue()
for i, h1 in enumerate(hats):
hats2 = hats[i+1:]
for j, h2 in enumerate(hats2):
hats3 = hats2[j+1:]
for h3 in hats3:
set_hats = set(hats)
se... | N = int(eval(input()))
A = list(map(int, input().split()))
hats = A[:]
from collections import defaultdict
d = defaultdict(lambda: {})
for i, h1 in enumerate(hats):
hats2 = hats[i+1:]
for j, h2 in enumerate(hats2):
d[h1][h2] = h1^h2
d[h2][h1] = h1^h2
def dfs(now1, now... | p02975 |
import copy
N = eval(input())
A = input().split()
n = int(N)
Int_A = [int(a) for a in A]
result = [Int_A[0]]
Int_A.remove(Int_A[0])
def check(a):
if len(Int_A) == 1:
if result[0] == Int_A[0] ^ a:
print("Yes")
exit()
return []
res = []
co_other ... | # import copy
#
N = eval(input())
A = input().split()
n = int(N)
Int_A = [int(a) for a in A]
k = 0
for a in Int_A:
k ^= a
if k == 0:
print("Yes")
else:
print("No")
#
# result = [Int_A[0]]
# Int_A.remove(Int_A[0])
#
#
# def check(a):
# if len(Int_A) == 1:
# if result... | p02975 |
import sys
input = sys.stdin.readline
from collections import Counter
N = int(eval(input()))
c = Counter((int(x) for x in input().split()))
# 0がある場合
# 0,x,x,0,x,x
# あるいは
# 0,0,0,0 (any length is ok)
if c[0] > 0:
if len(c) == 1:
bl = True
else:
if len(c) > 2:
bl ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
"""
・a,b,a+b,a,b,a+b,...
・0,a,a,0,a,a,...
・0,0,0,0,0,0,...
"""
N,*A = list(map(int,read().split()))
def solve(N,A):
if all(x == 0 for x in A):
return True
q,r = divmod(N... | p02975 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
d = defaultdict(int)
if all([not i for i in a]):
print("Yes")
else:
for i in a[1:]:
d[i] += 1
now1,now2 = a[0],0
ans = [now1]
for i in a[1:]:
xor = now1^i
d[i] -= 1
... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
d = defaultdict(int)
if True:
for i in a[1:]:
d[i] += 1
now1,now2 = a[0],0
for i in a[1:]:
xor = now1^i
d[i] -= 1
d[xor] -= 1
if d[xor] >= 0:
now1, now2 = i, xo... | p02975 |
import collections
N = int(eval(input()))
a = list(map(int,input().split()))
B = collections.Counter(a)
k = list(B.keys())
v = list(B.values())
if len(B) == 3 and k[0]^k[1]^k[2] == 0 and v[0] == v[1] == v[2]:
print("Yes")
elif len(B) == 2 and 0 in k and (v[0] == 2*v[1] or v[1] == 2*v[0]):
print("Yes"... | import collections
N = int(eval(input()))
a = list(map(int,input().split()))
B = collections.Counter(a)
k = list(B.keys())
v = list(B.values())
ans = "Yes"
if len(B) == 3 and k[0]^k[1]^k[2] == 0 and v[0] == v[1] == v[2]: pass
elif len(B) == 2 and 0 in k and (v[0] == 2*v[1] or v[1] == 2*v[0]): pass
elif len(B... | p02975 |
from bisect import bisect_left as bl
from copy import deepcopy as dc
N = int(eval(input()))
Al = sorted(list(map(int, input().split())))
#print(Al)
q = -1
r = -1
for i in range(1, N - 1):
A = dc(Al)
#print(A)
p = A.pop(0)
temp = p ^ A[i]
index = bl(A, temp)
if index >= N - 1:
continue
i... | N = int(eval(input()))
Al = list(map(int, input().split()))
p = Al[0]
for i in range(1, N):
p = p ^ Al[i]
if p == 0:
print("Yes")
else:
print("No") | p02975 |
N = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
flag = True
if len(set(a)) == 1 and a[0] == 0:
#print('Yes')
pass
elif N % 3 == 0:
if len(set(a)) == 3:
b = list(set(a))
c = []
for i in b:
c.append(a.count(i))
if a[0] != 0 and c[0] =... | N = int(eval(input()))
a = list(map(int,input().split()))
now = 0
for i in range(N):
now ^= a[i]
if now == 0:
print('Yes')
else:
print('No') | p02975 |
N=int(eval(input()))
a= list(map(int, input().split()))
a.sort()
b=[None]*N
b[0]=a[0]
A=0
for i in range(N-1,0,-1):
b[1]=a[i]
for j in range(2,N):
b[j]=b[j-1]^b[j-2]
if b[j] not in a:
break
else:
b.sort()
if a==b:
A=1
break
if A==1:
print("Yes")
else:
prin... | N=int(eval(input()))
a=list(map(int,input().split()))
t=0
for i in a:
t=t^i
print(("No" if t else "Yes")) | p02975 |
import itertools
def permutations(iterable, r=None):
pool = tuple(iterable)
n = len(pool)
ff = False
r = n if r is None else r
for indices in itertools.product(list(range(n)), repeat=r):
if len(set(indices)) == r:
p = tuple(pool[i] for i in indices)
for i in ... | n = int(eval(input()))
a = list(map(int, input().split()))
aa = 0
for i in range(n):
aa = aa ^ a[i]
if aa == 0:
print("Yes")
else:
print("No") | p02975 |
N = int(eval(input()))
A = list(map(int, input().split()))
assert len(A) == N
class multiset:
def __init__(self, L):
self.dic = {}
for a in L:
if a not in self.dic:
self.dic[a] = 0
self.dic[a] += 1
def has(self, x):
return x in self.di... | N = int(eval(input()))
A = list(map(int, input().split()))
assert len(A) == N
def yes():
S = set(A)
if A.count(0) == N:
return True
if N % 3 != 0:
return False
if len(S) == 3:
a, b, c = tuple(S)
return all(A.count(x) == N // 3 for x in S) and a ^ b == c
... | p02975 |
n,a=int(eval(input())),sorted(list(map(int,input().split())));b=set(a);l=len(b);print(("Yes"if(l==3and b.pop()^b.pop()==b.pop()and n%3==0and a[n//3-1]!=a[n//3]and a[n//3*2-1]!=a[n//3*2])or(l==1and a[0]==0)or(l==2and a[0]==0and n%3==0and a[n//3-1]!=a[n//3])else"No")) | n,a=int(eval(input())),0
for i in list(map(int,input().split())):a^=i
print(("Yes"if a==0else"No")) | p02975 |
N = int(eval(input()))
a_list = list(map(int,input().split()))
from collections import Counter
a_dict = Counter(a_list)
start = a_list[0]
# 数を減らさない。
# a_dict[a] -= 1
a_keys = list(a_dict.keys())
def check():
for a1 in a_keys:
# print("for1",start,a1)
a0 = start
tmp_dict... | from collections import Counter
N = int(eval(input()))
a_list = list(map(int,input().split()))
l = len(set(a_list))
def check():
counter = Counter(a_list)
if l == 1:
if a_list[0] == 0:
return True
return False
if l == 2:
if counter[0] == N/3:
r... | p02975 |
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
ok = False
for v in itertools.permutations(a):
v = v+v[:2]
for i in range(n):
if int(bin(v[i] ^ v[i+1] ^ v[i+2]), 2) != 0: break
elif i == n-1 and int(bin(v[i] ^ v[i+1] ^ v[i+2]), 2) == 0: ok = True
if ok: b... | n = int(eval(input()))
a = sorted(list(map(int, input().split())))
c0 = a.count(0)
ans = "No"
if c0==n: ans = "Yes"
elif len(set(a)) == 2:
c = a.count(a[-1])
if c == (2*n)//3 and c0 == n//3: ans = "Yes"
elif len(set(a)) == 3:
x,y,z = list(set(a))
if a.count(x) == a.count(y) == a.count(z):
... | p02975 |
import random
n = int(eval(input()))
a = [int(i) for i in input().split()]
for j in range(100000):
chk = 0
for i in range(n-1):
if a[i] == a[i-1] ^ a[i+1]:
chk += 1
else:
break
if a[n-1] == a[n-2] ^ a[0]:
chk += 1
if chk == n:
print("Yes")
break
else:
random.shuffle(a)
i... | n = int(eval(input()))
a = [int(i) for i in input().split()]
a_uni = list(set(a))
if len(a_uni) == 1:
if a[0] == 0:
print("Yes")
else:
print("No")
elif n%3 != 0:
print("No")
elif len(a_uni) == 2:
if a.count(0) == n/3:
print("Yes")
else:
print("No")
elif len(a_uni) == 3:
if a_uni[0]^a_uni... | p02975 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
a = A[0]
B = A[:]
B.sort()
for i in range(1, n):
C = [a, A[i]]
for j in range(2, n):
C.append(C[j - 2] ^ C[j - 1])
if C[-2] ^ C[-1] == C[0]:
C.sort()
if C == B:
print('Yes')
exit()
... | n = int(eval(input()))
A = [int(i) for i in input().split()]
S = 0
for a in A:
S ^= a
print(('Yes' if S == 0 else 'No')) | p02975 |
std_n = int(eval(input()))
std_list = tuple(map(int, input().split()))
std_set = set(std_list)
if std_set == {0}:
print("Yes")
exit()
elif len(std_set) == 2:
if 0 in std_set:
if std_list.count(0) * 3 == std_n:
print("Yes")
exit()
else:
print(... | std_n = int(eval(input()))
std_list = tuple(map(int, input().split()))
std_set = set(std_list)
if std_set == {0}:
print("Yes")
exit()
elif len(std_set) == 2:
if 0 in std_set:
if std_list.count(0) * 3 == std_n:
print("Yes")
exit()
else:
print(... | p02975 |
n = int(eval(input()))
als = list(map(int,input().split()))
ans = 'No'
sett = n//3
als.sort()
if als[0] == 0:
if als[n-1] == 0:
ans = 'Yes'
else:
cc = [0]*(n//2) + [als[n-1]]*(n//2)
if cc == als:
ans = 'Yes'
if n%3 == 0:
co = [als[0]]*sett + [(als[0]^als[n-1]... | n = int(eval(input()))
als = list(map(int,input().split()))
ans = 'No'
sett = n//3
als.sort()
if als[0] == 0:
if als[n-1] == 0:
ans = 'Yes'
#else:
#cc = [0]*(n//2) + [als[n-1]]*(n//2)
#if cc == als:
#ans = 'Yes'
if n%3 == 0:
co = [als[0]]*sett + [(als[0]^als[... | p02975 |
from collections import Counter
def solve(n, aaa):
if all(a == 0 for a in aaa):
return True
if n % 3 != 0:
return False
cnt = list(Counter(aaa).items())
if len(cnt) == 2:
(a1, c1), (a2, c2) = cnt
if c1 > c2:
c1, c2 = c2, c1
if c1 != ... | from collections import Counter
def solve(n, aaa):
if all(a == 0 for a in aaa):
return True
if n % 3 != 0:
return False
cnt = Counter(aaa)
if len(cnt) == 2:
(a1, c1), (a2, c2) = cnt.most_common()
if c1 != n * 2 // 3 or c2 != n // 3:
return Fa... | p02975 |
import itertools
boushi_num = int(eval(input()))
boushi_No = list(map(int,input().split()))
flag = 0
jyun = list(itertools.permutations(boushi_No, boushi_num))
jyun_num = len(jyun[0])
for v in jyun:
for i in range(0,jyun_num):
i = i
i_a = i+2
i_b = i+1
if i_a >boushi_num -1:
... | import itertools
boushi_num = int(eval(input()))
boushi_No = list(map(int,input().split()))
flag = 0
for v in itertools.permutations(boushi_No, boushi_num):
for i in range(0,len(v)):
i = i
i_a = i+2
i_b = i+1
if i_a >boushi_num -1:
i_a = i_a - boushi_num
if i_b >boushi_nu... | p02975 |
from itertools import combinations
N = int(eval(input()))
a = list(map(int, input().split()))
c = {}
for e in a:
c.setdefault(e, 0)
c[e] += 1
t = {}
for x, y in combinations(a, 2):
i = x
j = y
t[i] = 1
t.setdefault(j, 0)
t[j] += 1
for _ in range(N - 2):
k = i... | from itertools import product
N = int(eval(input()))
a = list(map(int, input().split()))
c = {}
for e in a:
c.setdefault(e, 0)
c[e] += 1
if len(set(c)) > 3:
print('No')
exit()
t = {}
for x, y in product(set(c), repeat=2):
i = x
j = y
t[i] = 1
if t[i] > c[i]:
... | p02975 |
N = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i not in d:
d[i] = 1
else:
d[i] +=1
if len(d) == 1 and list(d.keys())==[0]:
print('Yes')
elif len(d) == 2:
for i in d:
if i == 0 and d[i] * 3 != N or i != 0 and d[i] * 3 != 2 * N:
... | N = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i not in d:
d[i] = 1
else:
d[i] +=1
if len(d) == 1 and 0 in d:
print('Yes')
elif len(d) == 2:
for i in d:
if i == 0 and d[i] * 3 != N or i != 0 and d[i] * 3 != 2 * N:
print('... | p02975 |
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
ans="Yes"
if n>3:
for i in range(n-1):
if a.count(a[i])!=a.count(a[i+1]) or a.count(a[i])==1:
ans="No"
break
print(ans) | n=int(eval(input()))
L=list(map(int,input().split()))
LL=list(set(L))
ans="No"
if LL==[0]:
ans="Yes"
elif len(LL)==2:
if L.count(LL[0])==2*L.count(LL[1]) or L.count(LL[1])==2*L.count(LL[0]):
ans="Yes"
elif len(LL)==3:
if L.count(LL[0])==L.count(LL[1]) and L.count(LL[1])==L.count(LL[2]):
... | p02975 |
import itertools
N=int(eval(input()))
an=[int(x) for x in map(int,input().split()[:N])]
def judgeXOR(v):
for x in range(N):
if x==0:
if (v[N-1] ^ v[x+1] ) != (x+1):
return False
elif x==(N-1):
if (v[0] ^ v[x-1]) !=(x+1):
return Fals... | import itertools
N=int(eval(input()))
an=[int(x) for x in map(int,input().split()[:N])]
ret=an[0]
for x in range(1,N):
ret= an[x] ^ ret
if ret==0:
print("Yes")
else:
print("No")
| p02975 |
def get_caps(a):
dic = dict()
for ai in a:
dic.setdefault(ai, 0)
dic[ai] += 1
return dic
def get_xor(a, b):
bin_a = format(a, 'b')
bin_b = format(b, 'b')
digit = max(len(bin_a), len(bin_b))
# 2進数のケタ数を揃える
bin_a = bin_a.zfill(digit)
bin_b = bin_b.zfill(digit)
s = ''
... | def get_caps(a):
dic = dict()
for ai in a:
dic.setdefault(ai, 0)
dic[ai] += 1
return dic
def is_match(caps):
global N
if 0 in list(caps.keys()):
if caps[0] == N:
return True
if N % 3 == 0:
if 0 in list(caps.keys()) and len(caps) == 2:
if caps[0] == N//3... | p02975 |
import collections as col
N=int(eval(input()))
A=[ai for ai in map(int,input().split())]
CA=col.Counter(A)
CA_KEYS=sorted(CA.keys())
#print(CA_KEYS)
for Ai in CA_KEYS:
CA_Tmp={ai:0 for ai in CA_KEYS}
# print()
crnt=A[0]
next=Ai
CA_Tmp[crnt]=1
# print(crnt, end=" ")
if CA_Tmp[next]... |
import collections as col
N=int(eval(input()))
A=[ai for ai in map(int,input().split())]
Ans=False
CA=col.Counter(A)
if len(CA)==1 and 0 in CA:
Ans=True
elif len(A)%3==0:
if len(CA)==3:
K=list(CA.keys())
if (K[0]^K[1]==K[2]) and (CA[K[0]]==CA[K[1]]==CA[K[2]]):
Ans=True
... | p02975 |
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p02975 |
N = int(eval(input()))
*A, = list(map(int, input().split()))
setA = set(A)
if len(setA) == 3:
a, b, c = list(setA)
if a ^ c == b and a ^ b == c and b ^ c == a and A.count(a) == A.count(b) == A.count(c): print('Yes')
else: print('No')
elif len(setA) <= 2:
maxA = max(setA)
if A.count(0) == A.... | N = int(eval(input()))
*A, = list(map(int, input().split()))
setA = set(A)
if len(setA) == 3:
a, b, c = list(setA)
print(('Yes' if a ^ b ^ c == 0 and A.count(a) == A.count(b) == A.count(c) else 'No'))
elif len(setA) == 2: print(('Yes' if 2*A.count(0) == A.count(max(setA)) else 'No'))
elif len(setA) == 1:... | p02975 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
c = N-1
A.sort()
while c > 0:
num = A[0]^A[c]
pre_num = A[c]
B = [A[0],A[c],num]
while len(B) < N:
box = num
num = num^pre_num
pre_num = box
B.append(num)
if pre_num not in A:
b... | N = int(eval(input()))
A = [int(a) for a in input().split()]
c = N-1
A.sort()
num = A[0]^A[c]
pre_num = A[c]
B = [A[0],A[c],num]
while len(B) < N:
box = num
num = num^pre_num
pre_num = box
B.append(num)
B.sort()
if A == B:
print("Yes")
else:
print("No") | p02975 |
N = int(eval(input()))
a = list(map(int, input().split()))
a_set = set(a)
if len(a_set) == 1:
if a_set == {0}:
print('Yes')
else:
print('No')
elif len(a_set) == 2:
a_set = list(a_set)
a0 = a.count(a_set[0])
a1 = a.count(a_set[1])
if N % 3 == 0 and (a0 == 2 * a1 or a1 ... | N = int(eval(input()))
a = list(map(int, input().split()))
a_set = set(a)
if len(a_set) == 1:
if a_set == {0}:
print('Yes')
else:
print('No')
elif len(a_set) == 2:
a_set = list(a_set)
a0 = a.count(a_set[0])
a1 = a.count(a_set[1])
if N % 3 == 0 and a1 == 2 * a0 and a_s... | p02975 |
import itertools
N = int(eval(input()))
a = list(map(int ,input().split()))
def get_ans(a, N):
ans = 'Yes'
for l in list(itertools.permutations(a)):
a_tmp = list(l)
if a_tmp[0] != a[0]:
continue
a_tmp.extend(a_tmp[:2])
for x in range(N):
i... | import itertools
N = int(eval(input()))
a = list(map(int ,input().split()))
plus_set = set([ int(bin(c[0]^c[1]), 0) for c in (itertools.combinations(a,2))])
if set(a) == plus_set:
print('Yes')
else:
print('No') | p02975 |
a = int(eval(input()))
b = list(map(int, input().split()))
c = {}
for i in range(a):
if b[i] not in c:
c.setdefault(b[i], 1)
else:
c[b[i]] += 1
if len(c) == 3:
f = list(c.values())
for i in range(1, len(f)):
if f[i] != f[i-1]:
print("No")
... | a = int(eval(input()))
b = list(map(int, input().split()))
e = {}
for i in b:
if i not in e:
e[i] = 1
else:
e[i] += 1
if len(e) > 3:
print("No")
elif len(e) == 3:
x, y, z = list(map(int, list(e.keys())))
xx, yy, zz = list(map(int, list(e.values())))
if x ^ y == z and... | p02975 |
N=int(eval(input()))
a=[int(i) for i in input().split()]
b=list(set(a))
if len(b)==1:
if b[0]==0:
print("Yes")
else:
print("No")
else:
if N%3==0 and len(b)==3:
D={b[0]:0,b[1]:0,b[2]:0}
for i in range(N):
D[a[i]]+=1
if D[b[0]]==D[b[1]] and D[b[... | N=int(eval(input()))
A=[int(i) for i in input().split()]
tmp=0
for i in range(N):
tmp=tmp^A[i]
if tmp==0:
print("Yes")
else:
print("No")
| p02975 |
from collections import defaultdict
n = int(eval(input()))
a = tuple(map(int, input().split()))
can = True
if n % 3 == 0:
d = defaultdict(int)
for aa in a:
d[aa] += 1
m = n // 3
t = []
for number, cnt in list(d.items()):
if cnt % m != 0:
can = False
... | def main():
from collections import Counter
n = int(eval(input()))
*a, = list(map(int, input().split()))
if n % 3 == 0:
ctr = Counter(a)
if len(ctr) == 1:
print(('Yes' if 0 in ctr else 'No'))
return
elif len(ctr) == 2:
print(('Y... | p02975 |
N=int(eval(input()))
A=list(map(int, input().split()))
a=A[0]
for i in range(N-1):
a=a^A[i+1]
if a==0:
print("Yes")
else:
print("No")
| N=int(eval(input()))
A=list(map(int, input().split()))
x=len(set(A))
if x==1:
if A==[0]*N:
print('Yes')
else:
print('No')
elif x==2:
B=list(set(A))
a,b=max(B),min(B)
if b==0 and A.count(0)==(N//3):
print('Yes')
else:
print('No')
elif x==3:
B=list(set(A))
a=max(B)
c=... | p02975 |
from itertools import permutations
n = int(eval(input()))
line = list(map(int,input().split( )))
Flag = False
perm = list(permutations(list(range(n))))
for item in perm:
flag = True
for i in range(n):
if line[item[i]] != line[item[(i-1)%n]] ^ line[item[(i+1)%n]]:
flag = Fals... | n = int(eval(input()))
line = list(map(int,input().split( )))
s = list(set(line))
if n%3==0 and 0 in line and line.count(0)==n//3 and len(s)<=2:
print('Yes')
elif n%3==0 and len(s)==3 and s[0]^s[1]==s[2] and s[1]^s[2]==s[0] and line.count(s[0])==n//3 and line.count(s[1])==n//3:
print('Yes')
elif s == ... | p02975 |
# coding: utf-8
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
d = {}
for i in range(N):
a = A[i]
if a not in list(d.keys()):
d[a] = 1
else:
d[a] += 1
if len(list(d.keys())) == 1:
if list(d.keys())[0] == 0:
print("Yes")
else:
print(... | # coding: utf-8
N = int(eval(input()))
A = list(map(int, input().split()))
# A.sort()
d = {}
for i in range(N):
a = A[i]
if a not in list(d.keys()):
d[a] = 1
else:
d[a] += 1
flag = True
if len(list(d.keys())) == 1:
if list(d.keys())[0] == 0:
flag = True
else:
... | p02975 |
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from opera... | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from opera... | p02975 |
n=int(eval(input()))
a=sorted([int(i) for i in input().split()])
m,k=n//3,0
for i in range(n):
d=i%3*m+i//3
if a[d]^a[(d+2*m)%n]!=a[(d+m)%n]:
k=1
print(('YNeos'[k::2])) | n=int(eval(input()))
a=sorted([int(i) for i in input().split()])
m=n//3
print(('YNeos'[(a[0],a[m],a[-m])!=(a[m-1],a[-m-1],a[-1]) or a[0]^a[m]!=a[-m]::2])) | p02975 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
A[i] = bin(A[i])
max_len = len(A[N-1]) - 2
for i in range(N):
A[i] = A[i][2:].zfill(max_len)
check = True
for i in range(max_len):
count0 = 0
count1 = 0
for j in range(N):
if(A[j][i] == '0'):
count0 += 1
... | n = int(eval(input()))
nums = list(map(int, input().split()))
#set型にしてからlistにキャストすることで，複数存在するものを省いている
unq = list(set(nums))
#違う数字が4個以上存在したら，正しい答えは存在しない
if len(unq) > 3:
print("No")
if len(unq) == 3:
#list,unqをアンパックしてa,b,cにいれている
a,b,c = unq
if a ^ b ^ c == 0:
if nums.count(a) == nums.c... | p02975 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = set(A)
C = list(B)
k = len(C)
if N%3==0:
if k==3 and C[0]^C[1]==C[2] and A.count(C[0])==A.count(C[1]) and A.count(C[0])==A.count(C[2]):
print("Yes")
elif k==2:
C = sorted(C)
if C[0]==0 and A.count(C[0])==N//3:
... | N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
if A[i] not in C:
C[A[i]] = 0
C[A[i]] += 1
if len(C)>3:
print("No")
else:
if N%3==0:
if 0 in C:
if len(C)==1:
print("Yes")
elif len(C)==2:
... | p02975 |
import sys
input = sys.stdin.readline
def check(n, nums):
kind = set(nums)
if len(kind) > 3:
return False
if len(kind) == 1 and 0 in kind:
return True
if n % 3 != 0:
return False
if len(kind) == 3:
a, b, c = kind
return nums.count(a) == nums.... | import sys
input = sys.stdin.readline
def check(n, nums):
kind = set(nums)
if len(kind) > 3:
return False
if len(kind) == 1 and 0 in kind:
return True
if n % 3 != 0:
return False
if len(kind) == 3:
if len(set([nums.count(k) for k in kind])) !=... | p02975 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(1, n):
a[i] ^= a[i - 1]
if a[n - 1] == 0:
print('Yes')
else:
print('No')
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, *a = list(map(int, read().split()))
for af in a[1:]:
a[0] ^= af
print(('Yes' if a[0] == 0 else 'No'))
| p02975 |
import copy
N=int(eval(input()))
a=list(map(int,input().split()))
A={}
for h in range(N):
if a[h] in A:
A[a[h]]+=1
else:
A[a[h]]=1
A[a[0]]-=1
ans="No"
for i in range(1,N):
temp=copy.copy(A)
P=[a[0],a[i]]
temp[a[i]]-=1
for j in range(2,N):
x=P[j-2]^P[j-1]... | N=int(eval(input()))
a=list(map(int,input().split()))
d={}
for h in range(1,N):
if a[h] in d:
d[a[h]]+=1
else:
d[a[h]]=1
ans="Yes"
b=[a[0]]
for h in range(1,N):
t=a[h]^a[0]
if t in d:
b.append(a[h])
d[a[h]]-=1
if d[a[h]]==0:
del d[a... | p02975 |
N=int(eval(input()))
a=list(map(int,input().split()))
L=[str(bin(i))[2:] for i in a]
dic=dict([(i,0) for i in range(32)])
for s in L:
for i,c in enumerate(s[::-1]):
if c=='1':
dic[i]+=1
for i in list(dic.values()):
if i%2==1:
print("No")
exit(0)
else:
print("... | N=int(eval(input()))
A=list(map(int,input().split()))
sA=set(A)
flg=0
if all([x==0 for x in A]):
flg=1
elif len(sA)==2 and N%3==0:
a,b=[A.count(x) for x in sA]
if min(a,b)==N//3 and max(a,b)==N//3*2:
flg=1
elif len(sA)==3 and N%3==0:
a,b,c=[x for x in sA]
if a^b^c==0 and all([... | p02975 |
from functools import*;_,a=open(0);print(('YNeos'[reduce(lambda x,y:x^y,list(map(int,a.split())))>0::2])) | _,a=open(0);a,*b=list(map(int,a.split()))
for b in b:a^=b
print(('YNeos'[a>0::2])) | p02975 |
def main():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = collections.Counter(list(map(int, input().rstrip('\n').split()))).most_common()
if len(a) == 3:
if a[0][0] ^ a[1][0] ^ a[2][0] == 0 and a[0][1] == a[1][1] == a[2][1]:
... | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
a = collections.Counter(a).most_common()
if len(a) == 1:
if a[0][0] == 0:
print("Yes")
else:
... | p02975 |
def f(t,T):
if t in T:
return T[t]
else:
return 0
from copy import copy
N=int(eval(input()))
A=list(map(int,input().split()))
T={}
for a in A[1:]:
if a in T:
T[a]+=1
else:
T[a]=1
F=True
for i in range(1,N):
a,b=A[0],A[i]
X=[a,b]+[0]*(N-2)
... | N=int(eval(input()))
A=list(map(int,input().split()))
T={}
for a in A:
if a in T:
T[a]+=1
else:
T[a]=1
F=True
for x in T:
F&=(3*T[x]%N==0)
if not F:
print("No")
exit()
M=max(T,key=lambda x:T[x])
if 3*T[M]==N:
x,y,z=list(T.keys())
elif 3*T[M]==2*N:
x=... | p02975 |
import sys
inputs = sys.stdin.readlines()
N = int(inputs[0])
a_list = list(map(int, inputs[1].split()))
from collections import Counter
def all_zeros(a_list):
return sum(a_list) == 0
def check(N, a_list):
if all_zeros(a_list):
print('Yes')
return
elif N % 3 == 0:
... | import sys
inputs = sys.stdin.readlines()
from collections import Counter
N = int(inputs[0])
a_list = list(map(int, inputs[1].split()))
def check(N, a_list):
mc = Counter(a_list).most_common()
n = len(mc)
if n == 1:
if mc[0][0] == 0:
print('Yes')
return
... | p02975 |
from copy import copy
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
d = Counter(a)
#print(d)
for i in range(1, n):
one = prev = a[0]
two = cur = a[i]
dd = copy(d)
end = True
for j in range(n-2):
nxt = prev^cur
if dd[nxt] >0:... | from collections import Counter
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
if (len(c) == 1 and c[0] == n) or (len(c) == 2 and c[0] == n//3 and c[max(c.keys())] == 2*n//3) or (len(c) == 3 and reduce(lambda x, y: x^y, list(c.keys())) == 0 and set(c.values()... | p02975 |
N = int(eval(input()))
a = list(map(int, input().split()))
flag = False
for i in range(len(a)):
ta = a.pop(i)
sum_xor = 0
for _a in a:
sum_xor = sum_xor ^ _a
if sum_xor==ta:
flag = True
break
a.append(ta)
if flag:
print('Yes')
else:
print('No') | N = int(eval(input()))
a = list(map(int, input().split()))
flag = False
sum_xor = 0
for _a in a:
sum_xor = sum_xor ^ _a
if sum_xor==0:
print('Yes')
else:
print('No') | p02975 |
N = int(eval(input()))
A = list(map(int, input().split()))
import sys
from collections import Counter
d = Counter(A)
if d[0] == N:
print("Yes")
sys.exit()
if d[0] == N // 3:
for x in list(d.keys()):
if d[x] == 2 * N // 3:
print("Yes")
sys.exit()
# print(d... | N = int(eval(input()))
A = list(map(int, input().split()))
import sys
from collections import Counter
d = Counter(A)
if d[0] == N:
print("Yes")
sys.exit()
if d[0] == N // 3:
for x in list(d.keys()):
if d[x] == 2 * N // 3:
print("Yes")
sys.exit()
third = N... | p02975 |
def f(n, D, p, q):
for i in range(n-2):
r = p ^ q
if (r in D) and (D[r] > 0):
D[r] -= 1
else:
return -1
p, q = q, r
return p ^ q
def solve(n, a):
D = {}
for x in a:
if not x in D:
D[x] = 0
D[x] += 1
... | def solve(n, a):
p = 0
for x in a:
p ^= x
return "Yes" if p == 0 else "No"
n = int(eval(input()))
a = list(map(int, input().split()))
print((solve(n, a))) | p02975 |
import collections
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
C = collections.Counter(a)
L = len(C)
e = list(C.keys())
if (L == 1) and (C[0] > 0):
print("Yes")
elif (L == 2) and (C[e[0]] * 2 == C[e[1]]):
print((((e[0] ^ e[0] == e[1]) or (e[1] ^ e[1] == e[0])) and "Yes" or ... | import collections
N = int(eval(input()))
a = list(map(int, input().split()))
C = collections.Counter(a)
L = len(C)
e = list(C.keys())
if (L == 1) and (C[0] > 0):
print("Yes")
elif (L == 2) and (C[e[0]] * 2 == C[e[1]]):
print((((e[0] ^ e[0] == e[1]) or (e[1] ^ e[1] == e[0])) and "Yes" or "No"))
elif... | p02975 |
from functools import reduce
from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split()))
if N % 3 and a != [0] * N:
print("No")
exit()
nums = Counter(a)
ks = sorted(nums)
vs = sorted(nums.values())
if (
(len(nums) == 1 and ks[0] == 0)
or (len(nums) == 2 a... | N, *A = map(int, open(0).read().split())
A_set = set(A)
if len(A_set) == 1:
print("Yes") if sum(A) == 0 else print("No")
elif len(A_set) == 2:
a1, a2 = sorted(A_set)
print("Yes") if a1 == 0 and A.count(a1) * 3 == N else print("No")
elif len(A_set) == 3:
a1, a2, a3 = list(A_set)
if a1 ^ a2... | p02975 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.