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 | import sys
# import math
import heapq
# input = sys.stdin.readline
from collections import deque
def main():
n, m = map(int,input().split())
room =[[]for _ in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
room[a].append(b)
room[b].append(a)
point = [0] *(n+1)... | import sys
# import math
import heapq
# input = sys.stdin.readline
from collections import deque
def main():
n, m = map(int,input().split())
room =[[]for _ in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
room[a].append(b)
room[b].append(a)
point = [0] *(n+1)... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 400,336 | 400,337 | u408071652 | python |
p02678 | import sys
# import math
import heapq
# input = sys.stdin.readline
from collections import deque
def main():
n, m = map(int,input().split())
room =[[]for _ in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
room[a].append(b)
room[b].append(a)
point = [0] *(n+1)... | import sys
# import math
import heapq
# input = sys.stdin.readline
from collections import deque
def main():
n, m = map(int,input().split())
room =[[]for _ in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
room[a].append(b)
room[b].append(a)
point = [0] *(n+1)... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 400,338 | 400,337 | u408071652 | python |
p02678 | from collections import deque
q=deque()
def MI(): return map(int, input().split())
N,M=MI()
g=[[] for _ in range(M+1)]
for _ in range(M):
a,b=MI()
g[a].append(b)
g[b].append(a)
check=[0]*(N+1)
check[1]=1
ans=[0]*(N+1)
q.append(1)
while len(q)>0:
v=q.popleft()
for u in g[v]:
if check[u]==0:
check[u]=... | from collections import deque
q=deque()
def MI(): return map(int, input().split())
N,M=MI()
g=[[] for _ in range(N+1)]
for _ in range(M):
a,b=MI()
g[a].append(b)
g[b].append(a)
check=[0]*(N+1)
check[1]=1
ans=[0]*(N+1)
q.append(1)
while len(q)>0:
v=q.popleft()
for u in g[v]:
if check[u]==0:
check[u]=... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,343 | 400,344 | u506858457 | python |
p02678 | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
N, M = map(int, input().split())
AB = [map(int, input().split()) for _ in range(M)]
C = [[] for _ in range(N+1)]
for a, b in AB:
C[a].append(b)
C[b].append(a) ... | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
N, M = map(int, input().split())
AB = [map(int, input().split()) for _ in range(M)]
C = [[] for _ in range(N+1)]
for a, b in AB:
C[a].append(b)
C[b].append(a) ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 400,357 | 400,358 | u461454424 | python |
p02678 | #ABC168D
def main():
import sys
from collections import defaultdict
from collections import deque
N, M = map(int, sys.stdin.readline().split())
AB = [tuple(map(int, sys.stdin.readline().split())) for _ in range(M)]
#print(AB)
edge = defaultdict(list)
for ab in AB:
edge[ab[0]... | #ABC168D
def main():
import sys
from collections import defaultdict
from collections import deque
N, M = map(int, sys.stdin.readline().split())
AB = [tuple(map(int, sys.stdin.readline().split())) for _ in range(M)]
#print(AB)
edge = defaultdict(list)
for ab in AB:
edge[ab[0]... | [
"call.add"
] | 400,359 | 400,360 | u401452016 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
ans=[0]*(n+1)
adj=[[] for _ in range(n+1)]
for i in range(m):
u,v=map(int,input().split())
adj[u].append(v)
adj[v].append(u)
que=deque([1])
vis=[0 for _ in range(n+1)]
vis[1]=1
while que:
t=que.popleft()
#print(t)
for i in adj[t]:
... | from collections import deque
n,m=map(int,input().split())
ans=[0]*(n+1)
adj=[[] for _ in range(n+1)]
for i in range(m):
u,v=map(int,input().split())
adj[u].append(v)
adj[v].append(u)
que=deque([1])
vis=[0 for _ in range(n+1)]
vis[1]=1
while que:
t=que.popleft()
#print(t)
for i in adj[t]:
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,361 | 400,362 | u252628711 | python |
p02678 | import queue
N,M=map(int,input().split())
adj=[[] for s in range(M+1)]
parent=[-1]*(N+1)
for i in range(M):
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
parent[x]=p
for next in... | import queue
N,M=map(int,input().split())
adj=[[] for s in range(N+1)]
parent=[-1]*(N+1)
for i in range(M):
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
parent[x]=p
for next in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,367 | 400,368 | u229518917 | python |
p02678 | import queue
N,M=map(int,input().split())
adj=[[] for _ in range(M+1)]
parent=[-1]*(N+1)
for i in range(M):
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
parent[x]=p
for next in... | import queue
N,M=map(int,input().split())
adj=[[] for s in range(N+1)]
parent=[-1]*(N+1)
for i in range(M):
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
parent[x]=p
for next in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,369 | 400,368 | u229518917 | python |
p02678 | #!/usr/bin/env python3
from collections import deque
q = deque([0])
Dequeue = lambda: q.popleft()
Enqueue = lambda x: q.append(x)
n, m = map(int, input().split())
l = [[] for _ in [0]*n]
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
l[a] += [b]
l[b] += [a]
ans = [-1]*n
while q:
... | #!/usr/bin/env python3
from collections import deque
q = deque([0])
Dequeue = lambda: q.popleft()
Enqueue = lambda x: q.append(x)
n, m = map(int, input().split())
l = [[] for _ in [0]*n]
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
l[a] += [b]
l[b] += [a]
ans = [-1]*n
while q:
... | [
"assignment.value.change"
] | 400,372 | 400,373 | u132892633 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
table = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().split())
table[a].append(b)
table[b].append(a)
ans = [0] * (n + 1)
ans[1] = -1
queue = deque()
for s in table[1]:
ans[s] = 1
# 注目してるノード番号, ひとつ前の番号
queue.a... | from collections import deque
n, m = map(int, input().split())
table = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().split())
table[a].append(b)
table[b].append(a)
ans = [0] * (n + 1)
ans[1] = -1
queue = deque()
for s in table[1]:
ans[s] = 1
# 注目してるノード番号, ひとつ前の番号
queue.a... | [
"call.add"
] | 400,384 | 400,385 | u445624660 | python |
p02678 | from collections import deque
dic={}
n,m=map(int,input().split())
nod=[[]]
keep=[0]*n
for i in range(n-1):
nod.append([])
for i in range(m):
a,b=map(int,input().split())
nod[a-1].append(b)
nod[b-1].append(a)
use=deque()
use.append(1)
for i in range(0,10**100):
if bool(use):
sss=use.popleft()
for j in ... | from collections import deque
dic={}
n,m=map(int,input().split())
nod=[[]]
keep=[0]*n
for i in range(n-1):
nod.append([])
for i in range(m):
a,b=map(int,input().split())
nod[a-1].append(b)
nod[b-1].append(a)
use=deque()
use.append(1)
for i in range(0,10**100):
if bool(use):
sss=use.popleft()
for j in ... | [
"call.add"
] | 400,386 | 400,387 | u277641173 | python |
p02678 | import queue
N, M = map(int, input().split())
adj = [[] for i in [0]*N] # 隣接リスト
for i in [0]*M:
a, b = map(int, input().split())
adj[a-1].append(b)
adj[b-1].append(a)
print(adj)
que = queue.Queue()
que.put(1)
guide = [-1]*(N)
while not que.empty():
x = que.get()
for y in adj[x-1]:
if gui... | import queue
N, M = map(int, input().split())
adj = [[] for i in [0]*N] # 隣接リスト
for i in [0]*M:
a, b = map(int, input().split())
adj[a-1].append(b)
adj[b-1].append(a)
que = queue.Queue()
que.put(1)
guide = [-1]*(N)
while not que.empty():
x = que.get()
for y in adj[x-1]:
if guide[y-1] == ... | [
"call.remove"
] | 400,401 | 400,402 | u607114738 | python |
p02678 | from collections import deque
n,m = map(int, input().split())
dic = {}
for i in range(m):
a,b = map(int,input().split())
dic.setdefault(a,[])
dic.setdefault(b,[])
dic[a].append(b)
dic[b].append(a)
array = [-1] * (n+1)
d = deque()
d.append(1)
while len(d) != 0:
tmp = d.popleft()
arr = dic.get(tmp... | from collections import deque
n,m = map(int, input().split())
dic = {}
for i in range(m):
a,b = map(int,input().split())
dic.setdefault(a,[])
dic.setdefault(b,[])
dic[a].append(b)
dic[b].append(a)
array = [-1] * (n+1)
d = deque()
d.append(1)
while len(d) != 0:
tmp = d.popleft()
arr = dic.get(tmp... | [
"call.add"
] | 400,409 | 400,410 | u952491523 | python |
p02678 | from collections import deque
N, M=map(int, sys.stdin.readline().split())
p = []
for i in range(M):
p.append(list(map(int, sys.stdin.readline().split())))
graph = [[] for _ in range(N + 1)]
for pi in p:
graph[pi[0]].append(pi[1])
graph[pi[1]].append(pi[0])
q = deque([1])
p = [0] * (N + 1)
p[1] = 1
while ... | import sys
from collections import deque
N, M=map(int, sys.stdin.readline().split())
p = []
for i in range(M):
p.append(list(map(int, sys.stdin.readline().split())))
graph = [[] for _ in range(N + 1)]
for pi in p:
graph[pi[0]].append(pi[1])
graph[pi[1]].append(pi[0])
q = deque([1])
p = [0] * (N + 1)
p[1]... | [] | 400,419 | 400,420 | u197868423 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
queue = deque([0])
d = [None]*n
d[0] = 0
while queue:
v = queue.popleft()
for i in g[v]:
if d[i] == Non... |
from collections import deque
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
queue = deque([0])
d = [None]*n
d[0] = 0
while queue:
v = queue.popleft()
for i in g[v]:
if d[i] == No... | [] | 400,433 | 400,434 | u952773501 | python |
p02678 | N, M = map(int, input().split())
node =[[] for _ in range(N)]
for _ in range(M):
x, y = map(int, input().split())
node[x-1].append(y-1)
node[y-1].append(x-1)
ct = [-1]*N
i = 0
stack = []
ct[0] = 0
stack.append(0)
while len(stack) != 0:
v = stack.pop()
for e in node[v]:
if ct[e] == -1:
ct[e] = v
... | N, M = map(int, input().split())
node =[[] for _ in range(N)]
for _ in range(M):
x, y = map(int, input().split())
node[x-1].append(y-1)
node[y-1].append(x-1)
ct = [-1]*N
i = 0
stack = []
ct[0] = 0
stack.append(0)
while len(stack) != 0:
v = stack.pop(0)
for e in node[v]:
if ct[e] == -1:
ct[e] = v
... | [
"call.arguments.change"
] | 400,437 | 400,438 | u958693198 | python |
p02678 | def BFS(K,edges,N):
INF = 10**10
roots=[ [] for i in range(N)]
for a,b in edges:
roots[a-1]+=[b-1]
roots[b-1]+=[a-1]
dist=[INF]*N
pre = [-1]*N
stack=[]
stack.append(K)
dist[K]=0
while stack:
label=stack.pop(-1)
for i in roots[label]:
if dist[i]==INF:
dist[i]=dist[label]+1... | def BFS(K,edges,N):
INF = 10**10
roots=[ [] for i in range(N)]
for a,b in edges:
roots[a-1]+=[b-1]
roots[b-1]+=[a-1]
dist=[INF]*N
pre = [-1]*N
stack=[]
stack.append(K)
dist[K]=0
while stack:
label=stack.pop(0)
for i in roots[label]:
if dist[i]==INF:
dist[i]=dist[label]+1
... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.unary.remove"
] | 400,495 | 400,496 | u212786022 | python |
p02678 | from collections import deque
N,M=map(int, input().split())
G=[[] for _ in range(N)]
for i in range(M):
a,b=map(int, input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
siru=[-1]*(N-1)#2~~N
que=deque([0])
while que:
#print(que)
now=que.pop()
nexlist=G[now]
for nex in nexlist:
if... | from collections import deque
N,M=map(int, input().split())
G=[[] for _ in range(N)]
for i in range(M):
a,b=map(int, input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
siru=[-1]*(N-1)#2~~N
que=deque([0])
while que:
#print(que)
now=que.popleft()
nexlist=G[now]
for nex in nexlist:
... | [
"assignment.value.change",
"identifier.change"
] | 400,512 | 400,513 | u784022244 | python |
p02678 | from collections import deque
N,M=map(int, input().split())
G=[[] for _ in range(N)]
for i in range(M):
a,b=map(int, input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
siru=[-1]*(N-1)#2~~N
que=deque([0])
while len(que)>0:
#print(que)
now=que.pop()
nexlist=G[now]
for nex in nexlist:
... | from collections import deque
N,M=map(int, input().split())
G=[[] for _ in range(N)]
for i in range(M):
a,b=map(int, input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
siru=[-1]*(N-1)#2~~N
que=deque([0])
while que:
#print(que)
now=que.popleft()
nexlist=G[now]
for nex in nexlist:
... | [
"call.remove",
"assignment.value.change",
"identifier.change"
] | 400,514 | 400,513 | u784022244 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
#a,b = 1 2 (頂点1,2が隣接)
#a,b = 2 3 (頂点2,3が隣接)
#a,b = 3 4 (頂点3,4が隣接)
#a,b = 4 2 (頂点2,2が隣接)
#G = [[],[2],[1,3,4],[2,4],[3,2]]
ans... | from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
#a,b = 1 2 (頂点1,2が隣接)
#a,b = 2 3 (頂点2,3が隣接)
#a,b = 3 4 (頂点3,4が隣接)
#a,b = 4 2 (頂点2,2が隣接)
#G = [[],[2],[1,3,4],[2,4],[3,2]]
ans... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 400,530 | 400,531 | u956433805 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
to = [[] for _ in range(n + 1)]
for i in range(n):
a, b = map(int, input().split())
to[a].append(b)
to[b].append(a)
q = deque([1])
dist = [-1] * (n + 1)
# print(to)
while q:
v = q.popleft()
for u in to[v]:
if dist[u] != -1:
... | from collections import deque
n, m = map(int, input().split())
to = [[] for _ in range(n + 1)]
for i in range(m):
a, b = map(int, input().split())
to[a].append(b)
to[b].append(a)
q = deque([1])
dist = [-1] * (n + 1)
# print(to)
while q:
v = q.popleft()
for u in to[v]:
if dist[u] != -1:
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,534 | 400,535 | u118211443 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
e = [[] for _ in range(n+1)]
lndmrk = [-1] * (n + 1)
for i in range(n):
a, b = map(int, input().split())
e[a].append(b)
e[b].append(a)
q = deque()
lndmrk[1] = 0
q.append(1)
while(len(q) != 0):
v = q.popleft()
for i in e[v]:
if lndmrk[i] != -1:
co... | from collections import deque
n, m = map(int, input().split())
e = [[] for _ in range(n+1)]
lndmrk = [-1] * (n + 1)
for i in range(m):
a, b = map(int, input().split())
e[a].append(b)
e[b].append(a)
q = deque()
lndmrk[1] = 0
q.append(1)
while(len(q) != 0):
v = q.popleft()
for i in e[v]:
if lndmrk[i] != -1:
co... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,538 | 400,539 | u700526568 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
e = [[] for _ in range(n+1)]
lndmrk = [-1] * (n + 1)
for i in range(n):
a, b = map(int, input().split())
e[a].append(b)
e[b].append(a)
q = deque()
lndmrk[1] = 0
q.append(1)
while(len(q) != 0):
v = q.popleft()
for i in e[v]:
if lndmrk[i] != -1:
co... | from collections import deque
n, m = map(int, input().split())
e = [[] for _ in range(n+1)]
lndmrk = [-1] * (n + 1)
for i in range(m):
a, b = map(int, input().split())
e[a].append(b)
e[b].append(a)
q = deque()
lndmrk[1] = 0
q.append(1)
while(len(q) != 0):
v = q.popleft()
for i in e[v]:
if lndmrk[i] != -1:
co... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 400,541 | 400,539 | u700526568 | python |
p02678 | from collections import deque
n,m,*ab = map(int, open(0).read().split())
to = [set() for _ in range(n+1)]
ans = [None] * (n+1)
for i in range(0, n*2, 2):
a = ab[i]
b = ab[i+1]
to[a].add(b)
to[b].add(a)
q = deque([1])
while q:
p = q.pop()
children = to[p]
for child in children:
if a... | from collections import deque
n,m,*ab = map(int, open(0).read().split())
to = [[] for _ in range(n+1)]
ans = [None] * (n+1)
for i in range(0, m*2, 2):
a = ab[i]
b = ab[i+1]
to[a].append(b)
to[b].append(a)
q = deque([1])
while q:
p = q.pop()
children = to[p]
for child in children:
i... | [
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.step.change"
] | 400,550 | 400,551 | u200916944 | python |
p02678 | from collections import deque
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
roots = [[] for _ in range(n)]
signs = [-1 for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
roots[a].append(b)
roots[b].append(a)
queue = deque([0])
signs[0] ... | from collections import deque
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
roots = [[] for _ in range(n)]
signs = [-1 for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
roots[a].append(b)
roots[b].append(a)
queue = deque([0])
signs[0] ... | [
"identifier.change",
"call.arguments.change"
] | 400,556 | 400,557 | u411537765 | python |
p02678 | import queue
I=lambda:map(int,input().split())
N,M=I()
ls=[[] for _ in range(M+1)]
for _ in[0]*M:
A,B=I()
ls[A]+=[B]
ls[B]+=[A]
q = queue.Queue()
v=[-1]*(N+1)
v[0]=v[1]=0
q.put(1)
while not(q.empty()):
top=q.get()
for l in ls[top]:
if v[l]<0:
v[l]=top
q.put(l)
if -1 in v:
print("No")
else:
... | import queue
I=lambda:map(int,input().split())
N,M=I()
ls=[[] for _ in range(N+1)]
for _ in[0]*M:
A,B=I()
ls[A]+=[B]
ls[B]+=[A]
q = queue.Queue()
v=[-1]*(N+1)
v[0]=v[1]=0
q.put(1)
while not(q.empty()):
top=q.get()
for l in ls[top]:
if v[l]<0:
v[l]=top
q.put(l)
if -1 in v:
print("No")
else:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,558 | 400,559 | u782685137 | python |
p02678 | n,m=map(int,input().split())
ans=[0]*n
num1=[[] for _ in range(n)]
def ap(num01,num02):
num1[num01-1].append(num02)
num1[num02-1].append(num01)
for i in range(m):
a,b=map(int,input().split())
ap(a,b)
queue=[1]
def apq(num01):
queue.append(num01)
def qp():
return queue.pop(0)
for i in range(n):
... | n,m=map(int,input().split())
ans=[0]*n
num1=[[] for _ in range(n)]
def ap(num01,num02):
num1[num01-1].append(num02)
num1[num02-1].append(num01)
for i in range(m):
a,b=map(int,input().split())
ap(a,b)
queue=[1]
def apq(num01):
queue.append(num01)
def qp():
return queue.pop(0)
for i in range(n):
... | [
"call.remove"
] | 400,560 | 400,561 | u366886346 | python |
p02678 | import sys
input = sys.stdin.readline
n, m = map(int, input().split()) # nは頂点の数、mは辺の数
pic = [[] for _ in range(n)] # 隣接リスト_初期化
#print(n,m)
for _ in range(m): # 隣接リスト_取り込み
a, b = map(int, input().split())
pic[a-1].append(b-1)
pic[b-1].append(a-1)
#print(pic)
from collections import deque
def BFS(u): # '... | # ノードの開始が'0'でなく'1'であることに注意!!※※※
# AtCoder Beginner Contest 168
# https://atcoder.jp/contests/abc168/tasks/abc168_d
import sys
input = sys.stdin.readline
n, m = map(int, input().split()) # nは頂点の数、mは辺の数
pic = [[] for _ in range(n)] # 隣接リスト_初期化
for _ in range(m): # 隣接リスト_取り込み
a, b = map(int, input().split())
p... | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 400,566 | 400,567 | u680851063 | python |
p02678 | import sys
input = sys.stdin.readline
n, m = map(int, input().split()) # nは頂点の数、mは辺の数
pic = [[] for _ in range(n)] # 隣接リスト_初期化
#print(n,m)
for _ in range(m): # 隣接リスト_取り込み
a, b = map(int, input().split())
pic[a-1].append(b-1)
pic[b-1].append(a-1)
#print(pic)
from collections import deque
def BFS(u): # '... | # ノードの開始が'0'でなく'1'であることに注意!!※※※
import sys
input = sys.stdin.readline
n, m = map(int, input().split()) # nは頂点の数、mは辺の数
pic = [[] for _ in range(n)] # 隣接リスト_初期化
for _ in range(m): # 隣接リスト_取り込み
a, b = map(int, input().split())
pic[a-1].append(b-1) # ※※※
pic[b-1].append(a-1) # ※※※
from collections import d... | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 400,566 | 400,568 | u680851063 | python |
p02678 | import sys
input = sys.stdin.readline
n, m = map(int, input().split()) # nは頂点の数、mは辺の数
pic = [[] for _ in range(n)] # 隣接リスト_初期化
#print(n,m)
for _ in range(m): # 隣接リスト_取り込み
a, b = map(int, input().split())
pic[a-1].append(b-1)
pic[b-1].append(a-1)
#print(pic)
from collections import deque
def BFS(u): # '... | import sys
input = sys.stdin.readline
n, m = map(int, input().split()) # nは頂点の数、mは辺の数
pic = [[] for _ in range(n)] # 隣接リスト_初期化
#print(n,m)
for _ in range(m): # 隣接リスト_取り込み
a, b = map(int, input().split())
pic[a-1].append(b-1)
pic[b-1].append(a-1)
#print(pic)
from collections import deque
def BFS(u): # '... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 400,566 | 400,569 | u680851063 | python |
p02678 | n, m = map(int, input().split())
memo = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
if b != 1:
memo[a].append(b)
if a != 1:
memo[b].append(a)
print(memo)
signs = [-1] * (n+1)
now = [1]
cnt = 1
while cnt < n:
next = []
for j in now:
roots ... | n, m = map(int, input().split())
memo = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
if b != 1:
memo[a].append(b)
if a != 1:
memo[b].append(a)
signs = [-1] * (n+1)
now = [1]
cnt = 1
while cnt < n:
next = []
for j in now:
roots = mem... | [
"call.remove"
] | 400,572 | 400,573 | u533232830 | python |
p02678 | N,M = map(int,input().split())
AB = [[] for _ in range(M)]
ans = [0]*N
for _ in range(M):
a,b = map(int,input().split())
AB[a-1].append(b-1)
AB[b-1].append(a-1)
from collections import deque
node = 0
q = deque([0])
check = [0]*N
check[0] = 1
while len(q) > 0:
node = q.popleft()
for i in AB[node]:
if ch... | N,M = map(int,input().split())
AB = [[] for _ in range(N)]
ans = [0]*N
for _ in range(M):
a,b = map(int,input().split())
AB[a-1].append(b-1)
AB[b-1].append(a-1)
from collections import deque
node = 0
q = deque([0])
check = [0]*N
check[0] = 1
while len(q) > 0:
node = q.popleft()
for i in AB[node]:
if ch... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,581 | 400,582 | u442877951 | python |
p02678 | import numpy as np
import sys
sys.setrecursionlimit(10**10)
N,M = map(int,input().split())
R = [[] for _ in range(N)]
ans = np.zeros(N,dtype=int)
ans[0] = 1
queue = [1]
for _ in range(M):
i,j = map(int,input().split())
R[i-1].append(j)
R[j-1].append(i)
def bfs(que):
if que==[]:
return
i... | import numpy as np
import sys
sys.setrecursionlimit(10**7)
N,M = map(int,input().split())
R = [[] for _ in range(N)]
ans = np.zeros(N,dtype=int)
ans[0] = 1
queue = [1]
for _ in range(M):
i,j = map(int,input().split())
R[i-1].append(j)
R[j-1].append(i)
def bfs(que):
if que==[]:
return
i ... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 400,595 | 400,596 | u980205854 | python |
p02678 | n, m = map(int, input().split())
lab = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
lab[a].append(b)
lab[b].append(a)
l = [0]*(n+1)
num = [1]
while num:
v = num.pop(0)
for i in lab[v]:
if not l[i]:
l[i] = v
num.append(i)
if not 0 in... | n, m = map(int, input().split())
lab = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
lab[a].append(b)
lab[b].append(a)
l = [0]*(n+1)
num = [1]
while num:
v = num.pop(0)
for i in lab[v]:
if not l[i]:
l[i] = v
num.append(i)
... | [
"control_flow.branch.if.condition.change"
] | 400,603 | 400,604 | u316733945 | python |
p02678 | N,M=map(int,input().split())
G=[]
for i in range(0,M):
G.append([])
for i in range(0,M):
a,b=map(int,input().split())
a-=1
b-=1
G[a].append(b)
G[b].append(a)
q=[]
sign=[-1]*N
sign[0]=0
q.append(0)
while q:
x=q.pop(0)
for nv in G[x]:
if sign[nv]==-1:
sign[nv]=x
... | N,M=map(int,input().split())
G=[]
for i in range(0,N):
G.append([])
for i in range(0,M):
a,b=map(int,input().split())
a-=1
b-=1
G[a].append(b)
G[b].append(a)
q=[]
sign=[-1]*N
sign[0]=0
q.append(0)
while q:
x=q.pop(0)
for nv in G[x]:
if sign[nv]==-1:
sign[nv]=x
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,618 | 400,619 | u630211216 | python |
p02678 | def resolve():
n, m = map(int, input().split()) # 標準入力1行目の処理、n頂点、m辺
adj = [[] for i in range(n+1)] # 隣接リスト初期化、要素数は頂点数
for i in range(m):
A, B = map(int, input().split())
adj[A].append(B) # このappendのやり方だと、adj[0]が空になることに注意
adj[B].append(A) # （問題文の頂点インデックスが1始まりであるため）
#print(adj)
... | def resolve():
n, m = map(int, input().split()) # 標準入力1行目の処理、n頂点、m辺
adj = [[] for i in range(n+1)] # 隣接リスト初期化、要素数は頂点数
for i in range(m):
A, B = map(int, input().split())
adj[A].append(B) # このappendのやり方だと、adj[0]が空になることに注意
adj[B].append(A) # （問題文の頂点インデックスが1始まりであるため）
#print(adj)
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,626 | 400,627 | u484052148 | python |
p02678 | from collections import deque
def mapinput():
return map(int,input().split())
n,m = mapinput()
rootlist = [[] for i in range(n)]
flag = [False for i in range(n)]
for i in range(m):
a,b= mapinput()
rootlist[a-1].append(b)
rootlist[b-1].append(a)
que = deque()
que.append(1)
while len(que) !=0:
now... | from collections import deque
def mapinput():
return map(int,input().split())
n,m = mapinput()
rootlist = [[] for i in range(n)]
flag = [False for i in range(n)]
for i in range(m):
a,b= mapinput()
rootlist[a-1].append(b)
rootlist[b-1].append(a)
que = deque()
que.append(1)
while len(que) !=0:
now... | [
"assignment.value.change",
"identifier.change"
] | 400,628 | 400,629 | u946517952 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
grid = [[] for _ in range(n + 1)]
ans = [0] * n
visited = [False] * n
visited[0] = True
for _ in range(n):
s, t = map(int, input().split())
grid[s].append(t)
grid[t].append(s)
queue = deque([1])
while queue:
node = queue.popleft()
for i in g... | from collections import deque
n, m = map(int, input().split())
grid = [[] for _ in range(n + 1)]
ans = [0] * n
visited = [False] * n
visited[0] = True
for _ in range(m):
s, t = map(int, input().split())
grid[s].append(t)
grid[t].append(s)
queue = deque([1])
while queue:
node = queue.popleft()
for i in g... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,630 | 400,631 | u743354620 | python |
p02678 | from collections import deque
N, M = [int(i) for i in input().split(' ')]
links = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = [int(i) for i in input().split(' ')]
links[a].append(b)
links[b].append(a)
q = deque([1])
results = [-1 for _ in range(N + 1)]
while q:
i = q.popleft()
for... | from collections import deque
N, M = [int(i) for i in input().split(' ')]
links = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = [int(i) for i in input().split(' ')]
links[a].append(b)
links[b].append(a)
q = deque([1])
results = [-1 for _ in range(N + 1)]
while q:
i = q.popleft()
for... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,638 | 400,639 | u067986021 | python |
p02678 | N, M = map(int, input().split())
loads = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
loads[A-1].append(B-1)
loads[B-1].append(A-1)
queue = [0]
dist = [0] * N
prev = [-1] * N
while(len(queue) != 0):
now = queue[0]
queue.pop(0)
for i in loads[now]:
if dist[... | N, M = map(int, input().split())
loads = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
loads[A-1].append(B-1)
loads[B-1].append(A-1)
queue = [0]
dist = [0] * N
prev = [-1] * N
while(len(queue) != 0):
now = queue[0]
queue.pop(0)
for i in loads[now]:
if dist[... | [
"call.add"
] | 400,650 | 400,651 | u198668088 | python |
p02678 | from collections import deque
WHITE=0
GRAY=1
BLACK=2
nList = []
labelList = []
color = []
Q = deque([])
def readinput():
global nList
global color
global Q
global labelList
n,m=list(map(int,input().split()))
nList = []
for _ in range(n+1):
nList.append([]) # 1-オリジンの隣接リスト
fo... | from collections import deque
WHITE=0
GRAY=1
BLACK=2
nList = []
labelList = []
color = []
Q = deque([])
def readinput():
global nList
global color
global Q
global labelList
n,m=list(map(int,input().split()))
nList = []
for _ in range(n+1):
nList.append([]) # 1-オリジンの隣接リスト
fo... | [
"call.remove"
] | 400,654 | 400,655 | u592547545 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
graph=[[] for i in range(n)]
sirusi=[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 in graph[v]:
if... | from collections import deque
n,m=map(int,input().split())
graph=[[] for i in range(n)]
sirusi=[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 in graph[v]:
if... | [
"call.remove"
] | 400,659 | 400,660 | u449473917 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
INF=100050
q=deque()
class Room:
def __init__(self,num):
self.number=num
self.frontier=True
self.neighbor=[]
self.arrow=0
self.deepness=INF
def set(self,room):
self.neighbor.append(room)
def ... | from collections import deque
n,m=map(int,input().split())
INF=100050
q=deque()
class Room:
def __init__(self,num):
self.number=num
self.frontier=True
self.neighbor=[]
self.arrow=0
self.deepness=INF
def set(self,room):
self.neighbor.append(room)
def ... | [
"call.add"
] | 400,667 | 400,668 | u970598682 | python |
p02678 | import copy
from collections import deque
from collections import defaultdict
N,M=map(int, input().split())
line=defaultdict(list)
q=deque
next=deque()
ans=[-1]*(N+1)
ans[0]=0
ans[1]=0
for i in range(N):
a,b=map(int, input().split())
line[a].append(b)
line[b].append(a)
#print(line)
next.append(1)
a=1
whi... | import copy
from collections import deque
from collections import defaultdict
N,M=map(int, input().split())
line=defaultdict(list)
q=deque
next=deque()
ans=[-1]*(N+1)
ans[0]=0
ans[1]=0
for i in range(M):
a,b=map(int, input().split())
line[a].append(b)
line[b].append(a)
#print(line)
next.append(1)
a=1
whi... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,669 | 400,670 | u585963734 | python |
p02678 | n, m = map(int, input().split())
a, b = list(), list()
for i in range(m):
tmp = list(map(int, input().split()))
a.append(tmp[0])
b.append(tmp[1])
graph = [[] for _ in range(n)]
for i in range(m):
graph[a[i] - 1].append(b[i] - 1)
graph[b[i] - 1].append(a[i] - 1)
print(graph)
pathway = [None for _ i... | n, m = map(int, input().split())
a, b = list(), list()
for i in range(m):
tmp = list(map(int, input().split()))
a.append(tmp[0])
b.append(tmp[1])
graph = [[] for _ in range(n)]
for i in range(m):
graph[a[i] - 1].append(b[i] - 1)
graph[b[i] - 1].append(a[i] - 1)
pathway = [None for _ in range(n)]
q... | [
"call.remove"
] | 400,673 | 400,674 | u263660661 | python |
p02678 | from collections import deque
# 初期化周り
N, M = map(int, input().rstrip().split())
G = [[] for i in range(N+1)]
for i in range(M):
A, B = map(int, input().rstrip().split())
G[A].append(B)
G[B].append(A)
# 目印
sign = [-1]*(N+1)
sign[0] = None
sign[1] = 0
queue = deque([1])
while queue:
node = queue.pople... | from collections import deque
# 初期化周り
N, M = map(int, input().rstrip().split())
G = [[] for i in range(N+1)]
for i in range(M):
A, B = map(int, input().rstrip().split())
G[A].append(B)
G[B].append(A)
# 目印
sign = [-1]*(N+1)
sign[0] = None
sign[1] = 0
queue = deque([1])
while queue:
node = queue.pople... | [
"call.arguments.change"
] | 400,682 | 400,683 | u285257696 | python |
p02678 | from collections import deque
n, m = map(int,input().split())
def vertex_node() -> list:
v_c = [[] for _ in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
v_c[a].append(b)
v_c[b].append(a)
return v_c
def bfs(l) -> list:
dist = [-1] * (n+1)
dist[0] = 0
dis... | from collections import deque
n, m = map(int,input().split())
def vertex_node() -> list:
v_c = [[] for _ in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
v_c[a].append(b)
v_c[b].append(a)
return v_c
def bfs(l) -> list:
dist = [-1] * (n+1)
dist[0] = 0
dis... | [
"expression.operation.binary.remove"
] | 400,728 | 400,729 | u983967747 | python |
p02678 | from collections import deque
n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(m)]
ans=[0]*n
def bfs():
deq.append(0)#1
finish=set()
finish.add(0)
while deq:
#print(deq)
now=deq.pop()
for ad_i in adlist[now]:
if ad_i-1 != now and ad_i-1 ... | from collections import deque
n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(m)]
ans=[0]*n
def dfs():
deq.append(0)#1
finish=set()
finish.add(0)
while deq:
now=deq.popleft()
# print(now+1)
for ad_i in adlist[now]:
if ad_i-1 != now and a... | [
"identifier.change",
"assignment.value.change",
"call.function.change"
] | 400,734 | 400,735 | u375695365 | python |
p02678 | n, m = map(int, input().split())
edge = [list(map(int, input().split())) for _ in range(m)]
next_node = [[] for _ in range(n)]
for a, b in edge:
next_node[a-1].append(b)
next_node[b-1].append(a)
q = [1]
visit = [1] + [0] * (n-1)
prev = [0]*n
while q:
now = q.pop()
for i in next_node[now-1]:
i... | n, m = map(int, input().split())
edge = [list(map(int, input().split())) for _ in range(m)]
next_node = [[] for _ in range(n)]
for a, b in edge:
next_node[a-1].append(b)
next_node[b-1].append(a)
q = [1]
visit = [1] + [0] * (n-1)
prev = [0] * n
while q:
now = q.pop(0)
for i in next_node[now-1]:
... | [
"call.arguments.change"
] | 400,765 | 400,766 | u970267139 | python |
p02678 | from collections import deque
# 頂点数と辺数
N, M = map(int, input().split())
# 辺
AB = [map(int, input().split()) for _ in range(M)]
# 無向グラフの隣接リスト設定
link = [[] for _ in range(N + 1)]
for a, b in AB:
link[a].append(b)
link[b].append(a)
# BFSのデータフレーム
dist = [-1] * (N + 1) # 看板未設定
que = deque([1]) # 頂点1を始点とした訪問キュー... | from collections import deque
# 頂点数と辺数
N, M = map(int, input().split())
# 辺
AB = [map(int, input().split()) for _ in range(M)]
# 無向グラフの隣接リスト設定
link = [[] for _ in range(N + 1)]
for a, b in AB:
link[a].append(b)
link[b].append(a)
# BFSのデータフレーム
dist = [-1] * (N + 1) # 看板未設定
que = deque([1]) # 頂点1を始点とした訪問キュー... | [
"call.remove"
] | 400,770 | 400,771 | u079022116 | python |
p02678 | #この解答を自分で写経してみる
N,M=map(int,input().split())
AB=[map(int,input().split()) for _ in range(M)]
#map関数を格納したリストを作る
#この_表記で繰り返すという文化に慣れよう
links=[[] for _ in range(N+1)]
#移動先を出力する
#リストの入れ子にしたかったら、最初から入れ子として定義しないといけない
#何か + for _ in range(M) で、何かをM回繰り返す
for a,b in AB:
#map関数それぞれに対して、値を抽出する
links[a].append(b)
links[b]... | #この解答を自分で写経してみる
N,M=map(int,input().split())
AB=[map(int,input().split()) for _ in range(M)]
#map関数を格納したリストを作る
#この_表記で繰り返すという文化に慣れよう
links=[[] for _ in range(N+1)]
#移動先を出力する
#リストの入れ子にしたかったら、最初から入れ子として定義しないといけない
#何か + for _ in range(M) で、何かをM回繰り返す
for a,b in AB:
#map関数それぞれに対して、値を抽出する
links[a].append(b)
links[b]... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,772 | 400,773 | u349765885 | python |
p02678 | #この解答を自分で写経してみる
N,M=map(int,input().split())
AB=[map(int,input().split()) for _ in range(M)]
#map関数を格納したリストを作る
#この_表記で繰り返すという文化に慣れよう
links=[[] for _ in range(N+1)]
#移動先を出力する
#リストの入れ子にしたかったら、最初から入れ子として定義しないといけない
#何か + for _ in range(M) で、何かをM回繰り返す
for a,b in AB:
#map関数それぞれに対して、値を抽出する
links[a].append(b)
links[b]... | #この解答を自分で写経してみる
N,M=map(int,input().split())
AB=[map(int,input().split()) for _ in range(M)]
#map関数を格納したリストを作る
#この_表記で繰り返すという文化に慣れよう
links=[[] for _ in range(N+1)]
#移動先を出力する
#リストの入れ子にしたかったら、最初から入れ子として定義しないといけない
#何か + for _ in range(M) で、何かをM回繰り返す
for a,b in AB:
#map関数それぞれに対して、値を抽出する
links[a].append(b)
links[b]... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,774 | 400,773 | u349765885 | python |
p02678 | from collections import deque
N,M = map(int, input().split())
root = [[] for _ in range(N)]
for _ in range(N):
a,b = map(int,input().split())
root[a - 1].append(b)
root[b - 1].append(a)
q = deque()
q.append(1)
ans = [0 for _ in range(N)]
while len(q) > 0:
v = q.popleft()
for ike in root[v - 1]:
q.append(ike... | from collections import deque
N,M = map(int, input().split())
root = [[] for _ in range(N)]
for _ in range(M):
a,b = map(int,input().split())
root[a - 1].append(b)
root[b - 1].append(a)
q = deque()
q.append(1)
ans = [0 for _ in range(N)]
while len(q) > 0:
v = q.popleft()
for ike in root[v - 1]:
q.append(ike... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,775 | 400,776 | u577415482 | python |
p02678 | n,m = map(int,input().split())
info = [[] for i in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
info[a].append(b)
info[b].append(a)
import collections
seen = [-1]*(n+1)
todo = collections.deque()
for i in info[1]:
todo.append(i)
seen[i] = 1
while len(todo) != 0:
now = todo.p... | n,m = map(int,input().split())
info = [[] for i in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
info[a].append(b)
info[b].append(a)
import collections
seen = [-1]*(n+1)
todo = collections.deque()
for i in info[1]:
todo.append(i)
seen[i] = 1
while len(todo) != 0:
now = todo.p... | [
"assignment.value.change",
"identifier.change"
] | 400,790 | 400,791 | u204208382 | python |
p02678 | n,m = map(int,input().split())
info = [[] for i in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
info[a].append(b)
info[b].append(a)
import collections
seen = [-1]*(n+1)
todo = collections.deque()
for i in info[1]:
todo.appendleft(i)
seen[i] = 1
while len(todo) != 0:
now = to... | n,m = map(int,input().split())
info = [[] for i in range(n+1)]
for i in range(m):
a,b = map(int,input().split())
info[a].append(b)
info[b].append(a)
import collections
seen = [-1]*(n+1)
todo = collections.deque()
for i in info[1]:
todo.append(i)
seen[i] = 1
while len(todo) != 0:
now = todo.p... | [
"identifier.change"
] | 400,792 | 400,791 | u204208382 | python |
p02678 | def m():
N, M = map(int, input().split())
g = [[] for _ in range(N + 1)]
dp = [10 ** 9] * (N + 1)
visited = [False] * (N + 1)
for _ in range(M):
a, b = map(int, input().split())
g[a].append(b)
g[b].append(a)
def bfs(root):
visited[root] = True
dp[root] =... |
def m():
N, M = map(int, input().split())
g = [[] for _ in range(N + 1)]
dp = [10 ** 9] * (N + 1)
visited = [False] * (N + 1)
for _ in range(M):
a, b = map(int, input().split())
g[a].append(b)
g[b].append(a)
def bfs(root):
visited[root] = True
dp[root] ... | [
"call.arguments.change"
] | 400,804 | 400,805 | u480847874 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
graph = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
print(a, b)
graph[a-1].append(b-1)
graph[b-1].append(a-1)
# print(graph)
res = [-1] * (N)
que = deque()
que.append(0)
while que:
i = que.popleft()
... | from collections import deque
N, M = map(int, input().split())
graph = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
graph[a-1].append(b-1)
graph[b-1].append(a-1)
# print(graph)
res = [-1] * (N)
que = deque()
que.append(0)
while que:
i = que.popleft()
for j in graph[... | [
"call.remove"
] | 400,812 | 400,813 | u162172626 | python |
p02678 | from sys import stdin
from collections import deque
n,m=map(int,input().split())
ab=[[] for _ in range(n)]
for i in range(m):
a,b=map(int,readline().split())
a-=1
b-=1
ab[a].append(b)
ab[b].append(a)
queue=[0]
ans=[-1]*n
ans[0]=0
while len(queue)!=0:
now_check=queue.pop(0)
for i in ab[now_c... | from sys import stdin
from collections import deque
n,m=map(int,input().split())
ab=[[] for _ in range(n)]
for i in range(m):
a,b=map(int,stdin.readline().split())
a-=1
b-=1
ab[a].append(b)
ab[b].append(a)
queue=[0]
ans=[-1]*n
ans[0]=0
while len(queue)!=0:
now_check=queue.pop(0)
for i in ab... | [] | 400,822 | 400,823 | u055303078 | python |
p02678 | n,m = map(int,input().split())
AB = []
ans = [-1] * (n) #####
edge = [[] for _ in range(n)] #edge[i] := 頂点iから伸びてる辺の行き先のリスト #####
for i in range(m):
a,b = map(int,input().split())
a-=1; b-=1 #####
edge[a].append(b)
edge[b].append(a)
import collections
que = collections.deque()
que.append(0... | n,m = map(int,input().split())
AB = []
ans = [-1] * (n) #####
edge = [[] for _ in range(n)] #edge[i] := 頂点iから伸びてる辺の行き先のリスト #####
for i in range(m):
a,b = map(int,input().split())
a-=1; b-=1 #####
edge[a].append(b)
edge[b].append(a)
import collections
que = collections.deque()
que.append(0... | [] | 400,830 | 400,831 | u788137651 | python |
p02678 | from collections import deque
import sys
sys.setrecursionlimit(10**9)
INF = 10**20
def main():
N,M = map(int,input().split())
graph = [[] for _ in range(N)]
for i in range(M):
A,B = map(int,input().split())
graph[B-1].append(A-1)
graph[A-1].append(B-1)
stack = deque([0])
... | from collections import deque
import sys
sys.setrecursionlimit(10**9)
INF = 10**20
def main():
N,M = map(int,input().split())
graph = [[] for _ in range(N)]
for i in range(M):
A,B = map(int,input().split())
graph[B-1].append(A-1)
graph[A-1].append(B-1)
stack = deque([0])
... | [
"assignment.value.change",
"identifier.change"
] | 400,837 | 400,838 | u997648604 | python |
p02678 | N, M = map(int,input().split())
graph = [[] for n in range(N+1)]
for _ in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
# 入力例 1の場合
# graph : [[], [2], [1, 3, 4], [2, 4], [3, 2]] graphのインデックスが部屋名
# graph[2] : 部屋2は、1,3,4と繋がっている
# graph[4] : 部屋4は、3,2と繋がっている
#次に探索をする部屋番号をストックして... | N, M = map(int, input().split())
graph = [[] for n in range(N + 1)]
for _ in range(M):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
# 入力例 1の場合
# graph : [[], [2], [1, 3, 4], [2, 4], [3, 2]] graphのインデックスが部屋名
# graph[2] : 部屋2は、1,3,4と繋がっている
# graph[4] : 部屋4は、3,2と繋がっている
# 次に探索をする部屋番号を... | [
"assignment.add"
] | 400,841 | 400,842 | u212328220 | python |
p02678 | N, M = map(int,input().split())
graph = [[] for n in range(N+1)]
for _ in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
# 入力例 1の場合
# graph : [[], [2], [1, 3, 4], [2, 4], [3, 2]] graphのインデックスが部屋名
# graph[2] : 部屋2は、1,3,4と繋がっている
# graph[4] : 部屋4は、3,2と繋がっている
#次に探索をする部屋番号をストックして... | N, M = map(int,input().split())
graph = [[] for n in range(N+1)]
for _ in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
# 入力例 1の場合
# graph : [[], [2], [1, 3, 4], [2, 4], [3, 2]] graphのインデックスが部屋名
# graph[2] : 部屋2は、1,3,4と繋がっている
# graph[4] : 部屋4は、3,2と繋がっている
#次に探索をする部屋番号をストックして... | [
"assignment.add"
] | 400,841 | 400,843 | u212328220 | python |
p02678 | from _collections import deque
n,m=map(int,input().split())
M=[[] for _ in range(n)]
ANS=[-1]*n
ANS[0]=0
for i in range(m):
a,b=map(int,input().split())
M[b-1].append(a-1)
M[a-1].append(b-1)
q=deque([0])
while q:
s=q.popleft()
for x in M[s]:
if ANS[x]!=-1:
continue
q.ap... | from _collections import deque
n,m=map(int,input().split())
M=[[] for _ in range(n)]
ANS=[-1]*n
ANS[0]=0
for i in range(m):
a,b=map(int,input().split())
M[b-1].append(a-1)
M[a-1].append(b-1)
q=deque([0])
while q:
s=q.popleft()
for x in M[s]:
if ANS[x]!=-1:
continue
q.ap... | [] | 400,851 | 400,852 | u210827208 | python |
p02678 | from _collections import deque
n,m=map(int,input().split())
X=[[] for _ in range(n)]
visited=[0]*(n+1)
ANS=[0]*n
ANS[0]=1
for i in range(m):
a,b=map(int,input().split())
X[a-1].append(b-1)
X[b-1].append(a-1)
q=deque([0])
visited[0]=1
while len(q)>0:
s=q.popleft()
for x in X[s]:
if visited[x... | from _collections import deque
n,m=map(int,input().split())
X=[[] for _ in range(n)]
visited=[0]*(n+1)
ANS=[0]*n
ANS[0]=1
for i in range(m):
a,b=map(int,input().split())
X[a-1].append(b-1)
X[b-1].append(a-1)
q=deque([0])
visited[0]=1
while len(q)>0:
s=q.popleft()
for x in X[s]:
if visited[x... | [
"call.remove"
] | 400,853 | 400,854 | u210827208 | python |
p02678 | from collections import defaultdict
from collections import deque
n , m = map(int , input().split())
g = defaultdict(list)
for i in range(m):
u , v = map(int , input().split())
g[u].append(v)
g[v].append(u)
#print(g)
visited = [False]*(n+1)
a = [10**10]*(n+1)
q = deque()
q.append(1)
while q:
node = q.popleft()
vis... | from collections import defaultdict
from collections import deque
n , m = map(int , input().split())
g = defaultdict(list)
for i in range(m):
u , v = map(int , input().split())
g[u].append(v)
g[v].append(u)
#print(g)
visited = [False]*(n+1)
a = [10**10]*(n+1)
q = deque()
q.append(1)
while q:
node = q.popleft()
vis... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,855 | 400,856 | u733581231 | python |
p02678 | from collections import defaultdict
from collections import deque
n , m = map(int , input().split())
g = defaultdict(list)
for i in range(m):
u , v = map(int , input().split())
g[u].append(v)
g[v].append(u)
#print(g)
visited = [False]*(n+1)
a = [10**10]*(n+1)
q = deque()
q.append(1)
while q:
node = q.popleft()
vis... | from collections import defaultdict
from collections import deque
n , m = map(int , input().split())
g = defaultdict(list)
for i in range(m):
u , v = map(int , input().split())
g[u].append(v)
g[v].append(u)
#print(g)
visited = [False]*(n+1)
a = [10**10]*(n+1)
q = deque()
q.append(1)
while q:
node = q.popleft()
vis... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.continue.add",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 400,857 | 400,856 | u733581231 | python |
p02678 | N, M = map(int, input().split())
memo = [[] for _ in range(M+1)]
for _ in range(M):
Ai, Bi = map(int, input().split())
memo[Ai].append(Bi)
memo[Bi].append(Ai)
# print(memo)
visited = [False] * (N+1)
visited[1] = True
ans = [0]*(N+1)
queue = [1]
while queue:
room = queue.pop(0)
for connected_r... | N, M = map(int, input().split())
memo = [[] for _ in range(N+1)]
for _ in range(M):
Ai, Bi = map(int, input().split())
memo[Ai].append(Bi)
memo[Bi].append(Ai)
# print(memo)
visited = [False] * (N+1)
visited[1] = True
ans = [0]*(N+1)
queue = [1]
while queue:
room = queue.pop(0)
for connected_r... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,873 | 400,874 | u982591663 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while len(... | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while len(... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,882 | 400,881 | u826785572 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while len(... | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while len(... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 400,883 | 400,881 | u826785572 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while len(... | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(100005)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,882 | 400,885 | u826785572 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while len(... | from collections import deque
n, m = map(int, input().split())
INF = 100000000
to = [[] for _ in range(100005)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
print('Yes')
q = deque([])
dist = [INF] * n
pre = [-1] * n
dist[0] = 0
q.append(0)
while... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 400,883 | 400,885 | u826785572 | python |
p02678 | N,M = map(int,input().split())
AB = [list(map(int,input().split())) for i in range(M)]
ans = [-1] * (N+1)
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
from collections import deque
import sys
ans = [-1] * (N+1)
todo = deque([(1,0)])
while todo:
x,parent = tod... | N,M = map(int,input().split())
AB = [list(map(int,input().split())) for i in range(M)]
ans = [-1] * (N+1)
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
from collections import deque
import sys
ans = [-1] * (N+1)
todo = deque([(1,0)])
while todo:
x,parent = deq... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 400,896 | 400,897 | u698919163 | python |
p02678 | from math import floor,ceil,sqrt
import fractions
import itertools
from collections import deque
import heapq
N,M=map(int,input().split())
tree=[[] for _ in range(N)]
for i in range(M):
a,b=map(int,input().split())
tree[a-1].append(b-1)
tree[b-1].append(a-1)
prev=[-1]*N
d=[float("inf")]
prev[0]=0
d=deque()
... | from math import floor,ceil,sqrt
import fractions
import itertools
from collections import deque
import heapq
N,M=map(int,input().split())
tree=[[] for _ in range(N)]
for i in range(M):
a,b=map(int,input().split())
tree[a-1].append(b-1)
tree[b-1].append(a-1)
prev=[-1]*N
d=[float("inf")]
prev[0]=0
d=deque()
... | [
"call.add"
] | 400,902 | 400,903 | u995004106 | python |
p02678 | from collections import deque
n,m = map(int,input().split())
map_li = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
map_li[a].append(b)
map_li[b].append(a)
ans_li = [-1]*n
queue=deque([0])
visited = [False]*n
while queue:
x = queue.pop()
for g in map_li... | from collections import deque
n,m = map(int,input().split())
map_li = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
map_li[a].append(b)
map_li[b].append(a)
ans_li = [-1]*n
queue=deque([0])
visited = [False]*n
while queue:
x = queue.popleft()
for g in ma... | [
"assignment.value.change",
"identifier.change"
] | 400,912 | 400,913 | u798260206 | python |
p02678 | from collections import deque
n,m = map(int,input().split())
map_li = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
map_li[a].append(b)
map_li[b].append(a)
ans_li = [-1]*n
queue=deque([0])
visited = [False]*n
while queue:
x = queue.pop(0)
for g in map_l... | from collections import deque
n,m = map(int,input().split())
map_li = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
map_li[a].append(b)
map_li[b].append(a)
ans_li = [-1]*n
queue=deque([0])
visited = [False]*n
while queue:
x = queue.popleft()
for g in ma... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 400,914 | 400,913 | u798260206 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
route =[[] for i in range(m+1)]
for i in range(m):
a, b = map(int, input().split())
route[a].append(b)
route[b].append(a)
visited = [0 for i in range(n+1)]
visited[1] = 1
ans = [0 for i in range(n+1)]
D = deque()
D.append(1)
while D:
visit =... | from collections import deque
n, m = map(int, input().split())
route =[[] for i in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
route[a].append(b)
route[b].append(a)
visited = [0 for i in range(n+1)]
visited[1] = 1
ans = [0 for i in range(n+1)]
D = deque()
D.append(1)
while D:
visit =... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,919 | 400,920 | u104005543 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
nei_L = [[] for _ in range(M)]
for i in range(M):
a, b = map(int, input().split())
nei_L[a - 1].append(b - 1)
nei_L[b - 1].append(a - 1)
ans = [-1] * N
queue = deque()
def bfs():
queue.append(0)
while queue:
now = queue.popl... | from collections import deque
N, M = map(int, input().split())
nei_L = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
nei_L[a - 1].append(b - 1)
nei_L[b - 1].append(a - 1)
ans = [-1] * N
queue = deque()
def bfs():
queue.append(0)
while queue:
now = queue.popl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,925 | 400,926 | u548545174 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
nei_L = [[] for _ in range(M)]
for i in range(M):
a, b = map(int, input().split())
nei_L[a - 1].append(b - 1)
nei_L[b - 1].append(a - 1)
ans = [-1] * N
queue = deque()
def bfs():
queue.append(0)
while len(queue) > 0:
now = q... | from collections import deque
N, M = map(int, input().split())
nei_L = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
nei_L[a - 1].append(b - 1)
nei_L[b - 1].append(a - 1)
ans = [-1] * N
queue = deque()
def bfs():
queue.append(0)
while queue:
now = queue.popl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove"
] | 400,927 | 400,926 | u548545174 | python |
p02678 | n, m = map(int, input().split())
G = [[] for _ in range(m)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].append(v)
G[v].append(u)
ans = [-1] * n
# ans[0] = 'Yes'
from collections import deque
q = deque([0])
while q:
_q = q.popleft()
for x in G[_q]:
if a... | n, m = map(int, input().split())
G = [[] for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].append(v)
G[v].append(u)
ans = [-1] * n
from collections import deque
q = deque([0])
while q:
_q = q.popleft()
for x in G[_q]:
if ans[x] == -1:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,934 | 400,935 | u072949274 | python |
p02678 | 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)
q = [0]
ans = [-1]*n
ans[0] = 0
count = 1
while q:
l = q.pop(0)
for i in edges[l]:
if ans[i] == -1:
ans[i] = l
... | 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)
q = [0]
ans = [-1]*n
ans[0] = 0
count = 1
while q:
l = q.pop(0)
for i in edges[l]:
if ans[i] == -1:
ans[i] = l
... | [
"call.add"
] | 400,945 | 400,946 | u623231048 | python |
p02678 | 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)
q = [0]
ans = [-1]*n
ans[0] = 0
count = 1
while q:
l = q.pop(-1)
for i in edges[l]:
if ans[i] == -1:
ans[i] = l
... | 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)
q = [0]
ans = [-1]*n
ans[0] = 0
count = 1
while q:
l = q.pop(0)
for i in edges[l]:
if ans[i] == -1:
ans[i] = l
... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.unary.remove"
] | 400,947 | 400,946 | u623231048 | python |
p02678 | from collections import deque
n, m = map(int, input().split())
route = [[] for i in range(m)]
for i in range(m):
a, b = map(int, input().split())
route[a-1].append(b - 1)
route[b-1].append(a - 1)
next_queue = deque()
sign = [-1] * n
sign[0] = 999
next_queue.append(0)
while next_queue:
current_number... | from collections import deque
n, m = map(int, input().split())
route = [[] for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
route[a-1].append(b - 1)
route[b-1].append(a - 1)
next_queue = deque()
sign = [-1] * n
sign[0] = 999
next_queue.append(0)
while next_queue:
current_number... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,950 | 400,951 | u531603069 | python |
p02678 | def resolve():
n, m = map(int, input().split())
ab = [list(map(int, input().split()))for i in range(m)]
ans = [0] * n
edge = [[]for _ in range(n)]
for a, b in ab:
edge[a - 1].append(b - 1)
edge[b - 1].append(a - 1)
visited = {0}
stack = [0]
for i in stack:
for j i... | def resolve():
n, m = map(int, input().split())
ab = [list(map(int, input().split()))for i in range(m)]
ans = [0] * n
edge = [[]for _ in range(n)]
for a, b in ab:
edge[a - 1].append(b - 1)
edge[b - 1].append(a - 1)
visited = {0}
stack = [0]
for i in stack:
for j i... | [
"call.add"
] | 400,957 | 400,958 | u586662847 | python |
p02678 | from collections import deque
N,M = (int(x) for x in input().split())
connected = [[] for _ in range(N+1)]
searched = [0] * (N+1)
signs = [0] * (N+1)
for i in range(M):
A,B = (int(x) for x in input().split())
connected[A].append(B)
connected[B].append(A)
d = deque()
for edge in connected[1]:
d.append(... | from collections import deque
N,M = (int(x) for x in input().split())
connected = [[] for _ in range(N+1)]
searched = [0] * (N+1)
signs = [0] * (N+1)
for i in range(M):
A,B = (int(x) for x in input().split())
connected[A].append(B)
connected[B].append(A)
d = deque()
for edge in connected[1]:
d.append(... | [
"assignment.add"
] | 400,959 | 400,960 | u093041722 | python |
p02678 | N, M = map(int, input().split())
lists = [False for i in range(N)]
lists[0] = True
a = N - 1
dicts = {i:[] for i in range(N)}
d = deque([0])
for i in range(M):
tmpa, tmpb = map(lambda x: int(x) - 1, input().split())
dicts[tmpa] += [tmpb]
dicts[tmpb] += [tmpa]
print('Yes')
while a > 0:
tmp = d.poplef... | from collections import deque
N, M = map(int, input().split())
lists = [False for i in range(N)]
lists[0] = True
a = N - 1
dicts = {i:[] for i in range(N)}
d = deque([0])
for i in range(M):
tmpa, tmpb = map(lambda x: int(x) - 1, input().split())
dicts[tmpa] += [tmpb]
dicts[tmpb] += [tmpa]
print('Yes')
w... | [] | 400,961 | 400,962 | u651109406 | python |
p02678 | from queue import Queue
n,m = map(int,input().split())
grafo = [[] for i in range(n)]
for x in range(m):
a,b = map(int,input().split())
grafo[a-1].append(b)
grafo[b-1].append(a)
placas = [0] * (n)
def bfs(a):
q = Queue(maxsize = n)
placas[1] = 1
q.put(a)
while not q.empty():
po... | from queue import Queue
n,m = map(int,input().split())
grafo = [[] for i in range(n)]
for x in range(m):
a,b = map(int,input().split())
grafo[a-1].append(b)
grafo[b-1].append(a)
placas = [0] * (n)
def bfs(a):
q = Queue(maxsize = n)
placas[0] = 1
q.put(a)
while not q.empty():
po... | [
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 400,969 | 400,970 | u945335181 | python |
p02678 | n,m=list(map(int, input().split()))
root = [[] for _ in range(n)]
answer=[0]*n
answer[0]=1
for i in range(m):
c=list(map(int, input().split()))
root[c[1]-1].append(c[0]-1)
root[c[0]-1].append(c[1]-1)
count=1#最初から1の部屋はOKにしとく
queue=[0]
#print(root)
newqueue=[]
while(count<n and len(queue)!=0):
for j in qu... | n,m=list(map(int, input().split()))
root = [[] for _ in range(n)]
answer=[-1]*n
answer[0]=1
for i in range(m):
c=list(map(int, input().split()))
root[c[1]-1].append(c[0]-1)
root[c[0]-1].append(c[1]-1)
count=1#最初から1の部屋はOKにしとく
queue=[0]
#print(root)
newqueue=[]
while(count<n and len(queue)!=0):
for j in q... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 400,981 | 400,982 | u927839462 | python |
p02678 | from collections import deque
n,m = map(int,input().split())
path = []
net = [[] for _ in range(n+1)]
for _ in range(m):
a,b = map(int,input().split())
net[a].append(b)
net[b].append(a)
a = [-1] * (n+1)
d = deque()
d.append(1)
while d:
u = d.popleft()
for child in net[u]:
if a[child] != -... | from collections import deque
n,m = map(int,input().split())
path = []
net = [[] for _ in range(n+1)]
for _ in range(m):
a,b = map(int,input().split())
net[a].append(b)
net[b].append(a)
a = [-1] * (n+1)
d = deque()
d.append(1)
while d:
u = d.popleft()
for child in net[u]:
if a[child] != -... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 400,985 | 400,986 | u788703383 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
G = [[] for _ in range(M)]
for i in range(M):
A, B = map(int, input().split())
G[A-1].append(B-1)
G[B-1].append(A-1)
seen = [0 for _ in range(N)]
seen[0] = 1
shirube = [-1 for _ in range(N-1)]
stack = deque([0])
while stack:
now = stack.popleft()... | from collections import deque
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for i in range(M):
A, B = map(int, input().split())
G[A-1].append(B-1)
G[B-1].append(A-1)
seen = [0 for _ in range(N)]
seen[0] = 1
shirube = [-1 for _ in range(N-1)]
stack = deque([0])
while stack:
now = stack.popleft()... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,987 | 400,988 | u594956556 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
G = [[] for _ in range(M)]
for i in range(M):
A, B = map(int, input().split())
G[A-1].append(B-1)
G[B-1].append(A-1)
seen = [0 for _ in range(N)]
seen[0] = 1
shirube = [-1 for _ in range(N-1)]
stack = deque([0])
while stack:
now = stack.popleft()... | from collections import deque
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for i in range(M):
A, B = map(int, input().split())
G[A-1].append(B-1)
G[B-1].append(A-1)
seen = [0 for _ in range(N)]
seen[0] = 1
shirube = [-1 for _ in range(N-1)]
stack = deque([0])
while stack:
now = stack.popleft()... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 400,989 | 400,988 | u594956556 | python |
p02678 | import sys,queue,math,copy,itertools,bisect,collections
from heapq import *
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
SI = lambda : sys.stdin.readline().rstrip()
... | import sys,queue,math,copy,itertools,bisect,collections
from heapq import *
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
SI = lambda : sys.stdin.readline().rstrip()
... | [
"call.arguments.change",
"assignment.value.change",
"identifier.change"
] | 400,992 | 400,993 | u703950586 | python |
p02678 | from typing import List
N, M = map(int, input().split())
graph:List[List[int]] = [[] for _ in range(N)]
for _ in range(N):
a,b = map(lambda x : int(x) -1 , input().split())
graph[a].append(b)
graph[b].append(a)
prev = [-1]*N
prev[0] = 0
import queue
qu = queue.Queue()
qu.put(0)
while not qu.empty():
top... | from typing import List
N, M = map(int, input().split())
graph:List[List[int]] = [[] for _ in range(N)]
for _ in range(M):
a,b = map(lambda x : int(x) -1 , input().split())
graph[a].append(b)
graph[b].append(a)
prev = [-1]*N
prev[0] = 0
import queue
qu = queue.Queue()
qu.put(0)
while not qu.empty():
top... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,011 | 401,012 | u961867404 | python |
p02678 | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, M = map(int, input().split())
graph = [[] for _ in range(M)]
for _ in range(M):
A, B = map(int, input().split())
graph[A-1].append(B-1)
g... | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, M = map(int, input().split())
graph = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
# print(A, B)
graph[A-1]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 401,013 | 401,014 | u016881126 | python |
p02678 | from collections import deque
def main():
N, M, *AB = map(int, open(0).read().split())
C = {}
for i in range(M):
a = AB[2 * i + 0] - 1
b = AB[2 * i + 1] - 1
if a not in C:
C[a] = []
C[a].append(b)
if b not in C:
C[b] = []
C[b].append(a... | from collections import deque
def main():
N, M, *AB = map(int, open(0).read().split())
C = {}
for i in range(M):
a = AB[2 * i + 0] - 1
b = AB[2 * i + 1] - 1
if a not in C:
C[a] = []
C[a].append(b)
if b not in C:
C[b] = []
C[b].append(a... | [
"call.remove"
] | 401,035 | 401,036 | u838644735 | python |
p02678 | def main():
input1 = input()
input1 = input1.split()
N = int(input1[0])
M = int(input1[1])
aisle = {}
result = [0]*(N-1)
record = [1]
count = N-1
in1 = 0
in2 = 0
for i in range(M):
input2 = input()
input2 = input2.split()
in1 = int(input2[0])
... | def main():
input1 = input()
input1 = input1.split()
N = int(input1[0])
M = int(input1[1])
aisle = {}
result = [0]*(N-1)
record = [1]
count = N-1
in1 = 0
in2 = 0
for i in range(M):
input2 = input()
input2 = input2.split()
in1 = int(input2[0])
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 401,043 | 401,044 | u332317213 | python |
p02678 | import bisect,collections,copy,heapq,itertools,math,numpy,string
#from operator import itemgetter
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().r... | import bisect,collections,copy,heapq,itertools,math,numpy,string
#from operator import itemgetter
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().r... | [
"expression.operation.binary.remove"
] | 401,053 | 401,054 | u441064181 | python |
p02678 | from collections import deque
n,m = map(int,input().split())
res = {}
for i in range(m):
a,b = map(int,input().split())
res.setdefault(a,[]).append(b)
res.setdefault(b,[]).append(a)
dist =[0] * (n+1)
sirusi = [0] * (n+1)
dist[1] = -1
que = deque([])
ique = deque([])
x = res.pop(1)
#print(x)
que.append(x... | from collections import deque
n,m = map(int,input().split())
res = {}
for i in range(m):
a,b = map(int,input().split())
res.setdefault(a,[]).append(b)
res.setdefault(b,[]).append(a)
dist =[0] * (n+1)
sirusi = [0] * (n+1)
dist[1] = -1
que = deque([])
ique = deque([])
x = res.pop(1)
#print(x)
que.append(x... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 401,060 | 401,061 | u167360450 | python |
p02678 | from collections import deque
n,m = map(int,input().split())
res = {}
for i in range(m):
a,b = map(int,input().split())
res.setdefault(a,[]).append(b)
res.setdefault(b,[]).append(a)
dist =[0] * (n+1)
sirusi = [0] * (n+1)
dist[1] = -1
que = deque([])
ique = deque([])
x = res.pop(1)
#print(x)
que.append(x... | from collections import deque
n,m = map(int,input().split())
res = {}
for i in range(m):
a,b = map(int,input().split())
res.setdefault(a,[]).append(b)
res.setdefault(b,[]).append(a)
dist =[0] * (n+1)
sirusi = [0] * (n+1)
dist[1] = -1
que = deque([])
ique = deque([])
x = res.pop(1)
#print(x)
que.append(x... | [
"call.add"
] | 401,062 | 401,061 | u167360450 | python |
p02678 | from collections import deque
N, M = map(int, input().split())
ways = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
ways[a].append(b)
ways[b].append(a)
print(ways)
searched = [0 for i in range(N)]
searched[0] = 1
ans = [0 for i in range(N)]
d = deque([])
d.append(0)
... | from collections import deque
N, M = map(int, input().split())
ways = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
ways[a].append(b)
ways[b].append(a)
searched = [0 for i in range(N)]
searched[0] = 1
ans = [0 for i in range(N)]
d = deque([])
d.append(0)
while d:
t... | [
"call.remove"
] | 401,063 | 401,064 | u536034761 | python |
p02678 | N, M = map(int, input().split())
graph = [[] for i in range(N)]
for i in range(M):
A, B = map(lambda x: int(x) - 1, input().split())
graph[A].append(B)
graph[B].append(A)
from collections import deque
dist = [-1] * N
prev = [-1] * N
dist[0] = 0
queue = deque([0])
while queue:
tmp = queue.popleft()
... | N, M = map(int, input().split())
graph = [[] for i in range(N)]
for i in range(M):
A, B = map(lambda x: int(x) - 1, input().split())
graph[A].append(B)
graph[B].append(A)
from collections import deque
dist = [-1] * N
prev = [-1] * N
dist[0] = 0
queue = deque([0])
while queue:
tmp = queue.popleft()
... | [
"identifier.change"
] | 401,069 | 401,070 | u745561510 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.