s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s681464459 | p02238 | u970436839 | 1454337993 | Python | Python | py | Runtime Error | 0 | 0 | 540 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
t = 0
def dfsv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
dfsv(v)
color[u] = 2
t += 1
f[u] = t
def dfs():
for u in range(n):
if color[u] == 0:
dfsv(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
dfs()
|
s953295337 | p02238 | u970436839 | 1454338458 | Python | Python | py | Runtime Error | 0 | 0 | 568 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
X = [0 for i in range(n)]
def dfsv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
dfsv(v)
color[u] = 2
t += 1
f[u] = t
def dfs():
t = 0
for u in range(n):
if color[u] == 0:
dfsv(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
dfs()
|
s973740997 | p02238 | u970436839 | 1454338476 | Python | Python | py | Runtime Error | 0 | 0 | 569 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
X = [0 for i in range(n)]
def dfsv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
dfsv(v)
color[u] == 2
t += 1
f[u] = t
def dfs():
t = 0
for u in range(n):
if color[u] == 0:
dfsv(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
dfs()
|
s715656881 | p02238 | u970436839 | 1454338646 | Python | Python | py | Runtime Error | 0 | 0 | 570 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
X = [0 for i in range(n)]
def dfsv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
dfsv(v)
color[u] = 2
t += 1
f[u] = t
def dfs():
t = 0
for u in range(n):
if color[u] == 0:
dfsv(u)
for u in range(n):
print (u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
dfs()
|
s690502768 | p02238 | u970436839 | 1454339021 | Python | Python | py | Runtime Error | 0 | 0 | 566 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
X = [0 for i in range(n)]
t = 0
def DFSv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFSv(v)
color[u] = 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFSv(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s620225394 | p02238 | u970436839 | 1454339141 | Python | Python | py | Runtime Error | 0 | 0 | 566 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
X = [0 for i in range(n)]
t = 0
def DFSv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFSv(v)
color[u] = 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFSv(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s184233861 | p02238 | u970436839 | 1454339329 | Python | Python | py | Runtime Error | 0 | 0 | 1194 | n = input()
color = [0 for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
X = [0 for i in range(n)]
t = 0
def DFSv(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFSv(v)
color[u] = 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFSv(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t[0]
for v in range(n):
if M[u][v] == 1 and st[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if st[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s683675979 | p02238 | u970436839 | 1454339339 | Python | Python | py | Runtime Error | 0 | 0 | 631 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t[0]
for v in range(n):
if M[u][v] == 1 and st[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if st[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s905001498 | p02238 | u970436839 | 1454339367 | Python | Python | py | Runtime Error | 0 | 0 | 628 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and st[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if st[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s997973527 | p02238 | u970436839 | 1454339415 | Python | Python | py | Runtime Error | 0 | 0 | 631 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if st[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s231604861 | p02238 | u970436839 | 1454339426 | Python | Python | py | Runtime Error | 0 | 0 | 634 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s211485008 | p02238 | u970436839 | 1454339481 | Python | Python | py | Runtime Error | 0 | 0 | 648 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = [0]
def DFS_v(u):
color[u] = 1
t[0] += 1
d[u] = t[0]
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] == 2
t[0] += 1
f[u] = t[0]
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s154092211 | p02238 | u970436839 | 1454339604 | Python | Python | py | Runtime Error | 0 | 0 | 643 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s212422283 | p02238 | u970436839 | 1454339665 | Python | Python | py | Runtime Error | 0 | 0 | 633 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print u+1, d[u], f[u]
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s997474322 | p02238 | u970436839 | 1454339704 | Python | Python | py | Runtime Error | 0 | 0 | 647 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] == 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print "%d %d %d" %(u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s589580079 | p02238 | u970436839 | 1454339791 | Python | Python | py | Runtime Error | 0 | 0 | 646 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_visit(v)
color[u] = 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print "%d %d %d" %(u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS()
|
s093072660 | p02238 | u970436839 | 1454340330 | Python | Python | py | Runtime Error | 0 | 0 | 589 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_v(v)
color[u] = 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print "%d %d %d" %(u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS() |
s365547628 | p02238 | u970436839 | 1454340483 | Python | Python | py | Runtime Error | 0 | 0 | 589 | n = input()
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
t = 0
def DFS_v(u):
color[u] = 1
t += 1
d[u] = t
for v in range(n):
if M[u][v] == 1 and color[v] == 0:
DFS_v(v)
color[u] = 2
t += 1
f[u] = t
def DFS():
for u in range(n):
if color[u] == 0:
DFS_v(u)
for u in range(n):
print '%d %d %d' %(u+1, d[u], f[u])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS() |
s246705085 | p02238 | u970436839 | 1454340648 | Python | Python | py | Runtime Error | 0 | 0 | 669 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
X = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
col = [0 for i in range(n)]
t = [0]
def DFS_visit(u):
col[u] = 1
t[0] += 1
d[u] = t[0]
for v in range(n):
if M[u][v] == 1 and col[v] == 0:
DFS_visit(v)
clo[u] = 2
t[0] += 1
f[u] = t[0]
def DFS():
for u in range(n):
if col[u] == 0:
DFS_visit(u)
for u in range(n):
print'{0} {1} {2}'.format(s+1, d[s], f[s])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS() |
s796074038 | p02238 | u970436839 | 1454340707 | Python | Python | py | Runtime Error | 0 | 0 | 669 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
col = [0 for i in range(n)]
t = [0]
def DFS_visit(u):
col[u] = 1
t[0] += 1
d[u] = t[0]
for v in range(n):
if M[u][v] == 1 and col[v] == 0:
DFS_visit(v)
col[u] = 2
t[0] += 1
f[u] = t[0]
def DFS():
for u in range(n):
if col[u] == 0:
DFS_visit(u)
for u in range(n):
print'{0} {1} {2}'.format(s+1, d[s], f[s])
for i in range(n):
X = map(int, raw_input().split())
for j in range(X[1]):
M[X[0]-1][X[2+j]-1] = 1
DFS() |
s266267617 | p02238 | u078762447 | 1454344566 | Python | Python | py | Runtime Error | 0 | 0 | 420 | import sys
def dfs(i, t, l, a, b):
t += 1
a[i] = t
for j in l[i]:
if not a[j-1]:
t = dfs(j-1, t, l, a, b)
t += 1
b[i] = t
return t
n = input()
l=[]
for i in range(n):
x = int(s) for s in sys.stdin.readline().split()[2:]
l.append(x)
a = [0] * n
b = [0] * n
t = 0
for i in xrange(n):
if not a[i]:
tm = dfs(i, t, l, a, b)
for i in xrange(n):
print i+1, a[i], b[i] |
s771453568 | p02238 | u824204304 | 1454406664 | Python | Python | py | Runtime Error | 0 | 0 | 645 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
G = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0:
dfs_visit(k)
time[0] += 1
f[s] = time[0]
def main():
for s in range(n):
if st[s] == 0:
def_visit(s)
for s in range(n):
print(s+1,d[s],f[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
v[G[0]-1][G[2+j]-1] = 1
main()
|
s685187377 | p02238 | u824204304 | 1454406671 | Python | Python | py | Runtime Error | 0 | 0 | 645 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
G = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0:
dfs_visit(k)
time[0] += 1
f[s] = time[0]
def main():
for s in range(n):
if st[s] == 0:
def_visit(s)
for s in range(n):
print(s+1,d[s],f[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
v[G[0]-1][G[2+j]-1] = 1
main()
|
s458887327 | p02238 | u824204304 | 1454406711 | Python | Python | py | Runtime Error | 0 | 0 | 645 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
G = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0:
dfs_visit(k)
time[0] += 1
f[s] = time[0]
def main():
for s in range(n):
if st[s] == 0:
def_visit(s)
for s in range(n):
print(s+1,d[s],f[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
a[G[0]-1][G[2+j]-1] = 1
main()
|
s778433591 | p02238 | u630265299 | 1454413661 | Python | Python | py | Runtime Error | 0 | 0 | 684 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
g = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0:
dfs_visit(k)
st[s] ==2
time[0] += 1
f[s] = time[0]
def main():
for s in range(n):
if st[s] == 0:
dfs_visit(s)
for s in range(n):
print'{0} {1} {2}'.format(s+1, d[s], f[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(g[1]):
a[G[0]-1][g[2+j]-1] = 1
int main |
s149860711 | p02238 | u630265299 | 1454413748 | Python | Python | py | Runtime Error | 0 | 0 | 683 | n = int(raw_input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
time = [0]
g = [0 for i in range(n)]
def dfs_visit(s):
st[s] = 1
time[0] += 1
d[s] = time[0]
for k in range(n):
if a[s][k] == 1 and st[k] == 0:
dfs_visit(k)
st[s] ==2
time[0] += 1
f[s] = time[0]
def main():
for s in range(n):
if st[s] == 0:
dfs_visit(s)
for s in range(n):
print'{0} {1} {2}'.format(s+1, d[s], f[s])
for i in range(n):
g = map(int, raw_input().split())
for j in range(G[1]):
a[g[0]-1][G[2+j]-1] = 1
main() |
s335962664 | p02238 | u563876281 | 1454417472 | Python | Python | py | Runtime Error | 0 | 0 | 639 | def depth(s, time):
time += 1
f[s] = 1
d[s] = t
for i in range(1, n+1):
if G[s][i] == 1:
if f[i] == 0:
depth(i, time)
t = f[i]
f[s] = time + 1
n = int(raw_input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [0 for i in range(n+1)]
f = [0 for i in range(n+1)]
for i in range(n):
v = map(int, raw_input().split())
for j in range(v[1]):
G[v[0]][v[2+j]] = 1
flag = [0 for i in range(n+1)]
for i in range(1, n+1):
if flag[i] == 0:
depth(i, max(f))
for i in range(1, n+1):
print(str(i) + " " + str(d[i]) + " " + str(f[i])) |
s056922577 | p02238 | u563876281 | 1454417551 | Python | Python | py | Runtime Error | 0 | 0 | 645 | def depth(s, time):
time += 1
flag[s] = 1
d[s] = t
for i in range(1, n+1):
if G[s][i] == 1:
if flag[i] == 0:
depth(i, time)
t = f[i]
f[s] = time + 1
n = int(raw_input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [0 for i in range(n+1)]
f = [0 for i in range(n+1)]
for i in range(n):
v = map(int, raw_input().split())
for j in range(v[1]):
G[v[0]][v[2+j]] = 1
flag = [0 for i in range(n+1)]
for i in range(1, n+1):
if flag[i] == 0:
depth(i, max(f))
for i in range(1, n+1):
print(str(i) + " " + str(d[i]) + " " + str(f[i])) |
s903041384 | p02238 | u563876281 | 1454417883 | Python | Python | py | Runtime Error | 0 | 0 | 645 | def depth(s, time):
time += 1
flag[s] = 1
d[s] = t
for i in range(1, n+1):
if G[s][i] == 1:
if flag[i] == 0:
depth(i, time)
t = f[i]
f[s] = time + 1
n = int(raw_input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [0 for i in range(n+1)]
f = [0 for i in range(n+1)]
for i in range(n):
v = map(int, raw_input().split())
for j in range(v[1]):
G[v[0]][v[2+j]] = 1
flag = [0 for i in range(n+1)]
for i in range(1, n+1):
if flag[i] == 0:
depth(i, max(f))
for i in range(1, n+1):
print(str(i) + " " + str(d[i]) + " " + str(f[i])) |
s870628373 | p02238 | u424209323 | 1454420591 | Python | Python | py | Runtime Error | 0 | 0 | 892 | N = 100
M = [[0 for i in range(N)] for j in range(N)]
color = [0 for i in range(N)]
d = [0 for i in range(N)]
f = [0 for i in range(N)]
tt = 0
###
def dfs_visit(u):
color[u] = 1
tt = tt + 1
d[u] = tt
for v in range(n):
if M[u][v] == 0:
continue
if color[v] == 0:
dfs_visit(v)
color[u] = 2
tt = tt + 1
f[u] = tt
###
def dfs():
for u in range(n):
color[u] = 0
tt = 0
for u in range(n):
if color[u] == 0:
dfs_visit(u)
for u in range(n):
print "%d %d %d" %(u + 1, d[u], f[u])
### MAIN
n = input()
for i in range(n):
for j in range(n):
M[i][j] = 0
for i in range(n):
Num = map(int, raw_input().split())
u = Num[0]
k = Num[1]
u = u - 1
for j in range(k):
v = Num[j]
v = v - 1
M[u][v] = 1
dfs() |
s887691671 | p02238 | u663227983 | 1454421885 | Python | Python | py | Runtime Error | 0 | 0 | 364 | n=0
m=input()
c=[0 for i in xrange(m)]
t=[0 for i in xrange(m)]
def d(u):
global n
if ts[u]:return
n = n + 1
ts[u]=[u+1,n]
for i in c[u]:d(i-1)
n = n + 1
ts[u][2:]=[n]
def dfs():
for i in range(m):
l=map(int,raw_input().split())
c[l[0]-1]=l[2:]
for i in range(m):
d(i)
print " ".join(map(str,t[i]))
dfs() |
s384982787 | p02238 | u663227983 | 1454421896 | Python | Python | py | Runtime Error | 0 | 0 | 365 | n=0
m=input()
c=[0 for i in xrange(m)]
t=[0 for i in xrange(m)]
def d(u):
global n
if ts[u]:return
n = n + 1
ts[u]=[u+1,n]
for i in c[u]:d(i-1)
n = n + 1
ts[u][2:]=[n]
def dfs():
for i in range(m):
l=map(int,raw_input().split())
c[l[0]-1]=l[2:]
for i in range(m):
d(i)
print " ".join(map(str,ts[i]))
dfs() |
s446645088 | p02238 | u038005340 | 1454422463 | Python | Python | py | Runtime Error | 0 | 0 | 703 | n = int( raw_input() )
d = [ 0 for i in range(n) ]
f = [ 0 for i in range(n) ]
G = [ 0 for i in range(n) ]
v = [ [0 for i in range(n) ] for j in range(n) ]
st = [ 0 for i in range(n) ]
tm = [ 0 ]
def DFS_visit(s):
st[ s ] = 1
tm[ 0 ] += 1
d[ s ] = tm[ 0 ]
for e in range(n):
if v[ s ][ e ] == 1 and st[ e ] == 0:
DFS_visit(e)
st[ s ] == 2
tm[ 0 ] += 1
f[ s ] = tm[ 0 ]
def DFS():
for s in range(n):
if st[ s ] == 0:
DFS_visit(s)
for s in range(n):
print'{ 0 } { 1 } { 2 }'.format( s+1 , d[ s ] , f[ s ] )
for i in range(n):
G = map( int , raw_input().split() )
for j in range( G[ 1 ] ):
v[ G[ 0 ] - 1 ][G [ 2+j ] - 1 ] = 1
DFS() |
s410085817 | p02238 | u038005340 | 1454422526 | Python | Python | py | Runtime Error | 0 | 0 | 701 | n = int(raw_input())
d = [ 0 for i in range(n) ]
f = [ 0 for i in range(n) ]
G = [ 0 for i in range(n) ]
v = [ [0 for i in range(n) ] for j in range(n) ]
st = [ 0 for i in range(n) ]
tm = [ 0 ]
def DFS_visit(s):
st[ s ] = 1
tm[ 0 ] += 1
d[ s ] = tm[ 0 ]
for e in range(n):
if v[ s ][ e ] == 1 and st[ e ] == 0:
DFS_visit(e)
st[ s ] == 2
tm[ 0 ] += 1
f[ s ] = tm[ 0 ]
def DFS():
for s in range(n):
if st[ s ] == 0:
DFS_visit(s)
for s in range(n):
print'{ 0 } { 1 } { 2 }'.format( s+1 , d[ s ] , f[ s ] )
for i in range(n):
G = map( int , raw_input().split() )
for j in range( G[ 1 ] ):
v[ G[ 0 ] - 1 ][G [ 2+j ] - 1 ] = 1
DFS() |
s457334338 | p02238 | u885889402 | 1454425436 | Python | Python3 | py | Runtime Error | 0 | 0 | 616 | def curserch(N,k,t,P,n):
g = 0
t = t+1
P[k]["d"] = t
for i in range(1,n+1):
if N[k][i]==1 and P[i]["d"]==0:
P[i]["f"] = g = curserch(N,i,t,P,n)
if g !=0:
return g+1
else:
return t+1
n = int(input())
A = [[0 for j in range(n+1)] for i in range(n+1)]
for i in range(n):
vec = input().split()
u = int(vec[0])
k = int(vec[1])
nodes = vec[2:]
for i in range(int(k)):
v = int(nodes[i])
A[u][v] = 1
P=[{"d":0} for i in range(n+1)]
P[1]["f"] = curserch(A,1,0,P,n)
j=1
for i in range(1,n+1):
print(i,P[i]["d"],P[i]["f"]) |
s111087398 | p02238 | u885889402 | 1454425547 | Python | Python3 | py | Runtime Error | 0 | 0 | 612 | def curserch(N,k,t,P,n):
g = 0
t = t+1
P[k]["d"] = t
for i in range(1,n+1):
if N[k][i]==1 and P[i]["d"]==0:
P[i]["f"] = g = curserch(N,i,t,P,n)
if g !=0:
return g+1
else:
return t+1
n = int(input())
A = [[0 for j in range(n+1)] for i in range(n+1)]
for i in range(n):
vec = input().split()
u = int(vec[0])
k = int(vec[1])
nodes = vec[2:]
for i in range(int(k)):
v = int(nodes[i])
A[u][v] = 1
P=[{"d":0} for i in range(n+1)]
P[1]["f"] = curserch(A,1,0,P,n)
for i in range(1,n+1):
print(i,P[i]["d"],P[i]["f"]) |
s264769312 | p02238 | u564398841 | 1485187201 | Python | Python3 | py | Runtime Error | 0 | 0 | 1229 | def dfs(u, node_info, matrix):
# ????????????????????¨??????????????????
colors = [0] * len(matrix)
detect_time = [0] * len(matrix)
finished_time = [0] * len(matrix)
time = 1
stack = list()
stack.append(u)
colors[u] = 1
detect_time[u] = time
while len(stack):
for i, val in enumerate(matrix[u]):
if val == 1 and colors[i] == 0:
time += 1
stack.append(i)
colors[i] = 1
detect_time[i] = time
u = i
break
else:
time += 1
e = stack.pop()
colors[e] = 2
finished_time[e] = time
if len(stack):
u = stack[-1]
for i in range(len(matrix)):
print('{} {} {}'.format(i + 1, detect_time[i], finished_time[i]))
if __name__ == '__main__':
N = int(input())
matrix = [[0] * N for _ in range(N)]
color = [0] * N
for i in matrix:
node_info = [int(i) for i in input().split()]
node_i = node_info[0] - 1
if not node_info[1] == 0:
for i in node_info[2:]:
matrix[node_i][i - 1] = 1
for line in matrix:
dfs(0, None, matrix) |
s699636516 | p02238 | u112247126 | 1488334377 | Python | Python3 | py | Runtime Error | 0 | 0 | 1105 | from collections import deque
def dfs(root):
global time
stack.append(root)
color[root] = 'gray'
arrive[root] = time
time += 1
while len(stack) > 0:
node = stack[-1]
for next in range(n):
if adjMat[node][next] == 1:
if color[next] == 'white':
color[next] = 'gray'
arrive[next] = time
time += 1
stack.append(next)
break
# In case there in no adjacent node whose color is white
color[node] = 'black'
finish[node] = time
time += 1
stack.pop()
n = int(input())
adjMat = [[0] * n for _ in range(n)]
color = ['white'] * n
stack = deque()
arrive = [0] * n
finish = [0] * n
time = 1
for _ in range(n):
adj = list(map(int, input().split()))
i = adj[0]
v = adj[2:]
for j in v:
adjMat[i - 1][j - 1] = 1
for root in range(n):
if color[root] = 'white':
dfs(root)
for i in range(n):
out = ''
out += '{} {} {}'.format(i+1, arrive[i], finish[i])
print(out) |
s789523220 | p02238 | u112247126 | 1488335270 | Python | Python3 | py | Runtime Error | 0 | 0 | 701 | def dfs_recursive(u):
global time
color[u] = 'gray'
arrive[u] = time
time += 1
for v in range(n):
if adjMat[u][v] == 1 and color[v] == 'white':
dfs_recursive(v)
color[u] = 'black'
finish[u] = time
time += 1
n = int(input())
adjMat = [[0] * n for _ in range(n)]
color = ['white'] * n
arrive = [0] * n
finish = [0] * n
time = 1
for _ in range(n):
adj = list(map(int, input().split()))
i = adj[0]
v = adj[2:]
for j in v:
adjMat[i - 1][j - 1] = 1
for root in range(n):
if color[root] == 'white':
dfs(root)
for i in range(n):
out = ''
out += '{} {} {}'.format(i + 1, arrive[i], finish[i])
print(out) |
s435947941 | p02238 | u735204496 | 1500613946 | Python | Python | py | Runtime Error | 0 | 0 | 948 | import sys
d_num = int(sys.stdin.readline().strip())
graph_list = []
for _ in range(0, d_num):
array = sys.stdin.readline().strip().split(" ")
if len(array) > 2:
graph_list.append([])
else:
graph_list.append([int(array[i]) for i in range(2, len(array))])
t = 1
result = [[] for _ in range(0, d_num)]
searched_list = []
stack = []
stack.append(0)
while sorted(searched_list) != range(0, d_num):
if len(stack) == 0:
stack.append(filter(lambda x: x not in searched_list, range(0, d_num))[0])
node = stack[-1]
searched_list.append(node)
children = filter(lambda x: x not in searched_list, graph_list[node])
if len(child) == 0:
next_node = children[0]
result[next_node].append(t)
else:
stack.pop()
result[node].append(t)
t += 1
s = ""
for i in range(0, len(result)):
print str(i+1) + " " + str(result[i][0] + 1) + " " + str(result[i][1] + 1)
|
s861036808 | p02238 | u858885710 | 1500625898 | Python | Python3 | py | Runtime Error | 0 | 0 | 594 | from sys import stdin
d_num = int(stdin.readline().strip())
graph = [[] for _ in range(d_num+1)]
for _ in range(d_num):
u, k, *neighbors = map(int, stdin.readline().split())
for v in neighbors:
graph[u].append(v)
visited = set()
timestamps = [None for _ in range(d_num+1)]
def dfs(u, stmp):
visited.add(u)
entry = stmp
stmp += 1
for v in graph[u]:
if v not in visited:
stmp = dfs(v, stmp)
timestamps[u] = entry, stmp
return stmp+1
dfs(1, 1)
for num, (entry, leave) in enumerate(timestamps[1:], 1):
print(num, entry, leave) |
s621342818 | p02238 | u659034691 | 1504947262 | Python | Python3 | py | Runtime Error | 0 | 0 | 769 | #depth first
N=int(input())
V=[]
a=[0]
for i in range(N):
V.append([int(i) for i in input().split()])
w=V[i][2:]
w.sort()
V[i]=V[i][:2]+w
a.append(0)
V=sorted(V,key=lambda x:x[0])
c=1
t=1
i=0
r=[1]
a[1]=1
p=[[1,t]]
q=[]
while t<N*2-1:
j=2
while t<N*2-1 and j-2<V[i][1] and V[i][1]>0 and a[V[i][j]]==1:
j+=1
t+=1
if j-2<V[i][1]:
a[V[i][j]]=1
c+=1
r.append(V[i][j])
p.append([V[i][j],t])
i=V[i][j]-1
else:
q.append(p[-1]+[t])
#end time immediately case?
r.pop(-1)
p.pop(-1)
i=r[-1]-1
# print(q)
q.append([1,1,N*2])
q=sorted(q,key=lambda x:x[0])
for i in range(N):
for j in range(3):
q[i][j]=str(q[i][j])
print(" ".join(q[i])) |
s746865452 | p02238 | u024715419 | 1510546973 | Python | Python3 | py | Runtime Error | 0 | 0 | 533 | j = 1
def dfs(graph, start, result, visited=None):
global j
if visited == None:
visited = []
visited.append(start)
result[start][1] = j
for next in graph[start][2:]:
if next in visited:
continue
j += 1
dfs(graph, next, result, visited)
else:
j += 1
result[start][2] = j
n = int(input())
g = [[]]
r = [[i,0,0] for i in range(n + 1)]
for i in range(n):
g.append(list(map(int, input().split())))
dfs(g,1,r)
for i in range(1:n+1)
print(*r[i]) |
s615288734 | p02238 | u626266743 | 1511869704 | Python | Python3 | py | Runtime Error | 0 | 0 | 692 | WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
def visit(u):
color[u] = GRAY
d[u] += tt
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] += tt
def dfs():
tt = 0
for u in range(n):
if (color[u] = WHITE):
visit(u)
for u in range(n):
print(u+1, d[u], f[u], sep = " ", end ="\n")
n = int(input())
for i in range(n):
for j in range(n):
M[i][j] = 0
for i in range(n):
u, k = int(input())
u -= 1
for j in range(k):
v = int(input())
v -= 1
M[u][v] = 1
dfs() |
s769307965 | p02238 | u626266743 | 1511870080 | Python | Python3 | py | Runtime Error | 0 | 0 | 635 | WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
def visit(u):
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(u+1, d[u], f[u], sep = " ", end ="\n")
n = int(input())
M = [[[0] for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1 |
s563243183 | p02238 | u626266743 | 1511870187 | Python | Python3 | py | Runtime Error | 0 | 0 | 639 | WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
def visit(u):
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ")
n = int(input())
M = [[[0] for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1 |
s660753569 | p02238 | u626266743 | 1511870200 | Python | Python3 | py | Runtime Error | 0 | 0 | 639 | WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
def visit(u):
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for i in range(n):
print(str(i+1), str(d[i]), str(f[i]), sep = " ")
n = int(input())
M = [[[0] for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1 |
s330152833 | p02238 | u626266743 | 1511870217 | Python | Python3 | py | Runtime Error | 0 | 0 | 637 | WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
def visit(u):
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ")
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1 |
s946163080 | p02238 | u626266743 | 1511870259 | Python | Python3 | py | Runtime Error | 0 | 0 | 638 |
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
def visit(u):
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s745307017 | p02238 | u626266743 | 1511870337 | Python | Python3 | py | Runtime Error | 0 | 0 | 662 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u-1][v-1] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s725778392 | p02238 | u626266743 | 1511870389 | Python | Python3 | py | Runtime Error | 0 | 0 | 658 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s499441130 | p02238 | u626266743 | 1511870467 | Python | Python3 | py | Runtime Error | 0 | 0 | 665 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[False for i in range(n)] for i in range(n)]
for i in range(n):
temp = list(map(int, input().split()))
for i in range(temp[1]):
M[temp[0]-1][temp[i+2]-1] = True
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s676438126 | p02238 | u626266743 | 1511870728 | Python | Python3 | py | Runtime Error | 0 | 0 | 658 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[False for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s254785102 | p02238 | u626266743 | 1511870765 | Python | Python3 | py | Runtime Error | 0 | 0 | 664 | def visit(u):
global visit_color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[False for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s235193063 | p02238 | u626266743 | 1511870916 | Python | Python3 | py | Runtime Error | 0 | 0 | 680 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[False for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color, d, f = [WHITE for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s365771243 | p02238 | u626266743 | 1511871092 | Python | Python3 | py | Runtime Error | 0 | 0 | 699 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color = [WHITE for i in range(n)]
d, f = [0 for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s762466460 | p02238 | u626266743 | 1511871228 | Python | Python3 | py | Runtime Error | 0 | 0 | 699 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color = [WHITE for i in range(n)]
d, f = [0 for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s408228422 | p02238 | u626266743 | 1511871305 | Python | Python3 | py | Runtime Error | 0 | 0 | 701 |
WHITE = 0
GRAY = 1
BLACK = 2
color = [WHITE for i in range(n)]
d, f = [0 for i in range(n)]
t = 1
def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s107991839 | p02238 | u626266743 | 1511871810 | Python | Python3 | py | Runtime Error | 0 | 0 | 607 | def visit(u):
global visit_color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for i in range(tmp[1]):
M[tmp[0]-1][tmp[i+2]-1] = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s729945116 | p02238 | u626266743 | 1511871853 | Python | Python3 | py | Runtime Error | 0 | 0 | 601 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
M[tmp[0]-1][tmp[j+2]-1] = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s383066240 | p02238 | u626266743 | 1511871880 | Python | Python3 | py | Runtime Error | 0 | 0 | 607 | def visit(u):
global visit_color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
M[tmp[0]-1][tmp[j+2]-1] = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s949229901 | p02238 | u626266743 | 1511871957 | Python | Python3 | py | Runtime Error | 0 | 0 | 700 | def visit(u):
global color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
M[tmp[0]-1][tmp[j+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color = [WHITE for i in range(n)]
d, f = [0 for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s808275038 | p02238 | u626266743 | 1511872149 | Python | Python3 | py | Runtime Error | 0 | 0 | 713 | def visit(u):
global visit_color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
visit(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[False for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
M[tmp[0]-1][tmp[j+2]-1] = True
WHITE = 0
GRAY = 1
BLACK = 2
color = [WHITE for i in range(n)]
d, f = [0 for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
visit(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s485493562 | p02238 | u626266743 | 1511872203 | Python | Python3 | py | Runtime Error | 0 | 0 | 696 | def dfs(u):
global dfs_color, d, f, t
color[u] = GRAY
d[u] += t
t += 1
for v in range(n):
if (M[u][v] == 0):
continue
else:
if (color[v] == WHITE):
dfs(v)
color[u] = BLACK
f[u] = t
t += 1
n = int(input())
M = [[ for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
for j in range(tmp[1]):
M[tmp[0]-1][tmp[j+2]-1] = 1
WHITE = 0
GRAY = 1
BLACK = 2
color = [WHITE for i in range(n)]
d, f = [0 for i in range(n)]
t = 1
for u in range(n):
if (color[u] == WHITE):
dfs(u)
for u in range(n):
print(str(u+1), str(d[u]), str(f[u]), sep = " ") |
s538732389 | p02238 | u845643816 | 1511920630 | Python | Python3 | py | Runtime Error | 0 | 0 | 596 | n = int(input())
a = [[0]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = 1
d = [0] * n ## time:discover
f = [0] * n ## time:finish
isDiscovered = [False] * n
time_stamp = 0
def dfs(u):
global time_stamp
isDiscovered [u - 1] = True
time_stamp++
d[u - 1] = time_stamp
for i in range(n):
if a[u - 1][i] == 1 and isDiscovered[i] == False:
dfs(i)
time_stamp++
f[u - 1] = time_stamp
for i in rane(n):
print(i+1, d[i], f[i]) |
s571699553 | p02238 | u845643816 | 1511920765 | Python | Python3 | py | Runtime Error | 0 | 0 | 648 | n = int(input())
a = [[0]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = 1
d = [0] * n ## time:discover
f = [0] * n ## time:finish
isDiscovered = [False] * n
time_stamp = 0
def dfs(x):
global time_stamp
isDiscovered [x] = True
time_stamp++
d[x] = time_stamp
for i in range(n):
if a[x][i] == 1 and isDiscovered[i] == False:
dfs(i)
time_stamp++
f[x] = time_stamp
for i in range(n):
if isDiscovered[i] == False:
dfs(i)
for i in rane(n):
print(i+1, d[i], f[i]) |
s911026437 | p02238 | u845643816 | 1511920797 | Python | Python3 | py | Runtime Error | 0 | 0 | 610 | n = int(input())
a = [[0]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = 1
d = [0] * n
f = [0] * n
isDiscovered = [False] * n
time_stamp = 0
def dfs(x):
global time_stamp
isDiscovered [x] = True
time_stamp++
d[x] = time_stamp
for i in range(n):
if a[x][i] == 1 and isDiscovered[i] == False:
dfs(i)
time_stamp++
f[x] = time_stamp
for i in range(n):
if isDiscovered[i] == False:
dfs(i)
for i in rane(n):
print(i+1, d[i], f[i]) |
s814116266 | p02238 | u845643816 | 1511920930 | Python | Python3 | py | Runtime Error | 0 | 0 | 640 | n = int(input())
a = [[0]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = 1
d = [0] * n
f = [0] * n
isDiscovered = [False] * n
time_stamp = 0
def dfs(x):
global time_stamp
isDiscovered [x] = True
time_stamp = time_stamp + 1
d[x] = time_stamp
for i in range(n):
if a[x][i] == 1 and isDiscovered[i] == False:
dfs(i)
time_stamp = time_stamp + 1
f[x] = time_stamp
for i in range(n):
if isDiscovered[i] == False:
dfs(i)
for i in rane(n):
print(i+1, d[i], f[i]) |
s056795454 | p02238 | u845643816 | 1511921428 | Python | Python3 | py | Runtime Error | 0 | 0 | 626 | n = int(input())
a = [[False]*n for i in range(n)]
for i in range(n):
v = list(map(int, input().split()))
u = v[0]
k = v[1]
for j in range(k):
a[u - 1][v[2 + j] - 1] = True
d = [0] * n
f = [0] * n
isDiscovered = [False] * n
time_stamp = 0
def dfs(x):
global time_stamp
isDiscovered [x] = True
time_stamp = time_stamp + 1
d[x] = time_stamp
for i in range(n):
if a[x][i]and !isDiscovered[i]:
dfs(i)
time_stamp = time_stamp + 1
f[x] = time_stamp
for i in range(n):
if !isDiscovered[i]:
dfs(i)
for i in range(n):
print(i+1, d[i], f[i]) |
s297814093 | p02238 | u152085200 | 1518402105 | Python | Python | py | Runtime Error | 10 | 4696 | 1372 | from sys import stdin
global time
time = 0
def dfs(graph,start,state,discover,finish):
state[start-1] = 1
global time
time = time + 1
discover[start-1] = time
# print str(time) + " go to " + str(start)
neighbours = sorted(graph[start])
for neighbour in neighbours:
if state[neighbour-1] == 0:
dfs(graph,neighbour,state,discover,finish)
state[start-1] = 2
time = time + 1
finish[start - 1] = time
# print str(time) + " out of " + str(start)
def main():
# g = {1: [2, 3],
# 2: [3, 4],
# 3: [5],
# 4: [6],
# 5: [6],
# 6: []}
d = [0]*6
f = [0]*6
# deal with input
n = int(stdin.readline())
g = {}
d = [-1]*n
all_vertex = []
for i in xrange(n):
entry = [int(s) for s in stdin.readline().split()[2:]]
g[i+1] = entry
all_vertex.append(i+1)
# exp = []
# state represent vertex visited state: 0 not visited 1 visiting 2 finished
state = [0]*n
for node in all_vertex:
if state[node-1] == 0:
dfs(g,node,state,d,f)
# print 'state ' + str(state)
# print 'd' + str(d)
# print 'f' + str(f)
# deal with output
for i in xrange(n):
print str(i+1) + ' ' + str(d[i]) + ' ' + str(f[i])
main()
|
s087988971 | p02238 | u126478680 | 1525502299 | Python | Python3 | py | Runtime Error | 0 | 0 | 1136 | class Color(Enum):
WHITE = auto() # 未訪問の頂点
GRAY = auto() # 訪問済みだが, 全ての接点の調査は済んでいない状態の接点
BLACK = auto() # 訪問, 調査済みの接点
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
colors = [] # 頂点の訪問状態
A = [[0 for j in range(n)] for i in range(n)] # 隣接行列
# stack = [] ## スタックによる実装では頂点の保持が必要 => 再帰によって実装
# 隣接行列の初期化
for i in range(n):
arr = list(map(int, input().split(' ')))
u, k, v = arr[0], arr[1], arr[2:]
for j in range(k):
A[u-1][v[j]-1] = 1
time = 0
def dfs_init():
global colors
colors = [Color.WHITE for i in range(n)]
dfs(0)
def dfs(u):
global time
colors[u] = Color.GRAY
time += 1
d[u] = time
for v in range(n):
if A[u][v] == 1 and colors[v] == Color.WHITE:
dfs(v)
colors[u] = Color.BLACK
time += 1
f[u] = time
dfs_init()
for u in range(n):
if colors[u] == Color.WHITE:
dfs(u)
# 出力
for i in range(n):
print(i+1, d[i], f[i])
|
s009252148 | p02238 | u372207695 | 1530015050 | Python | Python3 | py | Runtime Error | 0 | 0 | 2149 | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
int main(){
stack<int> st;
int n;
cin >> n;
int d[n] = {};
int f[n] = {};
int vnum[n][2] = {};
bool vflag[n] = {};
int tmp2;
int num;
vector<vector<int>> vertex;
vector<int> tmp;
for(int i=0;i<n;i++){
cin >> num;
cin >> num;
vnum[i][0] = num;
for(int j=0;j<num;j++){
cin >> tmp2;
tmp.push_back(tmp2);
}
vertex.push_back(tmp);
tmp.clear();
}
int cnt = 1;
bool check;
int s;
st.push(0);
do{
s = st.top();
if(((vnum[s][0]==0) && d[s]==0) || (s==vertex[s][vnum[s][1]]-1)){
vflag[s] = true;
d[s] = cnt++;
f[s] = cnt++;
st.pop();
}else if(vnum[s][0]==vnum[s][1]){
vflag[s] = true;
f[s] = cnt++;
st.pop();
}else if((vflag[vertex[s][vnum[s][1]]-1]) && (d[s]==0)){
if(vnum[s][0]-vnum[s][1]==1){
vflag[s] = true;
d[s] = cnt++;
f[s] = cnt++;
st.pop();
}else{
vnum[s][1]++;
}
}else if(vflag[vertex[s][vnum[s][1]]-1]){
vflag[s] = true;
f[s] = cnt++;
st.pop();
}else if(vflag[s]){
st.push(vertex[s][vnum[s][1]++] - 1);
}else{
if(d[s]==0){
d[s] = cnt++;
}
st.push(vertex[s][vnum[s][1]++] - 1);
if(vnum[s][0]==vnum[s][1]){
vflag[s] = true;
}
if(vflag[vertex[s][vnum[s][1]]-1]){
f[s] = cnt++;
st.pop();
}
}
check = !st.empty();
if(!check){
for(int i=0;i<n;i++){
if(vflag[i]==false){
check = true;
st.push(i);
break;
}
}
}
}while(check);
for(int i=0;i<n;i++){
cout << i+1 << " " << d[i] << " " << f[i] << endl;
}
}
|
s932887031 | p02239 | u609061402 | 1531294779 | Python | Python3 | py | Runtime Error | 0 | 0 | 466 | def f(v,c):
check[v]=c
c+=1
for i in edge[v]:
if check==-1:
c=f(i,c)
time[v]=c
c+=1
return c
n=int(input())
edge=[[]for in range(n)]
for i in range(n):
a=list(map(int,input().split())
edge[a[0]]=sorted(a[2:])
time=[-1]*n
check=[-1]*n
c=1
for i in range(n):
if check[i]==-1:
c=f(i, c)
for i,(ch, t) in enumerate(zip(check,time)):
print(i+1, ch, t)
|
s928960728 | p02239 | u609061402 | 1531294792 | Python | Python3 | py | Runtime Error | 0 | 0 | 466 | def f(v,c):
check[v]=c
c+=1
for i in edge[v]:
if check==-1:
c=f(i,c)
time[v]=c
c+=1
return c
n=int(input())
edge=[[]for in range(n)]
for i in range(n):
a=list(map(int,input().split())
edge[a[0]]=sorted(a[2:])
time=[-1]*n
check=[-1]*n
c=1
for i in range(n):
if check[i]==-1:
c=f(i, c)
for i,(ch, t) in enumerate(zip(check,time)):
print(i+1, ch, t)
|
s878837201 | p02239 | u726330006 | 1540440890 | Python | Python3 | py | Runtime Error | 0 | 0 | 720 | def get_depth(graph,tmp_depth,vertex_list,depth_list):
new_vertex_list=[]
for vertex in vertex_list:
for j in range(len(depth_list)):
if(graph[vertex][j]!=0 and depth_list[j]==-1):
depth_list[j]=tmp_depth + 1
new_vertex_list.append(j)
get_depth(graph,tmp_depth+1,new_vertex_list,depth_list)
#グラフの作成
n=int(input())
graph=[[0]*n for loop in range(n)]
for loop in range(n):
tmp_ope=list(map(int,input().split()))
for j in range(tmp_ope[1]):
graph[tmp_ope[0]-1][tmp_ope[j+2]-1]=1
depth_list=[-1]*n
depth_list[0]=0
vertex_list=[0]
get_depth(graph,0,vertex_list,depth_list)
for i in range(n):
print(f"{i+1} {depth_list[i]}")
|
s520975531 | p02239 | u805716376 | 1551367961 | Python | Python3 | py | Runtime Error | 0 | 0 | 397 | N= int(input());E = [input().split()[2:] for _ in range(N)]
frag, T, L,Q = [0]*N, [0]*N, [0]*N, [0]
a,frag[0] = 100, 1
def func(ide):
for i in E[ide]:
i = int(i) - 1
if frag[i] != 1:frag[i] = 1;L[i] = L[ide] +1 ;Q.append(i)
else:return
while Q:top = Q[0];func(top);del Q[0]
for i in n:
if L[i] == 0:
L[i] == -1
for i in range(N):print(i + 1 ,int(L[i]))
|
s970531091 | p02239 | u805716376 | 1551368001 | Python | Python3 | py | Runtime Error | 0 | 0 | 404 | N= int(input());E = [input().split()[2:] for _ in range(N)]
frag, T, L,Q = [0]*N, [0]*N, [0]*N, [0]
a,frag[0] = 100, 1
def func(ide):
for i in E[ide]:
i = int(i) - 1
if frag[i] != 1:frag[i] = 1;L[i] = L[ide] +1 ;Q.append(i)
else:return
while Q:top = Q[0];func(top);del Q[0]
for i in range(n):
if L[i] == 0:
L[i] == -1
for i in range(N):print(i + 1 ,int(L[i]))
|
s980935312 | p02239 | u805716376 | 1551368079 | Python | Python3 | py | Runtime Error | 0 | 0 | 404 | N= int(input())
E = [input().split()[2:] for _ in range(N)]
frag, T, L,Q = [0]*N, [0]*N, [0]*N, [0]
a,frag[0] = 100, 1
def func(ide):
for i in E[ide]:
i = int(i) - 1
if frag[i] != 1:frag[i] = 1;L[i] = L[ide] +1 ;Q.append(i)
else:return
while Q:top = Q[0];func(top);del Q[0]
for i in range(n):
if L[i] == 0:
L[i] == -1
for i in range(N):print(i + 1 ,int(L[i]))
|
s398936215 | p02239 | u805716376 | 1551369636 | Python | Python3 | py | Runtime Error | 0 | 0 | 267 | N= int(input())
E = [input().split()[2:] for _ in [0]*N]
Q = [0]
L = [0] + [-1]*N
def func(ide):
for i in E[ide]:
i = int(i) - 1
if L[i] < 0 :L[i] = L[ide] +1 ;Q += [i]
while Q:top = Q.pop();func(top)
for i in range(N):print(i + 1 ,int(L[i]))
|
s244510275 | p02239 | u805716376 | 1551369731 | Python | Python3 | py | Runtime Error | 0 | 0 | 268 | N= int(input())
E = [input().split()[2:] for _ in [0]*N]
Q = [0]
L = [0] + [-1]*N
def func(ide):
for i in E[ide]:
i = int(i) - 1
if L[i] < 0 :L[i] = L[ide] +1 ; Q+= [i]
while Q:top = Q.pop(0);func(top)
for i in range(N):print(i + 1 ,int(L[i]))
|
s488307138 | p02239 | u805716376 | 1551370225 | Python | Python3 | py | Runtime Error | 0 | 0 | 325 | N= int(input())
E = [input().split()[2:] for _ in range(N)]
Q = [0]
L = [0] + [-1]*N
flag = [1] + [0]*N
def func(ide):
global Q
for i in E[ide]:
i = int(i) - 1
if frag[i] != 1:frag[i] = 1;L[i] = L[ide] +1 ;Q.append(i)
while Q:top = Q.pop(0);func(top)
for i in range(N):print(i + 1 ,int(L[i]))
|
s659214342 | p02239 | u805716376 | 1551370433 | Python | Python3 | py | Runtime Error | 0 | 0 | 350 | N= int(input())
E = [input().split()[2:] for _ in range(N)]
Q = [0]
L = [0] + [-1]*N
frag = [1] + [0]*N
def func(ide):
global Q
for i in E[ide]:
i = int(i) - 1
if frag[i] != 1:frag[i] = 1;L[i] = L[ide] +1 ;Q.append(i)
return else
while Q:top = Q[0];func(top);del Q[0]
for i in range(N):print(i + 1 ,int(L[i]))
|
s369225054 | p02239 | u805716376 | 1551371131 | Python | Python3 | py | Runtime Error | 0 | 0 | 545 | import numpy as np
N= int(input())
frag, T, L, Q = np.zeros(N),np.zeros(N),np.zeros(N),[0]
# frag, T, L,Q = [0]*N, [0]*N, [0]*N, [0]
a = 100
frag[0] = 1
def func(ide):
# print("frag = {}".format(frag))
for i in E[ide]:
i = int(i) - 1
if frag[i] != 1:
frag[i] = 1
L[i] = L[ide] +1
Q.append(i)
else:
return None
E = [input().split()[2:] for _ in range(N)]
while Q:
top = Q[0]
func(top)
del Q[0]
for i in range(N):print(i + 1 ,int(L[i]))
|
s246866920 | p02239 | u669284080 | 1451226748 | Python | Python3 | py | Runtime Error | 30 | 7768 | 392 | #!/usr/bin/python3
def find(id, V, d, dist):
i = id - 1
dist[i] = d
for v in V[i]:
find(v, V, d + 1, dist)
n = int(input())
# [isFind, d, f]
A = [[False, 0, 0] for i in range(n)]
U = []
V = []
dist = [-1] * n
for i in range(n):
l = list(map(int, input().split()))
U.append(l[0])
V.append(l[2:])
find(1, V, 0, dist)
for u in U:
print(u, dist[u - 1]) |
s229010596 | p02239 | u920118302 | 1454033080 | Python | Python | py | Runtime Error | 10 | 6476 | 437 | def BFS(s, r):
d[s] = r
for i in range(1, n+1):
if G[s][i] == 1 and flag[i] == 0:
BFS(i, r+1)
n = int(raw_input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [-1 for i in range(n+1)]
for i in range(n):
v = map(int, raw_input().split())
for j in range(v[1]):
G[v[0]][v[2+j]] = 1
flag = [0 for i in range(n+1)]
BFS(1, 0)
for i in range(1, n+1):
print(str(i) + " " + str(d[i])) |
s481251298 | p02239 | u885467869 | 1454074875 | Python | Python | py | Runtime Error | 10 | 6372 | 797 | class node:
def __init__(self, num):
self.number = num
self.distance = -1
self.link_node = []
self.is_serched = False
def BFS(node):
for item in node.link_node:
if item.is_serched == False:
item.distance = node.distance + 1
item.is_serched = True
for item in node.link_node:
BFS(item)
n = input()
node_list = [None] * (n + 1)
for i in xrange(1, n + 1):
node_list[i] = node(i)
for i in xrange(1, n + 1):
line = raw_input().split()
for node_num in line[2 : ]:
node_list[i].link_node.append(node_list[int(node_num)])
node_list[1].is_serched = True
node_list[1].distance = 0
BFS(node_list[1])
for item in node_list[1 : ]:
print '%s %s' % (str(item.number), str(item.distance))
|
s269690104 | p02239 | u885467869 | 1454078145 | Python | Python | py | Runtime Error | 10 | 6528 | 1474 | class node:
def __init__(self, num):
self.number = num
self.distance = -1
self.link_node = []
self.is_serched = False
class queue:
def __init__(self):
self.top = 0
self.bottom = 0
self.que = [None] * 100
def dequeue(self):
self.top = self.top + 1
return self.que[self.top - 1]
def enqueue(self, item):
self.que[self.bottom] = item
self.bottom = self.bottom + 1
def is_empty(self):
if self.top == self.bottom:
return True
else:
return False
n = input()
node_list = [None] * (n + 1)
for i in xrange(1, n + 1):
node_list[i] = node(i)
for i in xrange(1, n + 1):
line = raw_input().split()
for node_num in line[2 : ]:
node_list[i].link_node.append(node_list[int(node_num)])
node_que = queue()
node_list[1].distance = 0
node_que.enqueue(node_list[1])
while node_que.is_empty() == False:
top_item = node_que.que[node_que.top]
top_item.is_serched = True
for item in top_item.link_node:
if item.is_serched == False:
node_que.enqueue(item)
if item.distance == -1:
item.distance = top_item.distance + 1
elif item.distance > top_item.distance + 1:
item.distance = top_item.distance + 1
node_que.dequeue()
for item in node_list[1 : ]:
print '%s %s' % (str(item.number), str(item.distance))
|
s893818759 | p02239 | u885467869 | 1454078253 | Python | Python | py | Runtime Error | 10 | 6524 | 1475 | class node:
def __init__(self, num):
self.number = num
self.distance = -1
self.link_node = []
self.is_serched = False
class queue:
def __init__(self):
self.top = 0
self.bottom = 0
self.que = [None] * 1000
def dequeue(self):
self.top = self.top + 1
return self.que[self.top - 1]
def enqueue(self, item):
self.que[self.bottom] = item
self.bottom = self.bottom + 1
def is_empty(self):
if self.top == self.bottom:
return True
else:
return False
n = input()
node_list = [None] * (n + 1)
for i in xrange(1, n + 1):
node_list[i] = node(i)
for i in xrange(1, n + 1):
line = raw_input().split()
for node_num in line[2 : ]:
node_list[i].link_node.append(node_list[int(node_num)])
node_que = queue()
node_list[1].distance = 0
node_que.enqueue(node_list[1])
while node_que.is_empty() == False:
top_item = node_que.que[node_que.top]
top_item.is_serched = True
for item in top_item.link_node:
if item.is_serched == False:
node_que.enqueue(item)
if item.distance == -1:
item.distance = top_item.distance + 1
elif item.distance > top_item.distance + 1:
item.distance = top_item.distance + 1
node_que.dequeue()
for item in node_list[1 : ]:
print '%s %s' % (str(item.number), str(item.distance))
|
s730015699 | p02239 | u119456964 | 1454083924 | Python | Python | py | Runtime Error | 0 | 0 | 708 | n = int(raw_input())
d = [99999 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
g = [0 for i in range(n)]
temp_d = [0]
def BFS_visit(s, temp_d):
if temp_d == 99999:
temp_d = 0
if d[s] > temp_d:
d[s] = temp_d
temp_d += 1
for e in range(n):
if M[s][e] == 1:
BFS_visit(e, temp_d)
def BFS():
for s in range(n):
BFS_visit(s, d[s])
for s in range(n):
if d[s] == 99999:
d[s] = -1
for s in range(n):
print'{0} {1}'.format(s+1, d[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
M[G[0]-1][G[2+j]-1] = 1
g[i] = G[1]
BFS() |
s775981277 | p02239 | u069446126 | 1454084507 | Python | Python | py | Runtime Error | 0 | 0 | 668 |
def BFS(s = 0, time = 0):
d[s] = time
if len(Q) != 0:
Q.pop(0)
color[s] = 2
for j in range(len(d)):
if A[i][j] == 1 and color[j] == 0:
Q.append(A[i][j])
color[j] = 1
for j in range(Q):
time = time + 1
BFS(Q[j], time)
n = int(raw_input())
A = [0] * n
for i in range(n):
A[i] = [0] * n
for i in range(n):
value = map(int, raw_input().split())
u = value[0] - 1
k = value[1]
nodes = value[2:]
for j in range(k):
v = nodes[j] - 1
A[u][v] = 1
color = [0] * n
Q = [0]
d = [-1] * n
BFS(0, 0)
for i in range(n):
print(str(i + 1) + " " + str(d[i])) |
s637502257 | p02239 | u119456964 | 1454085134 | Python | Python | py | Runtime Error | 0 | 6284 | 702 | n = int(raw_input())
d = [99999 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
g = [0 for i in range(n)]
temp_d = [0]
def BFS_visit(s, temp_d):
if temp_d == 99999:
temp_d = 0
if d[s] > temp_d:
d[s] = temp_d
temp_d += 1
for e in range(n):
if M[s][e] == 1 and s != e:
BFS_visit(e, temp_d)
def BFS():
s = 0
BFS_visit(0, d[s])
for s in range(n):
if d[s] == 99999:
d[s] = -1
for s in range(n):
print'{0} {1}'.format(s+1, d[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
M[G[0]-1][G[2+j]-1] = 1
g[i] = G[1]
BFS() |
s088269564 | p02239 | u119456964 | 1454085239 | Python | Python | py | Runtime Error | 10 | 6404 | 702 | n = int(raw_input())
d = [99999 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
g = [0 for i in range(n)]
temp_d = [0]
def BFS_visit(s, temp_d):
if temp_d == 99999:
temp_d = 0
if d[s] > temp_d:
d[s] = temp_d
temp_d += 1
for e in range(n):
if M[s][e] == 1 and s != e:
BFS_visit(e, temp_d)
def BFS():
s = 0
BFS_visit(0, d[s])
for s in range(n):
if d[s] == 99999:
d[s] = -1
for s in range(n):
print'{0} {1}'.format(s+1, d[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
M[G[0]-1][G[2+j]-1] = 1
g[i] = G[1]
BFS() |
s324948836 | p02239 | u119456964 | 1454086061 | Python | Python | py | Runtime Error | 10 | 6408 | 705 | n = int(raw_input())
d = [99999 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
g = [0 for i in range(n)]
temp_d = [0]
def BFS_visit(s, temp_d):
if temp_d == 99999:
temp_d = 0
if d[s] > temp_d:
d[s] = temp_d
temp_d += 1
for e in range(1, n):
if M[s][e] == 1 and s != e:
BFS_visit(e, temp_d)
def BFS():
s = 0
BFS_visit(0, d[s])
for s in range(n):
if d[s] == 99999:
d[s] = -1
for s in range(n):
print'{0} {1}'.format(s+1, d[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
M[G[0]-1][G[2+j]-1] = 1
g[i] = G[1]
BFS() |
s586408716 | p02239 | u828153094 | 1454145460 | Python | Python | py | Runtime Error | 0 | 0 | 542 | #!/usr/bin/env python
from _future_ import division, print_function
from sys import stdin
from Quene import Quene
def main()
num = int(stdin.readline())
L = []
for _ in xrange(num):
L.append([int(s) for s in stdin.readline().split()[2:]])
d = [-1] * num
d[0] = 0
q = Quene(100)
q.put(0)
while not q.empty():
u = q.get()
for v in L[u]:
if d[v-1] < 0:
d[v-1] = d[u] + 1
q.put(v-1)
for i, v in enumerate(d):
print(i+1, v)
main() |
s165165995 | p02239 | u828153094 | 1454145634 | Python | Python | py | Runtime Error | 0 | 0 | 544 | #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
from Quene import Quene
def main()
num = int(stdin.readline())
L = []
for _ in xrange(num):
L.append([int(s) for s in stdin.readline().split()[2:]])
d = [-1] * num
d[0] = 0
q = Quene(100)
q.put(0)
while not q.empty():
u = q.get()
for v in L[u]:
if d[v-1] < 0:
d[v-1] = d[u] + 1
q.put(v-1)
for i, v in enumerate(d):
print(i+1, v)
main() |
s091279291 | p02239 | u824204304 | 1454409504 | Python | Python | py | Runtime Error | 0 | 0 | 659 | n = int(raw_input())
G = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
st = [0 for i in range(n)]
dis = [0]
b = [0 for i in range(n)]
def bfs_visit(s):
st[s] = 1
dis[0] = 0
for k in range(n):
if a[s][k] == 1 and st[k] == 0:
dis[0] += 1
b[k] = dis[0]
bfs_visit[k]
def main():
s = 1
b[1] = 0
bfs_visit(s)
for s in range(n):
if i!=1 and b[i] == 0:
b[i] = -1
for s in range(n):
print (s+1,b[s])
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
a[G[0]-1][G[2+j]-1] = 1
main()
|
s235186688 | p02239 | u824204304 | 1454410419 | Python | Python | py | Runtime Error | 0 | 0 | 483 | n = int(raw_input())
G = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
dis = [-1 for i in range(n)]
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
a[G[0]-1][G[2+j]-1] = 1
def bfs_visit(s):
for k in range(n):
if a[s][k] == 1 and dis[k] == -1:
dis[k] = dis[s] + 1
bfs_visit(k)
for s in range(s):
bfs_visit()
for s in range(s):
print (s+1,dis[s])
|
s732379680 | p02239 | u824204304 | 1454410720 | Python | Python | py | Runtime Error | 0 | 0 | 494 | n = int(raw_input())
G = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
dis = [-1 for i in range(n)]
dis[0] = 0
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
a[G[0]-1][G[2+j]-1] = 1
def bfs_visit(s):
for k in range(n):
if a[s][k] == 1 and dis[k] == -1:
dis[k] = dis[s] + 1
bfs_visit(k)
for s in range(s):
bfs_visit()
for s in range(s):
print (s+1,dis[s])
|
s899802909 | p02239 | u824204304 | 1454410958 | Python | Python | py | Runtime Error | 0 | 0 | 466 | n = int(raw_input())
G = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
dis = [-1 for i in range(n)]
dis[0] = 0
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
a[G[0]-1][G[2+j]-1] = 1
def bfs_visit(s):
for k in range(n):
if a[s][k] == 1 and dis[k] == -1:
dis[k] = dis[s] + 1
bfs_visit(k)
for s in range(n):
bfs_visit()
for s in range(n):
print (s+1,dis[s])
|
s134335111 | p02239 | u824204304 | 1454411858 | Python | Python | py | Runtime Error | 0 | 0 | 557 | n = int(raw_input())
G = [0 for i in range(n)]
a = [[0 for i in range(n)] for j in range(n)]
dis = [1000 for i in range(n)]
dis[0] = 0
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
a[G[0]-1][G[2+j]-1] = 1
def bfs_visit(s):
for k in range(n):
if a[s][k] == 1:
if dis[k] > dis[s] + 1:
dis[k] = dis[s] + 1
bfs_visit(k)
for s in range(n):
bfs_visit(s)
for s in range(n):
if dis[s] == 1000:
dis[s] = -1
for s in range(n):
print'{0} {1}'.format(s+1, d[s])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.