input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(eval(input()))
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = dict()
for i in range(1, n + 1):
... | import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(eval(input()))
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = dict()
for i in range(1, n + 1):
... | p02925 |
import sys
from collections import deque
def main():
inp = sys.stdin.readline
n = int(inp())
target_num = n*(n-1)//2
all_set = set()
fin = set()
all_add = all_set.add
a = [None] * n
for i in range(n):
a[i] = deque(list(map(int, inp().split())))
ans = 0
while True:
cur_set... | from collections import deque
import time
start = time.time() # なにこれ
n = int(eval(input()))
target_num = n*(n-1)//2
all_set = set()
a = [deque(list(map(int, input().split()))) for i in range(n)]
ans = 0
while True:
cur_set = set()
flag = False
for i in range(n):
if len(a[i]):
tup = ... | p02925 |
import sys
import bisect
import math
import itertools
from collections import deque
import copy
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
L = [[] for _ in range(N + 1)]
for j in range(N):
a = list(map(int, input().split()))
... | import sys
import bisect
import math
import itertools
from collections import deque
import copy
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
L = [[] for _ in range(N + 1)]
for j in range(N):
a = list(map(int, input().split()))
... | p02925 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p02925 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p02925 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = []
for i in range(N):
A.append(list(map(int, input().split())))
index = [0]*(N+1)
ans = -2
for k in range(30000):
today = set()
flag = 0
for j in range(N):
if j+1 in today:
continue
if index[j+1] >... | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = []
for i in range(N):
A.append(list(map(int, input().split())))
index = [0]*(N+1)
ans = -2
for k in range(10000):
today = set()
flag = 0
for j in range(N):
if j+1 in today:
continue
if index[j+1] >... | p02925 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from itertools import product
from collections import deque
# input
n=int(eval(input()))
V=[(i,j) for i,j in product(list(range(n)),repeat=2) if i<j]
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from itertools import product
n=int(eval(input()))
match=[[0]*n for _ in range(n)]
V=0 # V=n(n-1)/2
for i,j in product(list(range(n)),repeat=2):
if(... | p02925 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from itertools import product
n=int(eval(input()))
match=[[0]*n for _ in range(n)]
V=0 # V=n(n-1)/2
for i,j in product(list(range(n)),repeat=2):
if(... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
# popするため逆順にしておく
A=[list([int(x)-1 for x in input().split()]) for _ in range(n)]
for i in range(n): A[i].reverse()
stack=[]
def c... | p02925 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from functools import lru_cache
def resolve():
n=int(eval(input()))
# id table
N=0
id=[[None]*n for _ in range(n)]
for i in range(n):
for j in range(i+1,n):
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
# id table
N=0
id=[[None]*n for _ in range(n)]
for i in range(n):
for j in range(i+1,n):
id[i][j]=N
... | p02925 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
# id table
N=0
id=[[None]*n for _ in range(n)]
for i in range(n):
for j in range(i+1,n):
id[i][j]=N
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
# id table
N=0
id=[[None]*n for _ in range(n)]
from itertools import product
for i,j in product(list(range(n)),repeat=2):
... | p02925 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
# id table
N=0
id=[[None]*n for _ in range(n)]
from itertools import product
for i,j in product(list(range(n)),repeat=2):
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
M=[None]*n
for i in range(n):
M[i]=list([int(x)-1 for x in input().split()])[::-1]
# i が誰かしらと対戦できるか
def check(i):
if(... | p02925 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
M=[None]*n
for i in range(n):
M[i]=list([int(x)-1 for x in input().split()])[::-1]
# i が誰かしらと対戦できるか
def check(i):
if(... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(eval(input()))
A = [None] * n
for i in range(n):
tmp = list([int(x) - 1 for x in input().split()])
tmp.reverse()
A[i] ... | p02925 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_lef... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_lef... | p02925 |
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
cnt = [0] * N
S = []
for i in range(N):
t = A[i][cnt[i]] - 1
if i == A[t][cnt[t]] - 1:
if cnt[i] != N - 2:
S.append(i)
ans = 1
while S:
ans += 1
L = [True] * N
for i in S:
cnt[i] += 1
T = []
... | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
cnt = [0] * N
S = []
for i in range(N):
t = A[i][cnt[i]] - 1
if i == A[t][cnt[t]] - 1:
if cnt[i] != N - 2:
S.append(i)
ans = 1
L = [True] * N
while S:
ans += 1
for i in S:
cnt[i] += 1
L[i] =... | p02925 |
from collections import defaultdict
from heapq import heappush, heappop
N = int(eval(input()))
dic = defaultdict(list)
toNum = {}
L = N*(N-1)//2
s = [0]
for i in range(N-1,0,-1):
s += [s[-1]+i]
dist = [0]*L
for i in range(N):
inf = [int(c)-1 for c in input().split()]
pa = min(i,inf[0])
pb = max(i,i... | N = int(eval(input()))
A = [0 for i in range(N)]
for i in range(N):
A[i] = [-1]+[int(c)-1 for c in input().split()][::-1]
def f(cand):
can_use = []
candl = set()
for i in cand:
c = A[i][-1]
if A[c][-1]==i:
can_use += [i]
for n in can_use:
A[n].pop()
candl.add(n)
if A[... | p02925 |
n=int(eval(input()))
A=[list(map(int,input().split()))[::-1] for i in range(n)]
day=0
zan=[n-1]*n
zann=sum(zan)
sumi=set(range(n))
while True:
day+=1
kouho=list(sumi)
sumi=set()
for i in kouho:
try:
if A[A[i][-1]-1][-1]-1==i:
sumi.add(i)
sumi.add(A[i][-1]-1)
... | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
def main():
n=int(eval(input()))
A=[list(map(int,input().split()))[::-1] for i in range(n)]
day=0
zan=[n-1]*n
zann=sum(zan)
sumi=set(range(n))
while True:
day+=1
... | p02925 |
def main():
N = int(eval(input()))
a = [list(map(int, input().split())) for i in range(N)]
now = [0] * N
day = 0
MAX = (N*(N-1)) // 2
gamed_day = [-1] * N
finished = 0
while True:
if day > MAX:
print((-1))
break
had_game = False
... | import time
def main():
N = int(eval(input()))
a = [list(map(int, input().split())) for i in range(N)]
start = time.time()
now = [0] * N
day = 0
gamed_day = [-1] * N
finished = 0
while True:
if time.time() - start > 1.8:
print(((N*(N-1))//2))
b... | p02925 |
import time
def main():
N = int(eval(input()))
a = [list(map(int, input().split())) for i in range(N)]
start = time.time()
now = [0] * N
day = 0
gamed_day = [-1] * N
finished = 0
while True:
if time.time() - start > 1.8:
print(((N*(N-1))//2))
b... | import time
def main():
N = int(eval(input()))
a = [list(map(int, input().split())) for i in range(N)]
start = time.time()
now = [0] * N
day = 0
gamed_day = [-1] * N
finished = 0
while True:
if time.time() - start > 1.6:
print(((N*(N-1))//2))
b... | p02925 |
#!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import ite... | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import ite... | p02925 |
import sys
input=sys.stdin.readline
N=int(eval(input()))
node=[]
for i in range(0,N-1):
for j in range(i+1,N):
node.append((i,j))
_to={key:set([]) for key in node}
_from={key:set([]) for key in node}
for i in range(0,N):
A=list(map(int,input().split()))
for j in range(0,N-2):
... | N=int(eval(input()))
A=[[] for i in range(0,N)]
nodes=[]
for i in range(0,N-1):
for j in range(i+1,N):
nodes.append((i,j))
order={i:[0 for j in range(0,N)] for i in range(0,N)}
for i in range(0,N):
A[i]=list(map(int,input().split()))
for j in range(0,N-1):
order[i][A[i][j]-1]=j
... | p02925 |
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = []
for _ in range(n):
t = deque(list(([int(x) - 1 for x in input().split()])))
A.append(t)
... | import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = []
for _ in range(n):
t = deque(list(([int(x) - 1 for x in input().split()])))
A.append(t)
... | p02925 |
import sys
from collections import defaultdict
n=int(eval(input()))
a=[]
hd=[0]*n
for i in range(n):
a.append(tuple(map(int,input().split())))
d=defaultdict(int)
for i in range(n):
for j in range(n-1):
d[(i,j)]=a[i][j]
loop=0
flag=0
while(flag<n):
stk=[]
for i in range(n):
... | import sys
sys.setrecursionlimit(10**9)
n=int(eval(input()))
a=[]
for i in range(n):
a.append(tuple(map(int,input().split())))
#print(a)
root=[[] for i in range(n*(n-1)//2)]
buf=0
for i in range(n):
buf=0
for j in range(n-1):
if j==0:
x=min(i,a[i][j]-1)
y=max(... | p02925 |
import sys
input = sys.stdin.readline
N = int(input().strip())
from itertools import combinations
nodes = list(combinations(list(range(N)), 2))
graph = {i:[] for i in nodes}
in_cnt = {k:0 for k in nodes}
for x in range(N):
l = list(map(int,input().split()))
y = l[0]-1
prev = (min(x,y),max(x,y))
for... | import sys
input = sys.stdin.readline
N = int(input().strip())
M = N*(N-1)//2
graph = [[] for i in range(M)]
in_cnt = [0 for i in range(M)]
for x in range(1,N+1):
l = list(map(int,input().split()))
y = l[0]
b,s = max(x,y),min(x,y)
prev = (b-1)*(b-2)//2+s-1
for y in l[1:]:
b,s = max(x,y),mi... | p02925 |
import queue
import copy
N=int(eval(input()))
A=[[] for _ in range(N)]
for i in range(N):
A[i]=list(map(int,input().split()))
NE=[0]*N#i番目の人が，次何番目の試合をするかのリスト
F=[0]*N#i番目の人が，該当する日に試合をしたか記憶しておく
#i+1日目の試合をする人はi日目に試合をした人なので，それを記憶．
q1=queue.Queue()
q2=queue.Queue()
#初日
for i in range(N):
opp=A... | N=int(eval(input()))
A=[[] for _ in range(N)]
for i in range(N):
A[i]=list(map(int,input().split()))
NE=[0]*N#i番目の人が，次何番目の試合をするかのリスト
F=[0]*N#i番目の人が，該当する日に試合をしたか記憶しておく
#i+1日目の試合をする人はi日目に試合をした人なので，それを2つのqueueに記憶．
Q=[[],[]]
#初日
for i in range(N):
opp=A[i][0]-1
if A[opp][0]-1==i:
NE[... | p02925 |
N=int(eval(input()))
A=[[] for _ in range(N)]
for i in range(N):
A[i]=list(map(int,input().split()))
NE=[0]*N#i番目の人が，次何番目の試合をするかのリスト
F=[0]*N#i番目の人が，該当する日に試合をしたか記憶しておく
#i+1日目の試合をする人はi日目に試合をした人なので，それを2つのqueueに記憶．
Q=[[],[]]
#初日
for i in range(N):
opp=A[i][0]-1
if A[opp][0]-1==i:
NE[... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
A=[]
inf=10**6
for _ in range(N):
a=LI()+[inf]
for j in range(N-1):... | p02925 |
#!/usr/bin/env python
import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)
def main():
input = sys.stdin.readline
#N, M = map... | #!/usr/bin/env python
import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)
def main():
input = sys.stdin.readline
#N, M = map... | p02925 |
N=int(eval(input()))
A=[list(map(int,input().split())) for i in range(N)]
from collections import defaultdict
d=defaultdict(int)
l=defaultdict(list)
for i in range(N):
x,y=(i,A[i][0]-1) if i<A[i][0]-1 else (A[i][0]-1,i)
d[(x,y)]+=1
l[(x,y)].append(i)
p=[0]*N
r=0
while len(d)>0:
r+=1
f=0... | N=int(eval(input()))
A=[list(map(int,input().split())) for i in range(N)]
from collections import defaultdict
d=defaultdict(int)
l=defaultdict(list)
for i in range(N):
x,y=(i,A[i][0]-1) if i<A[i][0]-1 else (A[i][0]-1,i)
d[(x,y)]+=1
l[(x,y)].append(i)
p=[0]*N
r=0
cand=list(d.keys())
while len(d)>... | p02925 |
from collections import deque
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [deque([int(i)-1 for i in input().split()]) for _ in range(N)]
def solve() :
q = list(range(N))
count = 0
ret = 0
while count != N * (N - 1) :
if len(q) == 0 :
return -1
... | from collections import deque
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [deque([int(i)-1 for i in input().split()]) for _ in range(N)]
def solve() :
q = list(range(N))
count = 0
ret = 0
while count != N * (N - 1) :
if len(q) == 0 :
return -1
... | p02925 |
import sys
import collections
import copy
def input(): return sys.stdin.readline().strip()
N = int(eval(input()))
sc = [[int(i) for i in input().split()] for i in range(N)]
count = [0] * N
done = [0] * N
fin = [N-1] * N
ans = 0
chk = 0
for j in range(N*(N-1)//2):
done = [0] * N
for i in range(N-1):... | import sys
import collections
import copy
def input(): return sys.stdin.readline().strip()
N = int(eval(input()))
sc = [[int(i) for i in input().split()] for i in range(N)]
count = [0] * N
done = [0] * N
fin = [N-1] * N
ans = 0
chk = 0
for j in range(N*(N-1)//2):
if j >= 4000:
chk = 1
... | p02925 |
def main():
n=int(eval(input()))
a=[list(map(int,input().split())) for _ in [0]*n]
m=(n*(n-1))//2
d=dict()
dr=[]
cnt=0
for i in range(n-1):
for j in range(i+1,n):
d[(i,j)]=cnt
dr.append((i,j))
cnt+=1
g=[[] for _ in [0]*m]
gr=[0... | def main():
n=int(eval(input()))
a=[list(map(int,input().split())) for _ in [0]*n]
m=(n*(n-1))//2
d=dict()
cnt=0
for i in range(n-1):
for j in range(i+1,n):
d[(i,j)]=cnt
cnt+=1
g=[[] for _ in [0]*m]
gr=[0]*m
for i in range(n):
temp... | p02925 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [list([int(x)-1 for x in input().split()]) for _ in range(n)]
N = n*(n-1)//2
index = {}
ind = 0
from collections import defaultdict
ns = d... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [list([int(x)-1 for x in input().split()]) for _ in range(n)]
N = n*(n-1)//2
index = {}
ind = 0
from collections import defaultdict
ns = d... | p02925 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [list([int(x)-1 for x in input().split()]) for _ in range(n)]
N = n*(n-1)//2
index = [[0]*(n) for i in range(n)]
ind = 0
from collections i... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [list([int(x)-1 for x in input().split()]) for _ in range(n)]
N = n*(n-1)//2
index = [[0]*(n) for i in range(n)]
ind = 0
from collections i... | p02925 |
from collections import deque
def main():
n=int(eval(input()))
a=[0]*n
for i in range(n):
a[i]=deque(list([int(x)-1 for x in input().split()]))
q=deque([])
for idx,i in enumerate(a):
x=idx
y=i[0]
if x == a[y][0]:
if x not in q and y not in q:
q.append(x)
q.... | from collections import deque
def main():
n=int(eval(input()))
a=[0]*n
for i in range(n):
a[i]=deque(list([int(x)-1 for x in input().split()]))
q=deque([])
tmp=set()
for idx,i in enumerate(a):
x=idx
y=i[0]
if x == a[y][0]:
tmp.add(x)
tmp.add(y)
q=deque(tmp)
f... | p02925 |
from collections import deque
def main():
n=int(eval(input()))
a=[0]*n
for i in range(n):
a[i]=deque(list([int(x)-1 for x in input().split()]))
q=deque([])
tmp=set()
for idx,i in enumerate(a):
x=idx
y=i[0]
if x == a[y][0]:
tmp.add(x)
tmp.add(y)
q=deque(tmp)
f... | from collections import deque
def main():
n=int(eval(input()))
a=[0]*n
for i in range(n):
a[i]=deque(list([int(x)-1 for x in input().split()]))
tmp=set()
for p1,p in enumerate(a):
p2=p[0]
if p1==a[p2][0]:
tmp.add(p1)
tmp.add(p2)
q=deque(tmp)
for i in tmp:
a[i].p... | p02925 |
import sys
input = sys.stdin.readline
from collections import defaultdict, deque
n = int(eval(input()))
X = 10000
INF = 1 << 50
edges = defaultdict(list)
def topological_sort(G):
cnt_in = defaultdict(int)
for k in list(G.keys()):
for v in G[k]:
cnt_in[v] += 1
# print(cnt_in... | import sys
input = sys.stdin.readline
from collections import defaultdict, deque
n = int(eval(input()))
X = 10000
INF = 1 << 50
edges = defaultdict(list)
edges_r = defaultdict(list)
def topological_sort(G):
cnt_in = defaultdict(int)
for k in list(G.keys()):
for v in G[k]:
cnt_i... | p02925 |
n = int(eval(input()))
a = [[] for i in range(n)]
for i in range(n):
a[i] = list(map(int,input().split()))
for j in range(n-1):
a[i][j] -= 1
a[i].reverse()
q = []
def check(i):
if len(a[i]) == 0:
return
j = a[i][-1]
if len(a[j]) == 0:
return
if a[j][-... | n = int(eval(input()))
a = [[] for i in range(n)]
for i in range(n):
a[i] = list(map(int,input().split()))
for j in range(n-1):
a[i][j] -= 1
a[i].reverse()
q = []
def check(i):
if len(a[i]) == 0:
return
j = a[i][-1]
if len(a[j]) == 0:
return
if a[j][-... | p02925 |
from collections import deque
N = int(eval(input()))
A = [deque(list(map(int,input().split()))) for _ in range(N)]
day = 0
match = 0
que = [0 for _ in range(N+1)]
while match!=(N-1) * N / 2:
tsumi = True
for i in range(1,N+1):
if que[i]==0 and A[i-1]!=deque():
que[i] = A[i-1].popleft()
fo... | from collections import deque
import time
zuru = time.time()
N = int(eval(input()))
A = [deque(list(map(int,input().split()))) for _ in range(N)]
match = 0
que = [0 for _ in range(N+1)]
for day in range(1, (N-1) * N // 2 + 1):
tsumi = True
for i in range(1,N+1):
if que[i]==0 and A[i-1]!=deque():
... | p02925 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
e = [[] for _ in range(n)]
for i in range(n):
a = list(map(int, input().split()))
for aa in a:
aa -= 1
e[i].append(aa)
# print(e)
inds = [0] * n
cur = [e[i][0] for i in range(n)]
# print(cur)
cnt = 0
while sum(cur... | def check(player):
if not a[player]:
return
opponent = a[player][-1]
if not a[opponent]:
return
if a[opponent][-1] == player:
tpl = (player, opponent)
q.add((min(tpl), max(tpl)))
n = int(eval(input()))
a = []
for _ in range(n):
t = list([int(x) - 1 f... | p02925 |
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
from collections import deque
import queue
def get_ind(pre_tuple, num):
a, b = pre_tuple
ans = (a - ... | from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
from collections import deque
import queue
def get_ind(pre_tuple, num):
a, b = pre_tuple
ans = (a - ... | p02925 |
# -*- coding: utf-8 -*-
import sys
import time
from collections import deque
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def IN... | # -*- coding: utf-8 -*-
import sys
import time
from collections import deque
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def IN... | p02925 |
n=int(eval(input()))
battle=[]
def mainasu(x):
return int(x)-1
front=[]
for _ in range(n):
tmp=list(map(mainasu,input().split()))[::-1]
front.append(tmp.pop())
battle.append(tmp)
day=0
#pri()
cnt=0
while 1:
flag=0
for i in range(n):
if front[i]<n and i==front[fro... | n=int(eval(input()))
battle=[]
def mainasu(x):
return int(x)-1
front=[]
for _ in range(n):
tmp=list(map(mainasu,input().split()))[::-1]
front.append(tmp.pop())
battle.append(tmp)
def pri():
global front,battle,day,checkday
print((day,front,battle,checkday))
day=0
check... | p02925 |
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(eval(input()))
A = [[int(x) for x in input().split()] for _ in range(N)]
A = [[]] + A
cnt = 0
ok = True
q = list(range(1, N+1))
for _ in range... | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(eval(input()))
A = [[int(x) for x in input().split()] for _ in range(N)]
A = [[-1]] + A
def check(a, q=[]):
if not A[a]:
return Fal... | p02925 |
import sys
import time
def solve(matrix):
N = len(matrix)
#print matrix
day = 0
worst = N * (N-1) / 2
remaining = worst
start = time.time()
while remaining:
prev = remaining
day+=1
#print "day %d" % day
#print "matrix: %r" % matrix
#prin... | import sys
import time
def solve(matrix):
N = len(matrix)
#print matrix
day = 0
worst = N * (N-1) / 2
remaining = worst
start = time.time()
while remaining:
prev = remaining
day+=1
#print "day %d" % day
#print "matrix: %r" % matrix
#prin... | p02925 |
import sys
from collections import deque
sys.setrecursionlimit(10000000)
n = int(sys.stdin.readline().rstrip())
a = [deque(list(map(int, sys.stdin.readline().split()))) for _ in range(n)]
def deepPop(x):
global a
global days
target = a[x][0] -1
if a[target][0] -1 == x:
a[target].... | import sys
from collections import deque
n = int(eval(input()))
a = [deque(list(map(int, sys.stdin.readline().rstrip().split()))) for _ in range(n)]
current = []
for i in range(n):
target = a[i][0] -1
if a[target][0] -1 == i and i < target:
current.append([i, target])
day = 0
zc = 0
w... | p02925 |
import sys
import copy
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = [deque(lr()) for _ in range(N)]
answer = 0
match = 0
candidate = list(range(N))
while True:
used = set()
bool = False... | import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = [deque(lr()) for _ in range(N)]
answer = 0
match = 0
candidate = list(range(N))
while True:
used = set()
bool = False
c = []
... | p02925 |
import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = [deque([(i, x) for x in lr()]) for i in range(1, N+1)]
day = 0
candidate = set()
match = 0
for i in range(N):
c = A[i].popleft()
candi... | import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = [deque([(i, x) for x in lr()]) for i in range(1, N+1)]
day = 0
candidate = set()
match = 0
for i in range(N):
c = A[i][0]
candidate.ad... | p02925 |
from collections import defaultdict, deque, Counter
import sys
import heapq
import math
# input = sys.stdin.readline
sys.setrecursionlimit(1000000000)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
def main():
N = int(eval(input()))
# A, B = [int(a) for a in input().split()]
# H = [int(a) for a in in... | from collections import defaultdict, deque, Counter
import sys
import heapq
import math
# input = sys.stdin.readline
sys.setrecursionlimit(1000000000)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
def main():
N = int(eval(input()))
# A, B = [int(a) for a in input().split()]
# H = [int(a) for a in in... | p02925 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(i) - 1 for i in input().split()] for _ in range(N)]
cur = [0] * N
max_pairs = N * (N - 1)
pairs = 0
cnt = 1
for _ in range(max_pairs // 2):
visited = [False] * N
for i, a in enumerate(A):
if cur[i] >= N - 1:
... | import time
start = time.time()
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [[int(i) - 1 for i in input().split()] for _ in range(N)]
cur = [0] * N
max_pairs = N * (N - 1)
pairs = 0
cnt = 1
for _ in range(max_pairs // 2):
visited = [False] * N
for i, a in enumerate(A):... | p02925 |
import sys
from collections import deque
input = sys.stdin.readline
n = int(eval(input()))
to_battle_with = [deque([i - 1 for i in map(int, input().split())]) for _ in range(n)]
day_count = 0
remained_battles = (n * (n - 1)) // 2
while remained_battles:
battled_today = set()
no_battle_today =... | import sys
from collections import deque
input = sys.stdin.readline
n = int(eval(input()))
to_battle_with = [deque([i - 1 for i in map(int, input().split())]) for _ in range(n)]
def update_battle(player, battle_set, to_battle_with):
if not to_battle_with[player]:
return
next_opponent =... | p02925 |
import sys
input=sys.stdin.readline
def main():
N=int(eval(input()))
L=[[]]
for i in range(N):
a=list(map(int,input().split()))
L.append(a)
#print(L)
Z=[0 for i in range(N+1)]
day=0
cnt=0
for i in range(10**6+5):
if cnt==N*(N-1)/2:
... | N=int(eval(input()))
A=[[0]]
for i in range(N):
a=list(map(int,input().split()))
a+=[0]
A.append(a)
#print(A)
B=[0 for i in range(N+1)]
C=[a for a in range(1,N+1)]
cnt=0
for i in range(10**6):
D=[]
F=0
for j in C:
if A[A[j][B[j]]][B[A[j][B[j]]]]==j and j not in D and ... | p02925 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
import math
sys.setrecursionlimit(10**6)
def SI():
return input().split()
def MI():
return list(map(int,input().split()))
... | from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
import math
import time
ts=time.time()
sys.setrecursionlimit(10**6)
def SI():
return input().split()
def MI():
return lis... | p02925 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
import math
import time
ts=time.time()
sys.setrecursionlimit(10**6)
def SI():
return input().split()
def MI():
return lis... | from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
import math
import time
ts=time.time()
sys.setrecursionlimit(10**6)
def SI():
return input().split()
def MI():
return lis... | p02925 |
def examA():
N = I()
ans = 0
print(ans)
return
def examB():
ans = 0
print(ans)
return
def examC():
ans = 0
print(ans)
return
def examD():
ans = 0
print(ans)
return
def examE():
N = I()
node = N*(N-1)//2
V = [[]for _ in range(nod... | def examA():
N = I()
ans = 0
print(ans)
return
def examB():
ans = 0
print(ans)
return
def examC():
ans = 0
print(ans)
return
def examD():
ans = 0
print(ans)
return
def examE():
N = I()
node = N*(N-1)//2
V = [[]for _ in range(nod... | p02925 |
N = int(eval(input()))
aaa = []
for i in range(N):
aaa.append(list(reversed(list(map(int, input().split())))))
for i in range(0, N*N+1):
done = [False] * N
empty = True
played = False
for j, aa in enumerate(aaa):
if len(aa) > 0:
empty = False
l = aa[-1]-1
if (not (done[j] o... | N = int(eval(input()))
aaa = []
for i in range(N):
aaa.append(list(reversed(list(map(int, input().split())))))
cs = set(range(N))
for i in range(0, N*N+1):
empty = True
played = False
ncs = set()
for j in cs:
aa = aaa[j]
if len(aa) > 0:
empty = False
l = aa[-1]-1
if j... | p02925 |
import math
import collections
import heapq
from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
n = int(eval(input()))
maxv = n*(n-1)//2
a = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for... | import math
import collections
import heapq
from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
n = int(eval(input()))
maxv = n*(n-1)//2
a = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for... | p02925 |
import math
import collections
import heapq
from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
n = int(eval(input()))
maxv = n*(n-1)//2
a = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for... | import math
import collections
import heapq
from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
n = int(eval(input()))
maxv = n*(n-1)//2
a = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for... | p02925 |
from collections import Counter,defaultdict,deque
from bisect import bisect_left
import sys,math,itertools,pprint,fractions,time
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
st = time.t... | from collections import Counter,defaultdict,deque
from bisect import bisect_left
import sys,math,itertools,pprint,fractions,time
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
st = time.t... | p02925 |
import sys
from collections import deque
input = sys.stdin.readline
def solve_e(n, a_list):
days = 0
ind_list = [0] * n
match_count = 0
queue = list(range(n))
stack = dict()
while len(queue) > 0:
days += 1
new_queue = []
for p in queue:
if ind_l... | import sys
input = sys.stdin.readline
def solve_e(n, a_list):
days = 0
ind_list = [0] * n
match_count = 0
queue = list(range(n))
stack = dict()
while len(queue) > 0:
days += 1
new_queue = []
for p in queue:
if ind_list[p] < n - 1:
... | p02925 |
from collections import deque
import copy
n = int(eval(input()))
orders = [deque(list(map(int, input().split()))) for _ in range(n)]
cnt = 0
finished = set()
while True:
impossible = True
skip = copy.deepcopy(finished)
#print(orders)
for i in range(n):
if i not in skip and orders[i][0] - 1 not in... | from collections import deque
n = int(eval(input()))
orders = [deque([x - 1 for x in list(map(int, input().split()))] + [-1]) for _ in range(n)]
nxt = [orders[i].popleft() for i in range(n)]
days = [0 for _ in range(n)]
q = deque([i for i in range(n)])
while q:
a = q.popleft()
b = nxt[a]
if nxt[nxt[a]... | p02925 |
import sys
import copy
n=int(eval(input()))
maxmatch=n*(n-1)
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
day=0
match=[0]*(n+1)
jyunban=[i for i in range(n)]
jyunban_n=[]
while match[n]<maxmatch:
jyunban_n.clear()
day+=1
check=[True]*(n+1)
for i in jyunban:
if match... | import sys
MAX_INT = int(10e9)
MIN_NUM = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
N = I()
a = [IL()[::-1] for i in range(N)]
used =... | p02925 |
import sys
import copy
n=int(eval(input()))
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
maxmatch=n*(n-1)
day=0
q=[i for i in range(n)]
nq=[]
match=[0]*(n+1)
check=[0]*(n+1)
while q:
day+=1
for i in q:
if match[i]==n-1 or check[i]==day:
continue
else:
vs=a... | import sys
n=int(eval(input()))
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
maxmatch=n*(n-1)
day=0
q=[i for i in range(n)]
nq=[]
match=[0]*(n+1)
check=[0]*(n+1)
while q:
day+=1
for i in q:
if match[i]==n-1 or check[i]==day:
continue
else:
vs=a[i][match[i]]... | p02925 |
N = int(eval(input()))
A = [[x-1 for x in list(map(int, input().split()))[::-1]] for _ in range(N)]
def can_match(i, A, next_set):
if not A[i]:
return
j = A[i][-1]
if A[j][-1] == i:
if i < j:
next_set.add((i,j))
else:
next_set.add((j,i))
next_set = set()
for i in rang... | N = int(eval(input()))
A = [[x-1 for x in list(map(int, input().split()))[::-1]] for _ in range(N)]
def can_match(i, A, next_set):
if not A[i]:
return
j = A[i][-1]
if A[j][-1] == i:
if i < j:
next_set.add((i,j))
else:
next_set.add((j,i))
next_set = set()
for i in rang... | p02925 |
N = int(eval(input()))
A = [[x-1 for x in list(map(int, input().split()))[::-1]] for _ in range(N)]
def can_match(i, A, next_set):
if not A[i]:
return
j = A[i][-1]
if A[j][-1] == i:
if i < j:
next_set.add((i,j))
else:
next_set.add((j,i))
next_set = set()
for i in rang... | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [[x-1 for x in list(map(int, input().split()))[::-1]] for _ in range(N)]
def can_match(i, A, next_set):
if not A[i]:
return
j = A[i][-1]
if A[j][-1] == i:
if i < j:
next_set.add((i,j))
else:
next_set.add((j,i))
... | p02925 |
def solve():
ans = 0
N = int(eval(input()))
stacks = [list([int(x)-1 for x in input().split()])[::-1] for _ in range(N)]
lis = [0]*N
cnt = 0
now = 0
flag = 0
while cnt<N*(N-1)//2:
while not stacks[now]:
now = (now+1)%N
a = stacks[now][-1]
while not stacks[a]:
now = (... | def solve():
ans = 0
N = int(eval(input()))
stacks = [list([int(x)-1 for x in input().split()])[::-1] for _ in range(N)]
lis = [0]*N
cnt = 0
now = 0
flag = 0
while cnt<N*(N-1)//2:
while not stacks[now]:
now = (now+1)%N
a = stacks[now][-1]
if not stacks[a]:
return -1
... | p02925 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = [list(map(int, readline().split())) for _ in range(n)]
for cnt in range(n ** 2):
check = []
flag = True
for i in range(n):
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = [list(map(int, readline().split())) for _ in range(n)]
q = list(range(n))
for cnt in range(1, n ** 2 + 2):
qq = set()
while q:
... | p02925 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = [list([int(x) - 1 for x in readline().split()]) for _ in range(n)]
q = list(range(n))
cnt = 0
while q:
cnt += 1
qq = set()
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = [list([int(x) - 1 for x in readline().split()]) for _ in range(n)]
q = list(range(n))
for cnt in range(1, n ** 2):
qq = set()
for... | p02925 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0
r = set(list(range(n)))
N = n*(n-1) // 2 + 1
for _ in range(N):
if not r:
print(_)
break
ne = set()
flag = True
for j in r:
if not a[j]:
... | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0
r = set(list(range(n)))
N = n*(n-1) // 2 + 1
for _ in range(N):
if not r:
print(_)
break
ne = set()
flag = True
for j in r:
if not a[j]:
... | p02925 |
from collections import deque
import sys
input = lambda: sys.stdin.readline()[:-1]
n=int(eval(input()))
data=[deque(list(map(int,input().split()))) for i in range(n)]
last=n*(n-1)
count=0
while last:
flag=1
count+=1
taisenzumi=[0]*n
for i in range(n):
if data[i]:
aite=data[i][0]
if data[aite-1... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
M=[None]*n
for i in range(n):
M[i]=list([int(x)-1 for x in input().split()])[::-1]
# i が誰かしらと対戦できるか
def check(i):
if(... | p02925 |
from collections import deque
def main():
nums = {}
N = int(eval(input()))
count = 0
for i in range(1, N+1):
for j in range(i+1, N+1):
nums[(i, j)] = count
count += 1
graph = {i:deque() for i in range(count)}
input_num = [0] * count
... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
Id = {}
cur = 0
for i in range(1, N+1):
for j in range(i+1, N+1):
Id[(i,j)] = cur
cur += 1
G = [[] for i in range(N*(N-1)//2)]
size = [0] * (N*(N-1)//... | p02925 |
def main():
from collections import defaultdict,deque
from itertools import count
(n,),*a=[list(map(int,t.split()))for t in open(0)]
d=defaultdict(count().__next__)
es=[]
for i,b in enumerate(a,1):
for j,k in zip(b,b[1:]):
x,y=i,j
if y<x:x,y=y,x
... | def main():
from collections import defaultdict,deque
from itertools import count
(n,),*a=[list(map(int,t.split()))for t in open(0)]
d=defaultdict(count().__next__)
es=[]
for i,b in enumerate(a,1):
for j,k in zip(b,b[1:]):
x,y=i,j
if y<x:x,y=y,x
... | p02925 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
from collections import deque,defaultdict
def solve():
## input
N = int(eval(input()))
An = [deque([i-1 for i in list(map(int, input().split()))]) for _ in range(N)]
## solve
Pn = set([i for i in range(N)])
count = 0
while len(Pn) > 0:
Qn =... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
from collections import deque,defaultdict
from sys import stdin
def solve():
## input
N = int(eval(input()))
An = [deque([i-1 for i in list(map(int, stdin.readline().rstrip().split()))]) for _ in range(N)]
## solve
Pn = set([i for i in range(N)])
... | p02925 |
import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = [list(map(int, readline().split())) for _ in range(n)]
for i in range(n):
for j in range(n - 1):
a[i][j] -= 1
ls = [0] * n
ql = collect... | import collections
def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
for i in range(n):
for j in range(n-1):
a[i][j] -= 1
ad = [0] * n
... | p02925 |
import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
a = [list([int(x) - 1 for x in input().rstrip('\n').split()]) for _ in range(n)]
ps = [0] * n
ql = collections.deque()
for i in range(n):
ql.append([0, ... | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = [list([int(x) - 1 for x in readline().split()]) for _ in range(n)]
ls = [0] * n
ql = [[0, i] for i in range(n)]
ql = collections.deque(ql)
for i in rang... | p02925 |
import sys
input = sys.stdin.readline
from collections import deque
def main():
n = int(eval(input()))
U = n**2
G = [[] for _ in range(U)]
parent = [0]*U
for i in range(n):
A = list([int(x)-1 for x in input().split()])
for j in range(n-2):
a = A[j]
b = A[j+1]
G[min(i, ... | import sys
input = sys.stdin.readline
from collections import deque
n = int(eval(input()))
U = n**2
G = [[] for _ in range(U)]
parent = [0]*U
for i in range(n):
A = list([int(x)-1 for x in input().split()])
for j in range(n-2):
a = A[j]
b = A[j+1]
G[min(i, a)*n+max(i, a)].append(min(i, b)*... | p02925 |
n = int(eval(input()))
xss = [[int(x)-1 for x in input().split()] for _ in range(n)]
class Stack:
def __init__(xs):
self.__list = list(reversed(xs))
def peak(self):
return self.__list[-1]
def pop(self):
return self.pop()
def solve(n, xss):
yss = [[-1] + list(rev... | n = int(eval(input()))
xss = [[int(x)-1 for x in input().split()] for _ in range(n)]
def solve(n, xss):
yss = [[-1] + list(reversed(xs)) for xs in xss]
ans = 0
candidates = list(range(n))
while True:
#print(" ".join(map(str, candidates)))
ms = list(matches(yss, candidates))
... | p02925 |
#E
import sys
input=sys.stdin.readline
from collections import defaultdict,deque
n=int(eval(input()))
v=n**2
A=[list([int(x)-1 for x in input().split()]) for _ in range(n)]
Edges=set()
for i in range(n):
l=len(A[i])
for j in range(l-1):
a=A[i][j]
b=A[i][j+1]
fr_i,fr_j=min(i,... | import sys
input=sys.stdin.readline
from collections import defaultdict,deque
def conv(n,a,b):
return a*(2*n-a-1)//2+b-a-1
n=int(eval(input()))
v=n*(n-1)//2
A=[list([int(x)-1 for x in input().split()]) for _ in range(n)]
Edges=[]
for i in range(n):
l=len(A[i])
for j in range(l-1):
a=A[... | p02925 |
import sys
readline = sys.stdin.readline
def main():
limit = 10 ** 5
n = int(eval(input()))
a = []
for _ in range(n):
a.append(tuple(map(int,input().split())))
a = tuple(a)
play = [0 for _ in range(n)]
flag = [True for _ in range(n)]
count = 0
ans = 0
while True:
break_flag = True
for i... | import sys
readline = sys.stdin.readline
def main():
limit = 10 ** 4
n = int(eval(input()))
a = []
for _ in range(n):
a.append(tuple(map(int,input().split())))
a = tuple(a)
play = [0 for _ in range(n)]
flag = [True for _ in range(n)]
count = 0
ans = 0
while True:
break_flag = True
for i... | p02925 |
n=int(eval(input()))
data_set=[0 for i in range(n)]
for i in range(n):
a=list(map(int,input().split()))
a.append(-1)
data_set[i]=a
index=[0 for i in range(n)]
ans=-1
flag=True
now=[data_set[i][index[i]] for i in range(n)]
finished=[False for i in range(n)]
while flag:
visited=[False for i in... | n=int(eval(input()))
import time
T=time.time()
data_set=[0 for i in range(n)]
for i in range(n):
a=list(map(int,input().split()))
a.append(-1)
data_set[i]=a
index=[0 for i in range(n)]
ans=-1
flag=True
semi=False
now=[data_set[i][index[i]] for i in range(n)]
finished=[False for i in range(n)]
... | p02925 |
# atcoder problems solving
# League
from collections import deque
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
graph = {(i, j): [] for i in range(1, N+1) for j in range(i+1, N+1)}
indegree = {(i, j): 0 for i in range(1, N+1) for j in range(i+1, N+1)}
for i in range... | # 休憩review
# League
from collections import deque
N = int(eval(input()))
G = [[] for i in range(N**2+1)]
for i in range(N):
a = list(map(int, input().split()))
for j in range(1, N-1):
_from, _to = a[j-1], a[j]
G[N*min(i+1, _from)-N+max(i+1, _from)
].append(N*min(i+1, _to)-N+m... | p02925 |
import sys
N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split(" ")]) for i in range(N)]
canUse = set(range(N))
ans = 0
while any([len(i) > 0 for i in A]):
# print("\nDay", ans)
ans += 1
canUseNew = set()
for n in canUse:
if not A[n]:
continue
... | import sys
N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split(" ")]) for i in range(N)]
canUse = set(range(N))
ans = 0
done = 0
while done < N:
ans += 1
canUseNew = set()
# print("LC", len(canUse))
for n in canUse:
if not A[n]:
continue
f... | p02925 |
N = int(eval(input()))
A = []
for i in range(N):
As = list(map(int, input().split()))
As = list(reversed(list([N-a for a in As])))
A.append(As)
A.reverse()
#print(A)
d = 0
n = 0
while True:
gs = []
for i in range(N):
if A[i] == []:
continue
j = A[i][-1]
if j < i:
conti... | N = int(eval(input()))
A = []
for i in range(N):
As = list(map(int, input().split()))
As = list(reversed(list([a-1 for a in As])))
A.append(As)
#print(A)
d = 0
n = 0
l = list(range(N))
while True:
n2 = 0
l2 = []
s2 = set()
for i in l:
if A[i] == []:
continue
j = A[i][-1]
... | p02925 |
import time
s_time = time.time()
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
memo = {}
for i in range(n):
memo[i] = 0
cnt = 0
while True:
visited = [False] * n
flag = False
for i in range(n):
if memo[i] == len(a[0]):
continue
... | import time
s_time = time.time()
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
memo = {}
for i in range(n):
memo[i] = 0
cnt = 0
while True:
visited = [False] * n
flag = False
for i in range(n):
if memo[i] == len(a[0]):
continue
... | p02925 |
import collections as cl,sys
input = sys.stdin.readline
def l(): #intのlist
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
n = onem()
on = cl.deque()
de = cl.deque()
ppp = [n-1 for i in range(n)]
for i in range(n):
k = l()
for j in range(n-1):
k... | import collections as cl
def l(): #intのlist
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
n = onem()
on = []
de = cl.deque()
ppp = [n-1 for i in range(n)]
for i in range(n):
k = l()
for j in range(n-1):
k[j] -= 1
k.reverse()
de.append... | p02925 |
def main():
import sys
import time
input = sys.stdin.buffer.readline
start = time.time()
N = int(eval(input()))
A = [tuple(map(int, input().split())) for i in range(N)]
id = [0]*N
Lock = [-1]*N
ans = 0
min_id = 0
M = (N*(N-1)) // 2
while(min_id < N-1):
... |
def main():
import sys
import time
input = sys.stdin.buffer.readline
start = time.time()
N = int(eval(input()))
A = [tuple(map(int, input().split())) for i in range(N)]
id = [0]*N
Lock = [-1]*N
ans = 0
min_id = 0
M = (N*(N-1)) // 2
while(min_id < N-1):
... | p02925 |
from copy import deepcopy
n = int(eval(input()))
a = [list([int(x) - 1 for x in input().split()]) for _ in range(n)]
d = [0] * n
ans = 0
temp = set([x for x in range(n)])
while 1:
next_temp = set()
for t in temp:
if d[t] >= n - 1:
continue
u = a[t][d[t]]
if ... | from copy import deepcopy
from heapq import heappop, heappush
n = int(eval(input()))
a = [list([int(x) - 1 for x in input().split()]) for _ in range(n)]
d = [0] * n
ans = 0
temp = []
for x in range(n):
heappush(temp, x)
while 1:
next_temp = []
while len(temp) > 0:
x = heappop(temp)... | p02925 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
from collections import deque
def getN():
return int(eval(input()))
def getList():
return list(map(int, input().split()))
import math
n = getN()
match = [0 for i in range((n*(n-1))//2)]
child = [[] for i in range((n*(n-1))//... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
from collections import deque
def getN():
return int(eval(input()))
def getList():
return list(map(int, input().split()))
import math
n = getN()
match = [0 for i in range((n * (n - 1)) // 2)]
child = [[] for i in ra... | p02925 |
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | p02925 |
import sys
read = sys.stdin.readline
def main():
n = int(read())
V = 1000000
g = [[] for _ in range(V)]
deg = [0] * V
vlist = [False] * V
for i in range(n):
a = list([int(x) - 1 for x in read().rstrip().split()])
for j in range(n - 2):
v1 = min(i, a... | import sys
read = sys.stdin.readline
def main():
n = int(read())
V = 1000000
g = [[] for _ in range(V)]
deg = [0] * V
vlist = set()
for i in range(n):
a = list([int(x) - 1 for x in read().rstrip().split()])
for j in range(n - 1):
v1 = min(i, a[j]) *... | p02925 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
idx = [0] * N
d = 0
while True:
c = [False] * N
for i in range(N):
if idx[i] >= N - 1: continue
if c[i]: continue
m = A[i][idx[i]]
if A[m][idx[m]] == i:
... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
idx = [0] * N
D = [[-1] * (N) for _ in range(N)]
for j in range(N):
D[j][0] = 0
while True:
f = True
for i in range(N):
if idx[i] >= N - 1: continue
m = A[i][idx[i]]
... | p02925 |
def main():
N = int(eval(input()))
A = [list(reversed(list([int(x) - 1 for x in input().split()]))) for _ in range(N)]
d = 0
r = N
cur = list(range(N))
w = [a.pop() for a in A]
while r:
d += 1
nxt = []
for i in cur:
o = w[i]
if w[o]... | def main():
N = int(eval(input()))
A = [list(reversed(list([int(x) - 1 for x in input().split()]))) for _ in range(N)]
d = 0
r = N
cur = list(range(N))
w = [a.pop() for a in A]
while r:
d += 1
nxt = []
for i in cur:
o = w[i]
if o ==... | p02925 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | p02925 |
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(eval(input()))
a = [[min(i,int(j)-1)+max(i,int(j)-1)*(max(i,int(j)-1)-1)//2 for j in readline().split()] for i in range(n)]
N =n*(n-1)//2
g = [[] for i in range(N)]
p = [[] for i in range(N)]... | # coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(eval(input()))
N =n*(n-1)//2
a = [[int(j)-1 for j in readline().split()] for _ in range(n)]
g = [[] for i in range(N)]
indegree = [0]*N
def encode(x,y):
if x > y: x,y = y,x
return ... | p02925 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
from collections import deque
N = int(eval(input()))
A = [0 for i in range(N)]
for i in range(N) :
L = list(map(int,input().split()))
for j in range(len(L)) :
L[j] -= 1
A[i] = deque(L)
#print(A)
ans = 0
flg = 0
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
from collections import deque
N = int(eval(input()))
A = [0 for i in range(N)]
for i in range(N) :
L = list(map(int,input().split()))
for j in range(len(L)) :
L[j] -= 1
A[i] = deque(L)
#print(A)
ans = 0
flg = 0
... | p02925 |
def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
N = int(eval(input()))
A = []
for _ in range(N):
A.append(list(map(int, input().split())))
adj = defaultdict(list)
in_num = defaultdict(int)
for i in range(N):
for j i... | def main():
import sys
from collections import defaultdict
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = []
for _ in range(N):
A.append(list(map(int, input().split())))
adj = defaultdict(list)
in_num = defaultdict(int)
for i in range(N):
... | p02925 |
from collections import defaultdict
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
adj = defaultdict(list)
in_deg = defaultdict(int)
for u, row in enumerate(a, 1):
for v1, v2 in zip(row, row[1:]):
uu1, vv1 = min(u, v1), max(u, v1)
uu2, vv2 = min(u, v2), ma... | from collections import defaultdict
n = int(eval(input()))
a = [tuple(map(int, input().split())) for _ in range(n)]
adj = defaultdict(list)
in_deg = defaultdict(int)
for u, row in enumerate(a, 1):
for v1, v2 in zip(row, row[1:]):
uu1, vv1 = min(u, v1), max(u, v1)
uu2, vv2 = min(u, v2), m... | p02925 |
def resolve():
n = int(eval(input()))
am = []
from collections import deque
for i in range(n):
am.append(deque(list([int(x) - 1 for x in input().split()])))
cnt = n * (n - 1) // 2
day = 0
while cnt > 0:
day += 1
match = 0
done = {}
... | def resolve():
n = int(eval(input()))
a = []
for i in range(n):
row = list([int(x) - 1 for x in input().split()])
row.reverse()
a.append(row)
q = set()
def check(i):
if len(a[i]) == 0:
return
j = a[i][-1]
if i == a[j][-1]:... | p02925 |
from collections import deque
n=int(eval(input()))
a=[deque(list(map(int,input().split()))) for _ in range(n)]
tcnt,ans=0,0
while tcnt<n*(n-1)//2:
cnt=0
chk=[]
for i in range(n-1):
if i in chk:
continue
else:
if a[i]:
b=a[i][0]-1
... | from collections import deque
n=int(eval(input()))
x=lambda i:int(i)-1
a=[deque(list(map(x,input().split()))+[-1]) for _ in range(n)]
tcnt,ans=n*(n-1),0
chk=set(range(n))
while tcnt>0:
chk_next=set()
for i in chk:
if a[a[i][0]][0]==i:
chk_next.add(i)
if len(chk_next)==0:
... | p02925 |
import sys
def main():
n = int(sys.stdin.readline().strip())
a = [[0] * n for _ in range(n)]
for i in range(n):
a[i] = [int(s) for s in sys.stdin.readline().strip().split(' ')]
loc = [n-2] * n
ans = 0
used = [False] * n
game_count = 0
total_game_count = n * (n-1... | import sys
import time
def main():
n = int(sys.stdin.readline().strip())
a = [[0] * n for _ in range(n)]
for i in range(n):
a[i] = [int(s) for s in sys.stdin.readline().strip().split(' ')]
loc = [n-2] * n
ans = 0
game_count = 0
total_game_count = n * (n-1) // 2
s... | p02925 |
n = int(eval(input()))
a = [list(map(int,input().split())) for _ in range(n)]
s = [0 for i in range(n)] #それぞれ何試合目か
ans = 0
need = n*(n-1)//2
while need:
c = [0 for i in range(n)] #今日試合をするかどうか
ans += 1
for first in range(n):
if c[first] == 0 and s[first] < n-1:
second = a[first]... | import time
start = time.time()
n = int(eval(input()))
a = [list(map(int,input().split())) for _ in range(n)]
s = [0 for i in range(n)] #それぞれ何試合目か
ans = 0
need = n*(n-1)//2
while need:
c = [0 for i in range(n)] #今日試合をするかどうか
ans += 1
for first in range(n):
if c[first] == 0 and s[first] < n... | p02925 |
import copy
n = int(eval(input()))
# 隣接リスト
graph = {i+1000*j:set() for i in range(n) for j in range(i+1,n)}
# 入次数を管理
st = {i+1000*j:0 for i in range(n) for j in range(i+1,n)}
#たどったかどうかチェック
check = {i+1000*j:True for i in range(n) for j in range(i+1,n)}
# 入次数が0の頂点の集まり
szero = []
#ソートされたやつたち
ans = []
... | n = int(eval(input()))
# 隣接リスト
graph = {i+1000*j:[] for i in range(n) for j in range(i+1,n)}
# 入次数を管理
st = {i+1000*j:0 for i in range(n) for j in range(i+1,n)}
# 入次数が0の頂点の集まり
szero = []
#ソートされたやつたち
ans = []
for i in range(n):
ls = list(map(int,input().split()))
f = -1
for p in ls:
... | p02925 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.