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):
d[i] = input_int_list()[::-1]
day = 0
candi = set(range(1, n + 1))
rest = (n * (n - 1)) // 2
while rest:
played = set()
for a in candi:
if d[a] and d[d[a][-1]][-1] and a == d[d[a][-1]][-1]:
played.add(a)
played.add(d[a][-1])
if not played:
break
candi.clear()
rest -= len(played) // 2
for a in played:
candi.add(a)
d[a].pop()
if d[a]:
candi.add(d[a][-1])
day += 1
if rest == 0:
print(day)
else:
print((-1))
if __name__ == "__main__":
main()
| 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):
d[i] = input_int_list()[::-1]
day = 0
candi = set(range(1, n + 1))
rest = (n * (n - 1)) // 2
while rest:
played = set()
for a in candi:
if d[a] and d[d[a][-1]][-1] and a == d[d[a][-1]][-1]:
played.add(a)
played.add(d[a][-1])
if not played:
break
candi.clear()
rest -= len(played) // 2
for a in played:
candi.add(a)
d[a].pop()
# if d[a]:
# candi.add(d[a][-1])
day += 1
if rest == 0:
print(day)
else:
print((-1))
if __name__ == "__main__":
main()
| 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 = set()
flag = False
for i in range(n):
if len(a[i]):
tup = (min(i+1, a[i][0]), max(i+1, a[i][0]))
if a[i][0] in fin:
flag = False
break
else:
fin.add(i+1)
continue
if tup not in cur_set:
cur_set.add(tup)
elif tup in cur_set:
all_add(tup)
t1, t2 = tup
a[t1-1].popleft()
a[t2-1].popleft()
flag = True
ans += 1
if len(all_set)==target_num:
break
if not flag:
print((-1))
exit()
print(ans)
if __name__ == '__main__':
main() | 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 = (min(i+1, a[i][0]), max(i+1, a[i][0]))
else:
continue
if tup not in cur_set:
cur_set.add(tup)
elif tup in cur_set:
all_set.add(tup)
t1, t2 = tup
a[t1-1].popleft()
a[t2-1].popleft()
flag = True
ans += 1
if len(all_set)==target_num:
break
if time.time()-start>1.8:
print((1000*999//2))
exit()
if not flag:
print((-1))
exit()
print(ans) | 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()))
L[j + 1] = deque(a)
f_original = [False] * (N + 1)
f = [False] * (N + 1)
k =0
pre_revise =set(range(N+1))
current_revise =set(range(N+1))
while k<500001: # １日分の作業
f =[False] * (N + 1)
pre_revise =copy.copy(current_revise)
current_revise =set()
for i in pre_revise: #一人分の作業
if not L[i]:
continue
can = L[i][0]
if L[can][0] == i and f[can] is False and f[i] is False:
L[i].popleft()
L[can].popleft()
f[i] = True
f[can] = True
current_revise.add(i)
current_revise.add(can)
k += 1
if f == f_original:
break
for i in range(N + 1):
if len(L[i])>0:
print((-1))
exit()
print((k-1))
if __name__ == "__main__":
main()
| 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()))
L[j + 1] = deque(a)
k =0
current_revise =set(range(N+1))
while k<50000000: # １日分の作業
pre_revise =copy.copy(current_revise)
current_revise =set()
for i in pre_revise: #一人分の作業
if not L[i]:
continue
can = L[i][0]
if L[can][0] == i and i not in current_revise and can not in current_revise:
L[i].popleft()
L[can].popleft()
current_revise.add(i)
current_revise.add(can)
k += 1
if len(current_revise)==0:
break
for i in range(N + 1):
if len(L[i])>0:
print((-1))
exit()
print((k-1))
if __name__ == "__main__":
main()
| 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(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#A
def A():
s = S()
t = S()
ans = 0
for i in range(3):
if s[i] == t[i]:
ans += 1
print(ans)
return
#B
def B():
a, b = LI()
ans = 0
b -= 1
while b > 0:
b -= a - 1
ans += 1
print(ans)
return
#C
def C():
n = II()
h = LI()
i = 0
ans = 0
while i < n:
down = i+1
while down < n:
if h[down - 1] >= h[down]:
down += 1
else:
break
ans = max(ans, down - i - 1)
i = down
print(ans)
return
#D
def D():
n = II()
print((n * (n - 1) // 2))
return
#E
def E():
n = II()
a = LIR_(n)
ans = 0
tern = [0] * n
while 1:
ans += 1
f = True
c = defaultdict(int)
for i in range(n):
if c[i]:
continue
if tern[i] == n - 1:
continue
rival = a[i][tern[i]]
if c[rival]:
continue
if tern[rival] == n - 1:
continue
if a[rival][tern[rival]] == i:
c[i] += 1
c[rival] += 1
tern[rival] += 1
tern[i] += 1
f = False
if f:
if tern == [n - 1] * n:
print((ans-1))
return
else:
print((-1))
return
return
#F
def F():
return
#Solve
if __name__ == '__main__':
E()
| #!/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(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
import time
#A
def A():
s = S()
t = S()
ans = 0
for i in range(3):
if s[i] == t[i]:
ans += 1
print(ans)
return
#B
def B():
a, b = LI()
ans = 0
b -= 1
while b > 0:
b -= a - 1
ans += 1
print(ans)
return
#C
def C():
n = II()
h = LI()
i = 0
ans = 0
while i < n:
down = i+1
while down < n:
if h[down - 1] >= h[down]:
down += 1
else:
break
ans = max(ans, down - i - 1)
i = down
print(ans)
return
#D
def D():
n = II()
print((n * (n - 1) // 2))
return
#E
def E():
start = time.time()
n = II()
a = LIR_(n)
ans = 0
tern = [0] * n
while 1:
ans += 1
f = True
c = defaultdict(int)
for i in range(n):
if c[i]:
continue
if tern[i] == n - 1:
continue
rival = a[i][tern[i]]
if c[rival]:
continue
if tern[rival] == n - 1:
continue
if a[rival][tern[rival]] == i:
c[i] += 1
c[rival] += 1
tern[rival] += 1
tern[i] += 1
f = False
if time.time() - start >= 1.8:
print((n * (n - 1) // 2))
return
if f:
if tern == [n - 1] * n:
print((ans-1))
return
else:
print((-1))
return
return
#F
def F():
return
#Solve
if __name__ == '__main__':
E()
| 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(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
import time
#A
def A():
s = S()
t = S()
ans = 0
for i in range(3):
if s[i] == t[i]:
ans += 1
print(ans)
return
#B
def B():
a, b = LI()
ans = 0
b -= 1
while b > 0:
b -= a - 1
ans += 1
print(ans)
return
#C
def C():
n = II()
h = LI()
i = 0
ans = 0
while i < n:
down = i+1
while down < n:
if h[down - 1] >= h[down]:
down += 1
else:
break
ans = max(ans, down - i - 1)
i = down
print(ans)
return
#D
def D():
n = II()
print((n * (n - 1) // 2))
return
#E
def E():
start = time.time()
n = II()
a = LIR_(n)
ans = 0
tern = [0] * n
while 1:
ans += 1
f = True
c = defaultdict(int)
for i in range(n):
if c[i]:
continue
if tern[i] == n - 1:
continue
rival = a[i][tern[i]]
if c[rival]:
continue
if tern[rival] == n - 1:
continue
if a[rival][tern[rival]] == i:
c[i] += 1
c[rival] += 1
tern[rival] += 1
tern[i] += 1
f = False
if time.time() - start >= 1.8:
print((n * (n - 1) // 2))
return
if f:
if tern == [n - 1] * n:
print((ans-1))
return
else:
print((-1))
return
return
#F
def F():
return
#Solve
if __name__ == '__main__':
E()
| #!/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(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
import time
#A
def A():
s = S()
t = S()
ans = 0
for i in range(3):
if s[i] == t[i]:
ans += 1
print(ans)
return
#B
def B():
a, b = LI()
ans = 0
b -= 1
while b > 0:
b -= a - 1
ans += 1
print(ans)
return
#C
def C():
n = II()
h = LI()
i = 0
ans = 0
while i < n:
down = i+1
while down < n:
if h[down - 1] >= h[down]:
down += 1
else:
break
ans = max(ans, down - i - 1)
i = down
print(ans)
return
#D
def D():
n = II()
print((n * (n - 1) // 2))
return
#E
def E():
start = time.time()
n = II()
a = LIR_(n)
ans = 0
tern = [0] * n
while 1:
ans += 1
f = True
c = defaultdict(int)
for i in range(n):
if c[i]:
continue
if tern[i] == n - 1:
continue
rival = a[i][tern[i]]
if c[rival]:
continue
if tern[rival] == n - 1:
continue
if a[rival][tern[rival]] == i:
c[i] += 1
c[rival] += 1
tern[rival] += 1
tern[i] += 1
f = False
if time.time() - start >= 1:
print((n * (n - 1) // 2))
return
if f:
if tern == [n - 1] * n:
print((ans-1))
return
else:
print((-1))
return
return
#F
def F():
return
#Solve
if __name__ == '__main__':
E()
| 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] >= N-1:
continue
#print(j, index[j+1])
opponent = A[j][index[j+1]]
if A[opponent-1][index[opponent]] == j+1:
if opponent not in today:
index[opponent] += 1
index[j+1] += 1
today.add(opponent)
today.add(j+1)
flag = 1
if flag == 0:
if sum(index) == N*(N-1):
ans = k
break
else:
ans = -1
break
#print(index)
if ans == -2:
print((N*(N-1)//2))
else:
print(ans)
| 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] >= N-1:
continue
#print(j, index[j+1])
opponent = A[j][index[j+1]]
if A[opponent-1][index[opponent]] == j+1:
if opponent not in today:
index[opponent] += 1
index[j+1] += 1
today.add(opponent)
today.add(j+1)
flag = 1
if flag == 0:
if sum(index) == N*(N-1):
ans = k
break
else:
ans = -1
break
#print(index)
if ans == -2:
print((N*(N-1)//2))
else:
print(ans)
| 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]
E={v:[] for v in V}
indeg={v:0 for v in V}
for i in range(n):
a=list([int(x)-1 for x in input().split()])
for j in range(1,n-1):
p0,q0=min(i,a[j-1]),max(i,a[j-1])
p1,q1=min(i,a[j]),max(i,a[j])
E[(p0,q0)].append((p1,q1))
indeg[(p1,q1)]+=1
# topological sort
Q=deque(k for k,v in list(indeg.items()) if v==0)
res=[]
while(Q):
v0=Q.popleft()
res.append(v0)
for v1 in E[v0]:
indeg[v1]-=1
if indeg[v1]==0: Q.append(v1)
# judge whether DAG or not
if len(res)<n*(n-1)//2:
print((-1))
return
# calculate diameter
LP={v:1 for v in V}
for v0 in res:
for v1 in E[v0]:
LP[v1]=max(LP[v1],LP[v0]+1)
print((max(LP.values())))
resolve() | 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(i>=j): continue
match[i][j]=V
V+=1
def toID(i,j):
if(i>j): i,j=j,i
return match[i][j]
E=[[] for _ in range(V)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(1,n-1):
E[toID(i,A[j-1])].append(toID(i,A[j]))
# あとは頂点VのグラフをdfsしてLongest pathの長さを求める
# -1: unchecked, -2: checked and uncalculated
dp=[-1]*V
flag=True
def dfs(v):
global flag
dp[v]=-2
length=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
if(dp[nv]==-1):
dfs(nv)
length=max(length,dp[nv]+1)
dp[v]=length
# calculate
for i in range(V): dfs(i)
print((max(dp)+1 if(flag) else -1))
resolve() | 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(i>=j): continue
match[i][j]=V
V+=1
def toID(i,j):
if(i>j): i,j=j,i
return match[i][j]
E=[[] for _ in range(V)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(1,n-1):
E[toID(i,A[j-1])].append(toID(i,A[j]))
# 頂点数Vの有向グラフをdfsしてLongest pathの長さを求める
# -1: unchecked, -2: checked and uncalculated
dp=[-1]*V
def dfs(v):
if(dp[v]>=0): return
dp[v]=-2
length=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
if(dp[nv]==-1):
dfs(nv)
length=max(length,dp[nv]+1)
dp[v]=length
# calculate
for i in range(V): dfs(i)
print((max(dp)+1))
resolve() | 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 check(i):
if(not A[i]): return
j=A[i][-1]
if(A[j][-1]==i):
stack.append((min(i,j),max(i,j)))
# calculate
for i in range(n): check(i)
day=0
while(stack):
day+=1
stack=list(set(stack)) # uniqueを取る
prev,stack=stack,[]
for i,j in prev:
A[i].pop(); A[j].pop()
for i,j in prev:
check(i); check(j)
print((-1 if(any(A[i] for i in range(n))) else day))
resolve() | 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):
id[i][j]=N
N+=1
toID=lambda i,j:id[min(i,j)][max(i,j)]
E=[[] for _ in range(N)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(n-2):
u=toID(i,A[j])
v=toID(i,A[j+1])
E[u].append(v)
# longest path problem
dp=[-1]*N
@lru_cache(None)
def dfs(v):
dp[v]=-2
res=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
res=max(res,dfs(nv)+1)
dp[v]=res
return res
print((max(dfs(v) for v in range(N))+1))
resolve() | 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
N+=1
toID=lambda i,j:id[min(i,j)][max(i,j)]
E=[[] for _ in range(N)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(n-2):
u=toID(i,A[j])
v=toID(i,A[j+1])
E[u].append(v)
# longest path problem
dp=[-1]*N
def dfs(v):
if(dp[v]>=0): return dp[v]
dp[v]=-2
res=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
res=max(res,dfs(nv)+1)
dp[v]=res
return res
print((max(dfs(v) for v in range(N))+1))
resolve() | 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
N+=1
toID=lambda i,j:id[min(i,j)][max(i,j)]
E=[[] for _ in range(N)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(n-2):
u=toID(i,A[j])
v=toID(i,A[j+1])
E[u].append(v)
# longest path problem
dp=[-1]*N
def dfs(v):
if(dp[v]>=0): return dp[v]
dp[v]=-2
res=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
res=max(res,dfs(nv)+1)
dp[v]=res
return res
print((max(dfs(v) for v in range(N))+1))
resolve() | 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):
if(i>=j): continue
id[i][j]=N
N+=1
toID=lambda i,j:id[min(i,j)][max(i,j)]
E=[[] for _ in range(N)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(n-2):
u=toID(i,A[j])
v=toID(i,A[j+1])
E[u].append(v)
# longest path problem
dp=[-1]*N
def dfs(v):
if(dp[v]>=0): return dp[v]
dp[v]=-2
res=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
res=max(res,dfs(nv)+1)
dp[v]=res
return res
print((max(dfs(v) for v in range(N))+1))
resolve() | 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):
if(i>=j): continue
id[i][j]=N
N+=1
toID=lambda i,j:id[min(i,j)][max(i,j)]
E=[[] for _ in range(N)]
for i in range(n):
A=list([int(x)-1 for x in input().split()])
for j in range(n-2):
u=toID(i,A[j])
v=toID(i,A[j+1])
E[u].append(v)
# longest path problem
dp=[-1]*N
def dfs(v):
if(dp[v]>=0): return dp[v]
dp[v]=-2
res=0
for nv in E[v]:
if(dp[nv]==-2):
print((-1))
exit()
elif(dp[nv]==-1):
res=max(res,dfs(nv)+1)
else:
res=max(res,dp[nv]+1)
dp[v]=res
return res
print((max(dfs(v) for v in range(N))+1))
resolve() | 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(not M[i]): # 既に試合を終えている
return False
j=M[i][-1]
if(not M[j]): # これは起こり得ない
return False
return i==M[j][-1]
# 初日に対戦できる人をピックアップ
# 重複が起こるが、後で unique を取る
Q=[]
for i in range(n):
if(check(i)):
j=M[i][-1]
if(i>j): i,j=j,i # i<j
Q.append((i,j))
# 処理を行なっていく
day=0
nQ=[] # 次の試合相手
while(Q):
# Q には重複があるので unique
Q=list(set(Q))
# 先に全ての試合を終わらせる必要がある
for i,j in Q:
M[i].pop(); M[j].pop()
# 試合を終えた人は次の試合を行える可能性がある
for i,j in Q:
if(check(i)):
k=M[i][-1]
nQ.append((min(i,k),max(i,k)))
if(check(j)):
k=M[j][-1]
nQ.append((min(j,k),max(j,k)))
Q,nQ=nQ,[]
day+=1
print((day if(all(M[i]==[] for i in range(n))) else "-1"))
resolve() | 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(not M[i]): # 既に試合を終えている
return False
j=M[i][-1]
if(not M[j]): # これは起こり得ない
return False
return i==M[j][-1]
# 初日に対戦できる人をピックアップ
# 重複が起こるが、後で unique を取る
Q=[]
for i in range(n):
if(check(i)):
j=M[i][-1]
if(i>j): i,j=j,i # i<j
Q.append((i,j))
# 処理を行なっていく
day=0
nQ=[] # 次の試合相手
while(Q):
# Q には重複があるので unique
Q=list(set(Q))
# 先に全ての試合を終わらせる必要がある
for i,j in Q:
M[i].pop(); M[j].pop()
# 試合を終えた人は次の試合を行える可能性がある
for i,j in Q:
if(check(i)):
k=M[i][-1]
nQ.append((min(i,k),max(i,k)))
if(check(j)):
k=M[j][-1]
nQ.append((min(j,k),max(j,k)))
Q,nQ=nQ,[]
day+=1
print((day if(all(M[i]==[] for i in range(n))) else "-1"))
resolve() | 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] = tmp
now = set()
for i in range(n):
j = A[i][-1]
if i == A[j][-1]:
now.add((min(i, j), max(i, j)))
cnt = 0
while now:
next = set()
for i, j in now:
A[i].pop()
A[j].pop()
for i0, i1 in now:
for i in (i0, i1):
if not A[i]:
continue
j = A[i][-1]
if not A[j]:
continue
if i == A[j][-1]:
next.add((min(i, j), max(i, j)))
now = next
cnt += 1
if any(row for row in A):
print((-1))
return
print(cnt)
resolve() | 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_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def main():
N = inputInt()
A = []
for i in range(N):
tmp = inputList()
A.append(tmp)
ind = [0] * N
ans = 0
anfl = True
for i in range(90000):
flg = False
doList = []
for i, val in enumerate(ind):
if val == -1:
continue
min = A[i]
target = min[val]
if (A[target-1][ind[target-1]] - 1) == i:
if (i not in doList) and (target-1 not in doList):
if ind[i]+1 > N-2:
ind[i] = -1
else:
ind[i] += 1
if ind[target-1]+1 > N-2:
ind[target-1] = -1
else:
ind[target-1] += 1
doList.append(i)
doList.append(target-1)
flg = True
if flg == True:
ans += 1
else:
anfl = False
break
if anfl == False:
for i in ind:
if i != -1:
print((-1))
sys.exit()
print(ans)
else:
print(((N*(N-1))/2))
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def main():
N = inputInt()
A = []
for i in range(N):
tmp = inputList()
A.append(tmp)
ind = [0] * N
ans = 0
anfl = True
for i in range(80000):
flg = False
doList = []
for i, val in enumerate(ind):
if val == -1:
continue
min = A[i]
target = min[val]
if (A[target-1][ind[target-1]] - 1) == i:
if (i not in doList) and (target-1 not in doList):
if ind[i]+1 > N-2:
ind[i] = -1
else:
ind[i] += 1
if ind[target-1]+1 > N-2:
ind[target-1] = -1
else:
ind[target-1] += 1
doList.append(i)
doList.append(target-1)
flg = True
if flg == True:
ans += 1
else:
anfl = False
break
if anfl == False:
for i in ind:
if i != -1:
print((-1))
sys.exit()
print(ans)
else:
print(((N*(N-1))/2))
if __name__ == "__main__":
main()
| 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 = []
for i in S:
if L[i]:
t = A[i][cnt[i]] - 1
if i == A[t][cnt[t]] - 1:
if cnt[i] != N - 2:
L[i] = False
T.append(i)
if L[t]:
L[t] = False
if cnt[t] != N - 2:
T.append(t)
S = T
for i in range(N):
if cnt[i] != N - 2:
print((-1))
break
else:
print(ans)
| 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] = True
T = []
for i in S:
if L[i]:
t = A[i][cnt[i]] - 1
if i == A[t][cnt[t]] - 1:
if cnt[i] != N - 2:
L[i] = False
T.append(i)
if L[t]:
L[t] = False
if cnt[t] != N - 2:
T.append(t)
S = T
for i in range(N):
if cnt[i] != N - 2:
print((-1))
break
else:
print(ans)
| 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,inf[0])
pnum = s[pa]+(pb-pa-1)
for j in range(1,N-1):
a = min(i,inf[j])
b = max(i,inf[j])
num = s[a]+(b-a-1)
dic[pnum] += [num]
dist[num] += 1
pa = a
pb = b
pnum = num
hq = []
for i in range(L):
if dist[i]==0:
heappush(hq,(1,i))
dist[i] = 0
if hq==[]:
print((-1))
import sys
sys.exit()
cnt = 0
ans = 0
while hq:
c, n = heappop(hq)
if dist[n]>=c:
continue
dist[n] = c
cnt += 1
for m in dic[n]:
if dist[m]>=c+1:
continue
if ans<c+1:
ans = c+1
heappush(hq,(c+1,m))
if ans>L:
print((-1))
break
else:
print(ans) | 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[n][-1]!=-1:
candl.add(A[n][-1])
return len(can_use),candl
ans = 0
rest = N*(N-1)
cand = set(range(N))
while True:
ans += 1
x, cand = f(cand)
if x==0:
ans = -1
break
rest -= x
if rest==0:
break
print(ans) | 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)
except:
pass
for k in sumi:
A[k].pop()
zan[k]-=1
if zann==sum(zan):
print((-1))
exit(0)
zann=sum(zan)
if zann==0:
print(day)
exit(0)
| 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
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)
except:
pass
for k in sumi:
A[k].pop()
zan[k]-=1
if zann==sum(zan):
print((-1))
exit(0)
zann=sum(zan)
if zann==0:
print(day)
exit(0)
if __name__ == "__main__":
main() | 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
all_finish = True
for i in range(N-1, -1, -1):
if now[i] < N-1 and gamed_day[i] != day:
all_finish = False
want = a[i][now[i]] - 1
if gamed_day[want] != day:# 今日試合していない
if a[want][now[want]] - 1 == i:# 相手の試合相手が自分
now[want] += 1
now[i] += 1
if now[want] >= N-1:
finished += 1
if now[i] >= N-1:
finished += 1
gamed_day[i] = day
gamed_day[want] = day
had_game = True
# print(day+1, i+1, want+1)
if all_finish or finished == N:
if had_game:
print((day+1))
else:
print(day)
break
if not had_game:
print((-1))
break
day += 1
# print(now)
if __name__ == "__main__":
main()
| 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))
break
had_game = False
all_finish = True
for i in range(N-1, -1, -1):
if now[i] < N-1 and gamed_day[i] != day:
all_finish = False
want = a[i][now[i]] - 1
if gamed_day[want] != day:# 今日試合していない
if a[want][now[want]] - 1 == i:# 相手の試合相手が自分
now[want] += 1
now[i] += 1
if now[want] >= N-1:
finished += 1
if now[i] >= N-1:
finished += 1
gamed_day[i] = day
gamed_day[want] = day
had_game = True
# print(day+1, i+1, want+1)
if all_finish or finished == N:
if had_game:
print((day+1))
else:
print(day)
break
if not had_game:
print((-1))
break
day += 1
# print(now)
if __name__ == "__main__":
main()
| 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))
break
had_game = False
all_finish = True
for i in range(N-1, -1, -1):
if now[i] < N-1 and gamed_day[i] != day:
all_finish = False
want = a[i][now[i]] - 1
if gamed_day[want] != day:# 今日試合していない
if a[want][now[want]] - 1 == i:# 相手の試合相手が自分
now[want] += 1
now[i] += 1
if now[want] >= N-1:
finished += 1
if now[i] >= N-1:
finished += 1
gamed_day[i] = day
gamed_day[want] = day
had_game = True
# print(day+1, i+1, want+1)
if all_finish or finished == N:
if had_game:
print((day+1))
else:
print(day)
break
if not had_game:
print((-1))
break
day += 1
# print(now)
if __name__ == "__main__":
main()
| 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))
break
had_game = False
all_finish = True
for i in range(N-1, -1, -1):
if now[i] < N-1 and gamed_day[i] != day:
all_finish = False
want = a[i][now[i]] - 1
if gamed_day[want] != day:# 今日試合していない
if a[want][now[want]] - 1 == i:# 相手の試合相手が自分
now[want] += 1
now[i] += 1
if now[want] >= N-1:
finished += 1
if now[i] >= N-1:
finished += 1
gamed_day[i] = day
gamed_day[want] = day
had_game = True
# print(day+1, i+1, want+1)
if all_finish or finished == N:
if had_game:
print((day+1))
else:
print(day)
break
if not had_game:
print((-1))
break
day += 1
# print(now)
if __name__ == "__main__":
main()
| 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 itemgetter # itemgetter(1), itemgetter('key')
from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
# from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations # product(iter, repeat=n), permutations(iter[,r])
# from itertools import accumulate # accumulate(iter[, f])
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy # to copy multi-dimentional matrix without reference
# from fractions import gcd # for Python 3.4 (previous contest @AtCoder)
def main():
mod = 1000000007 # 10^9+7
inf = float('inf') # sys.float_info.max = 1.79...e+308
inf = 2 ** 64 - 1 # (for fast JIT compile in PyPy) 1.84...e+19
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().split()))
def mi_0(): return [int(x)-1 for x in input().split()]
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list([int(x)-1 for x in input().split()])
def li(): return list(eval(input()))
def edge_to_vertex(n, i, j):
'convert edge(i,j) (1-index) to vertex'
return (2 * n - i) * (i - 1) // 2 + (j - i - 1)
def topological_bfs(m, adj):
dim_0_vertices = []
sorted_vertices = []
dim = [0] * m
for i in range(m):
for j in adj[i]:
dim[j] += 1
q = deque()
for i in range(m):
if dim[i] == 0:
dim_0_vertices.append(i)
q.append(i)
while q:
u = q.popleft()
assert(dim[u] == 0)
sorted_vertices.append(u)
for v in adj[u]:
dim[v] -= 1
if dim[v] == 0:
q.append(v)
return dim_0_vertices, sorted_vertices
def bfs(adj, start):
max_depth = 0
q = deque()
q.append([start, 0])
while q:
u, dist = q.popleft()
max_depth = max(max_depth, dist)
for v in adj[u]:
q.append([v, dist + 1])
return max_depth
n = ii()
# 試合の組み合わせを頂点へと変換し有向グラフ隣接リストへと変換する前処理 O(n^2)
m = n * (n - 1) // 2
adj = [[] for _ in range(m)]
for i in range(1, n + 1):
L = lmi()
vertices = [edge_to_vertex(n, min(i, j), max(i, j)) for j in L]
for k in range(1, n - 1):
u, v = vertices[k-1], vertices[k]
adj[u].append(v)
# print(adj)
# BFS トポロジカルソートを用いて閉路判定 O(n^2)
dim_0_vertices, topological_sorted = topological_bfs(m, adj)
if len(topological_sorted) != m:
print((-1))
# 入次数 0 の頂点から BFS を行い最大距離を返す O(n^2)
else:
date = 0
for u in dim_0_vertices:
date = max(date, bfs(adj, u) + 1)
print(date)
if __name__ == "__main__":
main()
| #!/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 itemgetter # itemgetter(1), itemgetter('key')
from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
# from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations # product(iter, repeat=n), permutations(iter[,r])
# from itertools import accumulate # accumulate(iter[, f])
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy # to copy multi-dimentional matrix without reference
# from fractions import gcd # for Python 3.4 (previous contest @AtCoder)
def main():
mod = 1000000007 # 10^9+7
inf = float('inf') # sys.float_info.max = 1.79...e+308
inf = 2 ** 64 - 1 # (for fast JIT compile in PyPy) 1.84...e+19
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().split()))
def mi_0(): return [int(x)-1 for x in input().split()]
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list([int(x)-1 for x in input().split()])
def li(): return list(eval(input()))
def edge_to_vertex(n, i, j):
'convert edge(i,j) (1-index) to vertex'
return (2 * n - i) * (i - 1) // 2 + (j - i - 1)
def topological_bfs(m, adj):
sorted_vertices = []
dim = [0] * m
for i in range(m):
for j in adj[i]:
dim[j] += 1
q = deque()
for i in range(m):
if dim[i] == 0:
q.append(i)
while q:
u = q.popleft()
assert(dim[u] == 0)
sorted_vertices.append(u)
for v in adj[u]:
dim[v] -= 1
if dim[v] == 0:
q.append(v)
return sorted_vertices
n = ii()
# 試合の組み合わせを頂点へと変換し有向グラフ隣接リストへと変換する前処理 O(n^2)
m = n * (n - 1) // 2
adj = [[] for _ in range(m)]
for i in range(1, n + 1):
L = lmi()
vertices = [edge_to_vertex(n, min(i, j), max(i, j)) for j in L]
for k in range(1, n - 1):
u, v = vertices[k-1], vertices[k]
adj[u].append(v)
# print(adj)
# BFS トポロジカルソートを用いて閉路判定 O(n^2)
topological_sorted = topological_bfs(m, adj)
if len(topological_sorted) != m:
print((-1))
# 入次数 0 の頂点からトポロジカルソート順に辺を緩和し、最大距離を返す O(n^2)
else:
cost = [1] * m
for u in topological_sorted:
for v in adj[u]:
cost[v] = max(cost[u], cost[u] + 1)
print((max(cost)))
if __name__ == "__main__":
main()
| 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):
if A[j]-1>i:
if A[j+1]-1>i:
_to[(i,A[j]-1)].add((i,A[j+1]-1))
_from[(i,A[j+1]-1)].add((i,A[j]-1))
else:
_to[(i,A[j]-1)].add((A[j+1]-1,i))
_from[(A[j+1]-1,i)].add((i,A[j]-1))
else:
if A[j+1]-1>i:
_to[(A[j]-1,i)].add((i,A[j+1]-1))
_from[(i,A[j+1]-1)].add((A[j]-1,i))
else:
_to[(A[j]-1,i)].add((A[j+1]-1,i))
_from[(A[j+1]-1,i)].add((A[j]-1,i))
day=0
q=set([])
flag={n:0 for n in node}
for key in node:
if not _from[key]:
q.add(key)
sub=set([])
while q:
while q:
x=q.pop()
for n in _to[x]:
flag[n]+=1
if flag[n]==len(_from[n]):
sub.add(n)
if not q:
q=sub
sub=set([])
day+=1
break
able=True
for n in node:
if flag[n]!=len(_from[n]):
able=False
if able:
print(day)
else:
print((-1)) | 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
#i番目の人がj番目の人と戦うのが何番目か
q=set([])
for battle in nodes:
i,j=battle
if order[i][j]==0 and order[j][i]==0:
q.add(battle)
flag=[0 for i in range(0,N)]
day=0
sub=set([])
while q:
while q:
i,j=q.pop()
flag[i]+=1
flag[j]+=1
if flag[i]!=N-1:
s=A[i][order[i][j]+1]-1
if flag[s]>=order[s][i]:
sub.add((i,s))
if flag[j]!=N-1:
t=A[j][order[j][i]+1]-1
if flag[t]>=order[t][j]:
sub.add((j,t))
if not q:
day+=1
q=sub
sub=set([])
break
able=True
for i in range(0,N):
if flag[i]!=N-1:
able=False
if able:
print(day)
else:
print((-1)) | 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)
res = 0
emp = [1] * n
while True:
check = [0] * n
for i in range(n):
if A[i] and not check[i]:
idx = A[i][0]
if not check[idx] and A[idx][0] == i:
A[i].popleft()
A[idx].popleft()
check[i] = check[idx] = 1
if not A[i]:
emp[i] = 0
res += 1
if sum(emp) == 0:
break
if sum(check) == 0:
print((-1))
exit()
print(res)
if __name__ == '__main__':
resolve()
| 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)
que = deque(list(range(n)))
res = 0
emp = [False] * n
while que:
next_que = deque([])
check = set()
while que:
i = que.popleft()
if A[i]:
idx = A[i][0]
if i not in check and idx not in check and A[idx][0] == i:
A[i].popleft()
A[idx].popleft()
next_que.append(i)
next_que.append(idx)
check.add(i)
check.add(idx)
else:
emp[i] = True
que = next_que
if que:
res += 1
else:
print((res if all(emp) else -1))
if __name__ == '__main__':
resolve()
| 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):
if hd[i]==n-1:
continue
idx=d[(i,hd[i])]-1
if hd[idx]==n-1:
print((-1))
sys.exit()
if d[(idx,hd[idx])]==i+1:
stk.append(i)
if not stk:
loop=-2
break
for j in stk:
hd[j]+=1
if hd[j]==n-2:
flag+=1
loop+=1
print((loop+1)) | 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(i,a[i][j]-1)
buf=x*(2*n-2-x+1)//2+(y-x)-1
#print(x,y,buf)
continue
x=min(i,a[i][j]-1)
y=max(i,a[i][j]-1)
node=x*(2*n-2-x+1)//2+(y-x)-1
#print(x,y,node)
root[buf].append(node)
buf=node
flag=[True]
#閉路☑
def dfs(node,par):
dp[node]=0
for item in root[node]:
if item==par:
continue
if dp[item]==0:
flag[0]=False
return
if dp[item]==-1:
dfs(item,node)
dp[node]=1#finish
dp=[-1]*(n*(n-1)//2)
for i in range(n*(n-1)//2):
if dp[i]==-1:
dfs(i,i)
if flag[0]==False:
break
if flag[0]==False:
print((-1))
sys.exit()
dp=[-1]*(n*(n-1)//2)
def dfs1(node,par):
buf=0
for item in root[node]:
if item==par:
continue
if dp[item]!=-1:
buf=max(buf,dp[item])
continue
if dp[item]==-1:
buf=max([buf,dfs1(item,node)])
dp[node]=buf+1#finish
return buf+1
for i in range(n*(n-1)//2):
if dp[i]==-1:
dp[i]=dfs1(i,i)
print((max(dp)))
| 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 y in l[1:]:
y -= 1
now = (min(x,y),max(x,y))
graph[prev].append(now)
in_cnt[now] += 1
prev = now
d = {k:1 for k in nodes}
q = [i for i in nodes if not in_cnt[i]]
if not q:
print((-1))
exit()
ans = 0
while q:
x = q.pop()
for y in graph[x]:
d[y] = max(d[y],d[x]+1)
ans = max(ans,d[y])
in_cnt[y] -= 1
if not in_cnt[y]:
q.append(y)
if [i for i in nodes if in_cnt[i]]:
print((-1))
exit()
print(ans) | 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),min(x,y)
now = (b-1)*(b-2)//2+s-1
graph[prev].append(now)
in_cnt[now] += 1
prev = now
d = [1 for k in range(M)]
q = [i for i in range(M) if not in_cnt[i]]
if not q:
print((-1))
exit()
ans = 0
while q:
x = q.pop()
for y in graph[x]:
d[y] = max(d[y],d[x]+1)
ans = max(ans,d[y])
in_cnt[y] -= 1
if not in_cnt[y]:
q.append(y)
if [i for i in range(M) if in_cnt[i]]:
print((-1))
exit()
print(ans) | 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[i][0]-1
if A[opp][0]-1==i:
NE[i]+=1
q1.put(i)
ans=1
#d日目
for d in range(N*(N-1)//2):
F=[0]*N
while not q2.empty():
a=q2.get()
q1.put(a)
while not q1.empty():
i=q1.get()
if NE[i]==N-1:
continue
opp=A[i][NE[i]]-1
if F[i]==1 or F[opp]==1:#その日に試合したことがある人はスルー,oppの重複防止
continue
if A[opp][NE[opp]]-1==i:
NE[i]+=1
NE[opp]+=1
F[i]=1
F[opp]=1
if NE[i]!=N-1:
q2.put(i)
if NE[opp]!=N-1:
q2.put(opp)
ans+=1
if q2.empty() and q2.empty():
break
for i in range(N):
if NE[i]!=N-1:
ans=-1
print(ans) | 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[i]+=1
Q[0].append(i)
ans=1
#d日目
for d in range(N*(N-1)//2):
F=[0]*N
a=d%2
b=(d+1)%2
while len(Q[a])!=0:
i=Q[a].pop()
if NE[i]==N-1:
continue
opp=A[i][NE[i]]-1
if F[i]==1 or F[opp]==1:#その日に試合したことがある人はスルー,oppの重複防止
continue
if A[opp][NE[opp]]-1==i:
NE[i]+=1
NE[opp]+=1
F[i]=1
F[opp]=1
if NE[i]!=N-1:
Q[b].append(i)
if NE[opp]!=N-1:
Q[b].append(opp)
ans+=1
if len(Q[a])==0 and len(Q[b])==0:
break
for i in range(N):
if NE[i]!=N-1:
ans=-1
print(ans) | 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[i]+=1
Q[0].append(i)
ans=1
#d日目
for d in range(N*(N-1)//2):
F=[0]*N
a=d%2
b=(d+1)%2
while len(Q[a])!=0:
i=Q[a].pop()
if NE[i]==N-1:
continue
opp=A[i][NE[i]]-1
if F[i]==1 or F[opp]==1:#その日に試合したことがある人はスルー,oppの重複防止
continue
if A[opp][NE[opp]]-1==i:
NE[i]+=1
NE[opp]+=1
F[i]=1
F[opp]=1
if NE[i]!=N-1:
Q[b].append(i)
if NE[opp]!=N-1:
Q[b].append(opp)
ans+=1
if len(Q[a])==0 and len(Q[b])==0:
break
for i in range(N):
if NE[i]!=N-1:
ans=-1
print(ans) | 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):
a[j]-=1
A.append(a)
cur=[0]*N#i番目の人が何試合消化したか
st=[]# stackに，みるべき人を入れていいく，変化があった人だけ見れば良い
nxt=[]
#初日は全員みる，N>=3より初日で終わることはない
for i in range(N):
for j in range(i+1,N):
if A[i][0]==j and A[j][0]==i:
cur[i]=1
cur[j]=1
st.append(i)
st.append(j)
day=1
while st:
used=[0]*N
day+=1
while st:
i=st.pop()#みる人
j=A[i][cur[i]]#相手候補
if used[i]==0 and used[j]==0:
if A[j][cur[j]]==i:#マッチング
cur[i]+=1
cur[j]+=1
nxt.append(i)
nxt.append(j)
used[i]=1
used[j]=1
while nxt:
a=nxt.pop()
if cur[a]!=N-1:
st.append(a)
if sum(cur)==N*(N-1):
print(day)
else:
print((-1))
main()
| 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(int, input().split())
#N, K = map(int, input().split())
#ps = list(map(int, input().split()))
N = int(eval(input()))
A_all = []
for i in range(N):
As = list(map(int, input().split()))
A_all.append(As)
A_index = [0] * N
for i in range(N * (N - 1) // 2 + 1):
matches = set()
for j in range(1, N+1):
A_idx = A_index[j - 1]
if A_idx >= N - 1:
continue
k = A_all[j - 1][A_idx]
B_idx = A_index[k - 1]
if B_idx >= N - 1:
continue
if j == A_all[k - 1][B_idx]:
pair = tuple(sorted([j, k]))
matches.add(pair)
if not matches:
break
for match in matches:
for j in match:
A_index[j - 1] += 1
if all([A_idx == N - 1 for A_idx in A_index]):
print(i)
else:
print((-1))
if __name__ == '__main__':
main()
| #!/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(int, input().split())
#N, K = map(int, input().split())
#ps = list(map(int, input().split()))
N = int(eval(input()))
A_all = []
for i in range(N):
As = list(map(int, input().split()))
A_all.append(As)
A_index = [0] * N
candidates = set(range(1, N+1))
for i in range(N * (N - 1) // 2 + 1):
matches = set()
for j in candidates:
A_idx = A_index[j - 1]
if A_idx >= N - 1:
continue
k = A_all[j - 1][A_idx]
B_idx = A_index[k - 1]
if B_idx >= N - 1:
continue
if j == A_all[k - 1][B_idx]:
pair = tuple(sorted([j, k]))
matches.add(pair)
if not matches:
break
candidates = set()
for match in matches:
for j in match:
A_index[j - 1] += 1
candidates.add(j)
if all([A_idx == N - 1 for A_idx in A_index]):
print(i)
else:
print((-1))
if __name__ == '__main__':
main()
| 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
diff=defaultdict(int)
for k in list(d.keys()):
if d[k]==2:
del d[k]
for i in l[k]:
p[i]+=1
if p[i]>N-2:
continue
x,y=(i,A[i][p[i]]-1) if i<A[i][p[i]]-1 else (A[i][p[i]]-1,i)
diff[(x,y)]+=1
l[(x,y)].append(i)
f=1
for x,y in list(diff.keys()):
d[(x,y)]+=diff[(x,y)]
if f==0:
break
print((r if f>0 else -1)) | 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)>0:
r+=1
f=0
diff=defaultdict(int)
for k in cand:
if d[k]==2:
del d[k]
for i in l[k]:
p[i]+=1
if p[i]>N-2:
continue
x,y=(i,A[i][p[i]]-1) if i<A[i][p[i]]-1 else (A[i][p[i]]-1,i)
diff[(x,y)]+=1
l[(x,y)].append(i)
f=1
for x,y in list(diff.keys()):
d[(x,y)]+=diff[(x,y)]
cand=list(diff.keys())
if f==0:
break
print((r if f>0 else -1)) | 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
done = [False] * N
schedule = []
for i in q :
j = A[i][0]
if done[i] or done[j]:
continue
if i == A[j][0] :
schedule.append(i)
schedule.append(j)
done[i] = done[j] = True
ret += 1
q = []
for i in schedule :
A[i].popleft()
if len(A[i]) > 0 :
q.append(i)
count += len(schedule)
return ret
print((solve())) | 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
schedule = set()
for i in q :
j = A[i][0]
if i in schedule or j in schedule :
continue
if i == A[j][0] :
schedule.add(i)
schedule.add(j)
ret += 1
q = []
for i in schedule :
A[i].popleft()
if len(A[i]) > 0 :
q.append(i)
count += len(schedule)
return ret
print((solve()))
| 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):
if N-1 > count[i]:
if done[sc[i][count[i]]-1] == 0 and done[i] == 0:
if sc[sc[i][count[i]]-1][count[sc[i][count[i]]-1]] == i+1:
done[sc[i][count[i]]-1] = 1
done[i] = 1
count[sc[i][count[i]]-1] += 1
count[i] += 1
if done == [0] * N:
if count == fin:
break
else:
ans = -1
break
ans += 1
print(ans) | 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
break
done = [0] * N
for i in range(N-1):
if N-1 > count[i]:
if done[sc[i][count[i]]-1] == 0 and done[i] == 0:
if sc[sc[i][count[i]]-1][count[sc[i][count[i]]-1]] == i+1:
done[sc[i][count[i]]-1] = 1
done[i] = 1
count[sc[i][count[i]]-1] += 1
count[i] += 1
if done == [0] * N:
if count == fin:
break
else:
ans = -1
break
ans += 1
if chk == 0:
print(ans)
else:
print((N*(N-1)//2)) | 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]*m
for i in range(n):
temp=[]
for j in a[i]:
if i>=j:temp.append(d[(j-1,i)])
else:temp.append(d[(i,j-1)])
for j,k in enumerate(temp[1:]):
g[temp[j]].append(k)
gr[k]+=1
q=[i for i,j in enumerate(gr) if j==0]
cnt=0
while q:
cnt+=1
qq=[]
temp=[]
s=set()
for i in q:
x,y=dr[i]
if (x not in s) and (y not in s):
temp.append(i)
s.add(x)
s.add(y)
else:
qq.append(i)
for i in temp:
for j in g[i]:
gr[j]-=1
if gr[j]==0:
qq.append(j)
q=qq
if sum(gr)==0:
print(cnt)
else:
print((-1))
main() | 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=[]
for j in a[i]:
if i>=j:temp.append(d[(j-1,i)])
else:temp.append(d[(i,j-1)])
for j,k in enumerate(temp[1:]):
g[temp[j]].append(k)
gr[k]+=1
q=[i for i,j in enumerate(gr) if j==0]
cnt=0
while q:
cnt+=1
qq=[]
for i in q:
for j in g[i]:
gr[j]-=1
if gr[j]==0:
qq.append(j)
q=qq
if sum(gr)==0:
print(cnt)
else:
print((-1))
main() | 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 = defaultdict(list)
for i in range(n):
for j in range(i+1,n):
index[i,j] = ind
index[j,i] = ind
ind += 1
for i in range(n):
for j in range(n-2):
u = index[i,a[i][j]]
v = index[i,a[i][j+1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
# uからdfs
seen[u] = True
ans = 0
for v in ns[u]:
if done[v]:
ans = max(ans, vals[v]+1)
continue
elif seen[v]:
# サイクルを検出
return 1
else:
pos = dfs(v)
if pos>=0:
return 1
ans = max(ans, vals[v]+1)
done[u] = True
vals[u] = ans
return -1
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos>=0:
print((-1))
break
else:
print((max(vals)+1)) | 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 = defaultdict(list)
for i in range(n):
for j in range(i+1,n):
index[i,j] = ind
index[j,i] = ind
ind += 1
for i in range(n):
for j in range(n-2):
u = index[i,a[i][j]]
v = index[i,a[i][j+1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
s = [u]
while s:
u = s.pop()
if u>=0:
seen[u] = True
s.append(~u)
for v in ns[u]:
if done[v]:
continue
elif not seen[v]:
s.append(v)
else:
# 閉路発見
return True
else:
u = ~u
done[u] = True
# ここに帰りがけ処理を書く
val = 0
for v in ns[u]:
val = max(val, vals[v]+1)
vals[u] = val
return False
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos:
print((-1))
break
else:
print((max(vals)+1)) | 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 import defaultdict
ns = defaultdict(list)
for i in range(n):
for j in range(i+1,n):
index[i][j] = ind
index[j][i] = ind
ind += 1
for i in range(n):
for j in range(n-2):
u = index[i][a[i][j]]
v = index[i][a[i][j+1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
s = [u]
while s:
u = s.pop()
if u>=0:
# 非負の値: 新しい頂点に到達
seen[u] = True
s.append(~u)
for v in ns[u]:
if done[v]:
continue
elif not seen[v]:
s.append(v)
else:
# 閉路発見
return True
else:
u = ~u
done[u] = True
# ここに帰りがけ処理を書く
val = 0
for v in ns[u]:
# uの子はすべて処理が終わっている
val = max(val, vals[v]+1)
vals[u] = val
return False
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos:
print((-1))
break
else:
print((max(vals)+1)) | 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 import defaultdict
ns = [[] for _ in range(N)]
for i in range(n):
for j in range(i+1,n):
index[i][j] = ind
index[j][i] = ind
ind += 1
for i in range(n):
for j in range(n-2):
u = index[i][a[i][j]]
v = index[i][a[i][j+1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
s = [u]
while s:
u = s.pop()
if u>=0:
# 非負の値: 新しい頂点に到達
seen[u] = True
s.append(~u)
for v in ns[u]:
if done[v]:
continue
elif not seen[v]:
s.append(v)
else:
# 閉路発見
return True
else:
u = ~u
done[u] = True
# ここに帰りがけ処理を書く
val = 0
for v in ns[u]:
# uの子はすべて処理が終わっている
val = max(val, vals[v]+1)
vals[u] = val
return False
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos:
print((-1))
break
else:
print((max(vals)+1)) | 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.append(y)
a[x].popleft()
a[y].popleft()
day=0
while True:
day+=1
t=q.copy()
q=deque()
while t:
x=t.popleft()
if len(a[x])==0: continue;
y=a[x][0]
if len(a[y])==0: continue;
if x == a[y][0] and x not in q and y not in q:
q.append(x)
q.append(y)
a[x].popleft()
a[y].popleft()
#print(f'a={a}')
if len(q)==0: break;
for i in range(n):
if len(a[i])!=0:
print((-1))
exit()
print(day)
if __name__=='__main__':
main() | 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)
for i in tmp:
a[i].popleft()
day=0
while True:
day+=1
t=q.copy()
q=deque()
tmp=set()
while t:
x=t.popleft()
if len(a[x])==0: continue;
y=a[x][0]
if x == a[y][0]:
tmp.add(x)
tmp.add(y)
q=deque(tmp)
for i in tmp:
a[i].popleft()
if len(q)==0: break;
for i in range(n):
if len(a[i])!=0:
print((-1))
exit()
print(day)
if __name__=='__main__':
main() | 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)
for i in tmp:
a[i].popleft()
day=0
while True:
day+=1
t=q.copy()
q=deque()
tmp=set()
while t:
x=t.popleft()
if len(a[x])==0: continue;
y=a[x][0]
if x == a[y][0]:
tmp.add(x)
tmp.add(y)
q=deque(tmp)
for i in tmp:
a[i].popleft()
if len(q)==0: break;
for i in range(n):
if len(a[i])!=0:
print((-1))
exit()
print(day)
if __name__=='__main__':
main() | 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].popleft()
day=0
while True:
day+=1
tmp=set()
while q:
p1=q.popleft()
if len(a[p1])==0: continue;
p2=a[p1][0]
if p1==a[p2][0]:
tmp.add(p1)
tmp.add(p2)
q=deque(tmp)
for i in tmp:
a[i].popleft()
tmp=set()
if len(q)==0: break;
for i in a:
if i:
print((-1))
exit()
print(day)
if __name__=='__main__':
main() | 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)
res = []
# 入次数==0
q = deque([i for i in list(G.keys()) if cnt_in[i]==0])
while len(q) > 0:
v = q.popleft()
res.append(v)
for next_v in G[v]:
# 入次数を下げていく
cnt_in[next_v] -= 1
# 入次数が0に残ったところを次に追加
if cnt_in[next_v] == 0:
q.append(next_v)
# トポソ不可能！
if len(G) != len(res):
print((-1))
exit()
return res
for i in range(n):
r = list(map(int, input().split()))
# 初期
mn = min(i, r[0]-1)
mx = max(i, r[0]-1)
prev = mn * n + mx
for e in r[1:]:
e -= 1
mn = min(i,e)
mx = max(i,e)
now = mn*n+mx
edges[prev].append(now)
prev = now
vs = topological_sort(edges)
# トポソの順番で経路長を入れていく
used = [0] * n**2
for V in vs:
if used[V]: continue
used[V] = 1
q = deque([V])
while len(q) > 0:
v = q.popleft()
for u in edges[v]:
if used[u] <= used[v]:
q.append(u)
used[u] = max(used[u], used[v] + 1)
print((max(used))) | 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_in[v] += 1
# print(cnt_in)
res = []
# 入次数==0
q = deque([i for i in list(G.keys()) if cnt_in[i]==0])
while len(q) > 0:
v = q.popleft()
res.append(v)
for next_v in G[v]:
# 入次数を下げていく
cnt_in[next_v] -= 1
# 入次数が0に残ったところを次に追加
if cnt_in[next_v] == 0:
q.append(next_v)
# トポソ不可能！
if len(G) != len(res):
print((-1))
exit()
return res
for i in range(n):
r = list(map(int, input().split()))
# 初期
mn = min(i, r[0]-1)
mx = max(i, r[0]-1)
prev = mn * n + mx
for e in r[1:]:
e -= 1
mn = min(i,e)
mx = max(i,e)
now = mn*n+mx
edges[prev].append(now)
edges_r[now].append(prev)
prev = now
vs = topological_sort(edges)
# トポソの順番で経路長を入れていく
used = [0] * n**2
# for V in vs:
# if used[V]: continue
# used[V] = 1
# q = deque([V])
# while len(q) > 0:
# v = q.popleft()
# for u in edges[v]:
# if used[u] <= used[v]:
# q.append(u)
# used[u] = max(used[u], used[v] + 1)
for V in vs:
if used[V]:continue
used[V] = 1
mx = 1
for b in edges_r[V]:
mx = max(mx, used[b]+1)
used[V] = mx
# print(used)
print((max(used))) | 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][-1] == i:
q.append([min(i,j), max(i,j)])
def get_unique_list(seq):
seen = []
return [x for x in seq if x not in seen and not seen.append(x)]
for i in range(n):
check(i)
day = 0
while (len(q) > 0):
day += 1
prevQ = q
prevQ = get_unique_list(prevQ)
q = []
for i,j in prevQ:
a[i].pop()
a[j].pop()
for i,j in prevQ:
check(i)
check(j)
for i in range(n):
if len(a[i]) > 0:
print((-1))
exit()
print(day) | 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][-1] == i:
q.append([min(i,j), max(i,j)])
for i in range(n):
check(i)
day = 0
while (len(q) > 0):
day += 1
prevQ = list(map(list, set(map(tuple, q))))
q = []
for i,j in prevQ:
a[i].pop()
a[j].pop()
check(i)
check(j)
for i in range(n):
if len(a[i]) > 0:
print((-1))
exit()
print(day) | 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()
for i in range(1,N+1):
if que[i]!=0 and que[que[i]]==i:
que[que[i]] = 0
que[i] = 0
match += 1
tsumi = False
if tsumi:
day = -1
break
day += 1
print(day) | 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():
que[i] = A[i-1].popleft()
for i in range(1,N+1):
if que[i]!=0 and que[que[i]]==i:
que[que[i]] = 0
que[i] = 0
match += 1
tsumi = False
if tsumi:
ans = -1
break
if match==(N-1) * N / 2:
ans = day
break
if time.time()-zuru > 1.5:
ans = N*(N-1)//2
break
print(ans)
| 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) != -n:
flg = False
bls = [False] * n
for ind, target in enumerate(cur):
if bls[ind] or bls[target]:
continue
if cur[target] == ind:
flg = True
inds[ind] += 1
inds[target] += 1
bls[ind] = True
bls[target] = True
cur[ind] = e[ind][inds[ind]] if inds[ind] < n - 1 else -1
cur[target] = e[target][inds[target]] if inds[target] < n - 1 else -1
if not flg:
print((-1))
exit()
cnt += 1
# print(cur, cnt)
print(cnt)
| 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 for x in input().split()])
t.reverse()
a.append(t)
q = set()
for i in range(n):
check(i)
day = 0
while q:
day += 1
prev_q = set()
q, prev_q = prev_q, q
for player, opponent in prev_q:
a[player].pop()
a[opponent].pop()
for player, opponent in prev_q:
check(player)
check(opponent)
if any(a[player] for player in range(n)):
print((-1))
exit()
print(day) | 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 - 1) * num + b
return ans
def main():
num = int(eval(input()))
data = [list(map(int, input().split())) for i in range(num)]
graph_data = [set() for i in range(num * num)]
parent_node = [0 for i in range(num * num)]
for i in range(num):
now_node = i + 1
pre_tuple = (0, 0)
for j in range(num - 1):
next_node = data[i][j]
now_tuple = (min(now_node, next_node), max(now_node, next_node))
if j == 0:
pass
# parent_node[now_tuple] += 0
else:
index = get_ind(pre_tuple, num)
# print(index, pre_tuple)
graph_data[index].add(now_tuple)
index2 = get_ind(now_tuple, num)
parent_node[index2] += 1
pre_tuple = now_tuple
q = deque([])
count_node, ans = 0, 0
for i in range(1, num + 1):
for j in range(i + 1, num + 1):
node = (i, j)
index = get_ind(node, num)
if parent_node[index] == 0:
q.append((node, 1))
count_node += 1
while len(q) > 0:
now_node, length = q.popleft()
index = get_ind(now_node, num)
for next_node in graph_data[index]:
index2 = get_ind(next_node, num)
parent_node[index2] -= 1
if parent_node[index2] == 0:
q.append((next_node, length + 1))
count_node += 1
if count_node < (num * (num - 1)) // 2:
print((-1))
else:
print(length)
if __name__ == '__main__':
main()
| 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 - 1) * num + b
return ans
def main():
num = int(eval(input()))
data = [list(map(int, input().split())) for i in range(num)]
graph_data = [set() for i in range(num * num)]
parent_node = [0 for i in range(num * num)]
for i in range(num):
now_node = i + 1
pre_tuple = (0, 0)
for j in range(num - 1):
next_node = data[i][j]
now_tuple = (min(now_node, next_node), max(now_node, next_node))
if j == 0:
pass
# parent_node[now_tuple] += 0
else:
index = get_ind(pre_tuple, num)
# print(index, pre_tuple)
graph_data[index].add(now_tuple)
index2 = get_ind(now_tuple, num)
parent_node[index2] += 1
pre_tuple = now_tuple
q = deque([])
count_node, ans = 0, 0
for i in range(1, num + 1):
for j in range(i + 1, num + 1):
node = (i, j)
index = get_ind(node, num)
if parent_node[index] == 0:
q.append((node, 1))
count_node += 1
ans = 0
while len(q) > 0:
now_node, length = q.popleft()
ans = max(ans, length)
index = get_ind(now_node, num)
for next_node in graph_data[index]:
index2 = get_ind(next_node, num)
parent_node[index2] -= 1
if parent_node[index2] == 0:
q.append((next_node, length + 1))
count_node += 1
if count_node < (num * (num - 1)) // 2:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main()
| 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 INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N = INT()
A = [deque()]
for i in range(N):
A.append(deque(LIST()))
start = time.time()
cnt = N*(N-1)//2
day = 0
while cnt > 0:
prev = cnt
skip = [False] * (N+1)
for i in range(1, N+1):
if len(A[i]) and not skip[i]:
a = A[i][0]
if len(A[a]) and not skip[a]:
b = A[a][0]
if i == b:
A[i].popleft()
A[a].popleft()
cnt -= 1
skip[i] = skip[a] = True
if prev == cnt:
print((-1))
exit()
day += 1
elapsed_time = time.time() - start
if elapsed_time > 1:
print((N*(N-1)//2))
exit()
print(day)
| # -*- 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 INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
start = time.time()
N = INT()
A = [deque()]
for i in range(N):
A.append(deque(LIST()))
cnt = N*(N-1)//2
day = 0
while cnt > 0:
prev = cnt
skip = [False] * (N+1)
for i in range(1, N+1):
if len(A[i]) and not skip[i]:
a = A[i][0]
if len(A[a]) and not skip[a]:
b = A[a][0]
if i == b:
A[i].popleft()
A[a].popleft()
cnt -= 1
skip[i] = skip[a] = True
if prev == cnt:
print((-1))
exit()
day += 1
elapsed_time = time.time() - start
if elapsed_time > 1:
print((N*(N-1)//2))
exit()
print(day)
| 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[front[i]]:
flag=1
front[front[i]]=n
front[i]=n
if flag==0:
break
cnt=0
for i in range(n):
if front[i]==n:
if len(battle[i])>0:
front[i]=battle[i].pop()
else:
cnt+=1
day+=1
if cnt==n:
print(day)
else:
print((-1))
| 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
checkday=[-1]*n
#pri()
cnt=0
while 1:
flag=0
for i in range(n):
if i<n and front[i]<n and i==front[front[i]] and checkday[i]<day and checkday[front[i]]<day:
flag=1
if len(battle[front[i]])>0:
front[front[i]]=battle[front[i]].pop()
checkday[front[i]]=day
else:
front[front[i]]=n
cnt+=1
if len(battle[i])>0:
front[i]=battle[i].pop()
checkday[i]=day
else:
front[i]=n
cnt+=1
#pri()
if flag==0:
break
day+=1
if cnt==n:
print(day)
else:
print((-1))
| 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(N * (N - 1) // 2):
can_match_today = [False] * (N+1)
fin = True
match = False
nq = []
for i in q:
if can_match_today[i] or not A[i]:
continue
fin = False
l = A[i][-1]
if can_match_today[l]:
continue
r = A[l][-1]
if r == i:
match = True
can_match_today[l] = True
can_match_today[i] = True
A[l].pop()
A[i].pop()
nq.append(l)
nq.append(i)
if fin:
break
if not match:
ok = False
break
cnt += 1
q = nq
if ok:
print(cnt)
else:
print((-1))
| 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 False
b = A[a][-1]
b_op = A[b][-1]
ok = False
if a == b_op:
ok = True
if b < a:
a, b = b, a
q.append((a, b))
return ok
q = []
for i in range(1, N + 1):
check(i, q)
q = list(set(q))
day = 0
while q:
nq = []
for a, b in q:
A[a].pop()
A[b].pop()
check(a, nq)
check(b, nq)
day += 1
q = list(set(nq))
for i in range(1, N + 1):
if len(A[i]) != 0:
print((-1))
exit()
print(day)
exit()
| 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
#print "remaining:%d" % remaining
match = {}
for i, order in enumerate(matrix):
me = i+1
if match.get(me) and order and order[0] in match[me]:
x = matrix[order[0]-1].pop(0)
y = order.pop(0)
remaining -= 1
#print "%d and %d" % (x, y)
#print "matrix: %r" % matrix
elif order:
if match.get(order[0]):
match[order[0]].append(me)
else:
match[order[0]] = [me]
#print 'match: %r' % match
if time.time() - start > 1.6:
print(worst)
return
if remaining == prev:
print(-1)
return
print(day)
N = input()
N = int(N)
matrix = []
for x in range(N):
matrix.append([int(b) for b in input().split()])
solve(matrix) | 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
#print "remaining:%d" % remaining
match = {}
for i, order in enumerate(matrix):
me = i+1
if match.get(me) and order and order[0] in match[me]:
x = matrix[order[0]-1].pop(0)
y = order.pop(0)
remaining -= 1
#print "%d and %d" % (x, y)
#print "matrix: %r" % matrix
elif order:
if match.get(order[0]):
match[order[0]].append(me)
else:
match[order[0]] = [me]
#print 'match: %r' % match
if time.time() - start > 1.5:
print(worst)
return
if remaining == prev:
print(-1)
return
print(day)
N = input()
N = int(N)
matrix = []
for x in range(N):
matrix.append([int(b) for b in input().split()])
solve(matrix) | 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].popleft()
a[x].popleft()
maxd = max(days[x] +1, days[target] +1)
days[x] = maxd
days[target] = maxd
if len(a[x]) > 0:
deepPop(x)
if len(a[target]) > 0:
deepPop(target)
day = 0
days = [0] * n
setn = set(range(n))
while True:
popped = 0
zeros = 0
tmpns = list(setn)
for i in tmpns:
if len(a[i]) == 0:
setn.remove(i)
continue
num = a[i][0] - 1
if num < i:
continue
if a[num][0] - 1 == i:
deepPop(i)
popped += 1
if popped == 0:
if len(setn) == 0:
break
else:
day = -1
break
if day == -1:
print(day)
else:
print((max(days)))
| 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
while True:
popped = 0
plist = set()
zeros = 0
tc = []
for i in current:
a[i[0]].popleft()
a[i[1]].popleft()
if len(a[i[0]]) > 0:
plist.add(i[0])
else:
zc += 1
if len(a[i[1]]) > 0:
plist.add(i[1])
else:
zc += 1
for i in plist:
target = a[i][0] -1
if a[target][0] -1 == i:
if not target in plist or i < target:
tc.append([i, target])
day += 1
if len(tc) == 0:
break
current = tc
if zc != n:
day = -1
print(day)
| 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
c = []
for i in candidate:
if len(A[i]) == 0:
continue
op = A[i][0] - 1
if op in used or i in used:
continue
if A[op][0]-1 == i:
used.add(i)
used.add(op)
match += 1
c.extend([i, op])
bool = True
A[i].popleft()
A[op].popleft()
answer += 1
candidate = c
if match == N * (N-1) // 2:
break
if not bool:
print((-1))
exit()
print(answer)
| 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 = []
for i in candidate:
if len(A[i]) == 0:
continue
op = A[i][0] - 1
if op in used or i in used:
continue
if A[op][0] - 1 == i:
used.add(i)
used.add(op)
match += 1
c.extend([i, op])
bool = True
A[i].popleft()
A[op].popleft()
answer += 1
candidate = c
if match == N * (N-1) // 2:
break
if not bool:
print((-1))
exit()
print(answer)
| 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()
candidate.add(c)
while candidate:
day += 1
used = set()
next = set()
rmv = set()
for a, b in candidate:
if a in used or b in used:
continue
if (b, a) in candidate:
rmv.add((a, b))
rmv.add((b, a))
match += 1
if A[a-1]:
x = A[a-1].popleft()
next.add(x)
if A[b-1]:
y = A[b-1].popleft()
next.add(y)
used.add(a)
used.add(b)
candidate -= rmv
if match == N * (N-1) // 2:
break
candidate |= next
if not used:
print((-1)); exit()
print(day)
# 10
| 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.add(c)
while candidate:
day += 1
used = set()
next = set()
for a, b in candidate:
if a in used or b in used:
continue
if A[b-1][0] == (b, a):
match += 1
A[a-1].popleft()
A[b-1].popleft()
if A[a-1]:
next.add(A[a-1][0])
if A[b-1]:
next.add(A[b-1][0])
used.add(a)
used.add(b)
if match == N * (N-1) // 2:
break
candidate = next
if not used:
print((-1)); exit()
print(day)
# 10
| 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 input().split()]
A = {
i: list(reversed([int(a) - 1 for a in input().split()]))
for i in range(N)
}
Q = set(range(N))
count = 0
while True:
pool = []
for i in Q:
ai = A[i]
if len(ai) == 0:
continue
target = ai[-1]
if target < i:
continue
target_q = A[target]
if target_q[-1] == i:
# print(i,target)
pool.append(i)
pool.append(target)
if len(pool) == 0:
if len(Q) != 0:
print((-1))
return
else:
raise ValueError("test")
for i in pool:
A[i].pop()
if len(A[i]) == 0:
Q.remove(i)
count += 1
if len(Q) == 0:
print(count)
return
if __name__ == '__main__':
main()
| 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 input().split()]
A = {
i: list(reversed([int(a) - 1 for a in input().split()]))
for i in range(N)
}
Q = set(range(N))
count = 0
while True:
pool = []
for i in Q:
ai = A[i]
if len(ai) == 0:
continue
target = ai[-1]
# if target < i:
# continue
target_q = A[target]
if target_q[-1] == i:
# print(i,target)
pool.append(i)
pool.append(target)
if len(pool) == 0:
if len(Q) != 0:
print((-1))
return
else:
raise ValueError("test")
qq = []
for i in set(pool):
A[i].pop()
if len(A[i]) != 0:
qq.append(i)
Q = set(qq)
count += 1
if len(Q) == 0:
print(count)
return
if __name__ == '__main__':
main()
| 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:
continue
p = a[cur[i]]
if A[p][cur[p]] == i:
# print(cnt, p + 1, A[p][cur[p]] + 1, i + 1)
visited[i] = True
visited[a[cur[i]]] = True
pairs += 1
# print(pairs)
if pairs == max_pairs:
break
if pairs > max_pairs:
print((-1))
quit()
update = False
for i, v in enumerate(visited):
if v:
cur[i] += 1
update = True
if not update:
print((-1))
quit()
cnt += 1
print(cnt) | 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):
if cur[i] >= N - 1:
continue
p = a[cur[i]]
if A[p][cur[p]] == i:
# print(cnt, p + 1, A[p][cur[p]] + 1, i + 1)
visited[i] = True
visited[a[cur[i]]] = True
pairs += 1
# print(pairs)
if pairs == max_pairs:
break
if pairs > max_pairs:
print((-1))
quit()
update = False
for i, v in enumerate(visited):
if v:
cur[i] += 1
update = True
if not update:
print((-1))
quit()
if time.time() - start > 1.8:
print((N * (N - 1) // 2))
exit()
cnt += 1
print(cnt) | 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 = True
for player in range(n):
if not to_battle_with[player]:
continue
next_opponent = to_battle_with[player][0]
if player in battled_today or next_opponent in battled_today:
continue
if not to_battle_with[next_opponent]:
continue
if to_battle_with[next_opponent][0] == player:
battled_today.add(next_opponent)
battled_today.add(player)
to_battle_with[player].popleft()
to_battle_with[next_opponent].popleft()
remained_battles -= 1
no_battle_today = False
if no_battle_today:
print((-1))
break
day_count += 1
if not no_battle_today:
print(day_count)
| 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 = to_battle_with[player][0]
if not to_battle_with[next_opponent]:
return
if to_battle_with[next_opponent][0] == player:
if player > next_opponent:
player, next_opponent = next_opponent, player
battle_set.add((player, next_opponent))
battles_today = set()
for player in range(n):
update_battle(player, battles_today, to_battle_with)
day_count = 0
battle_count = 0
num_all_battles = (n * (n - 1)) // 2
while battles_today:
battles_tomorrow = set()
for p1, p2 in battles_today:
battle_count += 1
to_battle_with[p1].popleft()
to_battle_with[p2].popleft()
for p in [p1, p2]:
update_battle(p, battles_tomorrow, to_battle_with)
battles_today = battles_tomorrow
day_count += 1
if battle_count == num_all_battles:
print(day_count)
else:
print((-1))
| 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:
break
D=dict()
CNT=0
for j in range(1,N+1):
if Z[j]==N-1 or j in D:
continue
elif L[L[j][Z[j]]][Z[L[j][Z[j]]]]==j and L[j][Z[j]] not in D:
D[j]=1
D[L[j][Z[j]]]=1
X=L[j][Z[j]]
Z[j]+=1
Z[X]+=1
CNT+=1
if CNT==0:
print((-1))
exit()
cnt+=CNT
day+=1
#print(L)
#print(cnt)
print(day)
if __name__ == '__main__':
main() | 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 A[j][B[j]] not in D:
D.append(j)
D.append(A[j][B[j]])
B[A[j][B[j]]]+=1
B[j]+=1
F=1
cnt+=1
#print("A",i,B,D)
#print(A[j][B[j]],B,D)
if F==0:
break
D.sort()
C=D
if cnt==N*(N-1)//2:
print(i)
else:
print((-1)) | 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()))
def I():
return int(eval(input()))
def LI():
return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7
n=I()
t=[]
d=[]
nx=[0]*n
for i in range(n):
a=[i-1 for i in LI()[::-1]]
nx[i]=a.pop()
t.append(a)
d.append([-1]*(n))
flg=True
k=0
ans=0
MacthNum=0
yet=set(range(n))
n_yet=set(range(n))
while flg and MacthNum<n*(n-1)//2:
ans+=1
IsMatch=False
done=set()
#print('Day',ans,IsMatch,nx)
for i in yet:
if (i in done) or (nx[i] in done) or nx[i]==n:
continue
c1=i
c2=nx[i]
if c1==nx[c2]:
IsMatch=True
MacthNum+=1
#print('Day',ans,'Match',c1,'vs',c2)
if t[c1]:
n_i=t[c1].pop()
else:
n_i=n
n_yet.remove(c1)
if t[c2]:
n_n_i=t[c2].pop()
else:
n_n_i=n
n_yet.remove(c2)
#print(i,nx[i],nx)
nx[nx[i]],nx[i]=n_n_i,n_i
done.add(c1)
done.add(c2)
#print('i,t,d',i,t,'done=',done,'nx=',nx,n_i,n_n_i)
yet=[i for i in n_yet]
ans=ans if IsMatch else -1
flg=True if IsMatch else False
print(ans)
| 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 list(map(int,input().split()))
def I():
return int(eval(input()))
def LI():
return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7
n=I()
t=[]
d=[]
nx=[0]*n
for i in range(n):
a=[i-1 for i in LI()[::-1]]
nx[i]=a.pop()
t.append(a)
d.append([-1]*(n))
flg=True
ans=0
MacthNum=0
yet=set(range(n))
n_yet=set(range(n))
while flg and MacthNum<n*(n-1)//2:
elp=time.time()-ts
if elp>1.8:
ans=n*(n-1)//2
break
ans+=1
IsMatch=False
done=set()
for i in yet:
if (i in done) or (nx[i] in done) or nx[i]==n:
continue
c1=i
c2=nx[i]
if c1==nx[c2]:
IsMatch=True
MacthNum+=1
if t[c1]:
n_i=t[c1].pop()
else:
n_i=n
n_yet.remove(c1)
if t[c2]:
n_n_i=t[c2].pop()
else:
n_n_i=n
n_yet.remove(c2)
nx[nx[i]],nx[i]=n_n_i,n_i
done.add(c1)
done.add(c2)
yet=[i for i in n_yet]
ans=ans if IsMatch else -1
flg=True if IsMatch else False
print(ans)
| 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 list(map(int,input().split()))
def I():
return int(eval(input()))
def LI():
return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7
n=I()
t=[]
d=[]
nx=[0]*n
for i in range(n):
a=[i-1 for i in LI()[::-1]]
nx[i]=a.pop()
t.append(a)
d.append([-1]*(n))
flg=True
ans=0
MacthNum=0
yet=set(range(n))
n_yet=set(range(n))
while flg and MacthNum<n*(n-1)//2:
elp=time.time()-ts
if elp>1.8:
ans=n*(n-1)//2
break
ans+=1
IsMatch=False
done=set()
for i in yet:
if (i in done) or (nx[i] in done) or nx[i]==n:
continue
c1=i
c2=nx[i]
if c1==nx[c2]:
IsMatch=True
MacthNum+=1
if t[c1]:
n_i=t[c1].pop()
else:
n_i=n
n_yet.remove(c1)
if t[c2]:
n_n_i=t[c2].pop()
else:
n_n_i=n
n_yet.remove(c2)
nx[nx[i]],nx[i]=n_n_i,n_i
done.add(c1)
done.add(c2)
yet=[i for i in n_yet]
ans=ans if IsMatch else -1
flg=True if IsMatch else False
print(ans)
| 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 list(map(int,input().split()))
def I():
return int(eval(input()))
def LI():
return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7
n=I()
t=[]
d=[]
nx=[0]*n
for i in range(n):
a=[i-1 for i in LI()[::-1]]
nx[i]=a.pop()
t.append(a)
d.append([-1]*(n))
flg=True
ans=0
MacthNum=0
yet=set(range(n))
n_yet=set(range(n))
while flg and MacthNum<n*(n-1)//2:
elp=time.time()-ts
if elp>1.8:
ans=0#n*(n-1)//2
break
ans+=1
IsMatch=False
done=set()
n_yet=[]
#print('Day',ans,IsMatch,nx)
for i in yet:
if (i in done) or (nx[i] in done) or nx[i]==n:
continue
c1=i
c2=nx[i]
if c1==nx[c2]:
IsMatch=True
MacthNum+=1
#print('Day',ans,'Match',c1,'vs',c2)
if t[c1]:
n_i=t[c1].pop()
n_yet.append(c1)
else:
n_i=n
if t[c2]:
n_n_i=t[c2].pop()
n_yet.append(c2)
else:
n_n_i=n
#print(i,nx[i],nx)
nx[nx[i]],nx[i]=n_n_i,n_i
done.add(c1)
done.add(c2)
#print('i,t,d',i,t,'done=',done,'nx=',nx,n_i,n_n_i)
yet=[i for i in n_yet]
ans=ans if IsMatch else -1
flg=True if IsMatch else False
print(ans)
| 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(node)]
D = [[0]*N for _ in range(N)]
cur = 0
for i in range(N):
for j in range(i+1,N):
D[i][j] = cur
D[j][i] = cur
cur += 1
#A = [LI() for _ in range(N)]
for i in range(N):
a = LI()
for j in range(N-2):
fr = D[i][a[j]-1]
to = D[i][a[j+1]-1]
#print(fr,to)
V[fr].append(to)
visited = [False] * node
calculated = [False] * node
dp = [1] * node
# https://mhiro216.hatenablog.com/entry/2019/09/08/142414
def dfs(v):
if visited[v]:
if not calculated[v]:
return -1 # 計算が終わっていない頂点を2度訪れるのはループがあるということ
return dp[v]
visited[v] = True
for u in V[v]: # 全ての辺をなめる
res = dfs(u)
if res == -1: return -1 # ループがあれば-1を返す
elif res+1>dp[v]:
dp[v] = res + 1
calculated[v] = True
return dp[v]
ans = 0
for i in range(node):
res = dfs(i)
ans = max(ans,res)
if res == -1:
print('-1') # ループがあれば-1を返す（問題文の指示）
return
print(ans)
return
def examE2():
N = I()
node = N*(N-1)//2
V = [[]for _ in range(node)]
D = [[0]*N for _ in range(N)]
cur = 0
for i in range(N):
for j in range(i+1,N):
D[i][j] = cur
D[j][i] = cur
cur += 1
#A = [LI() for _ in range(N)]
for i in range(N):
a = LI()
for j in range(N-2):
fr = D[i][a[j]-1]
to = D[i][a[j+1]-1]
#print(fr,to)
V[fr].append(to)
#print(V)
# 閉路検出
def hasCycle(n,V):
visited = [False]*n
used = [False]*n
def dfs(s, p=-1):
if used[s]:
return False
now_use.add(s)
for v in V[s]:
if visited[v]:
return True
if v in now_use:
continue
visited[v] = True
res = dfs(v, s)
visited[v] = False
if res:
return True
return False
has_cycle = False
for i in range(node):
now_use = set()
if used[i]:
continue
visited[i] = True
if dfs(i):
has_cycle = True
break
for u in now_use:
used[u] = True
visited[i] = False
return has_cycle
if hasCycle(node,V):
print((-1))
return
def getMaxLength(n,V):
visited = [False]*n
def dfs(s,p=-1):
res = 0
for v in V[s]:
if v==p:
continue
visited[v] = True
child = dfs(v, s)
if res<child:
res = child
visited[v] = False
return res+1
max_length = 0
for i in range(n):
length = dfs(i)
if max_length<length:
max_length = length
return max_length
ans = getMaxLength(node,V)
print(ans)
return
def examF():
# 合ってんのこれ?????
def calc_L(a,b):
return (a**2 + b**2)**(1/2)
N = I()
X = [[]for _ in range(N)]
for i in range(N):
x,y = LI()
d = math.degrees(math.atan2(y,x))
if d<0:
d += 360
X[i] = [d,x,y]
X.sort()
#print(X)
ans = 0
for i in range(N):
cur_X = 0; cur_Y = 0
for d2,x2,y2 in (X[i:] + X[:i]):
if calc_L(cur_X+x2,cur_Y+y2)<calc_L(cur_X,cur_Y):
continue
cur_X += x2
cur_Y += y2
now = calc_L(cur_X,cur_Y)
if now>ans:
ans = now
print(ans)
return
import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]
sys.setrecursionlimit(10**6)
if __name__ == '__main__':
examE2()
"""
""" | 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(node)]
D = [[0]*N for _ in range(N)]
cur = 0
for i in range(N):
for j in range(i+1,N):
D[i][j] = cur
D[j][i] = cur
cur += 1
#A = [LI() for _ in range(N)]
for i in range(N):
a = LI()
for j in range(N-2):
fr = D[i][a[j]-1]
to = D[i][a[j+1]-1]
#print(fr,to)
V[fr].append(to)
visited = [False] * node
calculated = [False] * node
dp = [1] * node
# https://mhiro216.hatenablog.com/entry/2019/09/08/142414
def dfs(v):
if visited[v]:
if not calculated[v]:
return -1 # 計算が終わっていない頂点を2度訪れるのはループがあるということ
return dp[v]
visited[v] = True
for u in V[v]: # 全ての辺をなめる
res = dfs(u)
if res == -1: return -1 # ループがあれば-1を返す
elif res+1>dp[v]:
dp[v] = res + 1
calculated[v] = True
return dp[v]
ans = 0
for i in range(node):
res = dfs(i)
ans = max(ans,res)
if res == -1:
print('-1') # ループがあれば-1を返す（問題文の指示）
return
print(ans)
return
def examE2():
N = I()
node = N*(N-1)//2
V = [[]for _ in range(node)]
D = [[0]*N for _ in range(N)]
cur = 0
for i in range(N):
for j in range(i+1,N):
D[i][j] = cur
D[j][i] = cur
cur += 1
#A = [LI() for _ in range(N)]
for i in range(N):
a = LI()
for j in range(N-2):
fr = D[i][a[j]-1]
to = D[i][a[j+1]-1]
#print(fr,to)
V[fr].append(to)
#print(V)
# 閉路検出
def hasCycle(n,V):
visited = [False]*n
used = [False]*n
def dfs(s, p=-1):
if used[s]:
return False
now_use.add(s)
for v in V[s]:
if visited[v]:
return True
if v in now_use:
continue
visited[v] = True
res = dfs(v, s)
visited[v] = False
if res:
return True
return False
has_cycle = False
for i in range(node):
now_use = set()
if used[i]:
continue
visited[i] = True
if dfs(i):
has_cycle = True
break
for u in now_use:
used[u] = True
visited[i] = False
return has_cycle
if hasCycle(node,V):
print((-1))
return
def getMaxLength(n,V):
visited = [False]*n
max_lens = [0] * n
def dfs(s,p=-1):
res = 0
for v in V[s]:
if max_lens[v]>0:
child = max_lens[v]
else:
visited[v] = True
child = dfs(v, s)
visited[v] = False
if res<child:
res = child
max_lens[s] = res + 1
return res+1
for i in range(n):
if max_lens[i]>0:
continue
length = dfs(i)
return max(max_lens)
ans = getMaxLength(node,V)
print(ans)
return
def examF():
# 合ってんのこれ?????
def calc_L(a,b):
return (a**2 + b**2)**(1/2)
N = I()
X = [[]for _ in range(N)]
for i in range(N):
x,y = LI()
d = math.degrees(math.atan2(y,x))
if d<0:
d += 360
X[i] = [d,x,y]
X.sort()
#print(X)
ans = 0
for i in range(N):
cur_X = 0; cur_Y = 0
for d2,x2,y2 in (X[i:] + X[:i]):
if calc_L(cur_X+x2,cur_Y+y2)<calc_L(cur_X,cur_Y):
continue
cur_X += x2
cur_Y += y2
now = calc_L(cur_X,cur_Y)
if now>ans:
ans = now
print(ans)
return
import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]
sys.setrecursionlimit(10**6)
if __name__ == '__main__':
examE2()
"""
""" | 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] or done[l])) and len(aaa[l]) > 0 and aaa[l][-1] == j+1:
aa.pop()
aaa[l].pop()
done[j], done[l] = True, True
played = True
if empty:
print(i)
break
elif not played:
print((-1))
break | 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 not in ncs and l not in ncs and len(aaa[l]) > 0 and aaa[l][-1] == j+1:
aa.pop()
aaa[l].pop()
played = True
ncs.add(j)
ncs.add(l)
cs = ncs
if empty:
print(i)
break
elif not played:
print((-1))
break | 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 j in range(n-1):
a[i][j] -= 1
v = 0
Id = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if i < j:
Id[i][j] = v
v += 1
def toId(i, j):
if i > j:
i, j = j, i
return Id[i][j]
to = [[] for i in range(maxv)]
for i in range(n):
for j in range(n - 1):
a[i][j] = toId(i, a[i][j])
for j in range(n - 2):
to[a[i][j+1]].append(a[i][j])
visited = [False for i in range(maxv)]
calculated = [False for i in range(maxv)]
dp = [0 for i in range(maxv)]
def dfs(v):
if visited[v]:
if not calculated[v]:
return -1
return dp[v]
visited[v] = True
dp[v] = 1
for u in to[v]:
ret = dfs(u)
if ret == -1:
return -1
dp[v] = max(dp[v], ret + 1)
calculated[v] = True
return dp[v]
ans = 0
for i in range(v):
ret = dfs(i)
if ret == -1: # detected cycle
print((-1))
exit()
ans = max(ans, ret)
print(ans)
if __name__ == '__main__':
main()
| 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 j in range(n-1):
a[i][j] -= 1
v = 0
Id = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if i < j:
Id[i][j] = v
v += 1
def toId(i, j):
if i > j:
i, j = j, i
return Id[i][j]
to = [[] for i in range(maxv)]
for i in range(n):
for j in range(n - 1):
a[i][j] = toId(i, a[i][j])
for j in range(n - 2):
to[a[i][j+1]].append(a[i][j])
visited = [False for i in range(maxv)]
calculated = [False for i in range(maxv)]
dp = [-1 for i in range(maxv)]
def dfs(v):
if dp[v] != -1:
if not calculated[v]:
return -1
return dp[v]
visited[v] = True
dp[v] = 1
for u in to[v]:
ret = dfs(u)
if ret == -1:
return -1
dp[v] = max(dp[v], ret + 1)
calculated[v] = True
return dp[v]
ans = 0
for i in range(v):
ret = dfs(i)
if ret == -1: # detected cycle
print((-1))
exit()
ans = max(ans, ret)
print(ans)
if __name__ == '__main__':
main()
| 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 j in range(n-1):
a[i][j] -= 1
# 試合を頂点とする(ex 1-2,2-4 : i < j)
v = 0 # 頂点数
# 頂点にIDをふる
Id = [[-1 for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if i < j: # 3-1はダメ
Id[i][j] = v
Id[j][i] = v
v += 1
e = [[] for i in range(maxv)]
for i in range(n):
for j in range(n - 1):
# a[i][j]にIDを代入する Id[1][3]=1 => a[1][3] = a[3][1] = 1
# x = i
# y = a[i][j]
# if x > y:
# x, y = y, x
# a[i][j] = Id[x][y] # toId(i, a[i][j])
a[i][j] = Id[i][a[i][j]]
for j in range(n - 2):
e[a[i][j + 1]].append(a[i][j])
calculated = [False for i in range(maxv)]
dp = [-1 for i in range(maxv)]
def dfs(v):
if dp[v] != -1: # サイクル検知
if not calculated[v]:
return -1
return dp[v]
dp[v] = 1
for u in e[v]:
ret = dfs(u)
if ret == -1:
return -1
dp[v] = max(dp[v], ret + 1)
calculated[v] = True
return dp[v]
ans = 0
for i in range(v):
ret = dfs(i)
if ret == -1: # detected cycle
print((-1))
exit()
ans = max(ans, ret)
print(ans)
if __name__ == '__main__':
main()
| 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 j in range(n-1):
a[i][j] -= 1
# 試合を頂点とする(ex 1-2,2-4 : i < j)
v = 0 # 頂点数
# 頂点にIDをふる
Id = [[-1 for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if i < j:
Id[i][j] = v
Id[j][i] = v
v += 1
# 頂点間の辺を貼る
e = [[] for i in range(maxv)]
for i in range(n):
# a[i][j]にIDを代入する Id[1][3]=1 => a[1][3] = a[3][1] = 1
for j in range(n - 1):
a[i][j] = Id[i][a[i][j]]
# 逆向きに辺をはる
for j in range(n - 2):
e[a[i][j]].append(a[i][j+1])
calculated = [False for i in range(maxv)]
dp = [-1 for i in range(maxv)]
def dfs(v):
if dp[v] != -1: # サイクル検知
if not calculated[v]:
return -1
return dp[v]
dp[v] = 1
for u in e[v]:
ret = dfs(u)
if ret == -1:
return -1
dp[v] = max(dp[v], ret + 1)
calculated[v] = True
return dp[v]
ans = 0
for i in range(v):
ret = dfs(i)
if ret == -1: # サイクル検知
print((-1))
exit()
ans = max(ans, ret)
print(ans)
if __name__ == '__main__':
main()
| 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.time()
n = inp()
a = []
for i in range(n):
b = inpl()
a.append(deque(b))
zan = n*(n-1)//2
res = 0
while True:
res += 1
now = zan
s = set()
for i in range(n):
if i in s or a[i] == deque([]): continue
end = True
chk = a[i][0] - 1
if not chk in s and a[chk][0] == i+1:
zan -= 1
if not zan:
print(res); quit()
a[i].popleft(); a[chk].popleft()
s.add(i); s.add(chk)
# print(res,i,chk,a)
if now == zan or time.time() - st > 1700:
print((-1))
quit()
| 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.time()
n = inp()
a = []
for i in range(n):
b = inpl()
a.append(deque(b))
zan = n*(n-1)//2
res = 0
while True:
res += 1
now = zan
s = set()
for i in range(n):
if i in s or a[i] == deque([]): continue
end = True
chk = a[i][0] - 1
if not chk in s and a[chk][0] == i+1:
zan -= 1
if not zan:
print(res); quit()
a[i].popleft(); a[chk].popleft()
s.add(i); s.add(chk)
# print(res,i,chk,a)
nnn = time.time()
if now == zan:
print((-1))
quit()
if nnn - st > 1.7:
print((n*(n-1)//2))
quit()
| 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_list[p] < n - 1:
q = a_list[p][ind_list[p]] - 1
k = str(min(p, q)) + "_" + str(max(p, q))
if k in list(stack.keys()):
ind_list[p] += 1
ind_list[q] += 1
# print(days, p, q)
new_queue.append(p)
new_queue.append(q)
match_count += 1
else:
stack[k] = 1
queue = new_queue
if match_count == n * (n - 1) // 2:
return days - 1
else:
return -1
def test():
N = 1000
A_list = []
for i in range(N):
A_list.append(list(range(1, i + 1)) + list(range(i + 2, N + 1)))
print((solve_e(N, A_list)))
def main():
N = int(eval(input()))
A_list = []
for _ in range(N):
A_list.append(list(map(int, input().split())))
print((solve_e(N, A_list)))
if __name__ == "__main__":
main()
| 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:
q = a_list[p][ind_list[p]] - 1
k = str(min(p, q)) + "_" + str(max(p, q))
if k in list(stack.keys()):
ind_list[p] += 1
ind_list[q] += 1
# print(days, p, q)
new_queue.append(p)
new_queue.append(q)
match_count += 1
else:
stack[k] = 1
queue = new_queue
if match_count == n * (n - 1) // 2:
return days - 1
else:
return -1
def test():
N = 1000
A_list = []
for i in range(N):
A_list.append(list(range(1, i + 1)) + list(range(i + 2, N + 1)))
print((solve_e(N, A_list)))
def main():
N = int(eval(input()))
A_list = []
for _ in range(N):
A_list.append(list(map(int, input().split())))
print((solve_e(N, A_list)))
if __name__ == "__main__":
main()
| 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 skip and orders[orders[i][0] - 1][0] - 1 == i:
a = i
b = orders[i][0] - 1
impossible = False
skip.add(a)
skip.add(b)
orders[orders[i][0] - 1].popleft()
orders[i].popleft()
if len(orders[i]) == 0:
finished.add(a)
if len(orders[b]) == 0:
finished.add(b)
cnt += 1
if len(finished) == n:
print(cnt)
break
if impossible:
print((-1))
break | 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]] == a:
days[a], days[b] = [max(days[a], days[b]) + 1 for _ in range(2)]
nxt[a] = orders[a].popleft()
nxt[b] = orders[b].popleft()
q.append(a)
q.append(b)
if sum(nxt) == -n:
print((max(days)))
else:
print((-1))
| 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[i]==n-1 or check[i]==False:
continue
else:
vs=a[i][match[i]]-1
if check[i] and check[vs]:
if a[i][match[i]]-1==vs and a[vs][match[vs]]-1==i:
match[i]+=1
match[vs]+=1
match[n]+=2
check[i]=False
check[vs]=False
check[n]=False
jyunban_n.append(i)
jyunban_n.append(vs)
if i==jyunban[-1]:
if check[n]:
print((-1))
sys.exit()
jyunban=copy.copy(jyunban_n)
print(day)
| 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 = [-1]*N
updatelist = [i for i in range(N)]
total = N*(N-1)//2
cnt = 0
days = 0
ul = []
while updatelist:
ul = []
for i in updatelist:
#print(a)
#print(i+1)
if len(a[i]) > 0 and used[i] != days:
numIND = a[i][-1] -1
#print(numIND+1)
if a[numIND][-1] == i+1 and used[numIND] != days:
a[i].pop(-1)
a[numIND].pop(-1)
used[i] = days
used[numIND] = days
ul.append(i)
ul.append(numIND)
cnt += 1
else:
updatelist = ul[:]
if len(ul) != 0:
days += 1
#print(a)
#print(cnt)
if cnt == total:
print(days)
else:
print((-1)) | 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[i][match[i]]-1
if check[vs]!=day and check[i]!=day and a[vs][match[vs]]-1==i and a[i][match[i]]-1==vs:
match[i]+=1
match[vs]+=1
match[n]+=2
check[i]=day
check[vs]=day
check[n]=day
nq.append(i)
nq.append(vs)
if i==q[-1]:
if check[n]!=day:
print((-1))
sys.exit()
if match[n]==maxmatch:
break
q=copy.copy(nq)
nq=[]
print(day)
| 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]]-1
if check[vs]!=day and check[i]!=day and a[vs][match[vs]]-1==i and a[i][match[i]]-1==vs:
match[i]+=1
match[vs]+=1
match[n]+=2
check[i]=day
check[vs]=day
check[n]=day
nq.append(i)
nq.append(vs)
if i==q[-1]:
if check[n]!=day:
print((-1))
sys.exit()
if match[n]==maxmatch:
break
q=nq[:]
nq=[]
print(day)
| 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 range(N):
can_match(i, A, next_set)
day = 0
battle = 0
while next_set:
day += 1
current_set, next_set = next_set.copy(), set()
for match in current_set:
battle += 1
del A[match[0]][-1]
can_match(match[0], A, next_set)
del A[match[1]][-1]
can_match(match[1], A, next_set)
if battle == N*(N-1)//2:
print(day)
else:
print((-1)) | 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 range(N):
can_match(i, A, next_set)
day = 0
battle = 0
while next_set:
day += 1
current_set, next_set = next_set, set()
for match in current_set:
battle += 1
del A[match[0]][-1]
can_match(match[0], A, next_set)
del A[match[1]][-1]
can_match(match[1], A, next_set)
if battle == N*(N-1)//2:
print(day)
else:
print((-1)) | 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 range(N):
can_match(i, A, next_set)
day = 0
battle = 0
while next_set:
day += 1
current_set, next_set = next_set, set()
for match in current_set:
battle += 1
del A[match[0]][-1]
can_match(match[0], A, next_set)
del A[match[1]][-1]
can_match(match[1], A, next_set)
if battle == N*(N-1)//2:
print(day)
else:
print((-1)) | 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))
next_set = set()
for i in range(N):
can_match(i, A, next_set)
day = 0
battle = 0
while next_set:
day += 1
current_set, next_set = next_set, set()
for match in current_set:
battle += 1
del A[match[0]][-1]
can_match(match[0], A, next_set)
del A[match[1]][-1]
can_match(match[1], A, next_set)
if battle == N*(N-1)//2:
print(day)
else:
print((-1)) | 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 = (now+1)%N
a = stacks[now][-1]
if stacks[a][-1] == now:
lis[now] = max(lis[now],lis[a])+1
lis[a] = lis[now]
stacks[a].pop(-1)
stacks[now].pop(-1)
cnt += 1
flag = 0
else:
now = a
flag += 1
if flag==2*N:
return -1
ans = max(lis)
return ans
print((solve())) | 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
if stacks[a][-1] == now:
lis[now] = max(lis[now],lis[a])+1
lis[a] = lis[now]
stacks[a].pop(-1)
stacks[now].pop(-1)
cnt += 1
flag = 0
else:
now = a
flag += 1
if flag==N:
return -1
ans = max(lis)
return ans
print((solve())) | 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):
if a[i]:
flag = False
if a[a[i][0] - 1][0] == i + 1:
check.append(i)
if flag:
print(cnt)
break
if check:
for v in check:
a[v].pop(0)
else:
print((-1))
break
| 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:
x = q.pop()
if a[a[x][0] - 1][0] == x + 1:
qq.add(x)
qq.add(a[x][0] - 1)
if qq:
for x in qq:
a[x].pop(0)
if a[x]:
q.append(x)
else:
print((-1))
break
if not q:
print(cnt)
break
| 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()
while q:
x = q.pop()
if a[a[x][0]][0] == x:
qq.add(x)
qq.add(a[x][0])
if qq:
for x in qq:
a[x].pop(0)
if a[x]:
q.append(x)
else:
print((-1))
exit()
print(cnt)
| 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 x in q:
if a[a[x][0]][0] == x:
qq.add(x)
qq.add(a[x][0])
if qq:
q = []
for x in qq:
a[x].pop(0)
if a[x]:
q.append(x)
else:
print((-1))
break
if not q:
print(cnt)
break
| 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]:
continue
c = a[j][0]
if c == "-":
continue
if j + 1 == a[c-1][0]:
a[j][0] = "-"
a[c-1][0] = "-"
ne.add(j)
ne.add(c-1)
for j in list(ne):
if a[j]:
if a[j][0] == "-":
a[j] = a[j][1:]
flag = False
if not a[j]:
ne.remove(j)
if flag:
print((-1))
break
else:
r = ne
| 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]:
continue
c = a[j][0]
if c == "-":
continue
if j + 1 == a[c-1][0]:
a[j][0] = "-"
a[c-1][0] = "-"
ne.add(j)
ne.add(c-1)
for j in list(ne):
if a[j]:
if a[j][0] == "-":
a[j].pop(0)
flag = False
if not a[j]:
ne.remove(j)
if flag:
print((-1))
break
else:
r = ne
| 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][0]==i+1:
if taisenzumi[i]:continue
if taisenzumi[aite-1]:continue
data[i].popleft()
data[aite-1].popleft()
taisenzumi[aite-1]=1
taisenzumi[i]=1
last-=2
flag=0
else:continue
if flag:
break
else:
print(count)
exit()
print((-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(not M[i]): # 既に試合を終えている
return False
j=M[i][-1]
if(not M[j]): # これは起こり得ない
return False
return i==M[j][-1]
# 初日に対戦できる人をピックアップ
# 重複が起こるが、後で unique を取る
Q=[]
for i in range(n):
if(check(i)):
j=M[i][-1]
if(i>j): i,j=j,i # i<j
Q.append((i,j))
# 処理を行なっていく
day=0
nQ=[] # 次の試合相手
while(Q):
# Q には重複があるので unique
Q=list(set(Q))
# 先に全ての試合を終わらせる必要がある
for i,j in Q:
M[i].pop(); M[j].pop()
# 試合を終えた人は次の試合を行える可能性がある
for i,j in Q:
if(check(i)):
k=M[i][-1]
nQ.append((min(i,k),max(i,k)))
if(check(j)):
k=M[j][-1]
nQ.append((min(j,k),max(j,k)))
Q,nQ=nQ,[]
day+=1
print((day if(all(M[i]==[] for i in range(n))) else "-1"))
resolve()
| 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
for i in range(1, N+1):
A = list(map(int, input().split()))
for j in range(N-2):
a, b = i, A[j]
if a > b: a, b = b, a
c, d = i, A[j+1]
if c > d: c, d = d, c
n = nums[(c, d)]
graph[nums[(a, b)]].append(n)
input_num[n] += 1
q = deque([(i, 1) for i in range(count) if not input_num[i]])
size = len(q)
dist = [0] * count
while q:
v, c = q.popleft()
c += 1
for u in graph[v]:
input_num[u] -= 1
dist[u] = max(dist[u], c)
if not input_num[u]:
q.append((u, c))
size += 1
if size != count: ans = -1
else: ans = max(dist)
print(ans)
if __name__ == '__main__':
main()
| 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)//2)
for i in range(1, N+1):
for idx, j in enumerate(list(map(int, input().split()))):
if i < j: k = Id[(i, j)]
else: k = Id[(j, i)]
if idx:
G[par].append(k)
size[k] += 1
par = k
g = [idx for idx, s in enumerate(size) if s == 0]
ans = 0
while g:
ans += 1
n_g = []
for v in g:
length = len(G[v])
if not length: continue
size[G[v][0]] -= 1
if not size[G[v][0]]: n_g.append(G[v][0])
if length == 2:
size[G[v][1]] -= 1
if not size[G[v][1]]: n_g.append(G[v][1])
g = n_g
for s in size:
if s != 0:
print((-1))
sys.exit()
print(ans)
if __name__ == '__main__':
main() | 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
v,w=i,k
if w<v:v,w=w,v
es+=(d[x*n+y],d[v*n+w]),
s=len(d)
outs=[[]for _ in range(s)]
ins=[0]*s
f=set(range(s))
for i,j in es:
outs[i]+=j,
f-={j}
ins[j]+=1
q=deque(f)
r=[]
data=[0]*s
m=0
while q:
i=q.popleft()
r+=i,
t=data[i]+1
if t>m:m=t
for j in outs[i]:
ins[j]-=1
if ins[j]<1:q+=j,
if t>data[j]:data[j]=t
print((-(len(r)<s)or m))
main() | 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
v,w=i,k
if w<v:v,w=w,v
es+=(d[x*n+y],d[v*n+w]),
s=len(d)
outs=[[]for _ in range(s)]
ins=[0]*s
f=set(range(s))
for i,j in es:
outs[i]+=j,
f-={j}
ins[j]+=1
q=deque(f)
l=0
data=[0]*s
m=0
while q:
i=q.popleft()
l+=1
t=data[i]+1
if t>m:m=t
for j in outs[i]:
ins[j]-=1
if ins[j]<1:q+=j,
if t>data[j]:data[j]=t
print((-(l<s)or m))
main() | 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 = set([])
dct = defaultdict(lambda:set([]))
for i in Pn:
if len(An[i]) == 0:
continue
j = An[i][0]
if i in dct[j]:
An[i].popleft()
if len(An[i]) > 0:
Qn = Qn | set([i,An[i][0]])
An[j].popleft()
if len(An[j]) > 0:
Qn = Qn | set([j,An[j][0]])
else:
dct[i].add(j)
Pn = Qn
count += 1
for i in range(N):
if len(An[i]) > 0:
return -1
return count
print((solve())) | #!/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)])
count = 0
while len(Pn) > 0:
Qn = set([])
dct = defaultdict(lambda:set([]))
for i in Pn:
j = An[i][0]
if i in dct[j]:
An[i].popleft()
if len(An[i]) > 0:
Qn.add(i)
Qn.add(An[i][0])
An[j].popleft()
if len(An[j]) > 0:
Qn.add(j)
Qn.add(An[j][0])
else:
dct[i].add(j)
Pn = Qn
count += 1
for i in range(N):
if len(An[i]) > 0:
return -1
return count
print((solve())) | 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 = collections.deque()
for i in range(n):
ql.append([0, i])
for i in range(10 ** 10):
fq = [True] * n
while True:
if len(ql) != 0:
d, ps = ql.popleft()
if d == i:
if fq[ps]:
nw = a[ps][ls[ps]]
if fq[nw]:
rw = a[nw][ls[nw]]
if ps == rw:
ls[ps] += 1
ls[nw] += 1
if ls[ps] < n - 1:
ql.append([d+1, ps])
if ls[nw] < n - 1:
ql.append([d+1, nw])
fq[nw] = False
fq[ps] = False
else:
ql.appendleft([d, ps])
break
else:
if sum(ls) == n * (n - 1):
print((i + 1))
else:
print((-1))
exit()
if __name__ == '__main__':
solve()
| 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
q = collections.deque([[0, i] for i in range(n)])
for i in range(10 ** 20):
fq = collections.defaultdict(list)
while True:
if len(q) != 0:
d, p = q.popleft()
if d == i:
if p not in fq:
tp = a[p][ad[p]]
if tp not in fq:
if p == a[tp][ad[tp]]:
fq[tp]
fq[p]
ad[tp] += 1
ad[p] += 1
if ad[tp] < n - 1:
q.append([d+1, tp])
if ad[p] < n - 1:
q.append([d+1, p])
else:
q.appendleft([d, p])
break
else:
if sum(ad) == n * (n - 1):
print((i + 1))
else:
print((-1))
exit()
if __name__ == '__main__':
slove()
| 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, i])
for i in range(10 ** 10):
fq = collections.defaultdict(int)
while ql:
d, p = ql.popleft()
if d == i:
if ps[p] < n - 1:
np = a[p][ps[p]]
if ps[np] < n - 1:
rp = a[np][ps[np]]
if p == rp:
if p not in fq and np not in fq:
fq[p]
fq[np]
ps[p] += 1
if ps[p] < n - 1:
ql.append([d+1, p])
ps[np] += 1
if ps[np] < n - 1:
ql.append([d+1, np])
else:
ql.appendleft([d, p])
break
else:
print((i + 1 if sum(ps) == n * (n - 1) else -1))
exit()
if __name__ == '__main__':
solve()
| 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 range(10 ** 10):
fq = collections.defaultdict(int)
while ql:
d, p = ql.popleft()
if d == i:
if ls[p] < n - 1:
rp = a[p][ls[p]]
if ls[rp] < n - 1:
rrp = a[rp][ls[rp]]
if p == rrp:
if p not in fq and rp not in fq:
fq[p]
fq[rp]
if ls[p] + 1 < n:
ls[p] += 1
ql.append([d+1, p])
if ls[rp] + 1 < n:
ls[rp] += 1
ql.append([d+1, rp])
elif d > i:
ql.appendleft([d, p])
break
if len(ql) == 0:
print((i if sum(ls) == (n - 1) * n else -1))
exit()
if __name__ == '__main__':
solve()
| 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, a)*n+max(i, a)].append(min(i, b)*n+max(i, b))
parent[min(i, b)*n+max(i, b)] += 1
que = deque([(i*n+j, 1) for i in range(n-1) for j in range(i+1, n) if not parent[i*n+j]])
ans = 1
cnt = 0
while que:
v, t = que.pop()
ans = max(ans, t)
cnt += 1
for nv in G[v]:
parent[nv] -= 1
if not parent[nv]:
que.appendleft((nv, t+1))
if cnt == n*(n-1)//2:
print(ans)
else:
print((-1))
if __name__ == "__main__":
main() | 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)*n+max(i, b))
parent[min(i, b)*n+max(i, b)] += 1
que = deque([(i*n+j, 1) for i in range(n-1) for j in range(i+1, n) if not parent[i*n+j]])
ans = 1
cnt = 0
while que:
v, t = que.pop()
ans = max(ans, t)
cnt += 1
for nv in G[v]:
parent[nv] -= 1
if not parent[nv]:
que.appendleft((nv, t+1))
if cnt == n*(n-1)//2:
print(ans)
else:
print((-1)) | 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(reversed(xs)) for xs in xss]
ans = 0
while True:
ms = list(matches(yss))
if len(ms) == 0:
if all(len(ys)==1 for ys in yss):
return ans
else:
return -1
return ans
ans += 1
for x, y in ms:
yss[x].pop()
yss[y].pop()
for i in range(n):
while len(yss[i]) > 0:
match = find_first_match(yss, i)
if match is None:
return [-1]
x, y = match
ans
def matches(yss):
firsts = [ys[-1] for ys in yss]
for x, y in enumerate(firsts):
if y!=-1 and x < y and firsts[y]==x:
yield y, firsts[y]
print((solve(n, xss)))
| 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))
if len(ms) == 0:
if all(len(ys)==1 for ys in yss):
return ans
else:
return -1
ans += 1
candidates = []
#print(" ".join(map(str, ms)))
for x, y in ms:
yss[x].pop()
yss[y].pop()
candidates.append(x)
candidates.append(y)
def matches(yss, candidates):
firsts = [yss[i][-1] for i in candidates]
ans = set()
for x, y in zip(candidates, firsts):
if y!=-1 and yss[y][-1] ==x:
ans.add((min(x, y), max(x, y)))
return ans
print((solve(n, xss))) | 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,a),max(i,a)
to_i,to_j=min(i,b),max(i,b)
Edges.add((fr_i*n+fr_j,to_i*n+to_j))
outs = defaultdict(list)
ins = defaultdict(int)
for v1, v2 in Edges:
outs[v1].append(v2)
ins[v2] += 1
q = deque((v1,1) for v1 in range(v) if ins[v1] == 0 and outs[v1])
res = []
while q:
v1,d = q.popleft()
res.append((v1,d))
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append((v2,d+1))
print((res[-1][1] if len(res)==n*(n-1)//2 else -1)) | 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[i][j]
b=A[i][j+1]
fr_i,fr_j=min(i,a),max(i,a)
to_i,to_j=min(i,b),max(i,b)
Edges.append((conv(n,fr_i,fr_j),conv(n,to_i,to_j)))
Outs=defaultdict(list)
In_cnt=defaultdict(int)
for v1,v2 in Edges:
Outs[v1].append(v2)
In_cnt[v2]+=1
q=deque((v0,1) for v0 in range(v) if In_cnt[v0]==0)
TopologicalSort=[]
while q:
v1,d=q.popleft()
TopologicalSort.append((v1,d))
for v2 in Outs[v1]:
In_cnt[v2]-=1
if In_cnt[v2]==0:
q.append((v2,d+1))
print((TopologicalSort[-1][1] if len(TopologicalSort)==n*(n-1)//2 else -1)) | 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 in range(n):
if flag[i]:
num = a[i][play[i]]-1
if flag[num] and a[num][play[num]]-1 == i:
play[num] += 1
play[i] += 1
flag[num] = False
flag[i] = False
break_flag = False
count += 1
if break_flag:
print((-1))
sys.exit()
ans += 1
if count == n*(n-1)//2:
break
if ans > limit:
print((-1))
sys.exit()
for i in range(n):
if play[i] < n-1:
flag[i] = True
else:
flag[i] = False
if ans == 0:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main() | 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 in range(n):
if flag[i]:
num = a[i][play[i]]-1
if flag[num] and a[num][play[num]]-1 == i:
play[num] += 1
play[i] += 1
flag[num] = False
flag[i] = False
break_flag = False
count += 1
if break_flag:
print((-1))
sys.exit()
ans += 1
if count == n*(n-1)//2:
break
if ans > limit:
print((n*(n-1)//2))
sys.exit()
for i in range(n):
if play[i] < n-1:
flag[i] = True
else:
flag[i] = False
if ans == 0:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main() | 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 range(n)]
sub=False
for i in range(n):
#nowリストのうち日ありからi+1番目のものについての一致条件の確認
K=now[i]
if now[K-1]==i+1 and not(visited[i] or visited[K-1]) and not(finished[i] or finished[K-1]):
visited[i]=True
visited[K-1]=True
index[i]+=1
index[K-1]+=1
sub=True
if index[i]==n-1:
finished[i]=True
now[i]=data_set[i][index[i]]
if index[K-1]==n-1:
finished[K-1]=True
now[K-1]=data_set[K-1][index[K-1]]
if not sub:
flag=False
ans+=1
judge=True
for i in range(n):
if finished[i]==False:
judge=False
break
if judge:
print(ans)
else:
print((-1)) | 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)]
while flag:
visited=[False for i in range(n)]
sub=False
for i in range(n):
#nowリストのうち日ありからi+1番目のものについての一致条件の確認
K=now[i]
if now[K-1]==i+1 and not(visited[i] or visited[K-1]) and not(finished[i] or finished[K-1]):
visited[i]=True
visited[K-1]=True
index[i]+=1
index[K-1]+=1
sub=True
if index[i]==n-1:
finished[i]=True
now[i]=data_set[i][index[i]]
if index[K-1]==n-1:
finished[K-1]=True
now[K-1]=data_set[K-1][index[K-1]]
if not sub:
flag=False
if time.time()-T>1.5:
flag=False
semi=True
ans+=1
judge=True
for i in range(n):
if finished[i]==False:
judge=False
break
if judge:
print(ans)
else:
if not semi:
print((-1))
if semi:
print((499500))
| 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(N):
a = list(map(int, input().split()))
for j in range(N-2):
x, y = a[j], a[j+1]
z, w = i+1, i+1
graph[(min(z, x), max(z, x))].append((min(w, y), max(w, y)))
indegree[(min(w, y), max(w, y))] += 1
d = deque()
e = deque()
visited = {(i, j): False for i in range(1, N+1) for j in range(i+1, N+1)}
cnt = 1
match = 0
for i in range(1, N+1):
for j in range(i+1, N+1):
if indegree[(i, j)] == 0:
d.append((i, j))
visited[(i, j)] = True
match += 1
while d:
while d:
x = d.popleft()
for node in graph[x]:
indegree[node] -= 1
if indegree[node] == 0:
e.append(node)
visited[node] = True
match += 1
if e:
d = e
e = deque()
cnt += 1
if match == N*(N-1)//2:
print(cnt)
else:
print((-1))
if __name__=="__main__":
main()
| # 休憩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+max(i+1, _to))
In = [0 for i in range(N**2+1)] # In[node] = node に入る入次数
for i in range(1, N**2+1):
for node in G[i]:
In[node] += 1
stack = deque()
for i in range(1, N**2+1):
if In[i] == 0:
stack.append(i) # stack := 入次数が0になった点を入れておく
Removed = [False for i in range(N**2+1)] # 考慮されたか
cnt = [1 for i in range(N**2+1)]
while stack:
x = stack.popleft()
Removed[x] = True
for node in G[x]:
In[node] -= 1
if In[node] == 0:
cnt[node] += cnt[x]
stack.append(node)
all_checked = all(Removed[node] == True for node in range(1, N**2+1))
if all_checked:
answer = max(cnt)
print(answer)
exit()
print((-1)) | 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
first = A[n][-1]
if first in canUseNew or n in canUseNew:
continue
if A[first][-1] == n:
# print("Do", n + 1, first + 1)
A[n].pop()
A[first].pop()
canUseNew.add(n)
canUseNew.add(first)
if len(canUseNew) == 0:
print((-1))
sys.exit(0)
canUse = canUseNew
print(ans)
| 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
first = A[n][-1]
if first in canUseNew or n in canUseNew:
continue
if A[first][-1] == n:
# print("Do", n + 1, first + 1)
A[n].pop()
if len(A[n]) == 0:
done += 1
A[first].pop()
if len(A[first]) == 0:
done += 1
canUseNew.add(n)
canUseNew.add(first)
if len(canUseNew) == 0:
print((-1))
sys.exit(0)
canUse = canUseNew
print(ans)
| 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:
continue
if A[j] == []:
continue
if A[j][-1] == i:
n += 1
gs.append((i, j))
if gs == []:
if n == N*(N-1)//2:
break
print((-1))
exit()
for i, j in gs:
A[i].pop()
A[j].pop()
d += 1
print(d)
| 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]
if A[j] == []:
continue
if i in s2 or j in s2:
continue
if A[j][-1] == i:
n += 1
n2 += 1
s2.add(i)
s2.add(j)
l2.append(i)
l2.append(j)
A[i].pop()
A[j].pop()
if n2 == 0:
if n == N*(N-1)//2:
break
print((-1))
exit()
l = l2
d += 1
print(d)
| 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
if visited[i] or visited[a[i][memo[i]] - 1]:
continue
visited[i] = True
if i + 1 == a[a[i][memo[i]] - 1][memo[a[i][memo[i]] - 1]]:
visited[a[i][memo[i]] - 1] = True
flag = True
tmp = memo[i]
memo[i] += 1
memo[a[i][tmp] - 1] += 1
if flag:
cnt += 1
else:
for i in memo:
if memo[i] != len(a[0]):
print((-1))
exit()
break
if abs(s_time - time.time()) > 1.7:
print((n*(n-1) //2))
print(cnt)
| 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
if visited[i] or visited[a[i][memo[i]] - 1]:
continue
visited[i] = True
if i + 1 == a[a[i][memo[i]] - 1][memo[a[i][memo[i]] - 1]]:
visited[a[i][memo[i]] - 1] = True
flag = True
tmp = memo[i]
memo[i] += 1
memo[a[i][tmp] - 1] += 1
if flag:
cnt += 1
else:
for i in memo:
if memo[i] != len(a[0]):
print((-1))
exit()
break
if abs(s_time - time.time()) > 1.7:
print((n*(n-1) //2))
exit()
print(cnt)
| 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[j] -= 1
k.reverse()
de.append([k[0],i])
on.append(cl.deque(k))
co = 1
ddd = cl.deque()
de.append([-1,-1])
cl = [1 for i in range(n)]
while de:
kkk = de.popleft()
if kkk[0] == -1 and kkk[1] == -1:
if sum(cl) == n:
co = -1
break
if len(de) == 0:
break
de.append([-1,-1])
co += 1
cl = [1 for i in range(n)]
elif ppp[kkk[0]] != 0 and on[kkk[0]][0] == kkk[1] and cl[kkk[0]] and cl[kkk[1]]:
cl[kkk[0]] = 0
cl[kkk[1]] = 0
on[kkk[0]].popleft()
on[kkk[1]].popleft()
ppp[kkk[0]] -= 1
ppp[kkk[1]] -= 1
if ppp[kkk[1]] != 0 != 0 and ppp[kkk[0]] != 0 and on[kkk[1]][0] == kkk[0] and on[kkk[0]][0] == kkk[1]:
de.append([on[kkk[1]][0],kkk[1]])
else:
if len(on[kkk[1]]) != 0:
de.append([on[kkk[1]][0],kkk[1]])
if len(on[kkk[0]]) != 0:
de.append([on[kkk[0]][0],kkk[0]])
print(co)
| 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([k[0],i])
on.append(cl.deque(k))
co = 1
ddd = cl.deque()
de.append([-1,-1])
ppppp = [1 for i in range(n)]
cl = ppppp[:]
while de:
kkk = de.popleft()
if kkk[0] == -1 and kkk[1] == -1:
if sum(cl) == n:
co = -1
break
if len(de) == 0:
break
de.append([-1,-1])
co += 1
cl = ppppp[:]
elif ppp[kkk[0]] != 0 and on[kkk[0]][0] == kkk[1] and cl[kkk[0]] and cl[kkk[1]]:
cl[kkk[0]] = 0
cl[kkk[1]] = 0
on[kkk[0]].popleft()
on[kkk[1]].popleft()
ppp[kkk[0]] -= 1
ppp[kkk[1]] -= 1
if ppp[kkk[1]] != 0 != 0 and ppp[kkk[0]] != 0 and on[kkk[1]][0] == kkk[0] and on[kkk[0]][0] == kkk[1]:
de.append([on[kkk[1]][0],kkk[1]])
else:
if len(on[kkk[1]]) != 0:
de.append([on[kkk[1]][0],kkk[1]])
if len(on[kkk[0]]) != 0:
de.append([on[kkk[0]][0],kkk[0]])
print(co)
| 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):
now = time.time()
if now - start > 2000:
ans = M+1
break
ans += 1
if ans > M:
break
tmp = set()
for i in range(N):
if id[i] >= N-1:
continue
else:
if Lock[i] >= 0:
continue
else:
a = A[i][id[i]]
if Lock[a-1] == i and i not in tmp:
Lock[a-1] = -1
id[a-1] += 1
tmp.add(a-1)
id[i] += 1
else:
if i not in tmp:
Lock[i] = A[i][id[i]]-1
min_id = min(id)
if ans > M:
print((-1))
else:
print(ans)
main()
|
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):
now = time.time()
if now - start > 2:
ans = M+1
break
ans += 1
if ans > M:
break
tmp = set()
for i in range(N):
if id[i] >= N-1:
continue
else:
if Lock[i] >= 0:
continue
else:
a = A[i][id[i]]
if Lock[a-1] == i and i not in tmp:
Lock[a-1] = -1
id[a-1] += 1
tmp.add(a-1)
id[i] += 1
else:
if i not in tmp:
Lock[i] = A[i][id[i]]-1
min_id = min(id)
if ans > M:
print((-1))
else:
print(ans)
main()
| 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 a[u][d[u]] == t:
next_temp.add(t)
next_temp.add(u)
#print(next_temp, d)
for t in next_temp:
d[t] += 1
if len(next_temp) == 0:
break
temp = deepcopy(next_temp)
ans += 1
if d.count(n-1) == n:
print(ans)
else:
print((-1)) | 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)
if d[x] >= n-1:
continue
y = a[x][d[x]]
#print(x, y)
if y not in next_temp:
if a[y][d[y]] == x:
heappush(next_temp, x)
heappush(next_temp, y)
#print(next_temp)
for t in next_temp:
d[t] += 1
if len(next_temp) == 0:
break
temp = [] + next_temp
ans += 1
#print(d)
if d.count(n-1) == n:
print(ans)
else:
print((-1))
| 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))//2)]
isroot = [True for i in range((n*(n-1))//2)]
def bfs():
q = deque([])
for root, rt in enumerate(isroot):
if rt:
q.append(root)
match[root] = 1
# print(match)
while(q):
item = q.popleft()
# print(q, item, child[item])
for ch in child[item]:
if match[ch] < match[item] + 1:
match[ch] = match[item] + 1
q.append(ch)
return
for idd in range(n):
nums = getList()
i = idd + 1
for j,k in zip(nums, nums[1:]):
ii, j = min(i, j), max(i,j)
iii, k = min(i, k), max(i,k)
idx1 = ((j-1)*(j-2))//2 + (ii-1)
idx2 = ((k - 1) * (k - 2)) // 2 + (iii - 1)
isroot[idx2] = False
child[idx1].append(idx2)
# print(i, j, k)
# print(idx1, idx2)
#
# print(child)
# print(isroot)
# # sys.exit()
bfs()
# print("gg")
ans = 1
for m in match:
if m > ans:
ans = m
if m == 0:
print((-1))
sys.exit()
print(ans)
| 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)) // 2)]
iriji = [0 for i in range((n * (n - 1)) // 2)]
def toposo(n, iriji, child):
order = [0 for i in range((n*(n+1))//2)]
q = deque([])
for i, iri in enumerate(iriji):
if iri == 0:
q.append(i)
order[i] = 1
while(q):
start = q.popleft()
target = child[start]
for tgt in target:
iriji[tgt] -= 1
if iriji[tgt] == 0:
q.append(tgt)
order[tgt] = order[start] + 1
if sum(iriji) != 0:
return -1
else:
return max(order)
for idd in range(n):
nums = getList()
i = idd + 1
for j, k in zip(nums, nums[1:]):
ii, j = min(i, j), max(i, j)
iii, k = min(i, k), max(i, k)
idx1 = ((j - 1) * (j - 2)) // 2 + (ii - 1)
idx2 = ((k - 1) * (k - 2)) // 2 + (iii - 1)
iriji[idx2] += 1
child[idx1].append(idx2)
# print(i, j, k)
# print(idx1, idx2)
#
# print(child)
# print(isroot)
# # sys.exit()
#
# bfs()
# # print("gg")
# ans = 1
# for m in match:
# if m > ans:
# ans = m
# if m == 0:
# print(-1)
# sys.exit()
# print(iriji, child)
print((toposo(n, iriji, child))) | 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.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7
def conv(n,a,b):
return a*(2*n-a-1)//2+b-a-1
def main():
N = II()
# A = [[] for _ in range(N)]
# for i in range(N):
# A[i] = LI()
# print(A)
# return
from collections import defaultdict
outs = defaultdict(list)
ins = defaultdict(int)
for i in range(N):
# prev_v = (i+1, A[i][0]) if i+1 < A[i][0] else (A[i][0], i+1)
a = LI()
for j in range(1,N-1):
# prev_v = (i+1, A[i][j-1]) if i+1 < A[i][j-1] else (A[i][j-1], i+1)
# next_v = (i+1, A[i][j]) if (i+1 < A[i][j]) else (A[i][j] , i+1)
# prev_v = conv(N, prev_v[0], prev_v[1])
# next_v = conv(N, next_v[0], next_v[1])
prev_v = (min(i+1, a[j-1]), max(i+1, a[j-1]))
next_v = (min(i+1, a[j]), max(i+1, a[j]))
prev_v = conv(N, prev_v[0]-1, prev_v[1]-1)
next_v = conv(N, next_v[0]-1, next_v[1]-1)
outs[prev_v].append(next_v)
ins[next_v] += 1
# print(outs, ins)
# return
from collections import deque
q = deque()
for i in range(1, N+1):
for j in range(1, N+1):
# j = A[i-1][0]
if i < j and ins[conv(N, i-1, j-1)] == 0:
q.append([conv(N, i-1, j-1), 0])
if not q:
print((-1))
return
# q = deque(v1 for v1 in range(1, N+1) if ins[v1] == 0)
res = []
depth_max = 0
while q:
v1, depth = q.popleft()
res.append(v1)
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append([v2, depth+1])
depth_max = max(depth_max, depth+1)
if len(res)!=N*(N-1)//2:
print((-1))
return
else:
print((depth_max+1))
return
main() | 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.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7
def conv(a, b, b_max):
return a*(b_max+1)+b
def main():
N = II()
# A = [[] for _ in range(N)]
# for i in range(N):
# A[i] = LI()
# print(A)
# return
from collections import defaultdict
outs = defaultdict(list)
ins = defaultdict(int)
for i in range(N):
# prev_v = (i+1, A[i][0]) if i+1 < A[i][0] else (A[i][0], i+1)
a = LI()
for j in range(1,N-1):
# prev_v = (i+1, A[i][j-1]) if i+1 < A[i][j-1] else (A[i][j-1], i+1)
# next_v = (i+1, A[i][j]) if (i+1 < A[i][j]) else (A[i][j] , i+1)
# prev_v = conv(N, prev_v[0], prev_v[1])
# next_v = conv(N, next_v[0], next_v[1])
prev_v = (min(i+1, a[j-1]), max(i+1, a[j-1]))
next_v = (min(i+1, a[j]), max(i+1, a[j]))
prev_v = conv(prev_v[0]-1, prev_v[1]-1, N)
next_v = conv( next_v[0]-1, next_v[1]-1, N)
outs[prev_v].append(next_v)
ins[next_v] += 1
# print(outs, ins)
# return
from collections import deque
q = deque()
for i in range(1, N+1):
for j in range(1, N+1):
# j = A[i-1][0]
if i < j and ins[conv(i-1, j-1, N)] == 0:
q.append([conv( i-1, j-1, N), 0])
if not q:
print((-1))
return
# q = deque(v1 for v1 in range(1, N+1) if ins[v1] == 0)
res = []
depth_max = 0
while q:
v1, depth = q.popleft()
res.append(v1)
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append([v2, depth+1])
depth_max = max(depth_max, depth+1)
if len(res)!=N*(N-1)//2:
print((-1))
return
else:
print((depth_max+1))
return
main() | 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[j]) * 1000 + max(i, a[j])
v2 = min(i, a[j + 1]) * 1000 + max(i, a[j + 1])
vlist[v1] = True
vlist[v2] = True
g[v1].append(v2)
deg[v2] += 1
d = [0] * V
check_cnt = 0
q = []
for v in range(V):
if vlist[v] and deg[v] == 0:
q.append(v)
if len(q) == 0:
print((-1))
exit()
for v in q:
check_cnt += 1
for nv in g[v]:
d[nv] = max(d[nv], d[v] + 1)
deg[nv] -= 1
if deg[nv] == 0:
q.append(nv)
if check_cnt == n * (n - 1) // 2:
print((max(d) + 1))
else:
print((-1))
if __name__ == '__main__':
main()
| 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]) * 1000 + max(i, a[j])
vlist.add(v1)
if j == n - 2:
break
v2 = min(i, a[j + 1]) * 1000 + max(i, a[j + 1])
g[v1].append(v2)
deg[v2] += 1
d = [0] * V
check_cnt = 0
q = []
for v in vlist:
if deg[v] == 0:
q.append(v)
if len(q) == 0:
print((-1))
exit()
for v in q:
check_cnt += 1
for nv in g[v]:
d[nv] = max(d[nv], d[v] + 1)
deg[nv] -= 1
if deg[nv] == 0:
q.append(nv)
if check_cnt == n * (n - 1) // 2:
print((max(d) + 1))
else:
print((-1))
if __name__ == '__main__':
main()
| 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:
c[i] = True
c[m] = True
f = False
for i in range(N):
if c[i]:
idx[i] += 1
f = True
if not f:
print((-1))
return
d += 1
if all([idx[i] >= N - 1 for i in range(N)]):
print(d)
return
if __name__ == '__main__':
input = sys.stdin.readline
N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split()]) for _ in range(N)]
main(N, A)
| # でつ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]]
if A[m][idx[m]] == i:
d = max(D[i][idx[i]], D[m][idx[m]])
idx[i] += 1
idx[m] += 1
D[i][idx[i]] = d + 1
D[m][idx[m]] = d + 1
f = False
if f: break
ans = -1
for i in range(N):
ans = max(ans, D[i][N - 1])
print(ans)
if __name__ == '__main__':
input = sys.stdin.readline
N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split()]) for _ in range(N)]
main(N, A)
| 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] == i:
nxt.append(i)
nxt.append(o)
if not nxt:
return -1
for i in set(nxt):
if A[i]:
w[i] = A[i].pop()
else:
w[i] = -1
r -= 1
cur = nxt
return d
print((main()))
| 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 == -1:
continue
if w[o] == i:
nxt.append(i)
nxt.append(o)
w[i] = -1
w[o] = -1
if not nxt:
return -1
cur = []
for i in nxt:
if A[i]:
w[i] = A[i].pop()
cur.append(i)
else:
r -= 1
return d
print((main()))
| 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
from heapq import heapify, heappop, heappush
import math
#inf = 10**17
#mod = 10**9 + 7
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
b = [0]*n
cnt = 0
while True:
f = 0
f2 = 0
sumi = [0]*n
for i in range(n):
if sumi[i] == 1 or b[i] == n-1:
f2 += 1
continue
aite = a[i][b[i]] - 1
if a[aite][b[aite]]-1 == i and sumi[aite]==0:
f = 1
b[i] += 1
b[aite] += 1
sumi[i] = 1
sumi[aite] = 1
if f2==n:
break
elif f:
cnt += 1
else:
print((-1))
exit()
print(cnt)
if __name__ == '__main__':
main() | 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
from heapq import heapify, heappop, heappush
import math
#inf = 10**17
#mod = 10**9 + 7
n = int(eval(input()))
a = []
for _ in range(n):
a.append(deque(list(map(int, input().split()))))
siai = n*(n-1)
d = [0]*n
while siai:
f = 0
for i in range(n):
while a[i] and a[a[i][0]-1][0] == i+1:
f = 1
day = max(d[i], d[a[i][0]-1])
d[i] = day + 1
d[a[i][0]-1] = day + 1
siai -= 2
a[a[i][0]-1].popleft()
a[i].popleft()
if not f:
print((-1))
break
else:
print((max(d)))
if __name__ == '__main__':
main() | 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)]
for i in range(n):
for j in range(n-2):
g[a[i][j]].append(a[i][j+1])
p[a[i][j+1]].append(a[i][j])
#print(g)
#print(p)
ans = [0]*(N)
indegree = [len(v) for v in p] # 流入辺の数を数えた配列
Source = [i for i, c in enumerate(indegree) if c == 0] #流入辺0の点の集合
#L = [] #ソート結果をためておく配列
num = 0
while Source:
node = Source.pop()
#L.append(node)
num += 1
for child in g[node]:
indegree[child] -= 1 #辺 node -> child を削除する
if ans[child] < ans[node]+1: ans[child] = ans[node]+1
if indegree[child] == 0:
Source.append(child)
#print(num)
if num != N:
print((-1))
else:
print((max(ans)+1))
#print(ans)
| # 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 y*(y-1)//2 + x
for i in range(n):
for j in range(n-2):
p,q = encode(i,a[i][j]), encode(i,a[i][j+1])
g[p].append(q)
indegree[q] += 1
"""
トポロジカルソート
q をheapq にしたりすると、辞書順にとりだしたりとかができる。
返り値：DAG ならトポソのひとつを返す。ループがあれば-1を返す
"""
"""
g: グラフの隣接行列
indegree: 流入辺の数を数えた配列
"""
def topological_sort_queue(g,indegree):
q = [i for i,c in enumerate(indegree) if c == 0] #流入辺0の点の集合
L = [] #ソート結果をためておく配列
ans =[0]*len(g)
a = 0
while q:
v = q.pop()
L.append(v)
for c in g[v]: #配る
ans[c] = max(ans[c],ans[v]+1)
a = max(a,ans[c])
indegree[c] -= 1 #辺 node -> child を削除する
if indegree[c] == 0:
q.append(c)
if len(L) != N: #print("サイクル検出")
return -1
else: #return(L)
return(a+1)
print((topological_sort_queue(g,indegree)))
| 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
zuru = 0
while flg == 0 :
zuru += 1
cnt = 0
cnt2 = 0
flg = 1
if zuru >= 10**5 :
ans = 499500
print(ans)
exit()
for i in range(N) :
if len(A[i]) == 0 :
cnt += 1
elif A[i][0] == -1 :
A[i].popleft()
elif A[i][0] < i :
cnt2 += 1
continue
elif i == A[A[i][0]][0] :
a = A[i].popleft()
A[a][0] = -1
flg = 0
else :
cnt2 += 1
if cnt == N :
flg = 1
elif flg == 0 :
ans += 1
elif (N-cnt) == cnt2 :
ans = -1
print(ans)
| 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
zuru = 0
while flg == 0 :
zuru += 1
cnt = 0
cnt2 = 0
flg = 1
if zuru >= 10**4 :
ans = 499500
print(ans)
exit()
for i in range(N) :
if len(A[i]) == 0 :
cnt += 1
elif A[i][0] == -1 :
A[i].popleft()
elif A[i][0] < i :
cnt2 += 1
continue
elif i == A[A[i][0]][0] :
a = A[i].popleft()
A[a][0] = -1
flg = 0
else :
cnt2 += 1
if cnt == N :
flg = 1
elif flg == 0 :
ans += 1
elif (N-cnt) == cnt2 :
ans = -1
print(ans)
| 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 in range(N-2):
x1 = x2= i+1
y1 = A[i][j]
y2 = A[i][j+1]
if x1 > y1:
x1, y1 = y1, x1
if x2 > y2:
x2, y2 = y2, x2
adj[(x1, y1)].append((x2, y2))
in_num[(x2, y2)] += 1
st = []
ng = (N * (N - 1)) // 2
for i in range(1, N+1):
for j in range(i+1, N+1):
if in_num[(i, j)] == 0:
st.append((i, j))
ng -= 1
ans = 0
while st:
ans += 1
st_new = []
for par in st:
for child in adj[par]:
if in_num[child] == 1:
st_new.append(child)
ng -= 1
in_num[child] -= 1
if st_new:
st = st_new
else:
break
if ng:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main()
| 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):
for j in range(N-2):
x1 = x2 = i+1
y1 = A[i][j]
y2 = A[i][j+1]
if x1 > y1:
x1, y1 = y1, x1
if x2 > y2:
x2, y2 = y2, x2
adj[x1*(N+1)+y1].append(x2*(N+1)+y2)
in_num[x2*(N+1)+y2] += 1
st = []
ng = (N * (N - 1)) // 2
for i in range(1, N+1):
for j in range(i+1, N+1):
if in_num[i*(N+1)+j] == 0:
st.append(i*(N+1)+j)
ng -= 1
ans = 0
while st:
ans += 1
st_new = []
for par in st:
for child in adj[par]:
if in_num[child] == 1:
st_new.append(child)
ng -= 1
in_num[child] -= 1
if st_new:
st = st_new
else:
break
if ng:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main()
| 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), max(u, v2)
adj[(uu1, vv1)].append((uu2, vv2))
in_deg[(uu1, vv1)]
in_deg[(uu2, vv2)] += 1
now = [tpl for tpl, val in list(in_deg.items()) if val == 0]
day = 0
while now:
day += 1
nxt = []
for u in now:
for v in adj[u]:
in_deg[v] -= 1
if in_deg[v] == 0:
nxt.append(v)
now = nxt
if max(in_deg.values()) > 0:
day = -1
print(day)
| 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), max(u, v2)
match1 = uu1 + vv1 * 1000
match2 = uu2 + vv2 * 1000
adj[match1].append(match2)
in_deg[match1]
in_deg[match2] += 1
now = [key for key, val in list(in_deg.items()) if val == 0]
day = 0
while now:
day += 1
nxt = []
for u in now:
for v in adj[u]:
in_deg[v] -= 1
if in_deg[v] == 0:
nxt.append(v)
now = nxt
if max(in_deg.values()) > 0:
day = -1
print(day)
| 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 = {}
for i in range(n):
if i in done:
continue
if len(am[i]) == 0:
continue
j = am[i][0]
if j < i:
continue
if j not in done and am[j][0] == i:
am[i].popleft()
am[j].popleft()
done[i] = 1
done[j] = 1
match += 1
if match == 0:
print((-1))
return
else:
cnt -= match
print(day)
resolve() | 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]:
p = (i, j) if i < j else (j, i)
q.add(p)
for i in range(n):
check(i)
day = 0
while len(q) > 0:
day += 1
prev_q, q = q, set()
for p in prev_q:
(i, j) = p
a[i].pop()
a[j].pop()
for p in prev_q:
(i, j) = p
check(i)
check(j)
for i in range(n):
if len(a[i]) != 0:
print((-1))
return
print(day)
resolve() | 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
if b in chk:
continue
else:
if b>i and a[b][0]-1==i:
chk.append(a[i].popleft()-1)
a[b].popleft()
cnt+=1
tcnt+=cnt
ans+=1
if cnt==0:
ans=-1
break
print(ans) | 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:
ans=-1
break
tcnt-=len(chk_next)
chk=set()
for i in chk_next:
a[i].popleft()
chk.add(i)
if a[i][0]!=-1:
chk.add(a[i][0])
ans+=1
print(ans) | 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) // 2
while game_count != total_game_count:
found = False
for i in range(n):
if loc[i] == -1:
continue
if used[i]:
continue
target = a[i][loc[i]] - 1
if used[target]:
continue
if loc[target] == -1:
continue
if a[target][loc[target]] - 1 == i:
used[i] = True
used[target] = True
loc[i] -= 1
loc[target] -= 1
found = True
game_count += 1
for i in range(n):
used[i] = False
ans += 1
if not found:
print((-1))
return
print(ans)
main()
| 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
start = time.time()
while game_count != total_game_count:
now = time.time()
if (now - start > 1.7):
print('-1')
return
found = False
used = [False] * n
for i in range(n):
if loc[i] == -1:
continue
if used[i]:
continue
target = a[i][loc[i]] - 1
if used[target]:
continue
if loc[target] == -1:
continue
if a[target][loc[target]] - 1 == i:
used[i] = True
used[target] = True
loc[i] -= 1
loc[target] -= 1
found = True
game_count += 1
ans += 1
if not found:
print((-1))
return
print(ans)
main()
| 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][s[first]]-1 # firstが対戦したい相手
second_num = s[second] # #secondの対戦番号
if c[second] == 0 and a[second][second_num]-1 == first:
c[first] = 1
c[second] = 1
s[first] += 1
s[second] += 1
need -= 1
if sum(c) == 0:
print((-1))
exit()
print(ans) | 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-1:
second = a[first][s[first]]-1 # firstが対戦したい相手
second_num = s[second] # #secondの対戦番号
if c[second] == 0 and a[second][second_num]-1 == first:
c[first] = 1
c[second] = 1
s[first] += 1
s[second] += 1
need -= 1
if sum(c) == 0:
print((-1))
exit()
now = time.time()-start
if now > 1.8:
print((n*(n-1)//2))
exit()
print(ans) | 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 = []
for i in range(n):
ls = list(map(int,input().split()))
f = -1
for p in ls:
v = min(i,p-1) + 1000*(max(i,p-1))
if f != -1:
graph[f].add(v)
st[v] += 1
f = v
for v in list(st.keys()):
if st[v] == 0:szero.append(v)
count = 0
next_szero = []
while True:
count += 1
for i in szero:
ans.append(i)
for v in graph[i]:
#if check[v]:check[v] = False
#else:continue
st[v] -= 1
if st[v] == 0:
next_szero.append(v)
if len(next_szero) == 0:break
szero = copy.deepcopy(next_szero)
next_szero = []
if len(ans) != n*(n-1)//2:
print((-1))
else:
print(count) | 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:
v = min(i,p-1) + 1000*(max(i,p-1))
if f != -1:
graph[f].append(v)
st[v] += 1
f = v
for v in list(st.keys()):
if st[v] == 0:szero.append(v)
count = 0
next_szero = []
while True:
count += 1
for i in szero:
ans.append(i)
for v in graph[i]:
st[v] -= 1
if st[v] == 0:
next_szero.append(v)
if len(next_szero) == 0:break
szero = next_szero
next_szero = []
if len(ans) != n*(n-1)//2:
print((-1))
else:
print(count) | p02925 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.