problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02761
|
N,M = map(int,input().rstrip().split(" "))
ans = 0
n = [-1 for i in range(N)]
for i in range(M):
s,c = map(int,input().rstrip().split(" "))
s -= 1
if n[s] == -1 or n[s] == c:
n[s] = c
else:
ans = -1
if N != 1 and n[0] == 0:
ans = -1
if ans == -1:
print(-1)
if N == 0 and M == 0:
print(0)
else:
for i in range(N):
if n[i] == -1:
if i == 0:
ans = ans + 10 ** (N -1)
else:
ans += 10 ** (N - i -1) * n[i]
print(ans)
|
N,M = map(int,input().rstrip().split(" "))
ans = 0
n = [-1 for i in range(N)]
for i in range(M):
s,c = map(int,input().rstrip().split(" "))
s -= 1
if n[s] == -1 or n[s] == c:
n[s] = c
else:
ans = -1
if N != 1 and n[0] == 0:
ans = -1
if ans == -1:
print(-1)
elif N == 1 and M == 0:
print(0)
else:
for i in range(N):
if n[i] == -1:
if i == 0:
ans += 10 ** (N -1)
else:
ans += 10 ** (N - i -1) * n[i]
print(ans)
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add",
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 553,281
| 553,280
|
u017050982
|
python
|
p02761
|
def main():
N,M = map(int,input().split())
ansl = [-1]*N
isok = True
for i in range(M):
s,c = map(int, input().split())
if ansl[s-1]<0 : ansl[s-1]=c
elif ansl[s-1]!=c : isok = False
if ansl[0] == 0: isok = False
if ansl[0] == -1: ansl[0] = 1
for i in range(1,N):
if ansl[i] == -1 : ansl[i] = 0
if isok:
ans = ''
for n in ansl: ans+=str(n)
else:
ans = -1
print(ans)
"""
sc = []
for i in range(M):
new_sici = list(map(int, input().split()))
equal_flag = False
for sici in sc:
if sici[0] == new_sici[0] and sici[1]!=new_sici[1]:
print(-1)
return
if sici == new_sici: equal_flag = True
if not equal_flag : sc.append(new_sici)
sc.sort()
ansl = [0]*N
if sc[0][0] > 1 : ansl[0]=1
for sici in sc: ansl[sici[0]-1]=sici[1]
ans = ''
for n in ansl: ans+=str(n)
print(ans)
"""
return
if __name__ == "__main__":
main()
|
def main():
N,M = map(int,input().split())
ansl = [-1]*N
isok = True
for i in range(M):
s,c = map(int, input().split())
if ansl[s-1]<0 : ansl[s-1]=c
elif ansl[s-1]!=c : isok = False
if N>1:
if ansl[0] == 0: isok = False
if ansl[0] == -1: ansl[0] = 1
for i in range(0,N):
if ansl[i] == -1 : ansl[i] = 0
if isok:
ans = ''
for n in ansl: ans+=str(n)
else:
ans = -1
print(ans)
"""
sc = []
for i in range(M):
new_sici = list(map(int, input().split()))
equal_flag = False
for sici in sc:
if sici[0] == new_sici[0] and sici[1]!=new_sici[1]:
print(-1)
return
if sici == new_sici: equal_flag = True
if not equal_flag : sc.append(new_sici)
sc.sort()
ansl = [0]*N
if sc[0][0] > 1 : ansl[0]=1
for sici in sc: ansl[sici[0]-1]=sici[1]
ans = ''
for n in ansl: ans+=str(n)
print(ans)
"""
return
if __name__ == "__main__":
main()
|
[
"control_flow.branch.if.add",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 553,326
| 553,327
|
u021022333
|
python
|
p02761
|
n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
if n == 1:
if m == 0:
print(0)
exit()
for i in range(m):
s = sc[i][0]
c = sc[i][1]
if ans[s-1] != -1 and ans[s-1] != c:
print(-1)
exit()
else:
ans[s-1] = c
print(ans[0])
else:
if m == 0:
print('1' + str(0 * (n-1)))
exit()
for i in range(m):
s = sc[i][0]
c = sc[i][1]
if ans[s-1] != -1 and ans[s-1] != c:
print(-1)
exit()
elif s == 1 and c == 0:
print(-1)
exit()
else:
ans[s-1] = c
for i in range(n):
if i == 0 and ans[i] == -1:
ans[i] = 1
elif i != 0 and ans[i] == -1:
ans[i] = 0
print(''.join(map(str, ans)))
|
n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
if n == 1:
if m == 0:
print(0)
exit()
for i in range(m):
s = sc[i][0]
c = sc[i][1]
if ans[s-1] != -1 and ans[s-1] != c:
print(-1)
exit()
else:
ans[s-1] = c
print(ans[0])
else:
if m == 0:
print('1' + str('0' * (n-1)))
exit()
for i in range(m):
s = sc[i][0]
c = sc[i][1]
if ans[s-1] != -1 and ans[s-1] != c:
print(-1)
exit()
elif s == 1 and c == 0:
print(-1)
exit()
else:
ans[s-1] = c
for i in range(n):
if i == 0 and ans[i] == -1:
ans[i] = 1
elif i != 0 and ans[i] == -1:
ans[i] = 0
print(''.join(map(str, ans)))
|
[
"call.arguments.change"
] | 553,359
| 553,360
|
u690781906
|
python
|
p02761
|
N, M = [int(i) for i in input().split(" ")]
conds = []
for _ in range(M):
conds.append([int(i) for i in input().split(" ")])
exists = True
A = [None for _ in range(N)]
for s, c in conds:
idx = s-1
if A[idx] != None and A[idx] != c:
exists = False
break
A[idx] = c
def check():
if not exists:
return [-1]
if N == 1:
if A[0] == None:
return [0]
else:
return A
else:
if A[0] == 0:
return [-1]
for i in range(N):
if A[i] == None:
A[i] = -float("infinity")
base = [1] + [0] * (N-1)
res = []
for i in range(N):
res[i] = max(A[i], base[i])
return res
print("".join(str(x) for x in check()))
|
N, M = [int(i) for i in input().split(" ")]
conds = []
for _ in range(M):
conds.append([int(i) for i in input().split(" ")])
exists = True
A = [None for _ in range(N)]
for s, c in conds:
idx = s-1
if A[idx] != None and A[idx] != c:
exists = False
break
A[idx] = c
def check():
if not exists:
return [-1]
if N == 1:
if A[0] == None:
return [0]
else:
return A
else:
if A[0] == 0:
return [-1]
for i in range(N):
if A[i] == None:
A[i] = -float("infinity")
base = [1] + [0] * (N-1)
res = []
for i in range(N):
res.append(max(A[i], base[i]))
return res
print("".join(str(x) for x in check()))
|
[
"call.arguments.change"
] | 553,396
| 553,397
|
u654127147
|
python
|
p02761
|
import functools
n, m = map(int, input().split())
ls = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
flag = 0
for i in range(m):
keta = ls[i][0] - 1
if ls[i] == [1, 0] and n != 1:
flag = 1
break
else:
if ans[keta] == -1:
ans[keta] = ls[i][1]
elif ans[keta] == ls[i][1]:
continue
else:
flag = 1
break
if flag == 1:
print(-1)
elif flag == 0:
for j in range(n):
if ans[j] == -1:
if j == 0:
ans[j] = 1
else:
ans[j] = 0
ans_n = int(functools.reduce(lambda x, y: x + y, [str(x) for x in ans]))
print(ans_n)
|
import functools
n, m = map(int, input().split())
ls = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
flag = 0
for i in range(m):
keta = ls[i][0] - 1
if ls[i] == [1, 0] and n != 1:
flag = 1
break
else:
if ans[keta] == -1:
ans[keta] = ls[i][1]
elif ans[keta] == ls[i][1]:
continue
else:
flag = 1
break
if flag == 1:
print(-1)
elif flag == 0:
for j in range(n):
if ans[j] == -1:
if j == 0 and n != 1:
ans[j] = 1
else:
ans[j] = 0
ans_n = int(functools.reduce(lambda x, y: x + y, [str(x) for x in ans]))
print(ans_n)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,408
| 553,409
|
u386089355
|
python
|
p02761
|
# coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0:
ansl[i]="1"
else:
ansl[i]="0"
if ansl[0]=="0" and N!=1:
flg=False
ans=""
for i in range(N):
ans+=ansl[i]
if flg:
print(int(ans))
else:
print(-1)
|
# coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0 and N!=1:
ansl[i]="1"
else:
ansl[i]="0"
if ansl[0]=="0" and N!=1:
flg=False
ans=""
for i in range(N):
ans+=ansl[i]
if flg:
print(int(ans))
else:
print(-1)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,426
| 553,427
|
u095426154
|
python
|
p02761
|
# coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0:
ansl[i]="1"
else:
ansl[i]="0"
if ansl[0]=="0" and N!=0:
flg=False
ans=""
for i in range(N):
ans+=ansl[i]
if flg:
print(int(ans))
else:
print(-1)
|
# coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0 and N!=1:
ansl[i]="1"
else:
ansl[i]="0"
if ansl[0]=="0" and N!=1:
flg=False
ans=""
for i in range(N):
ans+=ansl[i]
if flg:
print(int(ans))
else:
print(-1)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.integer.change"
] | 553,428
| 553,427
|
u095426154
|
python
|
p02761
|
N, M = map(int, input().split())
A = [{i for i in range(0, 10)} for _ in range(N)]
A[0].discard(0)
T = True
for _ in range(M):
s, c = map(int, input().split())
A[s-1] = A[s-1] & set([c])
if len(A[s-1]) == 0:
T = False
if T:
X = ''
for i in range(N):
X += str(min(A[i]))
print(X)
else:
print(-1)
|
N, M = map(int, input().split())
A = [{i for i in range(0, 10)} for _ in range(N)]
if N > 1:
A[0].discard(0)
T = True
for _ in range(M):
s, c = map(int, input().split())
A[s-1] = A[s-1] & set([c])
if len(A[s-1]) == 0:
T = False
if T:
X = ''
for i in range(N):
X += str(min(A[i]))
print(X)
else:
print(-1)
|
[
"control_flow.branch.if.add"
] | 553,442
| 553,443
|
u761720628
|
python
|
p02761
|
def get_ints():
return list(map(int, input().split()))
n, m = get_ints()
digits = [-1 for i in range(n)]
for i in range(m):
s, c = get_ints()
s -= 1
if digits[s] >= 0 and digits[s] != c:
print(-1)
exit(0)
digits[s] = c
if digits[0] == 0:
if n == 1:
print(0)
else:
print(-1)
exit(0)
if digits[0] == -1:
digits[0] = 1
print(''.join(map(lambda x: str(max(0, x)), digits)))
|
def get_ints():
return list(map(int, input().split()))
n, m = get_ints()
digits = [-1 for i in range(n)]
for i in range(m):
s, c = get_ints()
s -= 1
if digits[s] >= 0 and digits[s] != c:
print(-1)
exit(0)
digits[s] = c
if digits[0] == 0:
if n == 1:
print(0)
else:
print(-1)
exit(0)
if n > 1 and digits[0] == -1:
digits[0] = 1
print(''.join(map(lambda x: str(max(0, x)), digits)))
|
[
"control_flow.branch.if.condition.change"
] | 553,470
| 553,471
|
u390181802
|
python
|
p02761
|
N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0 and N>1:
d[j] = 1
else:
d[j] = 0
ans += d[j]*(10**N)
print(flg if flg == -1 else ans)
|
N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0 and N>0:
d[j] = 1
else:
d[j] = 0
ans += d[j]*(10**N)
print(flg if flg == -1 else ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,484
| 553,485
|
u781758937
|
python
|
p02761
|
N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0:
d[j] = 1
else:
d[j] = 0
ans += d[j]*(10**N)
print(flg if flg == -1 else ans)
|
N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0 and N>0:
d[j] = 1
else:
d[j] = 0
ans += d[j]*(10**N)
print(flg if flg == -1 else ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,486
| 553,485
|
u781758937
|
python
|
p02761
|
N, M = map(int,input().split())
s = [0]*M
c = [0]*M
for i in range(M):
s[i], c[i] = map(int,input().split())
ans = [0]*N
if N != 1:
ans[0] = 1
error = 0
assign = [0]*M
for i in range(M):
assign[s[i]- 1] += 1
if assign[s[i] - 1] > 1 and ans[s[i] - 1] != c[i]:
error += 1
ans[s[i] - 1] = c[i]
if ans[0] == 0 and N != 1:
error += 1
if error == 0:
for i in range(N):
print(ans[i], end = "")
print()
else:
print(-1)
|
N, M = map(int,input().split())
s = [0]*M
c = [0]*M
for i in range(M):
s[i], c[i] = map(int,input().split())
ans = [0]*N
if N != 1:
ans[0] = 1
error = 0
assign = [0]*N
for i in range(M):
assign[s[i]- 1] += 1
if assign[s[i] - 1] > 1 and ans[s[i] - 1] != c[i]:
error += 1
ans[s[i] - 1] = c[i]
if ans[0] == 0 and N != 1:
error += 1
if error == 0:
for i in range(N):
print(ans[i], end = "")
print()
else:
print(-1)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 553,489
| 553,490
|
u539969758
|
python
|
p02761
|
N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 1
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]
c = j[1]
if int(x[s-1]) != c:
check = 0
#print(i,check)
if check == 1:
ans = i
break
print(ans)
|
N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 0
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]
c = j[1]
if int(x[s-1]) != c:
check = 0
#print(i,check)
if check == 1:
ans = i
break
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 553,493
| 553,494
|
u183896397
|
python
|
p02761
|
N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 1
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]
c = j[1]
if int(x[s-1]) != c:
check = 0
break
#print(i,check)
if check == 1:
ans = i
break
print(ans)
|
N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 0
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]
c = j[1]
if int(x[s-1]) != c:
check = 0
#print(i,check)
if check == 1:
ans = i
break
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"control_flow.break.remove"
] | 553,495
| 553,494
|
u183896397
|
python
|
p02761
|
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
numlst[numindex] = rule[1]
# 先頭が０の場合
if digit > 1 and numlst[0] == 0:
print(-1)
exit()
# 先頭がマイナス１かつ２ケタ以上の場合、０ではなく１にする
if digit > 2 and numlst[0] == -1:
numlst[0] = 1
# 文字列の組み立ておよび出力
for n in numlst:
if n == -1:
n = 0
print(n, end="")
print()
|
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
numlst[numindex] = rule[1]
# 先頭が０の場合
if digit > 1 and numlst[0] == 0:
print(-1)
exit()
# 先頭がマイナス１かつ２ケタ以上の場合、０ではなく１にする
if digit > 1 and numlst[0] == -1:
numlst[0] = 1
# 文字列の組み立ておよび出力
for n in numlst:
if n == -1:
n = 0
print(n, end="")
print()
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,506
| 553,507
|
u209299893
|
python
|
p02761
|
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
numlst[numindex] = rule[1]
# 先頭が０の場合
if digit > 1 and numlst[0] == 0:
print(-1)
exit()
# 先頭がマイナス１の場合、０ではなく１にする
if numlst[0] == -1:
numlst[0] = 1
# 文字列の組み立ておよび出力
for n in numlst:
if n == -1:
n = 0
print(n, end="")
print()
|
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
numlst[numindex] = rule[1]
# 先頭が０の場合
if digit > 1 and numlst[0] == 0:
print(-1)
exit()
# 先頭がマイナス１かつ２ケタ以上の場合、０ではなく１にする
if digit > 1 and numlst[0] == -1:
numlst[0] = 1
# 文字列の組み立ておよび出力
for n in numlst:
if n == -1:
n = 0
print(n, end="")
print()
|
[
"control_flow.branch.if.condition.change"
] | 553,508
| 553,507
|
u209299893
|
python
|
p02761
|
# Code for C - Guess The Number
# Use input() to fetch data from STDIN
import sys
[n, m] = [int(x) for x in input().split()]
s = []
c = []
for i in range(m):
[x, y] = [int(x) for x in input().split()]
s.append(x)
c.append(y)
for x in range(1, 1000):
a = str(x)
if len(a) != n:
continue
test = all([a[i - 1] == str(j) for i, j in zip(s, c)])
if test:
print(x)
sys.exit()
print("-1")
|
# Code for C - Guess The Number
# Use input() to fetch data from STDIN
import sys
[n, m] = [int(x) for x in input().split()]
s = []
c = []
for i in range(m):
[x, y] = [int(x) for x in input().split()]
s.append(x)
c.append(y)
for x in range(1000):
a = str(x)
if len(a) != n:
continue
test = all([a[i - 1] == str(j) for i, j in zip(s, c)])
if test:
print(x)
sys.exit()
print("-1")
|
[
"call.arguments.change"
] | 553,509
| 553,510
|
u638629468
|
python
|
p02761
|
n, m = map(int, input().split())
sc = [list(map(int, input().split()))for i in range(m)]
ans = -1
for i in range(1, 1000):
if len(str(i)) != n:
continue
for s, c in sc:
if str(i)[s-1] != str(c):
break
else:
ans = i
break
print(ans)
|
n, m = map(int, input().split())
sc = [list(map(int, input().split()))for i in range(m)]
ans = -1
for i in range(1000):
if len(str(i)) != n:
continue
for s, c in sc:
if str(i)[s-1] != str(c):
break
else:
ans = i
break
print(ans)
|
[
"call.arguments.change"
] | 553,521
| 553,522
|
u644516473
|
python
|
p02761
|
#n = int(input())
n,m = map(int,input().split())
#a_L = list(map(int,input().split()))
s_L,c_L = [],[]
for _ in range(m):
s,c = map(int,input().split())
s_L.append(s-1)
c_L.append(c)
ans = 10000
for i in range(700,703):
tmp =list(str(i))
#i = list(str(i))
#print(tmp)
flag = []
for j in range(m):
try:
if tmp[s_L[j]] == str(c_L[j]):
flag.append(True)
else:
#print(tmp)
flag.append(False)
except:
pass
if all(flag) and len(tmp)==n:
#print("OK")
#print(i)
ans = min(i,ans)
if ans == 10000:
print(-1)
else:
print(ans)
|
#n = int(input())
n,m = map(int,input().split())
#a_L = list(map(int,input().split()))
s_L,c_L = [],[]
for _ in range(m):
s,c = map(int,input().split())
s_L.append(s-1)
c_L.append(c)
ans = 10000
for i in range(0,10000):
tmp =list(str(i))
flag = []
for j in range(m):
try:
if tmp[s_L[j]] == str(c_L[j]):
flag.append(True)
else:
flag.append(False)
except:
pass
if all(flag) and len(tmp)==n:
ans = min(i,ans)
if ans == 10000:
print(-1)
else:
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.loop.range.bounds.upper.change"
] | 553,525
| 553,526
|
u625255205
|
python
|
p02761
|
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def main():
N,M = MI()
NUM = [-1]*N
ch = True
for i in range(M):
s,c = MI()
s = s-1
if(NUM[s]!=-1 and NUM[s]!=c):
ch = False
NUM[s]=c
if(NUM[0]==0 and N!=1):
ch=False
if(ch==False):
print(-1)
else:
ans = 0
t = 10**(N-1)
for i in range(N):
if(NUM[i]==-1 and (i==0 or N!=1)):
ans += t
elif(NUM[i]!=-1):
ans += (t * NUM[i])
t //= 10
print(ans)
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def main():
N,M = MI()
NUM = [-1]*N
ch = True
for i in range(M):
s,c = MI()
s = s-1
if(NUM[s]!=-1 and NUM[s]!=c):
ch = False
NUM[s]=c
if(NUM[0]==0 and N!=1):
ch=False
if(ch==False):
print(-1)
else:
ans = 0
t = 10**(N-1)
for i in range(N):
if(NUM[i]==-1 and i==0):
if(N!=1):
ans += t
elif(NUM[i]!=-1):
ans += (t * NUM[i])
t //= 10
print(ans)
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 553,572
| 553,573
|
u624696727
|
python
|
p02761
|
n, m = [int(x) for x in input().split()]
sc = [[int(x) for x in input().split()] for i in range(m)]
r = [-1] * n
def solution():
for s, c in sc:
if s == 1 and c == 0 and n != 1:
return '-1'
if r[s - 1] >= 0 and r[s - 1] != c:
return '-1'
r[s - 1] = c
for i in range(n):
if r[i] < 0:
if i == 0:
r[i] = 1
else:
r[i] = 0
return ''.join(str(r[i]) for i in range(n))
print(solution())
|
n, m = [int(x) for x in input().split()]
sc = [[int(x) for x in input().split()] for i in range(m)]
r = [-1] * n
def solution():
for s, c in sc:
if s == 1 and c == 0 and n != 1:
return '-1'
if r[s - 1] >= 0 and r[s - 1] != c:
return '-1'
r[s - 1] = c
for i in range(n):
if r[i] < 0:
if i == 0 and n != 1:
r[i] = 1
else:
r[i] = 0
return ''.join(str(r[i]) for i in range(n))
print(solution())
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,580
| 553,581
|
u727407185
|
python
|
p02761
|
N, M = map(int, input().split())
ans = [0] * N
ans_flag = [0] * N # s桁目に条件がきたら1
for _ in range(M):
s, c = map(int, input().split())
if N != 1 and s == 1 and c == 0: # 一番左が1の時点でN(>=2)桁がありえない
print(-1)
exit()
elif ans_flag[s-1] == 1 and ans[s-1] != c:
print(-1)
exit()
else:
ans[s-1] = c
ans_flag[s-1] = 1
if ans[0] == 0: # 一番左が0の場合は1にすれば最小になる
ans[0] = 1
print(int("".join(map(str, ans))))
|
N, M = map(int, input().split())
ans = [0] * N
ans_flag = [0] * N # s桁目に条件がきたら1
for _ in range(M):
s, c = map(int, input().split())
if N != 1 and s == 1 and c == 0: # 一番左が1の時点でN(>=2)桁がありえない
print(-1)
exit()
elif ans_flag[s-1] == 1 and ans[s-1] != c:
print(-1)
exit()
else:
ans[s-1] = c
ans_flag[s-1] = 1
if N != 1 and ans[0] == 0: # 一番左が0の場合は1にすれば最小になる
ans[0] = 1
print(int("".join(map(str, ans))))
|
[
"control_flow.branch.if.condition.change"
] | 553,585
| 553,586
|
u767664985
|
python
|
p02761
|
n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for _ in range(m)]
ans = '1'
if m == 1:
ans = '0'
for i in range(n-1):
ans += '0'
while len(ans) == n:
if all([ans[s-1] == str(c) for s, c in sc]):
print(int(ans))
exit()
ans = str(int(ans)+1)
print(-1)
|
n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for _ in range(m)]
ans = '1'
if n == 1:
ans = '0'
for i in range(n-1):
ans += '0'
while len(ans) == n:
if all([ans[s-1] == str(c) for s, c in sc]):
print(ans)
exit()
ans = str(int(ans)+1)
print(-1)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.arguments.change"
] | 553,591
| 553,592
|
u384793271
|
python
|
p02761
|
n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1 for _ in range(n)]
for sci in sc:
if ans[sci[0]-1] == -1:
ans[sci[0]-1] = sci[1]
elif ans[sci[0]-1] != sci[1]:
print(-1)
exit(0)
if ans[0] == 0 and n != 1:
print(-1)
exit(0)
ansint = 0
for i, a in enumerate(ans):
ansint *= 10
if a == -1:
if i == 0:
ans[i] = 1
else:
ans[i] = 0
ansint += ans[i]
print(ansint)
|
n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1 for _ in range(n)]
for sci in sc:
if ans[sci[0]-1] == -1:
ans[sci[0]-1] = sci[1]
elif ans[sci[0]-1] != sci[1]:
print(-1)
exit(0)
if ans[0] == 0 and n != 1:
print(-1)
exit(0)
ansint = 0
for i, a in enumerate(ans):
ansint *= 10
if a == -1:
if i == 0 and n != 1:
ans[i] = 1
else:
ans[i] = 0
ansint += ans[i]
print(ansint)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,593
| 553,594
|
u630281418
|
python
|
p02761
|
N, M = [int(i) for i in input().split()]
t = []
for i in range(M):
t += [[int(i) for i in input().split()]]
for i in range(1, 1000):
s = str(i)
s
if len(s) != N:
continue
isOK = True
for it in t:
if len(s) < it[0]:
isOK = False
else:
isOK = isOK and (s[it[0]-1] == str(it[1]))
if isOK:
print(s)
exit()
print(-1)
|
N, M = [int(i) for i in input().split()]
t = []
for i in range(M):
t += [[int(i) for i in input().split()]]
for i in range(1000):
s = str(i)
if len(s) != N:
continue
isOK = True
for it in t:
if len(s) < it[0]:
isOK = False
else:
isOK = isOK and (s[it[0]-1] == str(it[1]))
if isOK:
print(s)
exit()
print(-1)
|
[
"call.arguments.change"
] | 553,601
| 553,602
|
u225053756
|
python
|
p02761
|
N,M = map(int,input().split())
SC = []
for _ in range(M):
sc = list(map(int,input().split()))
SC.append(sc)
#print(SC)
for num in range(1000):
ans = True
znum = str(num).zfill(3)
#print(znum)
for sc in SC:
if znum[sc[0]-1] != str(sc[1]):
ans = False
if ans:
if len(str(num)) == N:
print(num)
#print(znum)
exit()
print(-1)
|
N,M = map(int,input().split())
SC = []
for _ in range(M):
sc = list(map(int,input().split()))
SC.append(sc)
#print(SC)
for num in range(1000):
ans = True
#znum = str(num).zfill(3)
znum = str(num).zfill(N)
#print(znum)
for sc in SC:
if znum[sc[0]-1] != str(sc[1]):
ans = False
if ans:
if len(str(num)) == N:
print(num)
#print(znum)
exit()
print(-1)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 553,622
| 553,623
|
u503228842
|
python
|
p02761
|
N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
def check(string):
for s, c in SC:
if string[s - 1] != str(c):
return False
return True
if N == 1:
for i in range(10 ** i):
if check(str(i)):
print (i)
exit()
print (-1)
exit()
else:
for i in range(10 ** (N - 1), 10 ** (N)):
if check(str(i)):
print (i)
exit()
print (-1)
exit()
|
N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
def check(string):
for s, c in SC:
if string[s - 1] != str(c):
return False
return True
if N == 1:
for i in range(10 ** 1):
if check(str(i)):
print (i)
exit()
print (-1)
exit()
else:
for i in range(10 ** (N - 1), 10 ** (N)):
if check(str(i)):
print (i)
exit()
print (-1)
exit()
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 553,657
| 553,658
|
u263830634
|
python
|
p02761
|
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
SC = [[int(x) for x in input().split()] for _ in range(N)]
f = False
for i in range(1000):
if len(str(i)) != N:
continue
x = str(i)
for s, c in SC:
if int(x[s - 1]) != c:
break
else:
f = True
if f:
print(i)
return
else:
print(-1)
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
SC = [[int(x) for x in input().split()] for _ in range(M)]
f = False
for i in range(1000):
if len(str(i)) != N:
continue
x = str(i)
for s, c in SC:
if int(x[s - 1]) != c:
break
else:
f = True
if f:
print(i)
return
else:
print(-1)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 553,693
| 553,694
|
u098012509
|
python
|
p02762
|
class UnionFind:
def __init__(self, n):
self.n = n
self.g = [i for i in range(n)]
self.nmembers = [1 for i in range(n)]
def __len__(self):
return self.n
def __str__(self):
return "group:{}\nnmembers:{}".format(self.g,self.nmembers)
def __getitem__(self,x):
return self.g[x]
def merge(self, x, y):
gx = self.whichgroup(x)
gy = self.whichgroup(y)
if gx != gy:
nx = self.nmembers[gx]
ny = self.nmembers[gy]
ming = min(gx, gy)
maxg = gx + gy - ming
self.g[maxg] = ming
self.nmembers[maxg] = 0
self.nmembers[ming] = nx + ny
def whichgroup(self, x):
if x != self.g[x]:
self.g[x] = self.whichgroup(self.g[x])
self.nmembers[x] = 0
return self.g[x]
else:
return x
N, M, K = map(int, input().split())
UF = UnionFind(N)
F = [0 for i in range(N)]
B = [0 for i in range(N)]
#print(UF)
for i in range(M):
x, y = map(int, input().split())
x, y = x-1, y-1
#print("x:{}, y:{}".format(x, y))
UF.merge(x, y)
F[x] += 1
F[y] += 1
for i in range(K):
x, y = map(int, input().split())
x, y = x-1, y-1
gx = UF.whichgroup(x)
gy = UF.whichgroup(y)
if gx == gy:
B[x] += 1
B[y] += 1
ans = []
for i in range(N):
ans.append(UF.nmembers[UF[i]]-B[i]-F[i]-1)
print(*ans)
|
class UnionFind:
def __init__(self, n):
self.n = n
self.g = [i for i in range(n)]
self.nmembers = [1 for i in range(n)]
def __len__(self):
return self.n
def __str__(self):
return "group:{}\nnmembers:{}".format(self.g,self.nmembers)
def __getitem__(self,x):
return self.whichgroup(x)
def merge(self, x, y):
gx = self.whichgroup(x)
gy = self.whichgroup(y)
if gx != gy:
nx = self.nmembers[gx]
ny = self.nmembers[gy]
ming = min(gx, gy)
maxg = gx + gy - ming
self.g[maxg] = ming
self.nmembers[maxg] = 0
self.nmembers[ming] = nx + ny
def whichgroup(self, x):
if x != self.g[x]:
self.g[x] = self.whichgroup(self.g[x])
self.nmembers[x] = 0
return self.g[x]
else:
return x
N, M, K = map(int, input().split())
UF = UnionFind(N)
F = [0 for i in range(N)]
B = [0 for i in range(N)]
#print(UF)
for i in range(M):
x, y = map(int, input().split())
x, y = x-1, y-1
#print("x:{}, y:{}".format(x, y))
UF.merge(x, y)
F[x] += 1
F[y] += 1
for i in range(K):
x, y = map(int, input().split())
x, y = x-1, y-1
gx = UF.whichgroup(x)
gy = UF.whichgroup(y)
if gx == gy:
B[x] += 1
B[y] += 1
#print(UF)
ans = []
for i in range(N):
ans.append(UF.nmembers[UF[i]]-B[i]-F[i]-1)
print(*ans)
|
[
"function.return_value.change"
] | 553,699
| 553,700
|
u845573105
|
python
|
p02762
|
from collections import deque, Counter
import sys
N_MAX = 100000 + 5
sys.setrecursionlimit(N_MAX)
N, M, K = map(int, sys.stdin.readline().rstrip().split())
fr = [[] for _ in range(N)] # 友達関係
for _ in range(M):
a, b = map(int, sys.stdin.readline().rstrip().split())
fr[a - 1].append(b - 1)
fr[b - 1].append(a - 1)
bl = [[] for _ in range(N)] # ブロック関係
for _ in range(K):
a, b = map(int, sys.stdin.readline().rstrip().split())
bl[a - 1].append(b - 1)
bl[b - 1].append(a - 1)
gr = [0] * N # 友達候補グループ
# ## BFS ## #
def bfs(u, num):
q = deque()
q.append(u)
while q:
u = q.popleft()
for v in fr[u]:
if gr[v] == 0: # state を確認
gr[v] = num # state を変更
q.append(v)
num = 1
for i in range(N):
if gr[i] == 0:
bfs(i, num)
num += 1
# print(gr)
gr_num = Counter(gr) # グループの人数を数えておく
# グループの中から、友達でも
ans = []
for i in range(N):
kouho_suu = gr_num[gr[i]]
for f in fr[i]:
if gr[i] == gr[f]:
kouho_suu -= 1
for b in bl[i]:
if gr[i] == gr[b]:
kouho_suu -= 1
kouho_suu -= 1
ans.append(kouho_suu)
print(*ans)
|
from collections import deque, Counter
import sys
N_MAX = 100000 + 5
sys.setrecursionlimit(N_MAX)
N, M, K = map(int, sys.stdin.readline().rstrip().split())
fr = [[] for _ in range(N)] # 友達関係
for _ in range(M):
a, b = map(int, sys.stdin.readline().rstrip().split())
fr[a - 1].append(b - 1)
fr[b - 1].append(a - 1)
bl = [[] for _ in range(N)] # ブロック関係
for _ in range(K):
a, b = map(int, sys.stdin.readline().rstrip().split())
bl[a - 1].append(b - 1)
bl[b - 1].append(a - 1)
gr = [0] * N # 友達候補グループ
# ## BFS ## #
def bfs(u, num):
q = deque()
q.append(u)
gr[u] = num
while q:
u = q.popleft()
for v in fr[u]:
if gr[v] == 0: # state を確認
gr[v] = num # state を変更
q.append(v)
num = 1
for i in range(N):
if gr[i] == 0:
bfs(i, num)
num += 1
# print(gr)
gr_num = Counter(gr) # グループの人数を数えておく
# グループの中から、友達でも
ans = []
for i in range(N):
kouho_suu = gr_num[gr[i]]
for f in fr[i]:
if gr[i] == gr[f]:
kouho_suu -= 1
for b in bl[i]:
if gr[i] == gr[b]:
kouho_suu -= 1
kouho_suu -= 1
ans.append(kouho_suu)
print(*ans)
|
[
"assignment.add"
] | 553,730
| 553,731
|
u726285999
|
python
|
p02762
|
n,m,k = map(int,input().split())
f = [[] for _ in range(n)]
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
f[a].append(b)
f[b].append(a)
for _ in range(k):
c,d = map(int,input().split())
c,d = c-1,d-1
g[c].append(d)
g[d].append(c)
d = {}
parent = [-1]*n
seen = [False]*n
from collections import deque
for i in range(n):
if seen[i]: continue
stack = deque()
d[i] = set([i])
stack = [i]
while stack:
v = stack.pop()
seen[v] = True
parent[v]=i
for nv in f[v]:
if seen[nv]: continue
d[i].add(nv)
stack.append(nv)
ans = [0]*n
for i in range(n):
group = d[parent[i]]
sum = len(d[i]) -len(f[i]) - len(set(g[i])&group) -1
ans[i]=sum
print(*ans)
|
n,m,k = map(int,input().split())
f = [[] for _ in range(n)]
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
f[a].append(b)
f[b].append(a)
for _ in range(k):
c,d = map(int,input().split())
c,d = c-1,d-1
g[c].append(d)
g[d].append(c)
d = {}
parent = [-1]*n
seen = [False]*n
from collections import deque
for i in range(n):
if seen[i]: continue
stack = deque()
d[i] = set([i])
stack = [i]
while stack:
v = stack.pop()
seen[v] = True
parent[v]=i
for nv in f[v]:
if seen[nv]: continue
d[i].add(nv)
stack.append(nv)
ans = [0]*n
for i in range(n):
group = d[parent[i]]
sum = len(group) -len(f[i]) - len(set(g[i])&group) -1
ans[i]=sum
print(*ans)
|
[
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 553,746
| 553,747
|
u800396927
|
python
|
p02762
|
import sys
sys.setrecursionlimit(1000000000)
n,m,k=map(int,input().split())
stock=[set() for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
if ter[next_j]==0:
ter[next_j]=k
dfs(next_j,k)
total=0
size=[0]*(n+1)
for i in range(n):
if ter[i]==0:
total+=1
ter[i]=total
dfs(i,total)
for i in range(n):
ans[i]+=size[ter[i]]-1
for i in range(k):
c, d = map(int, input().split())
if ter[c-1]==ter[d-1]:
ans[c-1]-=1
ans[d-1]-=1
for i in range(n-1):
print(ans[i],end=" ")
print(ans[n-1])
|
import sys
sys.setrecursionlimit(10000000)
n,m,k=map(int,input().split())
stock=[[] for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
if ter[next_j]==0:
ter[next_j]=k
dfs(next_j,k)
total=0
size=[0]*(n+1)
for i in range(n):
if ter[i]==0:
total+=1
ter[i]=total
dfs(i,total)
for i in range(n):
ans[i]+=size[ter[i]]-1
for i in range(k):
c, d = map(int, input().split())
if ter[c-1]==ter[d-1]:
ans[c-1]-=1
ans[d-1]-=1
for i in range(n-1):
print(ans[i],end=" ")
print(ans[n-1])
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 553,754
| 553,757
|
u414920281
|
python
|
p02762
|
import sys
sys.setrecursionlimit(1000000)
n,m,k=map(int,input().split())
stock=[set() for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
if ter[next_j]==0:
ter[next_j]=k
dfs(next_j,k)
total=0
size=[0]*(n+1)
for i in range(n):
if ter[i]==0:
total+=1
ter[i]=total
dfs(i,total)
for i in range(n):
ans[i]+=size[ter[i]]-1
for i in range(k):
c, d = map(int, input().split())
if ter[c-1]==ter[d-1]:
ans[c-1]-=1
ans[d-1]-=1
for i in range(n-1):
print(ans[i],end=" ")
print(ans[n-1])
|
import sys
sys.setrecursionlimit(10000000)
n,m,k=map(int,input().split())
stock=[[] for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
if ter[next_j]==0:
ter[next_j]=k
dfs(next_j,k)
total=0
size=[0]*(n+1)
for i in range(n):
if ter[i]==0:
total+=1
ter[i]=total
dfs(i,total)
for i in range(n):
ans[i]+=size[ter[i]]-1
for i in range(k):
c, d = map(int, input().split())
if ter[c-1]==ter[d-1]:
ans[c-1]-=1
ans[d-1]-=1
for i in range(n-1):
print(ans[i],end=" ")
print(ans[n-1])
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 553,756
| 553,757
|
u414920281
|
python
|
p02762
|
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def count(self, x):
return -self.table[self._root(x)]
def find(self, x, y):
return self._root(x) == self._root(y)
def union(self, x, y):
r1 = self._root(x)
r2 = self._root(y)
if r1 == r2:
return
d1 = self.table[r1]
d2 = self.table[r2]
if d1 <= d2:
self.table[r2] = r1
self.table[r1] += d2
else:
self.table[r1] = r2
self.table[r2] += d1
N, M, K = map(int, input().split())
ins_friend = UnionFind(N)
friends = [0 for i in range(N)]
blocks = [set() for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
ins_friend.union(a-1, b-1)
friends[a-1] += 1
friends[b-1] += 1
for _ in range(K):
c, d = map(int, input().split())
blocks[c-1].add(d-1)
blocks[d-1].add(c-1)
ans = [0 for i in range(N)]
for i in range(N):
ans[i] = ins_friend.count(i) - 1 - friends[i]
for x in range(len(blocks[i])):
if ins_friend.find(i, x) == True:
ans[i] -= 1
print(*ans)
|
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def count(self, x):
return -self.table[self._root(x)]
def find(self, x, y):
return self._root(x) == self._root(y)
def union(self, x, y):
r1 = self._root(x)
r2 = self._root(y)
if r1 == r2:
return
d1 = self.table[r1]
d2 = self.table[r2]
if d1 <= d2:
self.table[r2] = r1
self.table[r1] += d2
else:
self.table[r1] = r2
self.table[r2] += d1
N, M, K = map(int, input().split())
ins_friend = UnionFind(N)
friends = [0 for i in range(N)]
blocks = [set() for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
ins_friend.union(a-1, b-1)
friends[a-1] += 1
friends[b-1] += 1
for _ in range(K):
c, d = map(int, input().split())
blocks[c-1].add(d-1)
blocks[d-1].add(c-1)
ans = [0 for i in range(N)]
for i in range(N):
ans[i] = ins_friend.count(i) - 1 - friends[i]
for x in blocks[i]:
if ins_friend.find(i, x) == True:
ans[i] -= 1
print(*ans)
|
[
"call.remove",
"call.arguments.change"
] | 553,777
| 553,778
|
u026155812
|
python
|
p02762
|
import sys
from io import StringIO
import unittest
import os
# union find木
# 参考：https://note.nkmk.me/python-union-find/
class UnionFind:
def __init__(self, n):
"""
コンストラクタ
:要素数 n:
"""
self.n = n
# 添字x: 値yとすると・・
# root以外の場合： 要素xは集合yに所属する。
# rootの場合 ： 集合xの要素数はy個である。(負数で保持する)
self.parents = [-1] * n
def getroot(self, x):
"""
所属する集合(ルートの番号)を取得する。
:調査する要素 x:
"""
# 値が負数 = ルートに到達したので、ルート木の番号を返す。
if self.parents[x] < 0:
return x
else:
# 値が正数 = ルートに到達していない場合、さらに親の情報を確認する。
# 下の行は経路圧縮の処理。
self.parents[x] = self.getroot(self.parents[x])
return self.parents[x]
def union(self, x, y):
"""
2つの要素が所属する集合をを同じ集合に結合する。
:結合する要素(1つ目) x:
:結合する要素(2つ目) y:
"""
# 既に同じ集合に存在するなら何もせず終了。
x = self.getroot(x)
y = self.getroot(y)
if x == y:
return
# 集合を結合する。
# ※ここ、「要素数の大きい集合に、少ない集合を結合」しているが、こうすることで以後の「処理量を削減」するテクニックである。
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
"""
指定した集合に属する要素数を取得する。
:調査する集合 x:
"""
# 添え字[root]には、要素数が負数で格納されている。そのため、取得する際は-反転する。
return -self.parents[self.getroot(x)]
def is_same(self, x, y):
return self.getroot(x) == self.getroot(y)
def members(self, x):
root = self.getroot(x)
return [i for i in range(self.n) if self.getroot(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
# 実装を行う関数
def resolve():
# 数値取得サンプル
# 1行N項目 x, y = map(int, input().split())
# N行N項目 x = [list(map(int, input().split())) for i in range(n)]
n, m, k = map(int, input().split())
friends = [list(map(int, input().split())) for i in range(m)]
blocks = [list(map(int, input().split())) for i in range(k)]
# uf 作成(要素数を+1しているのは添え字と人番号を合わせるため)
uf = UnionFind(n + 1)
# 除外リスト作成(これは、本問題特有の処理)
# 添字x: 値yとすると・・ 要素xの友達候補を数えるとき、y(list)に該当する人は除外する。(要素数を+1しているのは添え字と人番号を合わせるため)
omits = [[] for i in range(n + 1)]
# UnionFindにて集合を明確にする。
for friend in friends:
uf.union(friend[0], friend[1])
# 除外リストを更新(これは、本問題特有の処理)
omits[friend[0]].append(friend[1])
omits[friend[1]].append(friend[0])
# ブロックリストの情報を除外リストに加える(これは、本問題特有の処理)
for block in blocks:
# 同じ集合に属するウ場合のみ、リストに追加
if uf.is_same(block[0], block[1]):
omits[block[0]].append(block[1])
omits[block[1]].append(block[0])
# 友達候補数を出力して終了(人は1始まりなので1からループを行う
# ans = []
# for i in range(1, n + 1):
# 友達候補 = 集合数 - 除外リスト(自分の友人数 + 自分がブロックしている人数) - 1(集合に含まれる自分自身を除く)
# ans.append(uf.size(i) - len(omits[i]) - 1)
ans = [str(uf.size(i) - len(omits[i])) - 1 for i in range(1, n + 1)]
print(" ".join(ans))
# テストクラス
class TestClass(unittest.TestCase):
def assertIO(self, assert_input, output):
stdout, sat_in = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, sat_in
self.assertEqual(out, output)
def test_input_1(self):
test_input = """4 4 1
2 1
1 3
3 2
3 4
4 1"""
output = """0 1 0 1"""
self.assertIO(test_input, output)
def test_input_2(self):
test_input = """5 10 0
1 2
1 3
1 4
1 5
3 2
2 4
2 5
4 3
5 3
4 5"""
output = """0 0 0 0 0"""
self.assertIO(test_input, output)
def test_input_3(self):
test_input = """10 9 3
10 1
6 7
8 2
2 5
8 4
7 3
10 9
6 4
5 8
2 6
7 5
3 1"""
output = """1 3 5 4 3 3 3 3 1 0"""
self.assertIO(test_input, output)
# 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
def tes_t_1original_1(self):
test_input = """データ"""
output = """データ"""
self.assertIO(test_input, output)
# 実装orテストの呼び出し
if __name__ == "__main__":
if os.environ.get("USERNAME") is None:
# AtCoder提出時の場合
resolve()
else:
# 自PCの場合
unittest.main()
|
import sys
from io import StringIO
import unittest
import os
# union find木
# 参考：https://note.nkmk.me/python-union-find/
class UnionFind:
def __init__(self, n):
"""
コンストラクタ
:要素数 n:
"""
self.n = n
# 添字x: 値yとすると・・
# root以外の場合： 要素xは集合yに所属する。
# rootの場合 ： 集合xの要素数はy個である。(負数で保持する)
self.parents = [-1] * n
def getroot(self, x):
"""
所属する集合(ルートの番号)を取得する。
:調査する要素 x:
"""
# 値が負数 = ルートに到達したので、ルート木の番号を返す。
if self.parents[x] < 0:
return x
else:
# 値が正数 = ルートに到達していない場合、さらに親の情報を確認する。
# 下の行は経路圧縮の処理。
self.parents[x] = self.getroot(self.parents[x])
return self.parents[x]
def union(self, x, y):
"""
2つの要素が所属する集合をを同じ集合に結合する。
:結合する要素(1つ目) x:
:結合する要素(2つ目) y:
"""
# 既に同じ集合に存在するなら何もせず終了。
x = self.getroot(x)
y = self.getroot(y)
if x == y:
return
# 集合を結合する。
# ※ここ、「要素数の大きい集合に、少ない集合を結合」しているが、こうすることで以後の「処理量を削減」するテクニックである。
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
"""
指定した集合に属する要素数を取得する。
:調査する集合 x:
"""
# 添え字[root]には、要素数が負数で格納されている。そのため、取得する際は-反転する。
return -self.parents[self.getroot(x)]
def is_same(self, x, y):
return self.getroot(x) == self.getroot(y)
def members(self, x):
root = self.getroot(x)
return [i for i in range(self.n) if self.getroot(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
# 実装を行う関数
def resolve():
# 数値取得サンプル
# 1行N項目 x, y = map(int, input().split())
# N行N項目 x = [list(map(int, input().split())) for i in range(n)]
n, m, k = map(int, input().split())
friends = [list(map(int, input().split())) for i in range(m)]
blocks = [list(map(int, input().split())) for i in range(k)]
# uf 作成(要素数を+1しているのは添え字と人番号を合わせるため)
uf = UnionFind(n + 1)
# 除外リスト作成(これは、本問題特有の処理)
# 添字x: 値yとすると・・ 要素xの友達候補を数えるとき、y(list)に該当する人は除外する。(要素数を+1しているのは添え字と人番号を合わせるため)
omits = [[] for i in range(n + 1)]
# UnionFindにて集合を明確にする。
for friend in friends:
uf.union(friend[0], friend[1])
# 除外リストを更新(これは、本問題特有の処理)
omits[friend[0]].append(friend[1])
omits[friend[1]].append(friend[0])
# ブロックリストの情報を除外リストに加える(これは、本問題特有の処理)
for block in blocks:
# 同じ集合に属するウ場合のみ、リストに追加
if uf.is_same(block[0], block[1]):
omits[block[0]].append(block[1])
omits[block[1]].append(block[0])
# 友達候補数を出力して終了(人は1始まりなので1からループを行う
# ans = []
# for i in range(1, n + 1):
# 友達候補 = 集合数 - 除外リスト(自分の友人数 + 自分がブロックしている人数) - 1(集合に含まれる自分自身を除く)
# ans.append(uf.size(i) - len(omits[i]) - 1)
ans = [str(uf.size(i) - len(omits[i]) - 1) for i in range(1, n + 1)]
print(" ".join(ans))
# テストクラス
class TestClass(unittest.TestCase):
def assertIO(self, assert_input, output):
stdout, sat_in = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, sat_in
self.assertEqual(out, output)
def test_input_1(self):
test_input = """4 4 1
2 1
1 3
3 2
3 4
4 1"""
output = """0 1 0 1"""
self.assertIO(test_input, output)
def test_input_2(self):
test_input = """5 10 0
1 2
1 3
1 4
1 5
3 2
2 4
2 5
4 3
5 3
4 5"""
output = """0 0 0 0 0"""
self.assertIO(test_input, output)
def test_input_3(self):
test_input = """10 9 3
10 1
6 7
8 2
2 5
8 4
7 3
10 9
6 4
5 8
2 6
7 5
3 1"""
output = """1 3 5 4 3 3 3 3 1 0"""
self.assertIO(test_input, output)
# 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
def tes_t_1original_1(self):
test_input = """データ"""
output = """データ"""
self.assertIO(test_input, output)
# 実装orテストの呼び出し
if __name__ == "__main__":
if os.environ.get("USERNAME") is None:
# AtCoder提出時の場合
resolve()
else:
# 自PCの場合
unittest.main()
|
[
"call.arguments.change"
] | 553,784
| 553,785
|
u550814027
|
python
|
p02762
|
N, M, K = map(int, input().split())
F = [[] for _ in range(N)]
B = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
F[a].append(b)
F[b].append(a)
print(F)
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
B[c].append(d)
B[d].append(c)
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根(最初は全て根)
self.par = [i for i in range(n)]
# 木の高さを格納する（初期状態では0）
self.rank = [0] * n
# 人間の数
self.size = [1] * n
# 検索
def find(self, x):
# 根ならその番号を返す
if self.par[x] == x:
return x
# 根でないなら、親の要素で再検索
else:
# 走査していく過程で親を書き換える(return xが代入される)
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self, x, y):
# 根を探す
x = self.find(x)
y = self.find(y)
if x == y:
return
# 木の高さを比較し、低いほうから高いほうに辺を張る
if self.rank[x] < self.rank[y]:
self.par[x] = y
self.size[y] += self.size[x]
else:
self.par[y] = x
self.size[x] += self.size[y]
# 木の高さが同じなら片方を1増やす
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 同じ集合に属するか判定
def same(self, x, y):
return self.find(x) == self.find(y)
# すべての頂点に対して親を検索する
def all_find(self):
for n in range(len(self.par)):
self.find(n)
UF = UnionFind(N)
for iam in range(N):
for friend in F[iam]:
UF.union(iam, friend) # 自分と自分の友達を併合
ans = [UF.size[UF.find(iam)] - 1 for iam in range(N)] # 同じ集合に属する人の数
for iam in range(N):
ans[iam] -= len(F[iam]) # すでに友達関係にある人達を引く
for iam in range(N):
for block in B[iam]:
if UF.same(iam, block): # ブロック関係にあったら引く
ans[iam] -= 1
print(*ans, sep=' ')
|
N, M, K = map(int, input().split())
F = [[] for _ in range(N)]
B = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
F[a].append(b)
F[b].append(a)
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
B[c].append(d)
B[d].append(c)
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根(最初は全て根)
self.par = [i for i in range(n)]
# 木の高さを格納する（初期状態では0）
self.rank = [0] * n
# 人間の数
self.size = [1] * n
# 検索
def find(self, x):
# 根ならその番号を返す
if self.par[x] == x:
return x
# 根でないなら、親の要素で再検索
else:
# 走査していく過程で親を書き換える(return xが代入される)
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self, x, y):
# 根を探す
x = self.find(x)
y = self.find(y)
if x == y:
return
# 木の高さを比較し、低いほうから高いほうに辺を張る
if self.rank[x] < self.rank[y]:
self.par[x] = y
self.size[y] += self.size[x]
else:
self.par[y] = x
self.size[x] += self.size[y]
# 木の高さが同じなら片方を1増やす
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 同じ集合に属するか判定
def same(self, x, y):
return self.find(x) == self.find(y)
# すべての頂点に対して親を検索する
def all_find(self):
for n in range(len(self.par)):
self.find(n)
UF = UnionFind(N)
for iam in range(N):
for friend in F[iam]:
UF.union(iam, friend) # 自分と自分の友達を併合
ans = [UF.size[UF.find(iam)] - 1 for iam in range(N)] # 同じ集合に属する人の数
for iam in range(N):
ans[iam] -= len(F[iam]) # すでに友達関係にある人達を引く
for iam in range(N):
for block in B[iam]:
if UF.same(iam, block): # ブロック関係にあったら引く
ans[iam] -= 1
print(*ans, sep=' ')
|
[
"call.remove"
] | 553,786
| 553,787
|
u934529721
|
python
|
p02762
|
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class UnionFind:
def __init__(self, n_nodes):
self.n_nodes = n_nodes
# self.parents[x] < 0 の時，xが根である．
# また，xが根の時，(-1) * (同一グループの要素数) が格納されるようになる.
self.parents = [-1] * n_nodes
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
# 常にxの方が要素数が多くなるように，スワップする
if self.parents[x] > self.parents[y]:
x, y = y, x
# 要素数の少ない方のグループを，要素数が多い方の木に貼る．
self.parents[x] += self.parents[y]
self.parents[y] = x
def get_size(self, x):
return -self.parents[self.find(x)]
def is_same(self, x, y):
return self.find(x) == self.find(y)
def get_members(self, x):
parent = self.find(x)
return [i for i in range(self.n_nodes) if self.find(i) == parent]
def get_parent_list(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def get_n_groups(self):
return len(self.get_parent_list())
def get_members_dict(self):
return {par: self.get_members(par) for par in self.get_parent_list()}
def main():
N, M, K = map(int, input().split())
tree = UnionFind(N)
friends = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
tree.unite(a, b)
friends[a].append(b)
friends[b].append(a)
ng = [[] for _ in range(N)]
for _ in range(K):
c, d = map(int, input().split())
c -= 1
d -= 1
ng[c].append(d)
ng[d].append(a)
ans = []
for i in range(N):
n_ng = 0
for j in ng[i]:
if tree.is_same(i, j):
n_ng += 1
n_member = tree.get_size(i)
n_friends = len(friends[i])
# 自分を引くのを忘れない
ans.append(n_member - n_friends - n_ng - 1)
print(*ans, sep=" ")
if __name__ == "__main__":
main()
|
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class UnionFind:
def __init__(self, n_nodes):
self.n_nodes = n_nodes
# self.parents[x] < 0 の時，xが根である．
# また，xが根の時，(-1) * (同一グループの要素数) が格納されるようになる.
self.parents = [-1] * n_nodes
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
# 常にxの方が要素数が多くなるように，スワップする
if self.parents[x] > self.parents[y]:
x, y = y, x
# 要素数の少ない方のグループを，要素数が多い方の木に貼る．
self.parents[x] += self.parents[y]
self.parents[y] = x
def get_size(self, x):
return -self.parents[self.find(x)]
def is_same(self, x, y):
return self.find(x) == self.find(y)
def get_members(self, x):
parent = self.find(x)
return [i for i in range(self.n_nodes) if self.find(i) == parent]
def get_parent_list(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def get_n_groups(self):
return len(self.get_parent_list())
def get_members_dict(self):
return {par: self.get_members(par) for par in self.get_parent_list()}
def main():
N, M, K = map(int, input().split())
tree = UnionFind(N)
friends = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
tree.unite(a, b)
friends[a].append(b)
friends[b].append(a)
ng = [[] for _ in range(N)]
for _ in range(K):
c, d = map(int, input().split())
c -= 1
d -= 1
ng[c].append(d)
ng[d].append(c)
ans = []
for i in range(N):
n_ng = 0
for j in ng[i]:
if tree.is_same(i, j):
n_ng += 1
n_member = tree.get_size(i)
n_friends = len(friends[i])
# 自分を引くのを忘れない
ans.append(n_member - n_friends - n_ng - 1)
print(*ans, sep=" ")
if __name__ == "__main__":
main()
|
[
"identifier.change",
"call.arguments.change"
] | 553,813
| 553,814
|
u346812984
|
python
|
p02762
|
import sys
sys.setrecursionlimit(10**5)
n,m,k=map(int,input().split())
fr=[0 for _ in range(n)]
frl=[[] for i in range(n)]
frlist=[]
for i in range(m):
a,b=map(int,input().split())
frl[a-1].append(b)
frl[b-1].append(a)
frlist.append([a,b])
treelist=[]
hitobito=set()
def saiki(c,tmpi):
global hitobito
global tmpset
global trbl
if frl[c-1] == []:
hitobito.add(c)
tmpset.add(c)
trbl[c-1]=tmpi
for tsugi in frl[c-1]:
if not tsugi in hitobito:
hitobito.add(tsugi)
tmpset.add(tsugi)
trbl[tsugi-1]=tmpi
saiki(tsugi,tmpi)
index=0
trbl=[None for _ in range(n)]
for i in range(n):
tmpset=set()
saiki(i+1,index)
if not tmpset == set():
treelist.append(tmpset)
index+=1
bl=[0 for _ in range(n)]
bll=[[] for i in range(n)]
bllist=[]
for i in range(k):
a,b=map(int,input().split())
bll[a-1].append(b)
bll[b-1].append(a)
bllist.append([a,b])
for fre in frlist:
if trbl[fre[0]-1] == trbl[fre[1]-1]:
fr[fre[0]-1]=fr[fre[0]-1]+1
fr[fre[1]-1]=fr[fre[1]-1]+1
for blo in bllist:
if trbl[blo[0]-1] == trbl[blo[1]-1]:
bl[blo[0]-1]=bl[blo[0]-1]+1
bl[blo[1]-1]=bl[blo[1]-1]+1
output=[]
print(trbl)
for i in range(n):
tmpsum=fr[i]+bl[i]
output.extend([str(len(treelist[trbl[i]])-tmpsum-1)," "])
print("".join(output))
|
import sys
sys.setrecursionlimit(10**5)
n,m,k=map(int,input().split())
fr=[0 for _ in range(n)]
frl=[[] for i in range(n)]
frlist=[]
for i in range(m):
a,b=map(int,input().split())
frl[a-1].append(b)
frl[b-1].append(a)
frlist.append([a,b])
treelist=[]
hitobito=set()
def saiki(c,tmpi):
global hitobito
global tmpset
global trbl
if frl[c-1] == []:
hitobito.add(c)
tmpset.add(c)
trbl[c-1]=tmpi
for tsugi in frl[c-1]:
if not tsugi in hitobito:
hitobito.add(tsugi)
tmpset.add(tsugi)
trbl[tsugi-1]=tmpi
saiki(tsugi,tmpi)
index=0
trbl=[None for _ in range(n)]
for i in range(n):
tmpset=set()
saiki(i+1,index)
if not tmpset == set():
treelist.append(tmpset)
index+=1
bl=[0 for _ in range(n)]
bll=[[] for i in range(n)]
bllist=[]
for i in range(k):
a,b=map(int,input().split())
bll[a-1].append(b)
bll[b-1].append(a)
bllist.append([a,b])
for fre in frlist:
if trbl[fre[0]-1] == trbl[fre[1]-1]:
fr[fre[0]-1]=fr[fre[0]-1]+1
fr[fre[1]-1]=fr[fre[1]-1]+1
for blo in bllist:
if trbl[blo[0]-1] == trbl[blo[1]-1]:
bl[blo[0]-1]=bl[blo[0]-1]+1
bl[blo[1]-1]=bl[blo[1]-1]+1
output=[]
for i in range(n):
tmpsum=fr[i]+bl[i]
output.extend([str(len(treelist[trbl[i]])-tmpsum-1)," "])
print("".join(output))
|
[
"call.remove"
] | 553,825
| 553,826
|
u485979475
|
python
|
p02762
|
import sys
input = sys.stdin.readline
from collections import deque
import copy
N, M, K = map(int, input().split())
friend = [deque() for _ in range(N)]
status = [-1]*N
numList = [0]*N
ans = [0]*N
for _ in range(M):
a, b = map(int, input().split())
friend[a-1].append(b-1)
friend[b-1].append(a-1)
ans[a-1] -= 1
ans[b-1] -= 1
def DFS(graph, v, num):
cnt = 0
stack = [v]
status[v] = num
while stack:
v = stack[-1]
if graph[v]:
w = graph[v].popleft()
if status[w] == -1:
status[w] = num
cnt += 1
stack.append(w)
else:
stack.pop()
numList[num] = cnt
cnt = 0
for i in range(N):
if status[i] == -1:
DFS(friend, i, cnt)
cnt += 1
for i in range(N):
ans[i] = numList[status[i]]
for i in range(K):
a, b = map(int, input().split())
if status[a-1] == status[b-1]:
ans[a-1] -= 1
ans[b-1] -= 1
print(" ".join(map(str, ans)))
|
import sys
input = sys.stdin.readline
from collections import deque
import copy
N, M, K = map(int, input().split())
friend = [deque() for _ in range(N)]
status = [-1]*N
numList = [0]*N
ans = [0]*N
for _ in range(M):
a, b = map(int, input().split())
friend[a-1].append(b-1)
friend[b-1].append(a-1)
ans[a-1] -= 1
ans[b-1] -= 1
def DFS(graph, v, num):
cnt = 0
stack = [v]
status[v] = num
while stack:
v = stack[-1]
if graph[v]:
w = graph[v].popleft()
if status[w] == -1:
status[w] = num
cnt += 1
stack.append(w)
else:
stack.pop()
numList[num] = cnt
cnt = 0
for i in range(N):
if status[i] == -1:
DFS(friend, i, cnt)
cnt += 1
for i in range(N):
ans[i] += numList[status[i]]
for i in range(K):
a, b = map(int, input().split())
if status[a-1] == status[b-1]:
ans[a-1] -= 1
ans[b-1] -= 1
print(" ".join(map(str, ans)))
|
[
"assignment.value.change"
] | 553,833
| 553,834
|
u135346354
|
python
|
p02762
|
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n, m, k = map(int, input().split())
uf = UnionFind(n)
E = [[] for i in range(n)]
num_E = [0]*n
E_d = [[] for i in range(n)]
import sys
input = sys.stdin.readline
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
uf.union(a, b)
E[a] += 1
E[b] += 1
for i in range(k):
a, b = map(int, input().split())
a -= 1
b -= 1
E_d[a] = E_d[a] + [b]
E_d[b] = E_d[b] + [a]
num_men = [0]*n
for i in range(n):
num_men[i] = uf.size(i) - 1
for dn in E_d[i]:
if uf.same(i, dn):
num_men[i] -= 1
num_men[i] -= E[i]
print(*num_men)
|
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n, m, k = map(int, input().split())
uf = UnionFind(n)
E = [[] for i in range(n)]
num_E = [0]*n
E_d = [[] for i in range(n)]
import sys
input = sys.stdin.readline
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
uf.union(a, b)
num_E[a] += 1
num_E[b] += 1
for i in range(k):
a, b = map(int, input().split())
a -= 1
b -= 1
E_d[a] = E_d[a] + [b]
E_d[b] = E_d[b] + [a]
num_men = [0]*n
for i in range(n):
num_men[i] = uf.size(i) - 1
for dn in E_d[i]:
if uf.same(i, dn):
num_men[i] -= 1
num_men[i] -= num_E[i]
print(*num_men)
|
[
"identifier.change"
] | 553,870
| 553,871
|
u731448038
|
python
|
p02762
|
from collections import deque,Counter
n,m,k = map(int,input().split())
G = [[] for _ in range(n)]
exc = [0]*n
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
exc[a] += 1
exc[b] += 1
stk = deque()
grp = [-1]*n
grpnum = 0
def dfs(s,g):
stk.append(s)
while stk:
cur = stk.pop()
for nxt in G[cur]:
if grp[nxt] != -1: continue
grp[nxt] = g
stk.append(nxt)
for i in range(n):
if grp[i] != -1: continue
dfs(i,grpnum)
grpnum += 1
cnt = Counter(grp)
for _ in range(k):
c,d = map(int,input().split())
c -= 1
d -= 1
if grp[c] == grp[d]:
exc[c] += 1
exc[d] += 1
ans = [cnt[grp[i]] - exc[i] - 1 for i in range(n)]
print(*ans)
|
from collections import deque,Counter
n,m,k = map(int,input().split())
G = [[] for _ in range(n)]
exc = [0]*n
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
exc[a] += 1
exc[b] += 1
stk = deque()
grp = [-1]*n
grpnum = 0
def dfs(s,g):
stk.append(s)
grp[s] = g
while stk:
cur = stk.pop()
for nxt in G[cur]:
if grp[nxt] != -1: continue
grp[nxt] = g
stk.append(nxt)
for i in range(n):
if grp[i] != -1: continue
dfs(i,grpnum)
grpnum += 1
cnt = Counter(grp)
for _ in range(k):
c,d = map(int,input().split())
c -= 1
d -= 1
if grp[c] == grp[d]:
exc[c] += 1
exc[d] += 1
ans = [cnt[grp[i]] - exc[i] - 1 for i in range(n)]
print(*ans)
|
[
"assignment.add"
] | 553,880
| 553,881
|
u677121387
|
python
|
p02762
|
from collections import deque, defaultdict
import sys
input = sys.stdin.buffer.readline
n, m, k = map(int, input().split())
#先ずは連結成分の数を調べる
G = defaultdict(lambda:deque([]))
for _ in range(m):
a, b = map(int, input().split())
a, b = a-1, b-1
G[a].append(b)
G[b].append(a)
NIL = -1
color = [NIL]*n
def dfs(r, c):
S = deque([])
S.append(r)
color[r] = c
while S:
u = S.popleft()
for v in G[u]:
if color[v] == NIL:
color[v] = c
S.append(v)
def make_color():
id = 1
for u in range(n):
if color[u] == NIL:
dfs(u, id)
id += 1
#グラフの塗り分け完了
#各色ごとの連結成分の数を数える
count = defaultdict(lambda:0)
for i in range(n):
count[i] = 0
for i in range(n):
count[color[i]] += 1
#ブロック関係の辞書を作成
block = defaultdict(lambda:deque([]))
for _ in range(k):
c, d = map(int, input().split())
c, d = c-1, d-1
block[c].append(d)
block[d].append(c)
temp = []
for i in range(n):
x = count[color[i]] - 1#自分以外の連結成分の和
y = len(G[i])#友達の数
z = 0 #連結内のブロック数
for v in block[i]:
if color[i] == color[v]:
z += 1
temp.append(x-y-z)
print(*temp)
|
from collections import deque, defaultdict
import sys
input = sys.stdin.buffer.readline
n, m, k = map(int, input().split())
#先ずは連結成分の数を調べる
G = defaultdict(lambda:deque([]))
for _ in range(m):
a, b = map(int, input().split())
a, b = a-1, b-1
G[a].append(b)
G[b].append(a)
NIL = -1
color = [NIL]*n
def dfs(r, c):
S = deque([])
S.append(r)
color[r] = c
while S:
u = S.popleft()
for v in G[u]:
if color[v] == NIL:
color[v] = c
S.append(v)
def make_color():
id = 1
for u in range(n):
if color[u] == NIL:
dfs(u, id)
id += 1
make_color()
#グラフの塗り分け完了
#各色ごとの連結成分の数を数える
count = defaultdict(lambda:0)
for i in range(n):
count[i] = 0
for i in range(n):
count[color[i]] += 1
#ブロック関係の辞書を作成
block = defaultdict(lambda:deque([]))
for _ in range(k):
c, d = map(int, input().split())
c, d = c-1, d-1
block[c].append(d)
block[d].append(c)
temp = []
for i in range(n):
x = count[color[i]] - 1#自分以外の連結成分の和
y = len(G[i])#友達の数
z = 0 #連結内のブロック数
for v in block[i]:
if color[i] == color[v]:
z += 1
temp.append(x-y-z)
print(*temp)
|
[
"call.add"
] | 553,882
| 553,883
|
u594803920
|
python
|
p02762
|
N, M, K = map(int, input().split())
ans = [0] * (N + 1)
child = {i:[] for i in range(1, N+1)}
isChecked = [0] * (N + 1)
isBlocked = [set() for _ in range(N+1)]
for _ in range(M):
a, b = map(int, input().split())
child[a].append(b)
child[b].append(a)
for _ in range(K):
c, d = map(int, input().split())
isBlocked[c].add(d)
isBlocked[d].add(c)
for i in range(1, N+1):
if isChecked[i]:
continue
isChecked[i] = 1
x = set([i])
ch = child[i].copy()
while ch:
c = ch.pop()
if isChecked[c]:
continue
isChecked[c] = 1
x.add(c)
ch.extend(child[c])
print(x)
for j in x:
ans[j] = len(x) - 1 - len(child[j]) - len(x & isBlocked[j])
print(*ans[1:])
|
N, M, K = map(int, input().split())
ans = [0] * (N + 1)
child = {i:[] for i in range(1, N+1)}
isChecked = [0] * (N + 1)
isBlocked = [set() for _ in range(N+1)]
for _ in range(M):
a, b = map(int, input().split())
child[a].append(b)
child[b].append(a)
for _ in range(K):
c, d = map(int, input().split())
isBlocked[c].add(d)
isBlocked[d].add(c)
for i in range(1, N+1):
if isChecked[i]:
continue
isChecked[i] = 1
x = set([i])
ch = child[i].copy()
while ch:
c = ch.pop()
if isChecked[c]:
continue
isChecked[c] = 1
x.add(c)
ch.extend(child[c])
for j in x:
ans[j] = len(x) - 1 - len(child[j]) - len(x & isBlocked[j])
print(*ans[1:])
|
[
"call.remove"
] | 553,894
| 553,895
|
u268318377
|
python
|
p02762
|
n, m, k = map(int, input().split())
graph = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
block = [[] for _ in range(n + 1)]
for _ in range(k):
c, d = map(int, input().split())
block[c].append(d)
block[d].append(c)
def dfs(graph, start):
visited = set([start])
stack = []
can_reach = set([start])
for f in graph[start]:
stack.append(f)
can_reach.add(f)
while stack:
friend = stack.pop()
visited.add(friend)
candidates = graph[friend]
for c in candidates:
if c not in visited:
can_reach.add(c)
stack.append(c)
return can_reach
labels = [None] * (n + 1)
for i in range(1, n + 1):
if labels[i] is None:
c = dfs(graph, i)
for j in c:
labels[j] = [i, len(c)]
ans = []
for i in range(1, n + 1):
num = labels[i][1] - 1
for j in graph[i]:
if labels[i][0] == labels[j][0]:
num -= 1
for k in block[i]:
if labels[i][0] == labels[k][0]:
num -= 1
ans.append(num)
print(labels)
|
n, m, k = map(int, input().split())
graph = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
block = [[] for _ in range(n + 1)]
for _ in range(k):
c, d = map(int, input().split())
block[c].append(d)
block[d].append(c)
def dfs(graph, start):
visited = set([start])
stack = []
can_reach = set([start])
for f in graph[start]:
stack.append(f)
can_reach.add(f)
while stack:
friend = stack.pop()
visited.add(friend)
candidates = graph[friend]
for c in candidates:
if c not in visited:
can_reach.add(c)
stack.append(c)
return can_reach
labels = [None] * (n + 1)
for i in range(1, n + 1):
if labels[i] is None:
c = dfs(graph, i)
for j in c:
labels[j] = [i, len(c)]
ans = []
for i in range(1, n + 1):
num = labels[i][1] - 1
for j in graph[i]:
if labels[i][0] == labels[j][0]:
num -= 1
for k in block[i]:
if labels[i][0] == labels[k][0]:
num -= 1
ans.append(num)
print(*ans)
|
[
"call.arguments.change",
"io.output.change"
] | 553,908
| 553,909
|
u940139461
|
python
|
p02761
|
n, m = map(int, input().split())
c = [0]* m
s = [0]* m
for i in range(m):
s[i], c[i] = map(int, input().split())
flg = True
if n == 1:
i_str = str(0)
for j in range(m):
if i_str[s[j]-1] != str(c[j]):
flg = False
continue
if flg==True:
print(i)
exit()
flg = True
for i in range(10**(n-1),10**n):
i_str = str(i)
for j in range(m):
if i_str[s[j]-1] != str(c[j]):
flg = False
continue
if flg==True:
print(i)
exit()
flg = True
print(-1)
|
n, m = map(int, input().split())
c = [0]* m
s = [0]* m
for i in range(m):
s[i], c[i] = map(int, input().split())
flg = True
if n == 1:
i = 0
i_str = str(i)
for j in range(m):
if i_str[s[j]-1] != str(c[j]):
flg = False
continue
if flg==True:
print(i)
exit()
flg = True
for i in range(10**(n-1),10**n):
i_str = str(i)
for j in range(m):
if i_str[s[j]-1] != str(c[j]):
flg = False
continue
if flg==True:
print(i)
exit()
flg = True
print(-1)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 553,927
| 553,928
|
u952467214
|
python
|
p02761
|
import sys
n, m = [int(i) for i in sys.stdin.readline().split()]
ls = []
ans = ["x"] * (n)
for i in range(m):
s, c = [int(i) for i in sys.stdin.readline().split()]
s -= 1
if ans[s] != "x" and ans[s] != str(c):
ans = -1
break
else:
ans[s] = str(c)
if ans == -1 or (ans[0] == "0" and n > 1):
print(-1)
else:
if ans[0] == "x":
if n == 0:
ans[0] = "0"
else:
ans[0] = "1"
ans = "".join(ans)
ans = ans.replace("x", "0")
print(ans)
|
import sys
n, m = [int(i) for i in sys.stdin.readline().split()]
ls = []
ans = ["x"] * (n)
for i in range(m):
s, c = [int(i) for i in sys.stdin.readline().split()]
s -= 1
if ans[s] != "x" and ans[s] != str(c):
ans = -1
break
else:
ans[s] = str(c)
if ans == -1 or (ans[0] == "0" and n > 1):
print(-1)
else:
if ans[0] == "x":
if n == 1:
ans[0] = "0"
else:
ans[0] = "1"
ans = "".join(ans)
ans = ans.replace("x", "0")
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,943
| 553,944
|
u190406011
|
python
|
p02761
|
n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 1 and ans[0] == 0:
isPossible = False
ans_str = ""
if isPossible:
for i in range(len(ans)):
num = ans[i]
if num == "empty":
if i == 0:
ans_str += "1"
else:
ans_str += "0"
else:
ans_str += str(num)
else:
ans_str = "-1"
print(ans_str)
|
n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 1 and ans[0] == 0:
isPossible = False
ans_str = ""
if isPossible:
for i in range(len(ans)):
num = ans[i]
if num == "empty":
if i == 0 and n != 1:
ans_str += "1"
else:
ans_str += "0"
else:
ans_str += str(num)
else:
ans_str = "-1"
print(ans_str)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,949
| 553,950
|
u023540496
|
python
|
p02761
|
n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 0 and ans[0] == 0:
isPossible = False
ans_str = ""
if isPossible:
for i in range(len(ans)):
num = ans[i]
if num == "empty":
if i == 0:
ans_str += "1"
else:
ans_str += "0"
else:
ans_str += str(num)
else:
ans_str = "-1"
print(ans_str)
|
n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 1 and ans[0] == 0:
isPossible = False
ans_str = ""
if isPossible:
for i in range(len(ans)):
num = ans[i]
if num == "empty":
if i == 0 and n != 1:
ans_str += "1"
else:
ans_str += "0"
else:
ans_str += str(num)
else:
ans_str = "-1"
print(ans_str)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,951
| 553,950
|
u023540496
|
python
|
p02761
|
import sys
n, m = map(int, input().split())
check = [list(map(int, input().split())) for i in range(m)]
for i in range(1, 1000):
x = str(i)
if len(x) != n:
continue
flg = True
for s, c in check:
if x[s-1] == str(c):
pass
else:
flg = False
if flg:
print(i)
sys.exit()
print(-1)
|
import sys
n, m = map(int, input().split())
check = [list(map(int, input().split())) for i in range(m)]
for i in range(1000):
x = str(i)
if len(x) != n:
continue
flg = True
for s, c in check:
if x[s-1] == str(c):
pass
else:
flg = False
if flg:
print(i)
sys.exit()
print(-1)
|
[
"call.arguments.change"
] | 553,952
| 553,953
|
u595289165
|
python
|
p02761
|
n, m = map(int, input().split())
d = [-1 for i in range(n)]
flag = True
for i in range(m):
s, c = map(int, input().split())
if d[s - 1] > -1 and d[s - 1] != c:
flag = False
elif s == 1 and n > 1 and c == 0:
flag = False
else:
d[s - 1] = c
if flag:
ans = ""
for i in range(n):
if d[i] == -1:
d[i] = (1 if i == 0 else 0)
ans += str(d[i])
print(ans)
else:
print(-1)
|
n, m = map(int, input().split())
d = [-1 for i in range(n)]
flag = True
for i in range(m):
s, c = map(int, input().split())
if d[s - 1] > -1 and d[s - 1] != c:
flag = False
elif s == 1 and n > 1 and c == 0:
flag = False
else:
d[s - 1] = c
if flag:
ans = ""
for i in range(n):
if d[i] == -1:
d[i] = (1 if i == 0 and n > 1 else 0)
ans += str(d[i])
print(ans)
else:
print(-1)
|
[] | 553,976
| 553,977
|
u671455949
|
python
|
p02761
|
n, m = map(int, input().split())
nList = ['*'] * n
flag = True
for i in range(m):
s, c = map(int, input().split())
if nList[s-1] == '*':
nList[s-1] = str(c)
elif nList[s-1] != str(c):
flag = False
break
if nList[0] == '0' and n > 2:
flag = False
if flag:
for i, num in enumerate(nList):
if num == '*':
if i == 0 and n > 2:
nList[i] = '1'
else:
nList[i] = '0'
print(''.join(nList))
else:
print('-1')
|
n, m = map(int, input().split())
nList = ['*'] * n
flag = True
for i in range(m):
s, c = map(int, input().split())
if nList[s-1] == '*':
nList[s-1] = str(c)
elif nList[s-1] != str(c):
flag = False
break
if nList[0] == '0' and n > 1:
flag = False
if flag:
for i, num in enumerate(nList):
if num == '*':
if i == 0 and n > 1:
nList[i] = '1'
else:
nList[i] = '0'
print(''.join(nList))
else:
print('-1')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,978
| 553,979
|
u384094369
|
python
|
p02761
|
N, M = map(int, input().split())
res = ["*"]*N
flag = True
for i in range(M):
s, c = input().split()
if s == "1" and c == "0":
if N != 1:
flag = False
if res[int(s)-1] != "*" and res[int(s)-1] != c:
flag = False
res[int(s)-1] = c
if flag:
if res[0] == "*":
res[0] = "1"
print("".join(x if x != "*" else "0" for x in res))
else:
print(-1)
|
N, M = map(int, input().split())
res = ["*"]*N
flag = True
for i in range(M):
s, c = input().split()
if s == "1" and c == "0":
if N != 1:
flag = False
if res[int(s)-1] != "*" and res[int(s)-1] != c:
flag = False
res[int(s)-1] = c
if flag:
if res[0] == "*":
if N != 1:
res[0] = "1"
print("".join(x if x != "*" else "0" for x in res))
else:
print(-1)
|
[
"control_flow.branch.if.add"
] | 553,994
| 553,995
|
u642012866
|
python
|
p02761
|
n,m=map(int,input().split())
ans = [None]*n
for _ in range(m):
s,c = map(int,input().split())
if n > 1 and s==1 and c==0:
ans = [-1]
break
if ans[s-1] is None or ans[s-1] == c:
ans[s-1] = c
else:
ans = [-1]
break
else:
for i in range(n):
if ans[i] is None:
ans[i] = 0 if i>0 else 1
print("".join(map(str,ans)))
|
n,m=map(int,input().split())
ans = [None]*n
for _ in range(m):
s,c = map(int,input().split())
if n > 1 and s==1 and c==0:
ans = [-1]
break
if ans[s-1] is None or ans[s-1] == c:
ans[s-1] = c
else:
ans = [-1]
break
else:
for i in range(n):
if ans[i] is None:
ans[i] = 0 if i>0 or n==1 else 1
print("".join(map(str,ans)))
|
[] | 554,004
| 554,005
|
u867320886
|
python
|
p02761
|
N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * N
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i]:
flag = False
for i in range(N):
if ans[i] < 0:
ans[i] = 0
if ans[-N] == 0:
ans[-N] = 1
if flag:
print(''.join(map(str, ans)))
else:
print(-1)
|
N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * N
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i]:
flag = False
for i in range(N):
if ans[i] < 0:
ans[i] = 0
if ans[-N] == 0 and N > 1:
ans[-N] = 1
if flag:
print(''.join(map(str, ans)))
else:
print(-1)
|
[
"control_flow.branch.if.condition.change"
] | 554,014
| 554,015
|
u795688372
|
python
|
p02761
|
N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * 3
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i]:
flag = False
for i in range(N):
if ans[i] < 0:
ans[i] = 0
if ans[-N] == 0:
ans[-N] = 1
if flag:
print(''.join(map(str, ans)))
else:
print(-1)
|
N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * N
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i]:
flag = False
for i in range(N):
if ans[i] < 0:
ans[i] = 0
if ans[-N] == 0 and N > 1:
ans[-N] = 1
if flag:
print(''.join(map(str, ans)))
else:
print(-1)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 554,016
| 554,015
|
u795688372
|
python
|
p02761
|
n, m = map(int, input().split())
l = [-1] * n
for _ in range(m):
s, c = map(int, input().split())
s -= 1
if l[s] == -1:
l[s] = c
elif l[s] != c:
print(-1)
exit()
if n > 1 and l[0] == 0:
print(-1)
exit()
if l[0] == -1:
if n == 0:
l[0] = 0
else:
l[0] = 1
for i in range(n):
if l[i] == -1:
l[i] = 0
print(*l, sep='')
|
n, m = map(int, input().split())
l = [-1] * n
for _ in range(m):
s, c = map(int, input().split())
s -= 1
if l[s] == -1:
l[s] = c
elif l[s] != c:
print(-1)
exit()
if n > 1 and l[0] == 0:
print(-1)
exit()
if l[0] == -1:
if n == 1:
l[0] = 0
else:
l[0] = 1
for i in range(n):
if l[i] == -1:
l[i] = 0
print(*l, sep='')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 554,023
| 554,024
|
u029576659
|
python
|
p02761
|
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
n,m=LI()
ans=[-1]*n
f=False
for i in range(m):
a,b=LI()
a-=1
if ans[a]!=-1:
if ans[a]!=b:
f=True
else:
ans[a]=b
if f:
return -1
_ans=''
for i,x in enumerate(ans):
if x==-1:
if i==0:
_ans+='1'
else:
_ans+='0'
else:
_ans+=str(x)
__ans=int(_ans)
if len(str(__ans))<n:
return -1
return _ans
# main()
print(main())
|
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
n,m=LI()
ans=[-1]*n
f=False
for i in range(m):
a,b=LI()
a-=1
if ans[a]!=-1:
if ans[a]!=b:
f=True
else:
ans[a]=b
if f:
return -1
_ans=''
for i,x in enumerate(ans):
if x==-1:
if i==0 and n!=1:
_ans+='1'
else:
_ans+='0'
else:
_ans+=str(x)
__ans=int(_ans)
if len(str(__ans))<n:
return -1
return _ans
# main()
print(main())
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,029
| 554,030
|
u941753895
|
python
|
p02761
|
n,m = map(int,input().split())
raw = []
for _ in range(m):
s,c = map(int,input().split())
s -= 1
raw.append([s,c])
for d in range(1000):
e = str(d)
e = '0' * (n-len(e)) + e
#print(e)
for x in raw:
s,c = x
if e[s] != str(c):
break
else:
if e[0] == '0':
continue
else:
print(e)
break
continue
else:
print(-1)
|
n,m = map(int,input().split())
raw = []
for _ in range(m):
s,c = map(int,input().split())
s -= 1
raw.append([s,c])
for d in range(1000):
e = str(d)
e = '0' * (n-len(e)) + e
#print(e)
for x in raw:
s,c = x
if e[s] != str(c):
break
else:
if e[0] == '0' and n != 1:
continue
else:
print(e)
break
continue
else:
print(-1)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,031
| 554,032
|
u111365362
|
python
|
p02761
|
n, m = [int(i) for i in input().split()]
sc = [[int(i) for i in input().split()] for _ in range(m)]
for i in range(10 ** (n - 1), 10 ** n):
s = str(i)
for j in sc:
if s[j[0]-1] != str(j[1]):
break
else:
print(i)
break
else:
print(-1)
|
n, m = [int(i) for i in input().split()]
sc = [[int(i) for i in input().split()] for _ in range(m)]
for i in range(10 ** (n - 1) if n>1 else 0, 10 ** n):
s = str(i)
for j in sc:
if s[j[0]-1] != str(j[1]):
break
else:
print(i)
break
else:
print(-1)
|
[
"control_flow.loop.range.bounds.lower.change"
] | 554,039
| 554,040
|
u571969099
|
python
|
p02761
|
n,m = map(int,input().split())
ans = [-1 for i in range(n)]
for i in range(m):
s,c = map(int,input().split())
if s == 1 and c == 0 and n != 1:
print(-1)
exit()
if ans[s-1] != -1 and ans[s-1] != str(c):
print(-1)
exit()
ans[s-1] = str(c)
for i in range(n):
if ans[i] == -1:
if i == 0:
ans[0] = "1"
else:
ans[i] = "0"
print(int("".join(ans)))
|
n,m = map(int,input().split())
ans = [-1 for i in range(n)]
for i in range(m):
s,c = map(int,input().split())
if s == 1 and c == 0 and n != 1:
print(-1)
exit()
if ans[s-1] != -1 and ans[s-1] != str(c):
print(-1)
exit()
ans[s-1] = str(c)
for i in range(n):
if ans[i] == -1:
if i == 0 and n != 1:
ans[0] = "1"
else:
ans[i] = "0"
print(int("".join(ans)))
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,053
| 554,054
|
u667024514
|
python
|
p02762
|
import sys
sys.setrecursionlimit(10*9)
n,m,k = map(int,input().split())
parent_of = [-1 for _ in range(n)]
#print(parent_of)
def root_of(x):
if parent_of[x] < 0:
return x
else:
parent_of[x] = root_of(parent_of[x])
return parent_of[x]
def unite(x,y):
top_root_x = root_of(x)
top_root_y = root_of(y)
if top_root_x == top_root_y:
return False
if parent_of[top_root_x] > parent_of[top_root_y]:
top_root_x,top_root_y = top_root_y,top_root_x
#print(parent_of[top_root_y])
parent_of[top_root_x] += parent_of[top_root_y]
parent_of[top_root_y] = top_root_x
return True
def size_of(x):
return -parent_of[root_of(x)]
def is_same(x,y):
return root_of(x) == root_of(y)
friend_list = [-1] * n
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
friend_list[a] -=1
friend_list[b] -=1
unite(a,b)
for _ in range(k):
c,d = map(int,input().split())
c -= 1
d -= 1
if root_of(c) == root_of(d):
block_list[c] -= 1
block_list[d] -= 1
for i in range(n):
friend_list[i] += size_of(i)
#print(size_of(i))
print(*friend_list)
|
import sys
sys.setrecursionlimit(10*9)
n,m,k = map(int,input().split())
parent_of = [-1 for _ in range(n)]
#print(parent_of)
def root_of(x):
if parent_of[x] < 0:
return x
else:
parent_of[x] = root_of(parent_of[x])
return parent_of[x]
def unite(x,y):
top_root_x = root_of(x)
top_root_y = root_of(y)
if top_root_x == top_root_y:
return False
if parent_of[top_root_x] > parent_of[top_root_y]:
top_root_x,top_root_y = top_root_y,top_root_x
#print(parent_of[top_root_y])
parent_of[top_root_x] += parent_of[top_root_y]
parent_of[top_root_y] = top_root_x
return True
def size_of(x):
return -parent_of[root_of(x)]
def is_same(x,y):
return root_of(x) == root_of(y)
friend_list = [-1] * n
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
friend_list[a] -=1
friend_list[b] -=1
unite(a,b)
for _ in range(k):
c,d = map(int,input().split())
c -= 1
d -= 1
if root_of(c) == root_of(d):
friend_list[c] -= 1
friend_list[d] -= 1
for i in range(n):
friend_list[i] += size_of(i)
#print(size_of(i))
print(*friend_list)
|
[
"identifier.change"
] | 554,065
| 554,066
|
u788703383
|
python
|
p02762
|
n, m, k = map(int, input().split())
clusterN = [1] * n
clusterI = list(range(n))
out = [0] * n
def generateC(x):
if clusterI[x] != x:
minI = generateC(clusterI[x])
clusterI[x] = minI
return minI
else:
return x
def unite(x, y):
CX = generateC(x)
CY = generateC(y)
if CX != CY:
if CX > CY:
CX, CY = CY, CX
x, y = y, x
clusterN[CX] += clusterN[CY]
clusterI[CY] = CX
generateC(y)
for _ in range(m):
a, b = map(int, input().split())
unite(a-1, b-1)
out[a-1] -= 1
out[b-1] -= 1
for _ in range(k):
a, b = map(int, input().split())
if generateC(a-1) == generateC(b-1):
out[a1] -= 1
out[b-1] -= 1
out = [out[i] + clusterN[generateC(i)] - 1 for i in range(n)]
print(*out)
|
n, m, k = map(int, input().split())
clusterN = [1] * n
clusterI = list(range(n))
out = [0] * n
def generateC(x):
if clusterI[x] != x:
minI = generateC(clusterI[x])
clusterI[x] = minI
return minI
else:
return x
def unite(x, y):
CX = generateC(x)
CY = generateC(y)
if CX != CY:
if CX > CY:
CX, CY = CY, CX
x, y = y, x
clusterN[CX] += clusterN[CY]
clusterI[CY] = CX
generateC(y)
for _ in range(m):
a, b = map(int, input().split())
unite(a-1, b-1)
out[a-1] -= 1
out[b-1] -= 1
for _ in range(k):
a, b = map(int, input().split())
if generateC(a-1) == generateC(b-1):
out[a-1] -= 1
out[b-1] -= 1
out = [out[i] + clusterN[generateC(i)] - 1 for i in range(n)]
print(*out)
|
[
"variable_access.subscript.index.change"
] | 554,067
| 554,068
|
u875541136
|
python
|
p02762
|
import sys
N,M,K=map(int,input().split())
s=[[]for i in range(N)]
tn=[0]*N
sys.setrecursionlimit(200000)
for i in range(M):
a,b=map(int,input().split())
s[a-1].append(b)
s[b-1].append(a)
tn[a-1]+=1
tn[b-1]+=1
l=[None]*N
def hu(n,t):
for i in s[n]:
if l[i-1]==None:
l[i-1]=t
hu(i-1,t)
t=0
for i in range(N):
if l[i]==None:
hu(i,t)
t+=1
c=[0]*t
for i in l:
c[i]+=1
for i in range(K):
a,b=map(int,input().split())
if l[a-1]==l[b-1]:
tn[a-1]+=1
tn[b-1]+=1
for i in range(N):
print(c[l[i]]-tn[i]-1,end=" ")
|
import sys
N,M,K=map(int,input().split())
s=[[]for i in range(N)]
tn=[0]*N
sys.setrecursionlimit(200000)
for i in range(M):
a,b=map(int,input().split())
s[a-1].append(b)
s[b-1].append(a)
tn[a-1]+=1
tn[b-1]+=1
l=[None]*N
def hu(n,t):
l[n]=t
for i in s[n]:
if l[i-1]==None:
l[i-1]=t
hu(i-1,t)
t=0
for i in range(N):
if l[i]==None:
hu(i,t)
t+=1
c=[0]*t
for i in l:
c[i]+=1
for i in range(K):
a,b=map(int,input().split())
if l[a-1]==l[b-1]:
tn[a-1]+=1
tn[b-1]+=1
for i in range(N):
print(c[l[i]]-tn[i]-1,end=" ")
|
[
"assignment.add"
] | 554,071
| 554,072
|
u187516587
|
python
|
p02762
|
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x):
if(self.parents[x] < 0):
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if(self.parents[x] > self.parents[y]):
x,y = y,x
self.parents[x] += self.parents[y]
self.parents[y] = x
def issame(self, x, y):
return self.find(x) == self.find(y)
def count(self,x):
return -self.parents[self.find(x)]
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def __str__(self):
return '\n'.join('{}: {}'.format(root, self.members(root)) for root in self.roots())
n,m,k = map(int, input().split(" "))
uf_friend = UnionFind(n+1)
uf_block = UnionFind(n+1)
count = [0]*(n+1)
for i in range(m):
a,b = map(int, input().split(" "))
uf_friend.union(a, b)
count[a] += 1
count[b] += 1
for i in range(k):
a,b = map(int, input().split(" "))
if(uf_friend.issame(a,b)):
count[a] += 1
count[b] += 1
result = [0]*n
for i in range(1,n+1):
result[i-1] = uf_friend.count(i) - count[i] - 1
print(result)
|
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x):
if(self.parents[x] < 0):
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if(self.parents[x] > self.parents[y]):
x,y = y,x
self.parents[x] += self.parents[y]
self.parents[y] = x
def issame(self, x, y):
return self.find(x) == self.find(y)
def count(self,x):
return -self.parents[self.find(x)]
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def __str__(self):
return '\n'.join('{}: {}'.format(root, self.members(root)) for root in self.roots())
n,m,k = map(int, input().split(" "))
uf_friend = UnionFind(n+1)
uf_block = UnionFind(n+1)
count = [0]*(n+1)
for i in range(m):
a,b = map(int, input().split(" "))
uf_friend.union(a, b)
count[a] += 1
count[b] += 1
for i in range(k):
a,b = map(int, input().split(" "))
if(uf_friend.issame(a,b)):
count[a] += 1
count[b] += 1
result = [0]*n
for i in range(1,n+1):
result[i-1] = uf_friend.count(i) - count[i] - 1
print(*result)
|
[
"call.arguments.change"
] | 554,112
| 554,113
|
u755989869
|
python
|
p02762
|
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
N, M, K = map(int, input().split())
uf = UnionFind(N)
friend =[[] for _ in range(N)]
block = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a-1, b-1
uf.union(a, b)
friend[a].append(b)
friend[b].append(a)
for i in range(k):
c, d = map(int, input().split())
c, d = c-1, d-1
if uf.same(c, d):
block[c].append(d)
block[d].append(c)
ans = [0] * N
for i in range(N):
ans[i] = uf.size(i) - len(friend[i]) - len(block[i]) - 1
print(*ans)
|
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
N, M, K = map(int, input().split())
uf = UnionFind(N)
friend =[[] for _ in range(N)]
block = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a-1, b-1
uf.union(a, b)
friend[a].append(b)
friend[b].append(a)
for _ in range(K):
c, d = map(int, input().split())
c, d = c-1, d-1
if uf.same(c, d):
block[c].append(d)
block[d].append(c)
ans = [0] * N
for i in range(N):
ans[i] = uf.size(i) - len(friend[i]) - len(block[i]) - 1
print(*ans)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,116
| 554,117
|
u327532412
|
python
|
p02762
|
import sys
sys.getrecursionlimit(10**6)
N,M,K = map(int,input().split())
par = [i for i in range(N+1)]
# 木の根を求める
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
# xとyが同じ集合に属するか否か
def bool_same(x,y):
return root(x) == root(y)
# xとyの属する集合を併合
def unite(x,y):
x = root(x)
y = root(y)
if x != y:
par[x] = y
AB = [list(map(int,input().split())) for i in range(M)]
CD = [list(map(int,input().split())) for i in range(K)]
for i in range(M):
a,b = AB[i]
unite(a,b)
member = [0 for i in range(N+1)]
for i in range(1,N+1):
member[root(i)] += 1
ans = [member[par[i]]-1 for i in range(N+1)]
for i in range(M):
a,b = AB[i]
if bool_same(a,b):
ans[a] -= 1
ans[b] -= 1
for i in range(K):
c,d = CD[i]
if bool_same(c,d):
ans[c] -= 1
ans[d] -= 1
print(*ans[1:])
|
import sys
sys.setrecursionlimit(10**6)
N,M,K = map(int,input().split())
par = [i for i in range(N+1)]
# 木の根を求める
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
# xとyが同じ集合に属するか否か
def bool_same(x,y):
return root(x) == root(y)
# xとyの属する集合を併合
def unite(x,y):
x = root(x)
y = root(y)
if x != y:
par[x] = y
AB = [list(map(int,input().split())) for i in range(M)]
CD = [list(map(int,input().split())) for i in range(K)]
for i in range(M):
a,b = AB[i]
unite(a,b)
member = [0 for i in range(N+1)]
for i in range(1,N+1):
member[root(i)] += 1
ans = [member[par[i]]-1 for i in range(N+1)]
for i in range(M):
a,b = AB[i]
if bool_same(a,b):
ans[a] -= 1
ans[b] -= 1
for i in range(K):
c,d = CD[i]
if bool_same(c,d):
ans[c] -= 1
ans[d] -= 1
print(*ans[1:])
|
[
"identifier.change"
] | 554,186
| 554,187
|
u747602774
|
python
|
p02762
|
# https://atcoder.jp/contests/abc157/submissions/10475457
import sys
readline = sys.stdin.readine
N, M, K = map(int, readline().split())
F = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = map(int, readline().split())
F[a].append(b)
F[b].append(a)
B = [[] for _ in range(N + 1)]
for _ in range(K):
c, d = map(int, readline().split())
B[c].append(d)
B[d].append(c)
seen = [-1] * (N + 1)
group = 0
def dfs(graph, s):
stack = [s]
seen[s] = group
n_connection = 1
while stack:
u = stack.pop()
for v in graph[u]:
if seen[v] == -1:
n_connection += 1
seen[v] = group
stack.append(v)
return n_connection
union = {}
for i in range(1, N + 1):
if seen[i] == -1:
n = dfs(F, i)
union[group] = n
group += 1
ans = []
for i in range(1, N + 1):
tmp = 0
tmp += union[seen[i]] - 1
tmp -= len(F[i])
for j in B[i]:
if seen[j] == seen[i]:
tmp -= 1
ans.append(tmp)
print(" ".join(map(str, ans)))
|
# https://atcoder.jp/contests/abc157/submissions/10475457
import sys
readline = sys.stdin.readline
N, M, K = map(int, readline().split())
F = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = map(int, readline().split())
F[a].append(b)
F[b].append(a)
B = [[] for _ in range(N + 1)]
for _ in range(K):
c, d = map(int, readline().split())
B[c].append(d)
B[d].append(c)
seen = [-1] * (N + 1)
group = 0
def dfs(graph, s):
stack = [s]
seen[s] = group
n_connection = 1
while stack:
u = stack.pop()
for v in graph[u]:
if seen[v] == -1:
n_connection += 1
seen[v] = group
stack.append(v)
return n_connection
union = {}
for i in range(1, N + 1):
if seen[i] == -1:
n = dfs(F, i)
union[group] = n
group += 1
ans = []
for i in range(1, N + 1):
tmp = 0
tmp += union[seen[i]] - 1
tmp -= len(F[i])
for j in B[i]:
if seen[j] == seen[i]:
tmp -= 1
ans.append(tmp)
print(" ".join(map(str, ans)))
|
[
"assignment.value.change",
"identifier.change"
] | 554,217
| 554,218
|
u780475861
|
python
|
p02762
|
#import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
self.find(self.parents[n])
def union(self,a,b):
a_par = self.find(a)
b_par = self.find(b)
if a_par == b_par:
return
##union by rank
#if self.rnks[a_par] < self.rnks[b_par]: #ランクの高い方の根に低い方の根をつける 逆にしないように……！
# a_par,b_par = b_par,a_par
#if self.rnks[a_par] == self.rnks[b_par]:
# self.rnks[a_par] += 1
if self.size(a_par) < self.size(b_par): #parentsの値が負の数のとき、それはその木のサイズを表す。
a_par,b_par = b_par,a_par
self.parents[a_par] += self.parents[b_par]
self.parents[b_par] = a_par
def size(self,n):
par = self.find(n)
return abs(self.parents[par])
def is_same(self,a,b):
return self.find(a) == self.find(b)
def main():
n,m,k = map(int,input().split())
uf = UF(n)
block_lst = [0 for _ in range(n+1)]
friend_lst = [0 for _ in range(n+1)]
#友達リスト部分
for i in range(m):
a,b = map(int,input().split())
friend_lst[a] += 1
friend_lst[b] += 1
uf.union(a,b)
#print(friend_lst)
#ブロックリスト部分
for i in range(k):
c,d = map(int,input().split())
if uf.is_same(c,d):#c,dが同じ友達候補グループにない限り、解答には影響しない！
block_lst[c] += 1
block_lst[d] += 1
#print(block_lst)
#メイン処理
answer = []
for i in range(1,n+1):
f_o_f = uf.size(i)
answer.append(f_o_f - friend_lst[i] - block_lst[i] - 1)
print(" ".join(map(str,answer)))
if __name__ == '__main__':
main()
|
#import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
return self.find(self.parents[n])
def union(self,a,b):
a_par = self.find(a)
b_par = self.find(b)
if a_par == b_par:
return
##union by rank
#if self.rnks[a_par] < self.rnks[b_par]: #ランクの高い方の根に低い方の根をつける 逆にしないように……！
# a_par,b_par = b_par,a_par
#if self.rnks[a_par] == self.rnks[b_par]:
# self.rnks[a_par] += 1
if self.size(a_par) < self.size(b_par): #parentsの値が負の数のとき、それはその木のサイズを表す。
a_par,b_par = b_par,a_par
self.parents[a_par] += self.parents[b_par]
self.parents[b_par] = a_par
def size(self,n):
par = self.find(n)
return abs(self.parents[par])
def is_same(self,a,b):
return self.find(a) == self.find(b)
def main():
n,m,k = map(int,input().split())
uf = UF(n)
block_lst = [0 for _ in range(n+1)]
friend_lst = [0 for _ in range(n+1)]
#友達リスト部分
for i in range(m):
a,b = map(int,input().split())
friend_lst[a] += 1
friend_lst[b] += 1
uf.union(a,b)
#print(friend_lst)
#ブロックリスト部分
for i in range(k):
c,d = map(int,input().split())
if uf.is_same(c,d):#c,dが同じ友達候補グループにない限り、解答には影響しない！
block_lst[c] += 1
block_lst[d] += 1
#print(block_lst)
#メイン処理
answer = []
for i in range(1,n+1):
f_o_f = uf.size(i)
answer.append(f_o_f - friend_lst[i] - block_lst[i] - 1)
print(" ".join(map(str,answer)))
if __name__ == '__main__':
main()
|
[
"control_flow.return.add"
] | 554,225
| 554,226
|
u695079172
|
python
|
p02762
|
#import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
self.parents[n] = self.find(self.parents[n])
return self.parents[n]
def union(self,a,b):
a_par = self.find(a)
b_par = self.find(b)
if a_par == b_par:
return
##union by rank
#if self.rnks[a_par] < self.rnks[b_par]: #ランクの高い方の根に低い方の根をつける 逆にしないように……！
# a_par,b_par = b_par,a_par
#if self.rnks[a_par] == self.rnks[b_par]:
# self.rnks[a_par] += 1
if self.size(a_par) < self.size(b_par): #parentsの値が負の数のとき、それはその木のサイズを表す。
a_par,b_par = b_par,a_par
self.parents[a_par] += self.parents[b_par]
self.parents[b_par] = a_par
def size(self,n):
par = self.find(n)
return abs(self.parents[par])
def is_same(self,a,b):
return self.find(a) == self.find(b)
def main():
n,m,k = map(int,input().split())
uf = UF(n)
block_lst = [0 for _ in range(n+1)]
friend_lst = [0 for _ in range(n+1)]
#友達リスト部分
for i in range(m):
a,b = map(int,input().split())
friend_lst[a] += 1
friend_lst[b] += 1
uf.union(a,b)
#print(friend_lst)
#ブロックリスト部分
for i in range(k):
c,d = map(int,input().split())
if uf.is_same(c,d):#c,dが同じ友達候補グループにない限り、解答には影響しない！
block_lst[c] += 1
block_lst[d] += 1
#print(block_lst)
#メイン処理
answer = []
for i in range(1,n+1):
f_o_f = uf.length(i)
answer.append(f_o_f - friend_lst[i] - block_lst[i] - 1)
print(" ".join(map(str,answer)))
if __name__ == '__main__':
main()
|
#import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
self.parents[n] = self.find(self.parents[n])
return self.parents[n]
def union(self,a,b):
a_par = self.find(a)
b_par = self.find(b)
if a_par == b_par:
return
##union by rank
#if self.rnks[a_par] < self.rnks[b_par]: #ランクの高い方の根に低い方の根をつける 逆にしないように……！
# a_par,b_par = b_par,a_par
#if self.rnks[a_par] == self.rnks[b_par]:
# self.rnks[a_par] += 1
if self.size(a_par) < self.size(b_par): #parentsの値が負の数のとき、それはその木のサイズを表す。
a_par,b_par = b_par,a_par
self.parents[a_par] += self.parents[b_par]
self.parents[b_par] = a_par
def size(self,n):
par = self.find(n)
return abs(self.parents[par])
def is_same(self,a,b):
return self.find(a) == self.find(b)
def main():
n,m,k = map(int,input().split())
uf = UF(n)
block_lst = [0 for _ in range(n+1)]
friend_lst = [0 for _ in range(n+1)]
#友達リスト部分
for i in range(m):
a,b = map(int,input().split())
friend_lst[a] += 1
friend_lst[b] += 1
uf.union(a,b)
#print(friend_lst)
#ブロックリスト部分
for i in range(k):
c,d = map(int,input().split())
if uf.is_same(c,d):#c,dが同じ友達候補グループにない限り、解答には影響しない！
block_lst[c] += 1
block_lst[d] += 1
#print(block_lst)
#メイン処理
answer = []
for i in range(1,n+1):
f_o_f = uf.size(i)
answer.append(f_o_f - friend_lst[i] - block_lst[i] - 1)
print(" ".join(map(str,answer)))
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.change"
] | 554,227
| 554,228
|
u695079172
|
python
|
p02762
|
import sys
sys.setrecursionlimit(999999999999)
class UF:
#経路圧縮のみのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
self.parents[n] = self.find(self.parents[n])
return self.parents[n]
def union(self,a,b):
a_par = self.find(a)
b_par = self.find(b)
if a_par == b_par:
return
if self.rnks[a_par] > self.rnks[b_par]:
a_par,b_par = b_par,a_par
if self.rnks[a_par] == self.rnks[b_par]:
self.rnks[a_par] += 1
self.parents[a_par] += self.parents[b_par]
self.parents[b_par] = a_par
def length(self,n):
par = self.find(n)
return abs(self.parents[par])
def is_same(self,a,b):
return self.find(a) == self.find(b)
def main():
n,m,k = map(int,input().split())
uf = UF(n)
block_lst = [0 for _ in range(n+1)]
friend_lst = [0 for _ in range(n+1)]
#友達リスト部分
for i in range(m):
a,b = map(int,input().split())
friend_lst[a] += 1
friend_lst[b] += 1
uf.union(a,b)
#print(friend_lst)
#ブロックリスト部分
for i in range(k):
c,d = map(int,input().split())
if uf.is_same(c,d):#c,dが同じ友達候補グループにない限り、解答には影響しない！
block_lst[c] += 1
block_lst[d] += 1
#print(block_lst)
#メイン処理
answer = []
for i in range(1,n+1):
f_o_f = uf.length(i)
answer.append(f_o_f - friend_lst[i] - block_lst[i] - 1)
print(" ".join(map(str,answer)))
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(500000)
class UF:
#経路圧縮のみのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
self.parents[n] = self.find(self.parents[n])
return self.parents[n]
def union(self,a,b):
a_par = self.find(a)
b_par = self.find(b)
if a_par == b_par:
return
if self.rnks[a_par] > self.rnks[b_par]:
a_par,b_par = b_par,a_par
if self.rnks[a_par] == self.rnks[b_par]:
self.rnks[a_par] += 1
self.parents[a_par] += self.parents[b_par]
self.parents[b_par] = a_par
def length(self,n):
par = self.find(n)
return abs(self.parents[par])
def is_same(self,a,b):
return self.find(a) == self.find(b)
def main():
n,m,k = map(int,input().split())
uf = UF(n)
block_lst = [0 for _ in range(n+1)]
friend_lst = [0 for _ in range(n+1)]
#友達リスト部分
for i in range(m):
a,b = map(int,input().split())
friend_lst[a] += 1
friend_lst[b] += 1
uf.union(a,b)
#print(friend_lst)
#ブロックリスト部分
for i in range(k):
c,d = map(int,input().split())
if uf.is_same(c,d):#c,dが同じ友達候補グループにない限り、解答には影響しない！
block_lst[c] += 1
block_lst[d] += 1
#print(block_lst)
#メイン処理
answer = []
for i in range(1,n+1):
f_o_f = uf.length(i)
answer.append(f_o_f - friend_lst[i] - block_lst[i] - 1)
print(" ".join(map(str,answer)))
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 554,231
| 554,232
|
u695079172
|
python
|
p02762
|
n,m,k=map(int,input().split())
ab=[list(map(int,input().split()))for i in range(m)]
cd=[list(map(int,input().split()))for i in range(k)]
class UnionFind():
def __init__(self,n):
self.n=[-1]*n
self.r=[0]*n
def Find_Root(self,x):
if self.n[x]<0:
return x
else:
self.n[x]=self.Find_Root(self.n[x])
return self.n[x]
def Unite(self,x,y):
x=self.Find_Root(x)
y=self.Find_Root(y)
if x==y:
return
elif self.r[x]>self.r[y]:
self.n[x]+=self.n[y]
self.n[y]=x
else:
self.n[y]+=self.n[x]
self.n[x]=y
if self.r[x]==self.r[y]:
self.r[y]+=1
def Root_Same(self,x,y):
return self.Find_Root(x)==self.Find_Root(y)
def Count(self,x):
return -self.n[self.Find_Root(x)]
u=UnionFind(n)
for a,b in ab:
u.Unite(a-1,b-1)
ans=[u.Count(i)-i for i in range(n)]
for a,b in ab:
if u.Root_Same(a-1,b-1):
ans[a-1]-=1
ans[b-1]-=1
for c,d in cd:
if u.Root_Same(c-1,d-1):
ans[c-1]-=1
ans[d-1]-=1
print(*ans)
|
n,m,k=map(int,input().split())
ab=[list(map(int,input().split()))for i in range(m)]
cd=[list(map(int,input().split()))for i in range(k)]
class UnionFind():
def __init__(self,n):
self.n=[-1]*n
self.r=[0]*n
def Find_Root(self,x):
if self.n[x]<0:
return x
else:
self.n[x]=self.Find_Root(self.n[x])
return self.n[x]
def Unite(self,x,y):
x=self.Find_Root(x)
y=self.Find_Root(y)
if x==y:
return
elif self.r[x]>self.r[y]:
self.n[x]+=self.n[y]
self.n[y]=x
else:
self.n[y]+=self.n[x]
self.n[x]=y
if self.r[x]==self.r[y]:
self.r[y]+=1
def Root_Same(self,x,y):
return self.Find_Root(x)==self.Find_Root(y)
def Count(self,x):
return -self.n[self.Find_Root(x)]
u=UnionFind(n)
for a,b in ab:
u.Unite(a-1,b-1)
ans=[u.Count(i)-1 for i in range(n)]
for a,b in ab:
if u.Root_Same(a-1,b-1):
ans[a-1]-=1
ans[b-1]-=1
for c,d in cd:
if u.Root_Same(c-1,d-1):
ans[c-1]-=1
ans[d-1]-=1
print(*ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 554,238
| 554,239
|
u434872492
|
python
|
p02761
|
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
##### 累乗 #####
# pow(x, y, z) -> x**y % z
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N,M = inputMap()
sc = []
for i in range(M):
s,c = inputMap()
sc.append((s,c))
ans = 0
if N == 1:
i = 0
flg = True
for vol in sc:
s,c = vol
tmp = str(i)
aa = int(tmp[s-1])
if aa != c:
flg = False
break
if flg == True:
print(i)
sys.exit()
for i in range(10**(N-1),(10**N)):
print(i)
flg = True
for vol in sc:
s,c = vol
tmp = str(i)
aa = int(tmp[s-1])
if aa != c:
flg = False
break
if flg == True:
print(i)
sys.exit()
print(-1)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
# https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
# comb = Combination(n+r-1, mod)
# return comb(n+r-1, r)
return combination(n+r-1, r, mod)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n+1):
fac.append(fac[i-1] * i % self.mod)
facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
return modinv
if __name__ == "__main__":
main()
|
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
##### 累乗 #####
# pow(x, y, z) -> x**y % z
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N,M = inputMap()
sc = []
for i in range(M):
s,c = inputMap()
sc.append((s,c))
ans = 0
if N == 1:
i = 0
flg = True
for vol in sc:
s,c = vol
tmp = str(i)
aa = int(tmp[s-1])
if aa != c:
flg = False
break
if flg == True:
print(i)
sys.exit()
for i in range(10**(N-1),(10**N)):
#print(i)
flg = True
for vol in sc:
s,c = vol
tmp = str(i)
aa = int(tmp[s-1])
if aa != c:
flg = False
break
if flg == True:
print(i)
sys.exit()
print(-1)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
# https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
# comb = Combination(n+r-1, mod)
# return comb(n+r-1, r)
return combination(n+r-1, r, mod)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n+1):
fac.append(fac[i-1] * i % self.mod)
facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
return modinv
if __name__ == "__main__":
main()
|
[
"call.remove"
] | 554,257
| 554,258
|
u448994613
|
python
|
p02761
|
N,M = map(int,input().split())
sc = [[0,0]]*M
ans = [0]*N
f = True
ans = -1
for i in range(M):
sc[i] = list(map(int,input().split()))
for i in range(1000):
str_i = str(i)
if (len(str_i) == N):
f = True
for j in range(M):
f &= (str_i[sc[i][0]-1] == str(sc[i][1]))
if (f):
ans = i
break
print(ans)
|
N,M = map(int,input().split())
sc = [[0,0]]*M
ans = [0]*N
f = True
ans = -1
for i in range(M):
sc[i] = list(map(int,input().split()))
for i in range(1000):
str_i = list(str(i))
if (len(str_i) == N):
f = True
for j in range(M):
f &= (str_i[sc[j][0]-1] == str(sc[j][1]))
if (f):
ans = i
break
print(ans)
|
[
"call.add",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 554,267
| 554,268
|
u202634017
|
python
|
p02761
|
# C問題
N,M = map(int,input().split(" "))
Num = [0]*N
check = [0]*N
flag=0
for i in range(M):
s,c = map(int,input().split(" "))
if s==1 and c==0 and N!=1:
flag=1
break
elif check[s-1]==1 and Num[s-1]!=c:
flag=1
break
else:
Num[s-1] = c
check[s-1]=1
if flag==1:
print(-1)
else:
if Num[0]==0:
Num[0]=1
for i in Num:
print("{}".format(i),end="")
print("\n",end="")
|
# C問題
N,M = map(int,input().split(" "))
Num = [0]*N
check = [0]*N
flag=0
for i in range(M):
s,c = map(int,input().split(" "))
if s==1 and c==0 and N!=1:
flag=1
break
elif check[s-1]==1 and Num[s-1]!=c:
flag=1
break
else:
Num[s-1] = c
check[s-1]=1
if flag==1:
print(-1)
else:
if N!=1 and Num[0]==0:
Num[0]=1
for i in Num:
print("{}".format(i),end="")
print("\n",end="")
|
[
"control_flow.branch.if.condition.change"
] | 554,281
| 554,282
|
u098982053
|
python
|
p02761
|
n, m = map(int, input().split())
t = [None] * n
invalid = False
for _ in range(m):
s, c = map(int, input().split())
if t[s-1] is None or t[s-1] == c:
t[s-1] = c
else:
invalid = True
for i in range(n):
if t[i] is None:
if i == 0:
t[i] = 1
else:
t[i] = 0
if invalid:
print(-1)
else:
if t[0] == 0 and n > 1:
print(-1)
else:
v = 0
for i in range(n):
v += t[-1 - i] * 10 ** i
print(v)
|
n, m = map(int, input().split())
t = [None] * n
invalid = False
for _ in range(m):
s, c = map(int, input().split())
if t[s-1] is None or t[s-1] == c:
t[s-1] = c
else:
invalid = True
for i in range(n):
if t[i] is None:
if i == 0 and n > 1:
t[i] = 1
else:
t[i] = 0
if invalid:
print(-1)
else:
if t[0] == 0 and n > 1:
print(-1)
else:
v = 0
for i in range(n):
v += t[-1 - i] * 10 ** i
print(v)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,311
| 554,312
|
u645855527
|
python
|
p02761
|
n, num = map(int, input().split())
ans = [-1 for i in range(n)]
flag = True
for i in range(num):
s, c = map(int, input().split())
s -= 1
if ans[s] == -1 or ans[s] == c:
ans[s] = c
else:
flag = False
if n != 1 and ans[0] == 0:
flag = False
if flag:
if ans[0] == -1:
ans[0] = 1
for i, x in enumerate(ans):
if x == -1:
ans[i] = 0
print("".join(map(str, ans)))
else:
print(-1)
|
n, num = map(int, input().split())
ans = [-1 for i in range(n)]
flag = True
for i in range(num):
s, c = map(int, input().split())
s -= 1
if ans[s] == -1 or ans[s] == c:
ans[s] = c
else:
flag = False
if n != 1 and ans[0] == 0:
flag = False
if flag:
if ans[0] == -1 and n != 1:
ans[0] = 1
for i, x in enumerate(ans):
if x == -1:
ans[i] = 0
print("".join(map(str, ans)))
else:
print(-1)
|
[
"control_flow.branch.if.condition.change"
] | 554,336
| 554,337
|
u301984327
|
python
|
p02761
|
n, m = [int(v) for v in input().split()]
query = [tuple(int(v) for v in input().split()) for _ in range(m)]
res = [None] * n
for s, c in query:
s -= 1
if res[s] is None:
if n > 1 and c == 0 and s == 0:
res = None
break
res[s] = c
elif res[s] == c:
pass
else:
res = None
break
if res is None:
print("-1")
else:
if res[0] is None:
res[0] = 1
res = [0 if v is None else v for v in res]
print("".join(str(v) for v in res))
|
n, m = [int(v) for v in input().split()]
query = [tuple(int(v) for v in input().split()) for _ in range(m)]
res = [None] * n
for s, c in query:
s -= 1
if res[s] is None:
if n > 1 and c == 0 and s == 0:
res = None
break
res[s] = c
elif res[s] == c:
pass
else:
res = None
break
if res is None:
print("-1")
else:
if n > 1 and res[0] is None:
res[0] = 1
res = [0 if v is None else v for v in res]
print("".join(str(v) for v in res))
|
[
"control_flow.branch.if.condition.change"
] | 554,362
| 554,363
|
u569280127
|
python
|
p02761
|
# -*- coding: utf-8 -*-
n, m = map(int, input().split())
ds = [-1 for _ in range(n)]
f = True
for _ in range(m):
si, ci = map(int, input().split())
si -= 1
if ds[si] == -1:
ds[si] = ci
elif ds[si] == ci:
continue
else:
f = False
if f:
if len(ds) == 1:
s = ds[0]
elif ds[0] == 0:
s = -1
else:
s = max(1, ds[0])
for i in ds[1:]:
s *= 10
s += max(0, i)
print(s)
else:
print(-1)
|
# -*- coding: utf-8 -*-
n, m = map(int, input().split())
ds = [-1 for _ in range(n)]
f = True
for _ in range(m):
si, ci = map(int, input().split())
si -= 1
if ds[si] == -1:
ds[si] = ci
elif ds[si] == ci:
continue
else:
f = False
if f:
if len(ds) == 1:
s = max(0, ds[0])
elif ds[0] == 0:
s = -1
else:
s = max(1, ds[0])
for i in ds[1:]:
s *= 10
s += max(0, i)
print(s)
else:
print(-1)
|
[
"call.add",
"call.arguments.change"
] | 554,390
| 554,391
|
u056277698
|
python
|
p02761
|
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)
def solve(N: int, M: int, s: "List[int]", c: "List[int]"):
ans=[-1]*N
dame=False
for i in range(M):
if N!=1 and s[i]==1 and c[i]==0: dame=True
if ans[s[i]-1]!=-1 and ans[s[i]-1]!=c[i]: dame=True
ans[s[i]-1]=c[i]
for i in range(N):
if ans[i]==-1:
if i==0: ans[i]=1
else: ans[i]=0
print(-1 if dame else "".join(map(str,ans)))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
s = [int()] * (M) # type: "List[int]"
c = [int()] * (M) # type: "List[int]"
for i in range(M):
s[i] = int(next(tokens))
c[i] = int(next(tokens))
solve(N, M, s, c)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)
def solve(N: int, M: int, s: "List[int]", c: "List[int]"):
ans=[-1]*N
dame=False
for i in range(M):
if N!=1 and s[i]==1 and c[i]==0: dame=True
if ans[s[i]-1]!=-1 and ans[s[i]-1]!=c[i]: dame=True
ans[s[i]-1]=c[i]
for i in range(N):
if ans[i]==-1:
if N!=1 and i==0: ans[i]=1
else: ans[i]=0
print(-1 if dame else "".join(map(str,ans)))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
s = [int()] * (M) # type: "List[int]"
c = [int()] * (M) # type: "List[int]"
for i in range(M):
s[i] = int(next(tokens))
c[i] = int(next(tokens))
solve(N, M, s, c)
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,424
| 554,425
|
u090649502
|
python
|
p02761
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from math import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N,M=MI()
ans = [-1]*N
for i in range(M):
j,x = MI()
j-=1
if ans[j]!=-1 and ans[j]!=x:
print(-1)
return
ans[j]=x
if ans[0] == 0 and N!=1:
print(-1)
return
if ans[0] == -1:
print(0)
return
non_zero = False
for i in range(N):
if ans[i]==-1:
if non_zero:
ans[i]=0
else:
ans[i]=1
non_zero = True
else:
non_zero = True
print(*ans,sep="")
if __name__ == '__main__':
main()
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from math import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N,M=MI()
ans = [-1]*N
for i in range(M):
j,x = MI()
j-=1
if ans[j]!=-1 and ans[j]!=x:
print(-1)
return
ans[j]=x
if ans[0] == 0 and N!=1:
print(-1)
return
if ans[0] == -1 and N==1:
print(0)
return
non_zero = False
for i in range(N):
if ans[i]==-1:
if non_zero:
ans[i]=0
else:
ans[i]=1
non_zero = True
else:
non_zero = True
print(*ans,sep="")
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change"
] | 554,433
| 554,434
|
u788137651
|
python
|
p02761
|
N, M = list(map(int, input().split()))
sol = [-1] * N
for i in range(M):
s, c = list(map(int, input().split()))
if sol[s-1] != -1 and sol[s-1] != c:
print('-1')
exit(0)
sol[s-1] = c
for v in range(1, 1000):
s = str(v)
if len(s) != N:
continue
fail = False
for i in range(len(sol)):
if sol[i] == -1:
continue
if int(s[i]) != sol[i]:
fail = True
break
if not fail:
print(v)
exit(0)
print(-1)
|
N, M = list(map(int, input().split()))
sol = [-1] * N
for i in range(M):
s, c = list(map(int, input().split()))
if sol[s-1] != -1 and sol[s-1] != c:
print('-1')
exit(0)
sol[s-1] = c
for v in range(0, 1000):
s = str(v)
if len(s) != N:
continue
fail = False
for i in range(len(sol)):
if sol[i] == -1:
continue
if int(s[i]) != sol[i]:
fail = True
break
if not fail:
print(v)
exit(0)
print(-1)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 554,445
| 554,446
|
u179053337
|
python
|
p02760
|
A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
b = [int(input()) for i in range(N)]
for i in range(N):
for j in range(3):
for k in range(3):
if A[j][k]==b[i]:
A[j][k] = 0
if A[1][1]==0 and A[0][0]==0 and A[2][2]==0 or A[1][1]==0 and A[2][0]==0 and A[0][2]==0 or A[1][1]==0 and A[0][1]==0 and A[2][1]==0 or A[1][1]==0 and A[1][0]==0 and A[2][0]==0 or A[0][0]==0 and A[0][1]==0 and A[0][1]==0 or A[0][0]==0 and A[1][0]==0 and A[2][0]==0 or A[2][2]==0 and A[0][2]==0 and A[1][2]==0 or A[2][2]==0 and A[2][0]==0 and A[2][1]==0:
print("Yes")
else:
print("No")
|
A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
b = [int(input()) for i in range(N)]
for i in range(N):
for j in range(3):
for k in range(3):
if A[j][k]==b[i]:
A[j][k] = 0
if A[1][1]==0 and A[0][0]==0 and A[2][2]==0 or A[1][1]==0 and A[2][0]==0 and A[0][2]==0 or A[1][1]==0 and A[0][1]==0 and A[2][1]==0 or A[1][1]==0 and A[1][0]==0 and A[1][2]==0 or A[0][0]==0 and A[0][1]==0 and A[0][2]==0 or A[0][0]==0 and A[1][0]==0 and A[2][0]==0 or A[2][2]==0 and A[0][2]==0 and A[1][2]==0 or A[2][2]==0 and A[2][0]==0 and A[2][1]==0:
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,453
| 554,454
|
u511457539
|
python
|
p02760
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,455
| 554,456
|
u205087376
|
python
|
p02760
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,457
| 554,456
|
u205087376
|
python
|
p02760
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,455
| 554,459
|
u205087376
|
python
|
p02760
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,457
| 554,459
|
u205087376
|
python
|
p02760
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+a[2][i] == 0:
ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
ans = 'Yes'
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,458
| 554,459
|
u205087376
|
python
|
p02760
|
import numpy as np
A = np.array(list(list(map(int, input().split())) for l in range(3)))
N = int(input())
b = np.array(list(int(input()) for l in range(N)))
bingo = np.zeros((3, 3))
bingo = bingo == 1
for b_i in b:
hantei = A == b_i
bingo = np.logical_or(bingo, hantei)
for i in range(3):
if all(bingo[i]) or all(bingo[:,i]):
print('Yes')
exit()
if (bingo[0,0] and bingo[1,1] and bingo[2,2]) or (bingo[0,2] and bingo[1,1] and bingo[3,1]):
print('Yes')
exit()
print('No')
|
import numpy as np
A = np.array(list(list(map(int, input().split())) for l in range(3)))
N = int(input())
b = np.array(list(int(input()) for l in range(N)))
bingo = np.zeros((3, 3))
bingo = bingo == 1
for b_i in b:
hantei = A == b_i
bingo = np.logical_or(bingo, hantei)
for i in range(3):
if all(bingo[i]) or all(bingo[:,i]):
print('Yes')
exit()
if (bingo[0,0] and bingo[1,1] and bingo[2,2]) or (bingo[0,2] and bingo[1,1] and bingo[2,0]):
print('Yes')
exit()
print('No')
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,463
| 554,464
|
u183657342
|
python
|
p02760
|
import sys
A = [[0] * 3 for i in range(3)]
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
for _ in range(N):
b = int(input())
if b in A1:
for a in [i for i, x in enumerate(A1) if x == b]:
A[0][a] = 1
if b in A2:
for a in [i for i, x in enumerate(A2) if x == b]:
A[1][a] = 1
if b in A3:
for a in [i for i, x in enumerate(A3) if x == b]:
A[2][a] = 1
for i in range(3):
if sum(A[i][:]) == 3:
print('Yes')
sys.exit()
if A[0][0] == 1 and A[1][0] == 1 and A[2][0] == 1:
print('Yes')
sys.exit()
if A[0][1] == 1 and A[1][1] == 1 and A[2][1] == 1:
print('Yes')
sys.exit()
if A[0][2] == 1 and A[1][2] == 1 and A[2][2] == 1:
print('Yes')
sys.exit()
if A[0][0] == 1 and A[1][1] == 1 and A[2][2] == 1:
print('Yes')
sys.exit()
if A[0][2] == 1 and A[1][1] == 1 and A[3][0] == 1:
print('Yes')
sys.exit()
print('No')
|
import sys
A = [[0] * 3 for i in range(3)]
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
for _ in range(N):
b = int(input())
if b in A1:
for a in [i for i, x in enumerate(A1) if x == b]:
A[0][a] = 1
if b in A2:
for a in [i for i, x in enumerate(A2) if x == b]:
A[1][a] = 1
if b in A3:
for a in [i for i, x in enumerate(A3) if x == b]:
A[2][a] = 1
for i in range(3):
if sum(A[i][:]) == 3:
print('Yes')
sys.exit()
if A[0][0] == 1 and A[1][0] == 1 and A[2][0] == 1:
print('Yes')
sys.exit()
if A[0][1] == 1 and A[1][1] == 1 and A[2][1] == 1:
print('Yes')
sys.exit()
if A[0][2] == 1 and A[1][2] == 1 and A[2][2] == 1:
print('Yes')
sys.exit()
if A[0][0] == 1 and A[1][1] == 1 and A[2][2] == 1:
print('Yes')
sys.exit()
if A[0][2] == 1 and A[1][1] == 1 and A[2][0] == 1:
print('Yes')
sys.exit()
print('No')
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,467
| 554,468
|
u847758719
|
python
|
p02760
|
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b in al:
al[al.index()] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or al[0] + al[3] + al[6] == 0 or al[1] + al[4] + al[7] == 0 or al[2] + al[5] + al[8] == 0 or al[0] + al[4] + al[8] == 0 or al[2] + al[4] + al[6] == 0:
print("Yes")
else:
print("No")
|
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b in al:
al[al.index(b)] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or al[0] + al[3] + al[6] == 0 or al[1] + al[4] + al[7] == 0 or al[2] + al[5] + al[8] == 0 or al[0] + al[4] + al[8] == 0 or al[2] + al[4] + al[6] == 0:
print("Yes")
else:
print("No")
|
[
"call.arguments.change"
] | 554,469
| 554,470
|
u118760114
|
python
|
p02760
|
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b == al:
al[al.index()] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or al[0] + al[3] + al[6] == 0 or al[1] + al[4] + al[7] == 0 or al[2] + al[5] + al[8] == 0 or al[0] + al[4] + al[8] == 0 or al[2] + al[4] + al[6] == 0:
print("Yes")
else:
print("No")
|
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b in al:
al[al.index(b)] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or al[0] + al[3] + al[6] == 0 or al[1] + al[4] + al[7] == 0 or al[2] + al[5] + al[8] == 0 or al[0] + al[4] + al[8] == 0 or al[2] + al[4] + al[6] == 0:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 554,471
| 554,470
|
u118760114
|
python
|
p02760
|
n = []
for i in range(3):
n.extend(list(map(int, input().split())))
m = int(input())
for i in range(m):
num = int(input())
if num in n: n[n.index(num)] = 0
check = "No"
for j in range(3):
if n[j + 0] == 0 and n[j + 3] == 0 and n[j + 6] == 0:
check = "Yes"
break
if n[j + 0] == 0 and n[j + 1] == 0 and n[j + 2] == 0:
check = "Yes"
break
if n[0] == 0 and n[4] == 0 and n[8] == 0:
check = "Yes"
if n[2] == 0 and n[4] == 0 and n[6] == 0:
check = "Yes"
print(check)
|
n = []
for i in range(3):
n.extend(list(map(int, input().split())))
m = int(input())
for i in range(m):
num = int(input())
if num in n: n[n.index(num)] = 0
check = "No"
for j in range(3):
if n[j + 0] == 0 and n[j + 3] == 0 and n[j + 6] == 0:
check = "Yes"
break
if n[j * 3] == 0 and n[j * 3 + 1] == 0 and n[j * 3 + 2] == 0:
check = "Yes"
break
if n[0] == 0 and n[4] == 0 and n[8] == 0:
check = "Yes"
if n[2] == 0 and n[4] == 0 and n[6] == 0:
check = "Yes"
print(check)
|
[
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 554,480
| 554,481
|
u908505367
|
python
|
p02760
|
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
B.append(int(input()))
ans='No'
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
judge(A1, B)
judge(A2, B)
judge(A3, B)
if sum(A1)==3 or sum(A2)==3 or sum(A3)==3:
ans = 'Yes'
for i in range(3):
if A1[i] + A2[i] + A3[i] == 1:
ans = 'Yes'
if A1[0] + A2[1] + A3[2] == 3 or A1[2] + A2[1] + A3[0] == 3:
ans = 'Yes'
print(ans)
|
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
B.append(int(input()))
ans='No'
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
judge(A1, B)
judge(A2, B)
judge(A3, B)
if sum(A1)==3 or sum(A2)==3 or sum(A3)==3:
ans = 'Yes'
for i in range(3):
if A1[i] + A2[i] + A3[i] == 3:
ans = 'Yes'
if A1[0] + A2[1] + A3[2] == 3 or A1[2] + A2[1] + A3[0] == 3:
ans = 'Yes'
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 554,484
| 554,485
|
u523087093
|
python
|
p02760
|
#定数
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
B.append(int(input()))
ans='No'
#判定式
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
#判定
judge(A1, B)
judge(A2, B)
judge(A3, B)
if sum(A1)==3 or sum(A2)==3 or sum(A3)==3:
ans = 'Yes'
for i in range(3):
if A1[i] + A2[i] + A3[i] == 1:
ans = 'Yes'
if A1[0] + A2[1] + A3[2] == 3 or A1[2] + A2[1] + A3[0] == 3:
ans = 'Yes'
print(ans)
|
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
B.append(int(input()))
ans='No'
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
judge(A1, B)
judge(A2, B)
judge(A3, B)
if sum(A1)==3 or sum(A2)==3 or sum(A3)==3:
ans = 'Yes'
for i in range(3):
if A1[i] + A2[i] + A3[i] == 3:
ans = 'Yes'
if A1[0] + A2[1] + A3[2] == 3 or A1[2] + A2[1] + A3[0] == 3:
ans = 'Yes'
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 554,486
| 554,485
|
u523087093
|
python
|
p02760
|
a = [[0] * 3 for i in range(3)]
for i in range(3):
a[i] = list(map(int, input().split(' ')))
n = int(input())
for i in range(n):
b = int(input())
for r in range(3):
for c in range(3):
if a[r][c] == b:
a[r][c] = 0
a = np.array(a)
sum1 = a.sum(axis=0)
sum2 = a.sum(axis=1)
naname1 = a[0][0] + a[1][1] + a[2][2]
naname2 = a[0][2] + a[1][1] + a[2][0]
if 0 in sum1 or 0 in sum2 or naname1 == 0 or naname2 == 0:
print('Yes')
else:
print('No')
|
import numpy as np
a = [[0] * 3 for i in range(3)]
for i in range(3):
a[i] = list(map(int, input().split(' ')))
n = int(input())
for i in range(n):
b = int(input())
for r in range(3):
for c in range(3):
if a[r][c] == b:
a[r][c] = 0
a = np.array(a)
sum1 = a.sum(axis=0)
sum2 = a.sum(axis=1)
naname1 = a[0][0] + a[1][1] + a[2][2]
naname2 = a[0][2] + a[1][1] + a[2][0]
if 0 in sum1 or 0 in sum2 or naname1 == 0 or naname2 == 0:
print('Yes')
else:
print('No')
|
[] | 554,493
| 554,494
|
u864551836
|
python
|
p02760
|
import sys
a=[]
for i in range(3):
a1,a2,a3=map(int,input().split())
a.append([a1,a2,a3])
check=[[0]*3 for i in range(3)]
n=int(input())
b=[]
for i in range(n):
b.append(int(input()))
for i in b:
for j in range(3):
if i in a[j]:
check[j][a[j].index(i)]=1
naname=[0]*3
for i in range(3):
if sum(a[i])==3:
print('Yes')
sys.exit()
for j in range(3):
num=0
for i in range(3):
if check[i][j]==1:
num+=1
if num==3:
print('Yes')
sys.exit()
if check[0][0]==check[1][1]==check[2][2]==1:
print('Yes')
sys.exit()
if check[0][2]==check[1][1]==check[2][0]==1:
print('Yes')
sys.exit()
print('No')
|
import sys
a=[]
for i in range(3):
a1,a2,a3=map(int,input().split())
a.append([a1,a2,a3])
check=[[0]*3 for i in range(3)]
n=int(input())
b=[]
for i in range(n):
b.append(int(input()))
for i in b:
for j in range(3):
if i in a[j]:
check[j][a[j].index(i)]=1
naname=[0]*3
for i in range(3):
if sum(check[i])==3:
print('Yes')
sys.exit()
for j in range(3):
num=0
for i in range(3):
if check[i][j]==1:
num+=1
if num==3:
print('Yes')
sys.exit()
if check[0][0]==check[1][1]==check[2][2]==1:
print('Yes')
sys.exit()
if check[0][2]==check[1][1]==check[2][0]==1:
print('Yes')
sys.exit()
print('No')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,495
| 554,496
|
u527261492
|
python
|
p02760
|
d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
if d[0][a] in num and d[1][a] in num and d[2][a] in num:
bingo=bingo+1
if d[a][0] in num and d[a][1] in num and d[a][2] in num:
bingo=bingo+1
if d[1][1] in num and d[2][2] in num and d[0][0] in num:
bingo=bingo+1
if d[0][1] in num and d[2][2] in num and d[1][0] in num:
bingo=bingo+1
if bingo>0:
print('Yes')
else:
print('No')
|
d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
if d[0][a] in num and d[1][a] in num and d[2][a] in num:
bingo=bingo+1
if d[a][0] in num and d[a][1] in num and d[a][2] in num:
bingo=bingo+1
if d[1][1] in num and d[2][2] in num and d[0][0] in num:
bingo=bingo+1
if d[1][1] in num and d[0][2] in num and d[2][0] in num:
bingo=bingo+1
if bingo>0:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,503
| 554,504
|
u692498898
|
python
|
p02760
|
import numpy as np
A1 = list(map(int, input().split()));
A2 = list(map(int, input().split()));
A3 = list(map(int, input().split()));
N = int(input());
#Bの配列を作成
B = [];
for i in range(N):
b = int(input())
B.append(b);
#ビンゴの行列を作成
A = np.hstack([A1,A2,A3]);
for i in range(N):
for j in range(len(A)):
if B[i] == A[j]:
A[j] = 0;
break;
else:
pass;
if A[0] == 0 and A[1] == 0 and A[2] == 0:
print("Yes");
elif A[3] == 0 and A[4] == 0 and A[5] == 0:
print("Yes");
elif A[6] == 0 and A[7] == 0 and A[8] == 0:
print("Yes");
elif A[0] == 0 and A[3] == 0 and A[6] == 0:
print("Yes");
elif A[1] == 0 and A[4] == 0 and A[7] == 0:
print("Yes");
elif A[2] == 0 and A[5] == 0 and A[8] == 0:
print("Yes");
elif A[0] == 0 and A[4] == 0 and A[7] == 0:
print("Yes");
elif A[2] == 0 and A[4] == 0 and A[6] == 0:
print("Yes");
else:
print("No");
|
import numpy as np
A1 = list(map(int, input().split()));
A2 = list(map(int, input().split()));
A3 = list(map(int, input().split()));
N = int(input());
#Bの配列を作成
B = [];
for i in range(N):
b = int(input())
B.append(b);
#ビンゴの行列を作成
A = np.hstack([A1,A2,A3]);
for i in range(N):
for j in range(len(A)):
if B[i] == A[j]:
A[j] = 0;
break;
else:
pass;
if A[0] == 0 and A[1] == 0 and A[2] == 0:
print("Yes");
elif A[3] == 0 and A[4] == 0 and A[5] == 0:
print("Yes");
elif A[6] == 0 and A[7] == 0 and A[8] == 0:
print("Yes");
elif A[0] == 0 and A[3] == 0 and A[6] == 0:
print("Yes");
elif A[1] == 0 and A[4] == 0 and A[7] == 0:
print("Yes");
elif A[2] == 0 and A[5] == 0 and A[8] == 0:
print("Yes");
elif A[0] == 0 and A[4] == 0 and A[8] == 0:
print("Yes");
elif A[2] == 0 and A[4] == 0 and A[6] == 0:
print("Yes");
else:
print("No");
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,509
| 554,510
|
u508061226
|
python
|
p02760
|
#!/usr/bin/env python3
def main():
*N, = map(int, open(0).read().split())
A = N[0:9]
N_number = N[9]
b = N[10:]
Ab_comm = set(A) & set(b)
A_rep = [0 if i in Ab_comm else i for i in A]
Ax=[]
Ay=[]
for i in range(0,3):
Ax.append(A_rep[i] + A_rep[i + 1] + A_rep[i + 2])
Ay.append(A_rep[i] + A_rep[i + 3] + A_rep[i + 6])
An=[]
An.append(A_rep[0] + A_rep[4] + A_rep[8])
An.append(A_rep[2] + A_rep[4] + A_rep[6])
if min(Ax + Ay + An) == 0:
print("Yes")
else:
print("No")
main()
|
#!/usr/bin/env python3
def main():
*N, = map(int, open(0).read().split())
A = N[0:9]
N_number = N[9]
b = N[10:]
Ab_comm = set(A) & set(b)
A_rep = [0 if i in Ab_comm else i for i in A]
Ax=[]
Ay=[]
for i in range(0,3):
Ax.append(A_rep[3*i] + A_rep[3*i + 1] + A_rep[3*i + 2])
Ay.append(A_rep[i] + A_rep[i + 3] + A_rep[i + 6])
An=[]
An.append(A_rep[0] + A_rep[4] + A_rep[8])
An.append(A_rep[2] + A_rep[4] + A_rep[6])
if min(Ax + Ay + An) == 0:
print("Yes")
else:
print("No")
main()
|
[
"expression.operation.binary.add"
] | 554,515
| 554,516
|
u428891594
|
python
|
p02760
|
a = [list(map(int,input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _1 in range(n)]
for bingo in b:
for i in range(3):
for j in range(3):
if a[i][j] == bingo:
a[i][j] = 0
triple_pair =[a[0][t1]+a[1][t1]+a[2][t1] for t1 in range(3)] + [a[t2][0]+a[t2][1]+a[t2][2] for t2 in range(3)] + [a[0][0]+a[1][1]+a[2][2]] + [a[0][2]+a[2][2]+a[2][0]]
if 0 in triple_pair:
print("Yes")
else:
print("No")
|
a = [list(map(int,input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _1 in range(n)]
for bingo in b:
for i in range(3):
for j in range(3):
if a[i][j] == bingo:
a[i][j] = 0
triple_pair =[a[0][t1]+a[1][t1]+a[2][t1] for t1 in range(3)] + [a[t2][0]+a[t2][1]+a[t2][2] for t2 in range(3)] + [a[0][0]+a[1][1]+a[2][2]] + [a[0][2]+a[1][1]+a[2][0]]
if 0 in triple_pair:
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 554,517
| 554,518
|
u136843617
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.