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 |
|---|---|---|---|---|---|---|---|
p02678 | from collections import deque
n,m = map(int,input().split())
ab = [[] for _ in range(m)]
kr = [[] for _ in range(n)]
dist = [-1 for _ in range(n)]
dist[0] = 0
ans = [-1 for _ in range(n)]
qn = deque([1])
for i in range(m):
a,b = map(int,input().split())
a,b = min(a,b),max(a,b)
ab[i] = [a,b]
kr[a-1].a... | from collections import deque
n,m = map(int,input().split())
ab = [[] for _ in range(m)]
kr = [[] for _ in range(n)]
dist = [-1 for _ in range(n)]
dist[0] = 0
ans = [-1 for _ in range(n)]
qn = deque([1])
for i in range(m):
a,b = map(int,input().split())
a,b = min(a,b),max(a,b)
ab[i] = [a,b]
kr[a-1].a... | [
"call.add"
] | 401,078 | 401,079 | u961674365 | python |
p02678 | N, M = map(int, input().split())
AB = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
for a, b in AB:
es[a-1].append(b-1)
es[b-1].append(a-1)
ans = [-1] * N
ans[0] = 0
from collections import deque
que = deque
que.insert(0)
while que:
s = que.popleft()
for v in es[s]... | N, M = map(int, input().split())
AB = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
for a, b in AB:
es[a-1].append(b-1)
es[b-1].append(a-1)
ans = [-1] * N
ans[0] = 0
from collections import deque
que = deque([])
que.append(0)
while que:
s = que.popleft()
for v in e... | [
"call.arguments.add",
"identifier.change"
] | 401,082 | 401,083 | u491550356 | python |
p02678 | from collections import deque, defaultdict
N, M = map(int, input().split())
tree = [[] for _ in range(N)]
for _ in range(M):
a, b = map(lambda x: int(x)-1, input().split())
tree[a].append(b)
tree[b].append(a)
visited = [False]*N
q = deque([0])
visited[0] = True
ans = defaultdict(int)
while len(q):
v = ... | from collections import deque, defaultdict
N, M = map(int, input().split())
tree = [[] for _ in range(N)]
for _ in range(M):
a, b = map(lambda x: int(x)-1, input().split())
tree[a].append(b)
tree[b].append(a)
visited = [False]*N
q = deque([0])
visited[0] = True
ans = defaultdict(int)
while len(q):
v = ... | [
"call.add"
] | 401,095 | 401,096 | u708255304 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
L=[[] for i in range(n)]
#print(L)
for i in range(m):
a,b=map(int,input().split())
L[a-1].append(b-1)
L[b-1].append(a-1)
#print(L)
d=[float('inf') for i in range(n)]
m=[0 for i in range(n)]
def bfs():
que=deque([])
que.append(0)
d[... | from collections import deque
n,m=map(int,input().split())
L=[[] for i in range(n)]
#print(L)
for i in range(m):
a,b=map(int,input().split())
L[a-1].append(b-1)
L[b-1].append(a-1)
#print(L)
d=[float('inf') for i in range(n)]
m=[0 for i in range(n)]
def bfs():
que=deque([])
que.append(0)
d[... | [
"call.add"
] | 401,097 | 401,098 | u901582103 | python |
p02678 | import collections
def main():
n, m = map(int, input().split())
g = [[] for i in range(m)]
for i in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
g[a].append(b)
g[b].append(a)
ans = solve(n, m, g)
if -1 in ans:
print('No')
else:
p... | import collections
def main():
n, m = map(int, input().split())
g = [[] for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
g[a].append(b)
g[b].append(a)
ans = solve(n, m, g)
if -1 in ans:
print('No')
else:
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,099 | 401,100 | u044459372 | python |
p02678 | from collections import defaultdict
import queue
N,M = map(int,input().split())
guide = {}
room = defaultdict(list)
for i in range(M):
a,b = map(int,input().split())
room[a].append(b)
room[b].append(a)
print(room)
q = queue.Queue()
for i in room[1]:
q.put(i)
guide[i] = 1
while not(q.empty()):... | from collections import defaultdict
import queue
N,M = map(int,input().split())
guide = {}
room = defaultdict(list)
for i in range(M):
a,b = map(int,input().split())
room[a].append(b)
room[b].append(a)
q = queue.Queue()
for i in room[1]:
q.put(i)
guide[i] = 1
while not(q.empty()):
x = q.g... | [
"call.remove",
"expression.operation.binary.remove"
] | 401,103 | 401,104 | u426175055 | python |
p02678 | from collections import deque
N,M=map(int,input().split())
tree=[[0] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
tree[A-1].append(B-1)
tree[B-1].append(A-1)
dist = [-1]*N
que = deque([0])
dist[0] = 0
while que:
v = que.popleft()
d = dist[v]
for w in tree[v]:
if... | from collections import deque
N,M=map(int,input().split())
tree=[[0] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
tree[A-1].append(B-1)
tree[B-1].append(A-1)
dist = [-1]*N
que = deque([0])
dist[0] = 0
while que:
v = que.popleft()
d = dist[v]
for w in tree[v]:
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 401,110 | 401,111 | u703528810 | python |
p02678 | from collections import deque
N,M=map(int,input().split())
tree=[[0] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
tree[A-1].append(B-1)
tree[B-1].append(A-1)
dist = [-1]*N
que = deque([0])
dist[0] = 0
while que:
v = que.popleft()
d = dist[v]
for w in tree[v]:
if... | from collections import deque
N,M=map(int,input().split())
tree=[[0] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
tree[A-1].append(B-1)
tree[B-1].append(A-1)
dist = [-1]*N
que = deque([0])
dist[0] = 0
while que:
v = que.popleft()
d = dist[v]
for w in tree[v]:
if... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 401,112 | 401,111 | u703528810 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
G = [[] for _ in range(n+1)]
par = [0] * (n+1)
for _ in range(m):
x, y = map(int, input().split())
G[x].append(y)
G[y].append(x)
print(G)
visited = [0] + [1] + [0] * (n-1)
q = deque()
q.append(1)
while q:
now = q.popleft()
#print("now:... | from collections import deque
n, m = map(int, input().split())
G = [[] for _ in range(n+1)]
par = [0] * (n+1)
for _ in range(m):
x, y = map(int, input().split())
G[x].append(y)
G[y].append(x)
visited = [0] + [1] + [0] * (n-1)
q = deque()
q.append(1)
while q:
now = q.popleft()
#print("now:", now)
... | [
"call.remove"
] | 401,121 | 401,122 | u135847648 | python |
p02678 | N, M = map(int, input().split())
A = []
B = []
pt = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -=1
b -=1
pt[a].append(b)
pt[b].append(a)
n=N
res_list = [-1] * N
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
while q:
q1=[]
for i in q:
for j ... | N, M = map(int, input().split())
A = []
B = []
pt = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -=1
b -=1
pt[a].append(b)
pt[b].append(a)
n=N
res_list = [-1] * N
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
while q:
q1=[]
for i in q:
for j ... | [
"call.remove"
] | 401,125 | 401,126 | u377158682 | python |
p02678 | N, M = map(int, input().split())
A = []
B = []
pt = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -=1
b -=1
pt[a].append(b)
pt[b].append(a)
n=M
res_list = [-1] * N
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
while q:
q1=[]
for i in q:
for j ... | N, M = map(int, input().split())
A = []
B = []
pt = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -=1
b -=1
pt[a].append(b)
pt[b].append(a)
n=N
res_list = [-1] * N
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
while q:
q1=[]
for i in q:
for j ... | [
"assignment.value.change",
"identifier.change"
] | 401,127 | 401,126 | u377158682 | python |
p02678 | N, M = map(int, input().split())
A = []
B = []
pt = [[] for i in range(M)]
for i in range(M):
a, b = map(int, input().split())
a -=1
b -=1
pt[a].append(b)
pt[b].append(a)
n=M
res_list = [-1] * N
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
while q:
q1=[]
for i in q:
for j ... | N, M = map(int, input().split())
A = []
B = []
pt = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -=1
b -=1
pt[a].append(b)
pt[b].append(a)
n=N
res_list = [-1] * N
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
while q:
q1=[]
for i in q:
for j ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,128 | 401,126 | u377158682 | python |
p02678 | n, m = map(int ,input().split())
adj = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
a-=1
b-=1
adj[a].append(b)
adj[b].append(a)
from collections import deque
q = deque()
dist = [-1] * n
ans = [0] * n
q.append(0)
while len(q) != 0:
now = q.popleft()
for to i... | n, m = map(int ,input().split())
adj = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a-=1
b-=1
adj[a].append(b)
adj[b].append(a)
from collections import deque
q = deque()
dist = [-1] * n
ans = [0] * n
q.append(0)
while len(q) != 0:
now = q.popleft()
for to i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,131 | 401,132 | u119982001 | python |
p02678 | n, m = map(int, input().split())
adj = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
adj[a].append(b)
adj[b].append(a)
from collections import deque
q = deque()
dist = [-1]*n
ans = [0]*n
q.append(0)
while len(q) != 0:
now = q.popleft()
for to i... | n, m = map(int ,input().split())
adj = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a-=1
b-=1
adj[a].append(b)
adj[b].append(a)
from collections import deque
q = deque()
dist = [-1] * n
ans = [0] * n
q.append(0)
while len(q) != 0:
now = q.popleft()
for to i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,133 | 401,132 | u119982001 | python |
p02678 | import itertools
import math
import fractions
import functools
import copy
from collections import deque
n, m = map(int, input().split())
ab = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
ab[a-1].append(b-1)
ab[b-1].append(a-1)
ans = [-1] * n
d = deque([0])
while d:
f = ... | import itertools
import math
import fractions
import functools
import copy
from collections import deque
n, m = map(int, input().split())
ab = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
ab[a-1].append(b-1)
ab[b-1].append(a-1)
ans = [-1] * n
d = deque([0])
while d:
f = ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,149 | 401,150 | u671060652 | python |
p02678 | import itertools
import math
import fractions
import functools
import copy
from collections import deque
n, m = map(int, input().split())
g = [[] for i in range(n)]
for i in range(m):
a,b = map(int, input().split())
a -= 1
b -= 1
g[a].append(b)
g[b].append(a)
print(g)
a = [-1]*n
d = deque([0])
whi... | import itertools
import math
import fractions
import functools
import copy
from collections import deque
n, m = map(int, input().split())
g = [[] for i in range(n)]
for i in range(m):
a,b = map(int, input().split())
a -= 1
b -= 1
g[a].append(b)
g[b].append(a)
a = [-1]*n
d = deque([0])
while d:
... | [
"call.remove"
] | 401,151 | 401,152 | u671060652 | python |
p02678 | import sys
from collections import deque
import time
input = sys.stdin.readline
n, m = map(int, input().split())
path = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
path[a].append(b)
path[b].append(a)
ans = [0] * (n+1)
alr = [0] * (n+1)
que = deque([1])
while len(que) > 0... | import sys
from collections import deque
import time
input = sys.stdin.readline
n, m = map(int, input().split())
path = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
path[a].append(b)
path[b].append(a)
ans = [0] * (n+1)
alr = [0] * (n+1)
que = deque([1])
while len(que) > 0... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 401,153 | 401,154 | u428132025 | python |
p02678 | import sys
import os
from collections import deque
def file_input():
f = open('ABC168/input.txt', 'r')
sys.stdin = f
def main():
if os.getenv("ENV")=='LOCAL':
file_input()
N,M=map(int, input().split())
r={}
for i in range(M):
A,B=map(int, input().split())
# print("A:"+... | import sys
import os
from collections import deque
def file_input():
f = open('ABC168/input.txt', 'r')
sys.stdin = f
def main():
if os.getenv("ENV")=='LOCAL':
file_input()
N,M=map(int, input().split())
r={}
for i in range(M):
A,B=map(int, input().split())
# print("A:"+... | [
"call.add"
] | 401,160 | 401,161 | u077003677 | python |
p02678 | def function():
N,M = map(int, input().split())
paths = []
for _m in range(M+1):
paths.append([])
for _m in range(M):
A,B = map(int, input().split())
paths[A].append(B)
paths[B].append(A)
dist = [-1]*(N+1)
dist[1] = 0
pre = [-1]*(N+1)
q = [1]... | def function():
N,M = map(int, input().split())
paths = []
for _ in range(N+1):
paths.append([])
for _m in range(M):
A,B = map(int, input().split())
paths[A].append(B)
paths[B].append(A)
dist = [-1]*(N+1)
dist[1] = 0
pre = [-1]*(N+1)
q = [1] # 1か... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,162 | 401,163 | u696499790 | python |
p02678 | def function():
N,M = map(int, input().split())
paths = []
for _m in range(M+1):
paths.append([])
for _m in range(M):
A,B = map(int, input().split())
paths[A].append(B)
paths[B].append(A)
dist = [-1]*(N+1)
dist[1] = 0
pre = [-1]*(N+1)
q = [1]... | def function():
N,M = map(int, input().split())
paths = []
for _ in range(N+1):
paths.append([])
for _m in range(M):
A,B = map(int, input().split())
paths[A].append(B)
paths[B].append(A)
dist = [-1]*(N+1)
dist[1] = 0
pre = [-1]*(N+1)
q = [1] # 1か... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,164 | 401,163 | u696499790 | python |
p02678 | # input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
import math
import sys
import bisect
import heapq # 優先度付きキュー(最小値取り出し)
from collections import deque
inf = 10 ** 15
mod = 10 ** 9 + 7
n, m = map(int, input().split())
# 幅優先？
ans = [-1 for i in range(n)] # i+1番目の部屋にある道しるべ
visited = ... | # input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
import math
import sys
import bisect
import heapq # 優先度付きキュー(最小値取り出し)
from collections import deque
inf = 10 ** 15
mod = 10 ** 9 + 7
n, m = map(int, input().split())
# 幅優先？
ans = [-1 for i in range(n)] # i+1番目の部屋にある道しるべ
visited = ... | [
"assignment.value.change",
"identifier.change"
] | 401,165 | 401,166 | u873190923 | python |
p02678 | from collections import deque
def main():
N,M = map(int, input().split())
r = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
r[a-1].append(b-1)
r[b-1].append(a-1)
print(r)
p=[-1]*N
q=deque([0])
while q:
i=q.popleft()
for j... | from collections import deque
def main():
N,M = map(int, input().split())
r = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
r[a-1].append(b-1)
r[b-1].append(a-1)
p=[-1]*N
q=deque([0])
while q:
i=q.popleft()
for j in r[i]:
... | [
"call.remove"
] | 401,169 | 401,170 | u452885705 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
u = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
u[a].append(b)
u[b].append(a)
q = deque([0])
ans = [-1] * n
count = 0
while len(q):
p = q.popleft()
for x in u[p]:
if ans[x... | from collections import deque
n, m = map(int, input().split())
u = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
u[a].append(b)
u[b].append(a)
q = deque([0])
ans = [-1] * n
count = 0
while len(q):
p = q.popleft()
for x in u[p]:
if ans[x... | [
"call.remove"
] | 401,171 | 401,172 | u955125992 | python |
p02678 | n,m=map(int,input().split())
d={}
for i in range(m):
x,y=map(int,input().split())
if x in d:
d[x].append(y)
else:
d[x]=[y]
if y in d:
d[y].append(x)
else:
d[y]=[x]
parent=[0]*(n+1)
bfs=[1]
visited=set([1])
while len(bfs)!=0:
x=bfs.pop(0)
visited.add(x)
for i in d[x]:
if i not in visited:
bfs.appen... | n,m=map(int,input().split())
d={}
for i in range(m):
x,y=map(int,input().split())
if x in d:
d[x].append(y)
else:
d[x]=[y]
if y in d:
d[y].append(x)
else:
d[y]=[x]
parent=[0]*(n+1)
bfs=[1]
visited=set([1])
while len(bfs)!=0:
x=bfs.pop(0)
visited.add(x)
for i in d[x]:
if i not in visited:
bfs.appen... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 401,179 | 401,180 | u578464015 | python |
p02678 | N,M = map(int,input().split()) #n:頂点数 w:辺の数
way = [[] for i in range(M)]
depth = [float("inf") for i in range(N)]
visited = [False for i in range(N)]
que=[0]
for i in range(M):
x,y = map(int,input().split())
way[x-1].append(y-1)
way[y-1].append(x-1)
for i in que:
for j in way[i]:
if visited[j]:
... | N,M = map(int,input().split()) #n:頂点数 w:辺の数
way = [[] for i in range(N)]
depth = [float("inf") for i in range(N)]
visited = [False for i in range(N)]
que=[0]
for i in range(M):
x,y = map(int,input().split())
way[x-1].append(y-1)
way[y-1].append(x-1)
for i in que:
for j in way[i]:
if visited[j]:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,195 | 401,196 | u821251381 | python |
p02678 | from collections import deque
n,m = list(map(int,input().split()))
e = [[] for _ in range(m+1)]
for i in range(m):
a,b = list(map(int,input().split()))
e[a].append(b)
e[b].append(a)
q = deque()
q.append(1)
t = [-1 for _ in range(n+1)]
while len(q):
node = q.popleft()
for i in range(len(e[node]))... | from collections import deque
n,m = list(map(int,input().split()))
e = [[] for _ in range(n+1)]
for i in range(m):
a,b = list(map(int,input().split()))
e[a].append(b)
e[b].append(a)
q = deque()
q.append(1)
t = [-1 for _ in range(n+1)]
while len(q):
node = q.popleft()
for i in range(len(e[node]))... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,202 | 401,203 | u049679412 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
edges=[[] for _ in range(n)]#[[１番目の部屋からいける部屋],[２番目の部屋からいける部屋]...]
for _ in range(m):
a,b=map(int,input().split())
edges[a-1].append(b-1)
edges[b-1].append(a-1)
todo=deque([0,0])
seen=[-1]*n
seen[0]=0
while todo:
node,parent=todo.popleft()#現... | from collections import deque
n,m=map(int,input().split())
edges=[[] for _ in range(n)]#[[１番目の部屋からいける部屋],[２番目の部屋からいける部屋]...]
for _ in range(m):
a,b=map(int,input().split())
edges[a-1].append(b-1)
edges[b-1].append(a-1)
todo=deque([[0,0]])
seen=[-1]*n
seen[0]=0
while todo:
node,parent=todo.popleft()... | [
"call.arguments.change"
] | 401,204 | 401,205 | u842964692 | python |
p02678 | import queue
N, M = map(int, input().split())
adj = [[] for i in range(N+1)]
parent = [-1] * (N+1)
for m in range(N):
a, b = map(int, input().split())
adj[a].append(b)
adj[b].append(a)
q = queue.Queue()
q.put((1,0))
while(not q.empty()):
x, p = q.get()
if parent[x] != -1:
continue
paren... | import queue
N,M = map(int,input().split())
adj = [[]for i in range(N+1)]
parent = [-1] * (N+1) # -1なら未訪問
for m in range(M):
a,b = map(int,input().split())
adj[a].append(b)
adj[b].append(a)
q = queue.Queue() # 自分の部屋番号、親の部屋番号
q.put((1,0)) # 部屋1の親は部屋0と考える
while(not q.empty()):
x, p = q.get()
if parent... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.string.change",
"io.output.change"
] | 401,232 | 401,233 | u551437236 | python |
p02678 | import queue
N, M = map(int, input().split())
adj = [[] for i in range(N+1)]
parent = [-1] * (N+1)
for m in range(N):
a, b = mpa(int, input().split())
adj[a].append(b)
adj[b].append(a)
q = queue.Queue()
q.put((1,0))
while(not q.empty()):
x, p = q.get()
if parent[x] != -1:
continue
paren... | import queue
N,M = map(int,input().split())
adj = [[]for i in range(N+1)]
parent = [-1] * (N+1) # -1なら未訪問
for m in range(M):
a,b = map(int,input().split())
adj[a].append(b)
adj[b].append(a)
q = queue.Queue() # 自分の部屋番号、親の部屋番号
q.put((1,0)) # 部屋1の親は部屋0と考える
while(not q.empty()):
x, p = q.get()
if parent... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change",
"call.function.change",
"literal.string.change",
"io.output.change"
] | 401,234 | 401,233 | u551437236 | python |
p02678 | n,m=map(int,input().split())
r=[[] for x in range(n)]
for c in range(m):
a,b=map(int,input().split())
r[a-1].append(b-1)
r[b-1].append(a-1)
s=[-1]*n
u=[0]
k=1
for c in range(10**5):
v=[]
for d in u:
for e in r[d]:
if s[e]==-1:
s[e]=d
k+=1
... | n,m=map(int,input().split())
r=[[] for x in range(n)]
for c in range(m):
a,b=map(int,input().split())
r[a-1].append(b-1)
r[b-1].append(a-1)
s=[-1]*n
s[0]=0
u=[0]
k=1
for c in range(10**5):
v=[]
for d in u:
for e in r[d]:
if s[e]==-1:
s[e]=d
k+=1
... | [
"assignment.add"
] | 401,235 | 401,236 | u631299617 | python |
p02678 | n,m=map(int,input().split())
g=[[] for x in range(n)]
for c in range(M):
a,b= map(int,input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
ans_list=[-1]*n
queue=[0]
while queue:
qi=queue.pop(0)
for gi in g[qi]:
if ans_list[gi]==-1:
queue.append(gi)
ans_list[gi]=q... | n,m=map(int,input().split())
g=[[] for x in range(n)]
for c in range(m):
a,b= map(int,input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
ans_list=[-1]*n
queue=[0]
while queue:
qi=queue.pop(0)
for gi in g[qi]:
if ans_list[gi]==-1:
queue.append(gi)
ans_list[gi]=q... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,239 | 401,240 | u631299617 | python |
p02678 | import queue
INF = float('inf')
def bfs():
q = queue.Queue()
[q.put([x, 0]) for x in graph[0]]
while not q.empty():
n = q.get()
nex = n[0]; now = n[1]
if visited[nex] == INF:
visited[nex] = now
[q.put([x, nex]) for x in graph[nex]]
return
N, M = map(int,... | import queue
INF = float('inf')
def bfs():
q = queue.Queue()
[q.put([x, 0]) for x in graph[0]]
while not q.empty():
n = q.get()
nex = n[0]; now = n[1]
if visited[nex] == INF:
visited[nex] = now
[q.put([x, nex]) for x in graph[nex]]
return
N, M = map(int,... | [
"call.add"
] | 401,241 | 401,242 | u707808519 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
l =[[] for _ in range(N)]
q=deque([0])
TFl=[0]*N
TFl[0]=1
ml=[-1]*N
for i in range(M):
A,B=map(int,input().split())
l[B-1].append(A-1)
l[A-1].append(B-1)
while q:
p = q.popleft()
for i in l[p]: #普通に1行ずつ回してるイメージ
if TFl[i]==1:
continu... | from collections import deque
N, M = map(int, input().split())
l =[[] for _ in range(N)]
q=deque([0])
TFl=[0]*N
TFl[0]=1
ml=[-1]*N
for i in range(M):
A,B=map(int,input().split())
l[B-1].append(A-1)
l[A-1].append(B-1)
while q:
p = q.popleft()
for i in l[p]: #普通に1行ずつ回してるイメージ
if TFl[i]==1:
continu... | [] | 401,243 | 401,244 | u444481227 | python |
p02678 | # abc168 D
from collections import deque
def bfs(graph, N, start):
visited = [-1] * N
visited[start] = 0
que = deque([start])
while que:
node = que.popleft()
for n in graph[node]:
if visited[n] == -1:
visited[n] = node
que.append(n)
print(... | # abc168 D
from collections import deque
def bfs(graph, N, start):
visited = [-1] * N
visited[start] = 0
que = deque([start])
while que:
node = que.popleft()
for n in graph[node]:
if visited[n] == -1:
visited[n] = node
que.append(n)
return... | [
"call.remove"
] | 401,251 | 401,252 | u676933207 | python |
p02678 | from collections import deque
class Node:
def __init__(self, data):
self.data = data
self.children = []
def main():
N, M = map(int, input().split())
dic = {}
for i in range(1, N + 1):
dic[i] = Node(i)
for i in range(0, M):
A, B = map(int, input().split())
di... | from collections import deque
class Node:
def __init__(self, data):
self.data = data
self.children = []
def main():
N, M = map(int, input().split())
dic = {}
for i in range(1, N + 1):
dic[i] = Node(i)
for i in range(0, M):
A, B = map(int, input().split())
di... | [
"assignment.value.change",
"identifier.change"
] | 401,259 | 401,260 | u278955646 | python |
p02678 | from collections import deque
class Node:
def __init__(self, data):
self.data = data
self.children = []
def main():
N, M = map(int, input().split())
dic = {}
for i in range(1, N + 1):
dic[i] = Node(i)
for i in range(0, M):
A, B = map(int, input().split())
di... | from collections import deque
class Node:
def __init__(self, data):
self.data = data
self.children = []
def main():
N, M = map(int, input().split())
dic = {}
for i in range(1, N + 1):
dic[i] = Node(i)
for i in range(0, M):
A, B = map(int, input().split())
di... | [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 401,261 | 401,260 | u278955646 | python |
p02678 | def bfs(graph, start, rooms):
queue = []
visited = [False]*rooms
visited[start] = True
marking = [0]*rooms
queue.append(start)
while queue:
nodes = queue.pop()
for node in graph[nodes]:
if not visited[node]:
visited[node] = True
queue.a... | import pdb
def bfs(graph, start, rooms):
queue = []
visited = [False]*rooms
visited[start] = True
marking = [0]*rooms
queue.append(start)
while queue:
nodes = queue.pop(0)
for node in graph[nodes]:
if not visited[node]:
visited[node] = True
... | [
"call.arguments.change"
] | 401,262 | 401,263 | u701893485 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
graph = [[] for _ in range(n + 1)]
for i in range(m):
a = ab[i][0]
b = ab[i][1]
graph[a].append(b)
graph[b].append(a)
inf = 100100100
ans = [[inf, inf] for _ in range(n + 1)]
ans[0]... | from collections import deque
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
graph = [[] for _ in range(n + 1)]
for i in range(m):
a = ab[i][0]
b = ab[i][1]
graph[a].append(b)
graph[b].append(a)
inf = 100100100
ans = [[inf, inf] for _ in range(n + 1)]
ans[0]... | [
"call.add"
] | 401,272 | 401,273 | u811436126 | python |
p02678 | from collections import deque
def main():
n,m = map(int,input().split())
arr = [[] for i in range(n)]
for _ in range(m):
a,b = map(int,input().split())
arr[a-1].append(b-1)
arr[b-1].append(a-1)
q = deque()
q.append(0)
ans = [-1] * n
ans[0] = 0
while q:
no... | from collections import deque
def main():
n,m = map(int,input().split())
arr = [[] for i in range(n)]
for _ in range(m):
a,b = map(int,input().split())
arr[a-1].append(b-1)
arr[b-1].append(a-1)
q = deque()
q.append(0)
ans = [-1] * n
ans[0] = 0
while q:
no... | [
"identifier.change"
] | 401,274 | 401,275 | u425317134 | python |
p02678 | from collections import deque
# print('input >>')
N, M = map(int,(input().split()))
ABs = [map(int,(input().split())) for _ in range(M)]
INF = 10 ** 10
ds = [INF] * (N+1)
marks = [0] * (N+1)
nodes = [None] * (N+1)
for AB in ABs:
A, B = AB
if nodes[A] is None:
nodes[A] = []
nodes[A].append(B)
... | from collections import deque
# print('input >>')
N, M = map(int,(input().split()))
ABs = [map(int,(input().split())) for _ in range(M)]
INF = 10 ** 10
ds = [INF] * (N+1)
marks = [0] * (N+1)
nodes = [None] * (N+1)
for AB in ABs:
A, B = AB
if nodes[A] is None:
nodes[A] = []
nodes[A].append(B)
... | [
"call.add"
] | 401,280 | 401,281 | u657994700 | python |
p02678 | from collections import deque
N,M=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(M)]
graph=[[]for i in range(N+1)]
for i in range(M):
u,v=A[i]
graph[u].append(v)
graph[v].append(u)
stack=deque([1])
visited=[-1 for i in range(N+1)]
visited2=[-1 for i in range(N+1)]
visited[1... | from collections import deque
N,M=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(M)]
graph=[[]for i in range(N+1)]
for i in range(M):
u,v=A[i]
graph[u].append(v)
graph[v].append(u)
stack=deque([1])
visited=[-1 for i in range(N+1)]
visited2=[-1 for i in range(N+1)]
visited[1... | [
"identifier.change"
] | 401,297 | 401,298 | u857547702 | python |
p02678 | from collections import deque
N,M=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(M)]
graph=[[]for i in range(N+1)]
for i in range(N):
u,v=A[i]
graph[u].append(v)
graph[v].append(u)
stack=deque([1])
visited=[-1 for i in range(N+1)]
visited2=[-1 for i in range(N+1)]
visited[1... | from collections import deque
N,M=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(M)]
graph=[[]for i in range(N+1)]
for i in range(M):
u,v=A[i]
graph[u].append(v)
graph[v].append(u)
stack=deque([1])
visited=[-1 for i in range(N+1)]
visited2=[-1 for i in range(N+1)]
visited[1... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,299 | 401,298 | u857547702 | python |
p02678 | from collections import deque
N,M=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(M)]
graph=[[]for i in range(N+1)]
for i in range(N):
u,v=A[i]
graph[u].append(v)
graph[v].append(u)
stack=deque([1])
visited=[-1 for i in range(N+1)]
visited2=[-1 for i in range(N+1)]
visited[1... | from collections import deque
N,M=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(M)]
graph=[[]for i in range(N+1)]
for i in range(M):
u,v=A[i]
graph[u].append(v)
graph[v].append(u)
stack=deque([1])
visited=[-1 for i in range(N+1)]
visited2=[-1 for i in range(N+1)]
visited[1... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,300 | 401,298 | u857547702 | python |
p02678 | N, M = map(int, input().split())
e = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
e[a-1].append(b-1)
e[b-1].append(a-1)
visited = [0]*N
visited[0] = 1
que = [0]
while que:
x = que.pop()
for i in e[x]:
if visited[i] == 0:
visited[i] = x+1
... | N, M = map(int, input().split())
e = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
e[a-1].append(b-1)
e[b-1].append(a-1)
visited = [0]*N
visited[0] = 1
que = [0]
while que:
x = que.pop(0)
for i in e[x]:
if visited[i] == 0:
visited[i] = x+1
... | [
"call.arguments.change"
] | 401,307 | 401,308 | u518085378 | python |
p02678 | from collections import deque
N,M=map(int,input().split())
arr=[[] for n in range(N)]
que=deque([1])
for m in range(M):
a,b=map(int,input().split())
arr[a-1].append(b)
arr[b-1].append(a)
dist=[-1]*N
dist[0]=0
arr2=[0]*(N-1)
print("Yes")
while que:
c=que.popleft()
for i in arr[c-1]:
if dist[i-1]!=-1:
... | from collections import deque
N,M=map(int,input().split())
arr=[[] for n in range(N)]
que=deque([1])
for m in range(M):
a,b=map(int,input().split())
arr[a-1].append(b)
arr[b-1].append(a)
dist=[-1]*N
dist[0]=0
arr2=[0]*(N-1)
print("Yes")
while que:
c=que.popleft()
for i in arr[c-1]:
if dist[i-1]!=-1:
... | [
"call.remove"
] | 401,311 | 401,312 | u721407235 | python |
p02678 | import collections
N, M = map(int, input().split())
G = [[] for i in range(N)]
for i in range(N):
a, b = map(int, input().split())
G[b-1].append(a-1)
G[a-1].append(b-1)
queue = collections.deque([0])
visited = [0]*N
visited[0] = 1
while queue:
x = queue.popleft()
for i in G[x]:
if visited... | import collections
N, M = map(int, input().split())
G = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
G[b-1].append(a-1)
G[a-1].append(b-1)
queue = collections.deque([0])
visited = [0]*N
visited[0] = 1
while queue:
x = queue.popleft()
for i in G[x]:
if visited... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,321 | 401,322 | u686036872 | python |
p02678 | import math
from collections import deque
n,m=[int(_) for _ in input().split()]
A=[[int(_) for _ in input().split()] for l in range(m)]
R=deque([] for _ in range(n))
for a in A:
R[a[0]-1].append(a[1]-1)
R[a[1]-1].append(a[0]-1)
print("Yes")
Dis=deque([100000000]*n)
Dis[0]=0
PP=deque([0]*n)
l=deque()
l.append(0)... | import math
from collections import deque
n,m=[int(_) for _ in input().split()]
A=[[int(_) for _ in input().split()] for l in range(m)]
R=deque([] for _ in range(n))
for a in A:
R[a[0]-1].append(a[1]-1)
R[a[1]-1].append(a[0]-1)
print("Yes")
Dis=deque([100000000]*n)
Dis[0]=0
PP=deque([0]*n)
l=deque()
l.append(0)... | [
"assignment.value.change",
"identifier.change"
] | 401,326 | 401,327 | u535659144 | python |
p02678 | import math
from collections import deque
n,m=[int(_) for _ in input().split()]
A=[[int(_) for _ in input().split()] for l in range(m)]
R=deque([] for _ in range(n))
for a in A:
R[a[0]-1].append(a[1]-1)
R[a[1]-1].append(a[0]-1)
print("Yes")
Dis=deque([100000000]*n)
Dis[0]=0
PP=[0]*n
l=deque()
l.append(0)
while ... | import math
from collections import deque
n,m=[int(_) for _ in input().split()]
A=[[int(_) for _ in input().split()] for l in range(m)]
R=deque([] for _ in range(n))
for a in A:
R[a[0]-1].append(a[1]-1)
R[a[1]-1].append(a[0]-1)
print("Yes")
Dis=deque([100000000]*n)
Dis[0]=0
PP=deque([0]*n)
l=deque()
l.append(0)... | [
"call.add",
"call.arguments.change",
"assignment.value.change",
"identifier.change"
] | 401,328 | 401,327 | u535659144 | python |
p02678 | from collections import deque
n, m = map(int,input().split())
AB = [tuple(map(int, input().split())) for _ in range(m)]
def bfs(start):
queue = deque()
visited = [False] * n
visited[start-1] = True
queue.append(start)
while queue:
target = queue.popleft()
print(target)
for i... | from collections import deque
n, m = map(int,input().split())
AB = [tuple(map(int, input().split())) for _ in range(m)]
def bfs(start):
queue = deque()
visited = [False] * n
visited[start-1] = True
queue.append(start)
while queue:
target = queue.popleft()
for i in g[target]:
... | [
"call.remove"
] | 401,329 | 401,330 | u270144704 | python |
p02678 | from collections import deque
n,m = map(int,input().split())
graph = [[] for i in range(n)]
mark = [0]*n
for i in range(m):
a, b = map(int,input().split())
a -=1; b -=1
graph[a].append(b)
graph[b].append(a)
d = deque([0])
visited = [False]*n
visited[0] = True
while d:
v = d.popleft()
for i i... | from collections import deque
n,m = map(int,input().split())
graph = [[] for i in range(n)]
mark = [0]*n
for i in range(m):
a, b = map(int,input().split())
a -=1; b -=1
graph[a].append(b)
graph[b].append(a)
d = deque([0])
visited = [False]*n
visited[0] = True
while d:
v = d.popleft()
for i i... | [] | 401,331 | 401,332 | u130387509 | python |
p02678 | import collections
n,m=map(int,input().split())
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=map(int,input().split())
g[a].append(b)
g[b].append(a)
q=collections.deque()
q.append(1)
check=[0]*(n+1)
check[1]=1
ans=[0]*(n+1)
while len(q)!=0:
v=q.pop()
for u in g[v]:
if check[u]==0:
check[u]=1
... | import collections
n,m=map(int,input().split())
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=map(int,input().split())
g[a].append(b)
g[b].append(a)
q=collections.deque()
q.append(1)
check=[0]*(n+1)
check[1]=1
ans=[0]*(n+1)
while len(q)!=0:
v=q.popleft()
for u in g[v]:
if check[u]==0:
check[u]=... | [
"assignment.value.change",
"identifier.change"
] | 401,346 | 401,347 | u163320134 | python |
p02678 | import collections
n,m=map(int,input().split())
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=map(int,input().split())
g[a].append(b)
g[b].append(a)
ans=[[0,10**18] for _ in range(n+1)]
q=collections.deque()
q.append((1,0))
check=[0]*(n+1)
check[1]=1
while len(q)!=0:
v,d=q.pop()
for u in g[v]:
if ans... | import collections
n,m=map(int,input().split())
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=map(int,input().split())
g[a].append(b)
g[b].append(a)
ans=[[0,10**18] for _ in range(n+1)]
q=collections.deque()
q.append((1,0))
check=[0]*(n+1)
check[1]=1
while len(q)!=0:
v,d=q.popleft()
for u in g[v]:
if... | [
"assignment.value.change",
"identifier.change"
] | 401,348 | 401,349 | u163320134 | python |
p02678 | from collections import deque
import sys
sys.setrecursionlimit(10**6)
n,m=map(int,input().split())
d=deque()
l=[[] for _ in range(n)]
R=[-1]*(n+1)
R[1]=0
for _ in range(m):
x,y=tuple(map(int,input().split()))
l[x-1].append(y)
l[y-1].append(x)
def g(s):
for i in range(len(l[s-1])):
if R[l[s-1]... | from collections import deque
import sys
sys.setrecursionlimit(10**6)
n,m=map(int,input().split())
d=deque()
l=[[] for _ in range(n)]
R=[-1]*(n+1)
R[1]=0
for _ in range(m):
x,y=tuple(map(int,input().split()))
l[x-1].append(y)
l[y-1].append(x)
def g(s):
for i in range(len(l[s-1])):
if R[l[s-1]... | [
"call.add"
] | 401,351 | 401,352 | u263753244 | python |
p02678 | from collections import deque
# from math import factorial
import itertools
import collections
import math
import sys
sys.setrecursionlimit(2000000)
n, m = list(map(int, input().split()))
room = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
room[a-1].append(b-1)
room[b-1].... | from collections import deque
# from math import factorial
import itertools
import collections
import math
import sys
sys.setrecursionlimit(2000000)
n, m = list(map(int, input().split()))
room = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
room[a-1].append(b-1)
room[b-1].... | [
"call.remove"
] | 401,355 | 401,356 | u696444274 | python |
p02678 | from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
INF = 10 ** 10
# N個の部屋とM本の通路
N, M = [int(x) for x in stdin.readline().rstrip().split()]
route = [[] for _ in range(M+1)]
for _ in range(M):
A, B = [int(x) for x in stdin.readline().... | from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
INF = 10 ** 10
# N個の部屋とM本の通路
N, M = [int(x) for x in stdin.readline().rstrip().split()]
route = [[] for _ in range(N+1)]
for _ in range(M):
A, B = [int(x) for x in stdin.readline().... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,357 | 401,358 | u979667682 | python |
p02678 | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n,m = mi()
rt = [[] for i in range(n)]
srb = [None] * n
dk = [10**10]*n
for i in range(m):
a,b = mi()
rt[a-1].append(b-1)
rt[b-1].append(a-1)
from collections import deque
l = deque()
srb[0] ... | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n,m = mi()
rt = [[] for i in range(n)]
srb = [None] * n
dk = [10**10]*n
for i in range(m):
a,b = mi()
rt[a-1].append(b-1)
rt[b-1].append(a-1)
from collections import deque
l = deque()
srb[0] ... | [
"call.remove"
] | 401,361 | 401,362 | u117054186 | python |
p02678 | from collections import deque
import sys
input = sys.stdin.readline
N,M = map(int,input().split())
path = [[] for i in range(N)]
ans = [None for i in range(N)]
visited = [0 for i in range(N)]
for _ in range(M):
a,b = map(int,input().split())
a = a - 1
b = b - 1
path[a].append(b)
path[b].append(a)
print(p... | from collections import deque
import sys
input = sys.stdin.readline
N,M = map(int,input().split())
path = [[] for i in range(N)]
ans = [None for i in range(N)]
visited = [0 for i in range(N)]
for _ in range(M):
a,b = map(int,input().split())
a = a - 1
b = b - 1
path[a].append(b)
path[b].append(a)
def bfs... | [
"call.remove"
] | 401,363 | 401,364 | u993435350 | python |
p02678 | from collections import deque
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
adjacent_list = [[] for i in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
adjacent_list[a].append(b)
adjacent_list[b].append(a)
ans = [-1 for i in range(n+1)]
def bfs():
#start at 1
... | from collections import deque
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
adjacent_list = [[] for i in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
adjacent_list[a].append(b)
adjacent_list[b].append(a)
ans = [-1 for i in range(n+1)]
def bfs():
#start at 1
... | [
"call.remove"
] | 401,370 | 401,371 | u691896522 | python |
p02678 | from collections import deque
def bfs(graph, N, start):
visited = [0] * N
visited[start] = 1
que = deque([start])
while que:
node = que.popleft()
for n in graph[node]:
if not visited[n]:
visited[n] = node + 1
que.append(n)
return visited
N... | from collections import deque
def bfs(graph, N, start):
visited = [0] * N
visited[start] = 1
que = deque([start])
while que:
node = que.popleft()
for n in graph[node]:
if not visited[n]:
visited[n] = node + 1
que.append(n)
return visited
N... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,372 | 401,373 | u638282348 | python |
p02678 | import sys
from collections import defaultdict
class Graph:
def __init__(self):
global n
self.graph = defaultdict(list)
self.parent = [None for i in range(0,n+1)]
def addEdge(self,u,v):
self.graph[u].append(v)
def BFS(self, s):
visited = [False] * (len(sel... | import sys
from collections import defaultdict
class Graph:
def __init__(self):
global n
self.graph = defaultdict(list)
self.parent = [None for i in range(0,n+1)]
def addEdge(self,u,v):
self.graph[u].append(v)
def BFS(self, s):
visited = [False] * (len(sel... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 401,389 | 401,390 | u720453974 | python |
p02678 | N,M = map(int,input().split())
V = [[] for _ in range(M)]
for _ in range(M):
a,b = map(int,input().split())
a = a-1
b = b-1
V[a].append(b)
V[b].append(a)
from collections import deque
q = deque([0])
ans = [-1]*N
ans[0] = 0
while q:
v = q.popleft()
for nv in V[v]:
if ans[nv] == ... | N,M = map(int,input().split())
V = [[] for _ in range(N)]
for _ in range(M):
a,b = map(int,input().split())
a = a-1
b = b-1
V[a].append(b)
V[b].append(a)
from collections import deque
q = deque([0])
ans = [-1]*N
ans[0] = 0
while q:
v = q.popleft()
for nv in V[v]:
if ans[nv] == ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,393 | 401,394 | u446774692 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
graph = [[] for i in range(N+1)]
ans = [0] * (N+1)
for i in range(M):
f, t = map(int, input().split())
graph[f].append(t)
graph[t].append(f)
D = deque([1])
checked = [0] * (N+1)
checked[0] = 1
checked[1] = 1
while D:
n = D.popleft()
for... | from collections import deque
N, M = map(int, input().split())
graph = [[] for i in range(N+1)]
ans = [0] * (N+1)
for i in range(M):
f, t = map(int, input().split())
graph[f].append(t)
graph[t].append(f)
D = deque([1])
checked = [0] * (N+1)
checked[0] = 1
checked[1] = 1
while D:
n = D.popleft()
for... | [
"call.add"
] | 401,398 | 401,399 | u613350811 | python |
p02678 | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in... | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in... | [
"call.add"
] | 401,406 | 401,407 | u638902622 | python |
p02678 | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | [
"control_flow.loop.condition.change"
] | 401,408 | 401,409 | u360061665 | python |
p02678 | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | [
"call.add",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 401,408 | 401,410 | u360061665 | python |
p02678 | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | [
"call.remove",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 401,413 | 401,412 | u360061665 | python |
p02678 | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | import sys
import itertools
import numpy as np
from collections import Counter
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split(' '))
G = [[] for _ in range(N+1)]
ans = [0]*(N+1)
count = 0
for i in range(M):
A, B = m... | [
"call.remove"
] | 401,414 | 401,412 | u360061665 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
graph = [[] for i in range(M)]
for i in range(M):
a, b = map(int, input().split())
a, b = a-1, b-1
graph[a].append(b)
graph[b].append(a)
dist = [-1] * N
dist[0] = 0
queue = deque([0])
while queue:
v = queue.popleft()
for ... | from collections import deque
N, M = map(int, input().split())
graph = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a, b = a-1, b-1
graph[a].append(b)
graph[b].append(a)
dist = [-1] * N
dist[0] = 0
queue = deque([0])
while queue:
v = queue.popleft()
for ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,415 | 401,416 | u970107703 | python |
p02678 | # -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
import queue
def main():
N, M = map(int, input().split())
connedted_room_list = [ [] for i in range(M)]
for i in range(M):
A, B = map(int, input().split())
connedted_room_list[A-1].append(B-1)
connedted_room_list[B-1].append(A-1)
... | # -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
import queue
def main():
N, M = map(int, input().split())
connedted_room_list = [ [] for i in range(N)] # ここでNとMを書き間違えていた。
for i in range(M):
A, B = map(int, input().split())
connedted_room_list[A-1].append(B-1)
connedted_room_lis... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,417 | 401,418 | u463864151 | python |
p02678 | #d
n,m=map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
maze = []
inf = 9999999
dist = [inf]* n
dist[0] = 0
queue = []
answer = [0]*n
goto = [[] * 1 for i in range(n)]
for i in range(len(ab)):
goto[ab[i][0]-1].append(ab[i][1]-1)
goto[ab[i][1]-1].append(ab[i][0]-1)
queue.exten... | #d
n,m=map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
maze = []
inf = 9999999
dist = [inf]* n
dist[0] = 0
queue = []
answer = [0]*n
goto = [[] * 1 for i in range(n)]
for i in range(len(ab)):
goto[ab[i][0]-1].append(ab[i][1]-1)
goto[ab[i][1]-1].append(ab[i][0]-1)
queue.exten... | [
"call.arguments.change"
] | 401,419 | 401,420 | u941645670 | python |
p02678 | #d
m,n=map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
maze = []
inf = 9999999
dist = [inf]* n
dist[0] = 0
queue = []
answer = [0]*n
goto = [[] * 1 for i in range(n)]
for i in range(len(ab)):
goto[ab[i][0]-1].append(ab[i][1]-1)
goto[ab[i][1]-1].append(ab[i][0]-1)
queue.exten... | #d
n,m=map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
maze = []
inf = 9999999
dist = [inf]* n
dist[0] = 0
queue = []
answer = [0]*n
goto = [[] * 1 for i in range(n)]
for i in range(len(ab)):
goto[ab[i][0]-1].append(ab[i][1]-1)
goto[ab[i][1]-1].append(ab[i][0]-1)
queue.exten... | [
"call.arguments.change"
] | 401,421 | 401,420 | u941645670 | python |
p02678 | import collections
INF = float('inf')
N, M = list(map(int, input().split()))
d = {i: [] for i in range(N)}
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a].append(b)
d[b].append(a)
queue = collections.deque()
queue.append((0, 0))
results = {i: (INF, -1) for i in range... | import collections
INF = float('inf')
N, M = list(map(int, input().split()))
d = {i: [] for i in range(N)}
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a].append(b)
d[b].append(a)
queue = collections.deque()
queue.append((0, 0))
results = {i: (INF, -1) for i in range... | [
"identifier.change"
] | 401,426 | 401,427 | u873904588 | python |
p02678 | n,m = map(int,input().split())
d = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = [-1]*n
ans[0] = 0
from collections import deque
q = deque([0])
while q:
u = q.popleft()
for v in d[u]:
if ans[v]==-1:
ans[v] = ... | n,m = map(int,input().split())
d = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = [-1]*n
ans[0] = 0
from collections import deque
q = deque([0])
while q:
u = q.popleft()
for v in d[u]:
if ans[v]==-1:
ans[v] = ... | [
"expression.operation.binary.add"
] | 401,439 | 401,440 | u145950990 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
a = []
b = [[] for _ in range(m)]
for i in range(m):
a.append(list(map(int, input().split())))
for i in range(m):
b[a[i][0]-1].append(a[i][1])
b[a[i][1]-1].append(a[i][0])
seen = [-1]*n
seen[0] = 1
que = deque([1])
while que:
v = qu... | from collections import deque
n, m = map(int, input().split())
a = []
b = [[] for _ in range(n)]
for i in range(m):
a.append(list(map(int, input().split())))
for i in range(m):
b[a[i][0]-1].append(a[i][1])
b[a[i][1]-1].append(a[i][0])
seen = [-1]*n
seen[0] = 1
que = deque([1])
while que:
v = qu... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,447 | 401,448 | u566159623 | python |
p02678 | # D
import sys
input = sys.stdin.readline
from collections import deque
N,M=map(int,input().split())
AL=[[] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
AL[A-1].append(B-1)
AL[B-1].append(A-1)
Q=deque([[0,-1]]) # [今いるindex,前のindex]
ANS=[-1 for _ in range(N)] # 答え
ANS[0]=1
TF=[0 for _... | import sys
input = sys.stdin.readline
from collections import deque
N,M=map(int,input().split())
AL=[[] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
AL[A-1].append(B-1)
AL[B-1].append(A-1)
Q=deque([[0,-1]]) # [今いるindex,前のindex]
ANS=[-1 for _ in range(N)] # 答え
ANS[0]=1
TF=[0 for _ in ... | [
"call.remove"
] | 401,461 | 401,462 | u202570162 | python |
p02678 | import sys
input = sys.stdin.readline
from collections import deque
N,M=map(int,input().split())
AL=[[] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
AL[A-1].append(B-1)
AL[B-1].append(A-1)
Q=deque([[0,-1]]) # [今いるindex,前のindex]
ANS=[-1 for _ in range(N)] # 答え
ANS[0]=1
TF=[0 for _ in ... | import sys
input = sys.stdin.readline
from collections import deque
N,M=map(int,input().split())
AL=[[] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
AL[A-1].append(B-1)
AL[B-1].append(A-1)
Q=deque([[0,-1]]) # [今いるindex,前のindex]
ANS=[-1 for _ in range(N)] # 答え
ANS[0]=1
TF=[0 for _ in ... | [
"call.remove"
] | 401,463 | 401,462 | u202570162 | python |
p02678 | from collections import deque
N, M = [int(s) for s in input().split()]
edge = [[int(s) - 1 for s in input().split()] for _ in range(M)]
graph = [[] for _ in range(M)]
for i, j in edge:
graph[i].append(j)
graph[j].append(i)
dq = deque([0])
visited = [False] * N
visited[0] = True
parent = [0]*N
while(dq):
s... | from collections import deque
N, M = [int(s) for s in input().split()]
edge = [[int(s) - 1 for s in input().split()] for _ in range(M)]
graph = [[] for _ in range(N)]
for i, j in edge:
graph[i].append(j)
graph[j].append(i)
dq = deque([0])
visited = [False] * N
visited[0] = True
parent = [0]*N
while(dq):
s... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,474 | 401,475 | u692054751 | python |
p02678 | from collections import deque
inf = 10 ** 7
N, M = map(int, input().split())
P = [list(map(int,input().split())) for i in range(M)]
a = [[] for i in range(N)]
for i in P:
a[i[0]-1].append(i[1]-1)
a[i[1]-1].append(i[0]-1)
path = [-1] * N
path[0] = 0
checked = [False] * N
stack = deque([(0,0)])
while (len(stack) ... | from collections import deque
inf = 10 ** 7
N, M = map(int, input().split())
P = [list(map(int,input().split())) for i in range(M)]
a = [[] for i in range(N)]
for i in P:
a[i[0]-1].append(i[1]-1)
a[i[1]-1].append(i[0]-1)
path = [-1] * N
path[0] = 0
checked = [False] * N
stack = deque([(0,0)])
while (len(stack) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 401,476 | 401,477 | u756195685 | python |
p02678 | N, M = map(int,input().split())
room = {}
startRoom = {1:1}
for i in range(M):
A, B = map(int,input().split())
room.setdefault(A, []).append(B)
room.setdefault(B, []).append(A)
#print(room)
targetRoom = [1]
while len(targetRoom) != 0:
nextTarget = []
for i in targetRoom:
roomList = room[i]
for j ... | N, M = map(int,input().split())
room = {}
startRoom = {1:1}
for i in range(M):
A, B = map(int,input().split())
room.setdefault(A, []).append(B)
room.setdefault(B, []).append(A)
targetRoom = [1]
while len(targetRoom) != 0:
nextTarget = []
for i in targetRoom:
roomList = room[i]
for j in roomList:
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 401,480 | 401,481 | u946404093 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
li = [list(map(int, input().split())) for _ in range(m)]
ans = [deque([]) for _ in range(m+10)]
ans2 = [[] for _ in range(m+10)]
for i in range(m):
s = li[i][0]
t = li[i][1]
ans[s].append(t)
ans[t].append(s)
stack = deque([1])
while stack... | from collections import deque
n, m = map(int, input().split())
li = [list(map(int, input().split())) for _ in range(m)]
ans = [deque([]) for _ in range(m+10)]
ans2 = [[] for _ in range(m+10)]
for i in range(m):
s = li[i][0]
t = li[i][1]
ans[s].append(t)
ans[t].append(s)
stack = deque([1])
while stack... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,486 | 401,487 | u346395915 | python |
p02678 | import sys
import math
import itertools
import numpy
rl = sys.stdin.readline
n, m = map(int, rl().split())
li = [[] for _ in range(m)]
for _ in range(m):
a, b = map(int, rl().split())
a -= 1
b -= 1
li[a].append(b)
li[b].append(a)
marks = [-1]*n
stack = [0]
while stack:
for next_room in li[stack[0]]:
... | import sys
import math
import itertools
import numpy
rl = sys.stdin.readline
n, m = map(int, rl().split())
li = [[] for _ in range(m+1)]
for _ in range(m):
a, b = map(int, rl().split())
a -= 1
b -= 1
li[a].append(b)
li[b].append(a)
marks = [-1]*n
stack = [0]
while stack:
for next_room in li[stack[0]]:
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 401,490 | 401,491 | u823885866 | python |
p02678 | from collections import deque, defaultdict
from sys import stdin
input = stdin.readline
def main():
N, M = map(int, input().split())
route = defaultdict(list)
for i in range(M):
a, b = map(int, input().split())
route[a-1].append(b-1)
route[b-1].append(a-1)
arrive_time = [0]... | from collections import deque, defaultdict
from sys import stdin
input = stdin.readline
def main():
N, M = map(int, input().split())
route = defaultdict(list)
for i in range(M):
a, b = map(int, input().split())
route[a-1].append(b-1)
route[b-1].append(a-1)
arrive_time = [0]... | [
"assignment.value.change",
"identifier.change"
] | 401,496 | 401,497 | u411353821 | python |
p02678 | N,M = map(int, input().split())
path = [[] for i in range(N)]
for i in range(M):
A,B = map(int, input().split())
path[A-1].append(B)
path[B-1].append(A)
ans = [0]*N
check = [0]*N
check[0] = 1
def func(x):
ls = []
for i in path[x-1]:
if check[i-1] == 0:
ans[i-1] = x
... | N,M = map(int, input().split())
path = [[] for i in range(N)]
for i in range(M):
A,B = map(int, input().split())
path[A-1].append(B)
path[B-1].append(A)
ans = [0]*N
check = [0]*N
check[0] = 1
def func(x):
ls = []
for i in path[x-1]:
if check[i-1] == 0:
ans[i-1] = x
... | [
"assignment.add"
] | 401,498 | 401,499 | u109396127 | python |
p02678 | from collections import deque
def bfs(g_list, visited):
q = deque([1])
visited[1] = 0
while q:
curr_room = q.popleft()
for next_room in g_list[curr_room]:
if visited[next_room] >= 0:
continue
visited[next_room] = curr_room
q.append(next_ro... | from collections import deque
def bfs(g_list, visited):
q = deque([1])
visited[1] = 0
while q:
curr_room = q.popleft()
for next_room in g_list[curr_room]:
if visited[next_room] >= 0:
continue
visited[next_room] = curr_room
q.append(next_ro... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,500 | 401,501 | u493520238 | python |
p02678 | import queue
n, m = map(int, input().split())
road = [[] for i in range(m)]
for i in range(m):
a, b = map(int, input().split())
road[a-1].append(b-1)
road[b-1].append(a-1)
# cost to isMin
result = [[999999999999999, None, False] for i in range(n)]
# from tom
q = queue.Queue()
result[0] = [0, None, Tru... | import queue
n, m = map(int, input().split())
road = [[] for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
road[a-1].append(b-1)
road[b-1].append(a-1)
# cost to isMin
result = [[999999999999999, None, False] for i in range(n)]
# from tom
q = queue.Queue()
result[0] = [0, None, Tru... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,513 | 401,514 | u539639881 | python |
p02678 | from collections import deque
N,M = map(int,input().split())
edge = [[] for i in range(N)]
for i in range(M):
a,b = map(int,input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
#print(edge)
print('YES')
ans = [None]*N
#print(edge)
q = deque([0])
tmp = [-1]*N#部屋１からの距離
tmp[0] = 0
while q:
now... | from collections import deque
N,M = map(int,input().split())
edge = [[] for i in range(N)]
for i in range(M):
a,b = map(int,input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
#print(edge)
print('Yes')
ans = [None]*N
#print(edge)
q = deque([0])
tmp = [-1]*N#部屋１からの距離
tmp[0] = 0
while q:
now... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 401,517 | 401,518 | u855831834 | python |
p02678 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | [
"call.remove"
] | 401,521 | 401,522 | u285891772 | python |
p02678 | from collections import deque
import sys
sys.setrecursionlimit(10000000)
N, M = map(int, input().split())
class tree():
def __init__(self):
self.num = 0
self.flag = 0
self.step = -1
self.leaf = []
li = [tree() for i in range(N)]
def saiki(que, step):
pop = que.pop()
li[pop].... | from collections import deque
import sys
sys.setrecursionlimit(10000000)
N, M = map(int, input().split())
class tree():
def __init__(self):
self.num = 0
self.flag = 0
self.step = -1
self.leaf = []
li = [tree() for i in range(N)]
def saiki(que, step):
pop = que.popleft()
li[p... | [
"assignment.value.change",
"identifier.change"
] | 401,530 | 401,531 | u133566678 | python |
p02678 | n,m = map(int,input().split())
road = {k:[] for k in range(1,n+1)}
for _ in range(m):
a,b = map(int,input().split())
road[a].append(b)
road[b].append(a)
next_visited = [1]
visited = {1:None}
temp_next = []
visit_num = {}
count = 0
while True:
print(next_visited)
temp_next = []
for room in next_visited:... | n,m = map(int,input().split())
road = {k:[] for k in range(1,n+1)}
for _ in range(m):
a,b = map(int,input().split())
road[a].append(b)
road[b].append(a)
next_visited = [1]
visited = {1:None}
temp_next = []
visit_num = {}
count = 0
while True:
temp_next = []
for room in next_visited:
ava_room = road[r... | [
"call.remove"
] | 401,546 | 401,547 | u741612283 | python |
p02678 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: D
# CreatedDate: 2020-05-17 22:04:10 +0900
# LastModified: 2020-05-17 22:22:23 +0900
#
from collections import deque
def bfs(path_list,guide,n):
color = [0]*(n+1)
color[1] = 1
Q = deque()
Q.append(1)
while Q:
u = Q.popleft()
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: D
# CreatedDate: 2020-05-17 22:04:10 +0900
# LastModified: 2020-05-17 22:24:55 +0900
#
from collections import deque
def bfs(path_list,guide,n):
color = [0]*(n+1)
color[1] = 1
Q = deque()
Q.append(1)
while Q:
u = Q.popleft()
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 401,561 | 401,562 | u326552320 | python |
p02678 | from queue import Queue
import sys
sys.setrecursionlimit(10 ** 6)
def main():
n, m = map(int, input().split())
edges = [[] for _ in range(m)]
for _ in range(m):
a, b = map(lambda x: int(x) - 1, input().split())
edges[a].append(b)
edges[b].append(a)
visited = {0: -1}
q = Queue()
q.put(0)
... | from queue import Queue
import sys
sys.setrecursionlimit(10 ** 6)
def main():
n, m = map(int, input().split())
edges = [[] for _ in range(n)]
for _ in range(m):
a, b = map(lambda x: int(x) - 1, input().split())
edges[a].append(b)
edges[b].append(a)
visited = {0: -1}
q = Queue()
q.put(0)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,565 | 401,566 | u002625175 | python |
p02678 | def main():
import sys
from collections import defaultdict,deque
sys.setrecursionlimit(10**5+2)
N,M=list(map(int,sys.stdin.readline().split()))
dic=defaultdict(list)
for i in range(M):
A,B=list(map(int,sys.stdin.readline().split()))
dic[A].append(B)
dic[B].append(A)
... | def main():
import sys
from collections import defaultdict,deque
sys.setrecursionlimit(10**5+2)
N,M=list(map(int,sys.stdin.readline().split()))
dic=defaultdict(list)
for i in range(M):
A,B=list(map(int,sys.stdin.readline().split()))
dic[A].append(B)
dic[B].append(A)
... | [
"call.remove"
] | 401,577 | 401,578 | u129019798 | python |
p02678 | def main():
import sys
from collections import defaultdict,deque
sys.setrecursionlimit(10**5+2)
N,M=list(map(int,sys.stdin.readline().split()))
dic=defaultdict(list)
for i in range(M):
A,B=list(map(int,sys.stdin.readline().split()))
dic[A].append(B)
dic[B].append(A)
... | def main():
import sys
from collections import defaultdict,deque
sys.setrecursionlimit(10**5+2)
N,M=list(map(int,sys.stdin.readline().split()))
dic=defaultdict(list)
for i in range(M):
A,B=list(map(int,sys.stdin.readline().split()))
dic[A].append(B)
dic[B].append(A)
... | [
"assignment.value.change",
"identifier.change"
] | 401,579 | 401,578 | u129019798 | python |
p02678 | from collections import deque
R=lambda: map(int, input().split())
n, m = R()
g = [[] for _ in range(n)]
for _ in range(m):
u, v = R()
g[u - 1].append(v - 1)
g[v - 1].append(u - 1)
r = 'Yes' + [None] * (n - 1)
V = [True] + [False] * (n - 1)
q = deque([0])
while q:
u = q.popleft()
for v in g[u]:
if not V... | from collections import deque
R=lambda: map(int, input().split())
n, m = R()
g = [[] for _ in range(n)]
for _ in range(m):
u, v = R()
g[u - 1].append(v - 1)
g[v - 1].append(u - 1)
r = ['Yes'] + [None] * (n - 1)
V = [True] + [False] * (n - 1)
q = deque([0])
while q:
u = q.popleft()
for v in g[u]:
if not... | [] | 401,582 | 401,583 | u021019433 | python |
p02678 | from collections import deque
N,M = map(int,input().split())
graph = [deque([]) for _ in range(N+1)]
for _ in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
# 幅優先探索
def bfs(u):
ans = [None] * (N+1)
queue = deque([u])
d = [None] * (N+1) # uからの距離の初期化
d[u] = 0 #... | from collections import deque
N,M = map(int,input().split())
graph = [deque([]) for _ in range(N+1)]
for _ in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
# 幅優先探索
def bfs(u):
ans = [None] * (N+1)
queue = deque([u])
d = [None] * (N+1) # uからの距離の初期化
d[u] = 0 #... | [
"call.add"
] | 401,588 | 401,589 | u920204936 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
root=[[] for _ in range(n)]
for i in range(m):
a,b=map(int,input().split())
root[a-1].append(b-1)
root[b-1].append(a-1)
times=[0]*n
sign=[-1]*n
sign[0]=0
color=[False]*n
que=deque([0])
while que: #qが空でないのはこう表現できる
i=que.popleft()
if color[i]==False:
for e... | from collections import deque
n,m=map(int,input().split())
root=[[] for _ in range(n)]
for i in range(m):
a,b=map(int,input().split())
root[a-1].append(b-1)
root[b-1].append(a-1)
times=[0]*n
sign=[-1]*n
sign[0]=0
color=[False]*n
que=deque([0])
while que: #qが空でないのはこう表現できる
i=que.popleft()
if color[i]==False:
for e... | [
"call.add"
] | 401,596 | 401,597 | u459590249 | python |
p02678 | from collections import deque
N,M = map(int,input().split())
AB = [list(map(int,input().split())) for _ in range(M)]
line = [[] for _ in range(N+1)]
flag = True
ans = [0] * (N+1)
for A,B in AB:
line[A].append(B)
line[B].append(A)
def bfs(now):
que = deque()
que.append(now)
while que.__len__() !=... | from collections import deque
N,M = map(int,input().split())
AB = [list(map(int,input().split())) for _ in range(M)]
line = [[] for _ in range(N+1)]
flag = True
ans = [0] * (N+1)
for A,B in AB:
line[A].append(B)
line[B].append(A)
def bfs(now):
que = deque()
que.append(now)
while que.__len__() !=... | [
"expression.operation.binary.remove"
] | 401,632 | 401,633 | u106971015 | python |
p02678 |
from collections import deque
def q4():
class Room:
def __init__(self, i):
self.id = i
self.d = -1
self.next = []
self.sign = -1
def add_next(self, n):
self.next.append(n)
def print(self, tab=0, printed=[]):
if self.i... |
from collections import deque
def q4():
class Room:
def __init__(self, i):
self.id = i
self.d = -1
self.next = []
self.sign = -1
def add_next(self, n):
self.next.append(n)
def print(self, tab=0, printed=[]):
if self.i... | [
"call.add"
] | 401,648 | 401,649 | u849756457 | python |
p02678 | from collections import deque
''' Breadth First Search (BFS) '''
def bfs(x):
q = deque([x])
visited[x] = True
while q:
x = q.popleft()
for y in adj[x]:
if not visited[y]:
q.append(y)
visited[y] = True
parent[y] = x
n, m = map(int,... | from collections import deque
''' Breadth First Search (BFS) '''
def bfs(x):
q = deque([x])
visited[x] = True
while q:
x = q.popleft()
for y in adj[x]:
if not visited[y]:
q.append(y)
visited[y] = True
parent[y] = x
n, m = map(int,... | [
"call.add"
] | 401,659 | 401,660 | u957796755 | python |
p02678 | N, M = list(map(int, input().split()))
m = [list() for _ in range(N + 1)]
for _ in range(M):
A, B = list(map(int, input().split()))
m[A].append(B)
m[B].append(A)
visited = [N + 100 for _ in range(N + 1)]
step = 0
visited[1] = step
que = [1]
os = [0 for _ in range(N + 1)]
while len(que) > 0:
step += ... | N, M = list(map(int, input().split()))
m = [list() for _ in range(N + 1)]
for _ in range(M):
A, B = list(map(int, input().split()))
m[A].append(B)
m[B].append(A)
visited = [N + 100 for _ in range(N + 1)]
step = 0
visited[1] = step
que = [1]
os = [0 for _ in range(N + 1)]
while len(que) > 0:
step += ... | [
"call.arguments.change"
] | 401,668 | 401,669 | u458925609 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.