input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# encoding: utf-8
N, K = list(map(int, input().split()))
ans = 0
# 2 * (a + b + c) = K * (p + q + r)
for pqr in range(3, (6 * N) // K + 1):
# a + b + c = ?
if (pqr * K) % 2: continue
else: abc = (pqr * K) // 2
for p in range(max((1, -((N - abc) // K))), abc // K + 1):
qr = pqr - p
min_r = -((p * K - 2 * abc) // (2 * K))
max_r = min(((2 * abc) // K - 2 * p, (abc - 1) // K))
# count w/o r loop
if min_r > max_r: continue
# print(abc, (p, qr - min_r, min_r), (p, qr - max_r, max_r))
ans += (max_r - min_r + 1) * 6
if p == qr - min_r == min_r: ans -= 5 # p = q = r
if p < qr - min_r == min_r: ans -= 3 # p < q = r
if p == qr - max_r < max_r: ans -= 3 # p = q < r
print(ans)
| # encoding: utf-8
N, K = list(map(int, input().split()))
ans = 0
for a in range(1, N + 1):
# find a (a, b, c)
# maybe TLE
# for b in range(1, N + 1):
# if (a + b) % K == 0: break
# for c in range(1, K + 1):
# # c and c + K returns same result
# if (b + c) % K == 0 and (a + c) % K == 0: break
# else: continue
# else:
# continue # next a
if (K - 2 * a) % K: continue
b = K - (a % K)
c = K - b
# b_min, c_min
b_min = K - (K - b) % K
c_min = K - (K - c) % K
# b_max, c_max
b_max = N - (N - b_min) % K
c_max = N - (N - c_min) % K
# add
# print(a, b, c, (b_min, b_max), (c_min, c_max))
ans += ((b_max - b_min) // K + 1) * ((c_max - c_min) // K + 1)
print(ans) | p03266 |
N,K = list(map(int,input().split()))
ans = 0
for a in range(1,N+1):
for b in range(1,N+1):
for c in range(1,N+1):
if ((a+b) % K == 0) and ((a+c) % K == 0) and ((b+c) % K == 0):
ans += 1
else:
continue
print(ans) | N,K = list(map(int,input().split()))
if K % 2 != 0:
case1 = len([n for n in range(1,N+1) if n % K ==0])
print((case1 ** 3))
else:
case1 = len([n for n in range(1,N+1) if n % K ==0])
case2 = len([n for n in range(1,N+1) if n % K == K //2])
print((case1**3 + case2**3)) | p03266 |
N, K = list(map(int, input().split()))
if K % 2 == 0:
c1 = 0
c2 = 0
for i in range(1, N+1):
if i % K == K//2:
c2 += 1
if i % K == 0:
c1 += 1
print((c1**3+c2**3))
else:
c = 0
for i in range(1, N+1):
if i % K == 0:
c += 1
print((c**3))
| N, K = list(map(int, input().split()))
c1 = N // K
if K % 2 == 1:
print((c1**3))
else:
c2 = (N+K//2)//K
print((c1**3+c2**3)) | p03266 |
N , K = (int(i) for i in input().split())
a = 0
b = 0
c = 0
count = 0
for i in range(N):
a = i+1
for j in range(N):
b = j + 1
for k in range(N):
c = k + 1
if (a+b)%K==0 and (b+c)%K==0 and (c+a)%K==0:
count += 1
print(count) | N, K = list(map(int, input().split()))
res = 0
res += (N // K)** 3
if K % 2 == 0:
res += ((N-K//2)//K + 1) ** 3
print(res) | p03266 |
n,k = list(map(int,input().split()))
ans = 0
for i in range(n):
a = k * (i+1)
if a <= n:
for ii in range(n):
b = k * (ii+1)
if b <= n:
for iii in range(n):
c = k * (iii+1)
if c <= n:
ans = ans + 1
#print(a,b,c)
else:
break
else:
break
else:
break
if k % 2 == 0:
for j in range(n):
a = int(k/2) + k * j
if a <= n:
for jj in range(n):
b = int(k/2) + k * jj
if b <= n:
for jjj in range(n):
c = int(k/2) + k * jjj
if c <= n:
ans = ans + 1
#print(a,b,c)
else:
break
else:
break
else:
break
print(ans)
| n,k = list(map(int,input().split()))
ans = 0
if k % 2 != 0:
print(((n//k)**3))
else:
print(((n//k)**3+((n+int(k/2))//k)**3))
| p03266 |
n,k = list(map(int,input().split()))
a = 0
b = 0
for i in range(1,n+1):
if i%k==0:
a += 1
elif k%2==0 and i%k==k//2:
b += 1
if k%2==0:
print((a**3+b**3))
else:
print((a**3))
| n,k=list(map(int,input().split()));print(((n//k)**3+(k+1)%2*((n-k//2)//k+1)**3)) | p03266 |
n, k = list(map(int, input().split()))
no_rem = 0
rem_half = 0
for i in range(1,n+1):
no_rem += 1 if i % k == 0 else 0
rem_half += 1 if k%2 == 0 and i%k == k//2 else 0
print((no_rem ** 3 + rem_half**3))
|
n, k = list(map(int, input().split()))
def solve1():
no_rem = 0
rem_half = 0
for i in range(1,n+1):
no_rem += 1 if i % k == 0 else 0
rem_half += 1 if k%2 == 0 and i%k == k//2 else 0
print((no_rem ** 3 + rem_half**3))
def solve2():
no_rem = n//k
rem_half = 0 if k%2==1 else (n + k//2)//k
print((no_rem**3 + rem_half**3))
solve2() | p03266 |
n,k=list(map(int,input().split()))
count=0
if k%2==1:
print(((n//k)**3))
else:
for i in range(k//2,n+1,k//2):
for j in range(k//2,n+1,k//2):
for l in range(k//2,n+1,k//2):
if (i+j)%k==0 and (j+l)%k==0 and (l+i)%k==0:
count+=1
print(count) | n,k=list(map(int,input().split()))
if k%2==1:
print(((n//k)**3))
else:
print(((n//k)**3+(n//(k//2)-n//k)**3)) | p03266 |
import itertools
N, K = list(map(int, input().split()))
count = 0
poss = [n for n in range(1, N+1) if (2*n)%K==0]
poss2 = list(itertools.product(poss, repeat=3))
count = len([comb for comb in poss2 if (comb[0]+comb[1])%K==0 and (comb[1]+comb[2])%K==0])
print(count) | N, K = list(map(int, input().split()))
num = {i%K:N//K for i in range(1, K+1)}
mod = N % K
for i in range(1, mod+1):
num[i] += 1
ans = 0
for i in range(K):
if (2*i) % K == 0:
cnt = num[i]
cnt *= num[(K-i)%K] * num[(K-i)%K]
ans += cnt
print(ans) | p03266 |
import collections
n,k = list(map(int, input().split(' ')))
cc= collections.Counter()
for ii in range(1, n+1):
cc[ii % k] +=1
r = 0
for ii in cc:
if 2*(k - ii) % k == 0:
r += cc[ii] * ((cc[(k - ii) % k ]) ** 2)
#* cc[(k - ii) % k]
print(r) | import collections
n,k = list(map(int, input().split(' ')))
cc= collections.Counter()
for ii in range(1, n+1):
cc[ii % k] +=1
r = 0
for ii in cc:
if (- 2*ii) % k == 0:
r += cc[ii] * ((cc[(k - ii) % k ]) ** 2)
#* cc[(k - ii) % k]
print(r) | p03266 |
N, K = [int(nk) for nk in input().split()]
ans = 0
# a+b=pK b+c=qK c+a=rK
for p in range(1, ((2*N)//K)+1):#1<=p<=(2*N)//K
for q in range(1, ((2*N)//K)+1):
b0 = (( p+q-1)*K)/2
if b0 < 1:
continue
for r in range(1, ((2*N)//K)+1):
a = (( p-q+r)*K)/2
b = (( p+q-r)*K)/2
c = ((-p+q+r)*K)/2
if b < 1:
break
elif a > N or c > N:
break
elif b > N:
continue
elif a < 1 or c < 1:
continue
elif a == int(a) and b == int(b) and c == int(c):
ans += 1
print(ans) | N, K = [int(nk) for nk in input().split()]
if K % 2 == 1:
print(((N//K)**3))
else:
ans1 = (N//K)**3
ans2 = ((N-(K//2))//K + 1)**3
print((ans1 + ans2)) | p03266 |
N, K = list(map(int,input().split()))
a, b = 0, 0
for i in range(1, N+1):
if(i%K == 0):
a += 1
if(K%2 == 0):
for i in range(1, N+1):
if(i%K == K//2):
b += 1
print((a**3 + b**3)) | N, K = list(map(int,input().split()))
k = N//K
ans = k**3
if(K%2 == 0):
if(K*k+K//2 <= N):
ans += (k+1)**3
else:
ans *= 2
print(ans) | p03266 |
N, K = list(map(int, input().split()))
ans = 0
for i in range(1,N+1):
for j in range(1,N+1):
for k in range(1,N+1):
if ((i + j) % K == 0 and (j + k) % K == 0 and (k + i) % K == 0):
ans += 1
print(ans) | N, K = list(map(int, input().split()))
ans = 0
if (K % 2 != 0):
ans = (N // K) ** 3
else:
for i in range(1,N+1):
if (i % K == int(K / 2)):
ans += 1
ans = ans ** 3 + (N // K) ** 3
print(ans) | p03266 |
n,k=list(map(int,input().split()))
count,point=0,0
if k%2!=0:
while k*(count+1)<=n:
count +=1
print((count**3))
else:
for i in range(1,n+1):
if i%k==0:point +=1
elif i*2%k==0:count +=1
print((count**3+point**3)) | n,k=list(map(int,input().split()))
A,B=0,0
for i in range(1,n+1):
if i%k==0:A +=1
elif 2*i%k==0:B +=1
print((A**3+B**3)) | p03266 |
N,K=list(map(int,input().split()))
ans=0
a=int(2*N/K)
for i in range(1,a+1):
if i*K%2==1:
continue
for j in range(1,a+1):
if j*K%2==1:
continue
for l in range(1,a+1):
if l*K%2==1:
continue
if ((i+j)*K//2)%K==((l+j)*K//2)%K==((i+l)*K//2)%K==0:
ans+=1
print(ans) | N,K=list(map(int,input().split()))
ans=0
if K%2==1:
print(((N//K)**3))
else:
ans=(N//K)**3
k=K//2
j=(N+k)//K
print((j**3+ans)) | p03266 |
n,k=list(map(int,input().split()))
ans=0
if k%2==0:
hanbun=len([i for i in range(k//2,n+1,k)])
ans+=hanbun**3
baisuu=len([i for i in range(k,n+1,k)])
ans+=baisuu**3
print(ans) | n,k=list(map(int,input().split()))
ans=0
baisuu=n//k
ans+=baisuu**3
if k%2==0:
if baisuu*k+k//2<=n:
hanbun=baisuu+1
else:
hanbun=baisuu
ans+=hanbun**3
print(ans) | p03266 |
n,k=list(map(int,input().split()))
ans=0
baisuu=n//k
ans+=baisuu**3
if k%2==0:
if baisuu*k+k//2<=n:
hanbun=baisuu+1
else:
hanbun=baisuu
ans+=hanbun**3
print(ans) | def main():
n,k=list(map(int,input().split()))
ans=0
baisuu=n//k
ans+=baisuu**3
if k%2==0:
if baisuu*k+k//2<=n:
hanbun=baisuu+1
else:
hanbun=baisuu
ans+=hanbun**3
print(ans)
if __name__=="__main__":
main() | p03266 |
n, k = list(map(int, input().split()))
ll = 2*n // k
ans = 0
for i in range(1, ll+1):
for j in range(1, ll+1):
for m in range(1, ll+1):
if ((m+i-j)*k) % 2 == 0 and ((i-m+j)*k) % 2 == 0 and ((m-i+j)*k) % 2 == 0:
if (m+i-j) > 0 and (i-m+j) > 0 and (m-i+j) > 0:
if (m+i-j)*k//2 <= n and (i-m+j)*k//2 <= n and (m-i+j)*k//2 <= n:
ans += 1
print(ans)
| n, k = list(map(int, input().split()))
ll = n // k
if ll % 2 == 0:
l_odd = ll // 2
l_even = ll // 2
else:
l_odd = ll // 2 + 1
l_even = ll // 2
if k % 2 == 0:
ans = ll ** 3
if n >= ll*k + k/2:
ans += (ll+1)**3
else:
ans += ll**3
print(ans)
else:
print((ll ** 3))
| p03266 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
ans=0
ans+=(n//k)**3
if k%2==0:
_a=0
for i in range(1,n+1):
if i%k==k//2:
_a+=1
ans+=_a**3
return ans
# main()
print((main()))
| import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
if k%2==0:
return (n//(k//2)-(n//k))**3+(n//k)**3
return (n//k)**3
# main()
print((main()))
| p03266 |
n,k = list(map(int,input().split()))
num = [0] * k
ans = 0
for i in range(1,n + 1):
num[i%k] += 1
for a in range(k):
b = (k - a) % k
c = (k - a) % k
if (b + c) % k != 0:
continue
ans += num[a] * num[b] * num[c]
print(ans) | n,k = list(map(int,input().split()))
def gcd(a,b):
if b == 0:
return a
return gcd(b,a % b)
def lcm(a,b):
return a * b // gcd(a,b)
if k % 2 != 0:
elements = n // k
print((elements**3))
else:
a = n // k
b = (n + (k//2)) // k
print((a**3 + b ** 3)) | p03266 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
R = [0] * K
for i in range(1, N + 1):
R[i % K] += 1
ans = 0
for a in range(K):
if 2 * (K - a) % K == 0:
ans += R[a] * R[(K - a) % K] ** 2
print(ans)
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
ans = pow(N // K, 3)
if K % 2 == 0:
ans += pow((N + K // 2) // K, 3)
print(ans)
return
if __name__ == '__main__':
main()
| p03266 |
N, K = list(map(int, input().split()))
c = 0
for i in range(1, N + 1):
a = 0
if (i + i) % K == 0:
for j in range(1, N + 1):
if (i + j) % K == 0:
a += 1
c += a * a
print(c)
| N, K = list(map(int, input().split()))
c = N // K
d = 0
for i in range(1, N + 1):
if K % 2 == 0 and i % K == K // 2:
d += 1
print((c ** 3 + d ** 3))
| p03266 |
N,K = list(map(int, input().split()))
cnt = 0
ans = []
for i in range(1,N+1):
for j in range(1,N+1):
for k in range(1,N+1):
if (i + j) % K == 0 and (j + k) % K == 0 and (k + i) % K == 0:
cnt += 1
ans.append([i,j,k])
print(cnt)
| n,k = list(map(int,input().split()))
if k%2==1:
ans = (n//k)**3
else:
even = n//k
odd = (2*n)//k - even
ans = even**3 + odd**3
print(ans) | p03266 |
def calc(n, k, x):
c = 0
while x <= n:
y = z = x
while 0 < y:
z = y
while 0 < z:
if x == y and y == z:
c += 1
elif x == y or y == z:
c += 3
else:
c += 6
z -= k
y -= k
x += k
return c
n, k = list(map(int, input().split()))
if k % 2 == 0:
print((calc(n, k, k) + calc(n, k, k // 2)))
else:
print((calc(n, k, k))) | def calc(n, k, x):
c = 0
while x <= n:
a = (x - 1) // k
c += 1 + 6 * (1 + a) * a // 2
x += k
return c
n, k = list(map(int, input().split()))
if k % 2 == 0:
print((calc(n, k, k) + calc(n, k, k // 2)))
else:
print((calc(n, k, k)))
| p03266 |
n, k = list(map(int, input().split()))
if k % 2 == 1:
ans = (n // k) ** 3
else:
num = n // k
num2 = n // (k // 2) - num
ans = num ** 3 + num2 ** 3
print(ans) | n, k = list(map(int, input().split()))
ans = 0
if k % 2 == 1:
ans += (n // k) ** 3
else:
ans += (n // k) ** 3
ans += ((n // (k // 2)) - (n // k)) ** 3
print(ans) | p03266 |
N, K = list(map(int, input().split()))
ret = 0
for x in range(1, N + 1):
for y in range(K - x, N + 1, K):
for z in range(K - y, N + 1, K):
if y > 0 and z > 0 and (z + x) % K == 0:
ret += 1
print(ret) | N, K = list(map(int, input().split()))
n = sum([1 for x in range(K, N + 1, K)])
if K % 2 == 1:
print((n ** 3))
else:
m = sum([1 for x in range(K // 2, N + 1, K)])
print((n ** 3 + m ** 3)) | p03266 |
N,K = [int(i) for i in input().split()]
candidates = []
for i in range(1,N+1) :
i = int(i)
if (i % K == 0) :
# Kの倍数は候補にする
candidates.append(i)
continue
if (K % 2 == 0 and i % (K/2) == 0) :
# Kが偶数だったらK/2も候補としてよい
candidates.append(i)
continue
count = 0
for a in candidates :
for b in candidates :
for c in candidates :
if (int(a+b) % K == 0 and int(b+c) % K == 0 and int(c+a) % K == 0) :
count += 1
print(count) | import itertools as it
N,K = [int(i) for i in input().split()]
candidates = []
even = []
odd = []
for i in range(1,N+1) :
i = int(i)
if (i % K == 0) :
# Kの倍数は候補にする
even.append(i)
continue
if (K % 2 == 0 and i % (K/2) == 0) :
# Kが偶数だったらK/2も候補としてよい
odd.append(i)
continue
# a,b,cの組み合わせ(Kが奇数のとき)
count = len(even) * len(even) * len(even)
# a,b,cの組み合わせ(Kが偶数のとき)
# すべての要素がK/2で揃っているケース
if (K % 2 == 0) :
count += (len(odd) * len(odd) * len(odd))
print(count) | p03266 |
import sys
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
ct=[0 for i in range(n)]
fin=0
day=0
count=0
check=[0,0]
while count!=n*(n-1)//2:
L=[0 for i in range(n)]
f1=0
for i in range(n):
if L[i]==0 and ct[i]!=n-1:
x=l[i][ct[i]]
if l[x-1][ct[x-1]]-1==i and L[x-1]==0:
ct[i]+=1
ct[x-1]+=1
L[i]=1
L[x-1]=1
count+=1
day+=1
check[0]=check[1]
check[1]=count
if check[0]==check[1]:
print((-1))
sys.exit()
print(day) | import sys
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
ct=[0 for i in range(n)]
fin=0
day=0
count=0
check=[0,0]
while count!=n*(n-1)//2 and day<=10**4:
L=[0 for i in range(n)]
f1=0
for i in range(n):
if L[i]==0 and ct[i]!=n-1:
x=l[i][ct[i]]
if l[x-1][ct[x-1]]-1==i and L[x-1]==0:
ct[i]+=1
ct[x-1]+=1
L[i]=1
L[x-1]=1
count+=1
day+=1
check[0]=check[1]
check[1]=count
if check[0]==check[1]:
print((-1))
sys.exit()
if day>10**4:
print((n*(n-1)//2))
sys.exit()
print(day) | p02925 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
import collections
As = [collections.deque()]
for i in range(N):
As.append(collections.deque(list(map(int, input().split()))))
Ks = [False] * (N + 1)
d = 1
ms = 0
msMax = N * (N - 1) // 2
sw = True
tab = set()
wa = [0] * (N + 1)
while sw:
wac = 0
c = 0
e = N + 1
f = N - 1
for i in range(1, e):
if Ks[i] or len(As[i]) == 0:
continue
p = As[i].popleft()
if i > p:
a = p
b = i
else:
a = i
b = p
if (a, b) in tab:
ms = ms + 1
c = c + 1
if ms == msMax:
sw = False
print(d)
break
tab.remove((a, b))
Ks[a] = False
wa[wac] = b
wac = wac + 1
else:
tab.add((a, b))
Ks[i] = True
for i in range(N):
if wa[i] == 0:
break
Ks[wa[i]] = False
wa[i] = 0
d = d + 1
if c == 0:
print((-1))
break | import sys
input = sys.stdin.readline
N = int(eval(input()))
As = [list(map(int, input().split())) + [-1] for _ in range(N)]
import collections
que = collections.deque([i for i in range(N)])
counters = [0] * N
days = [0] * N
while que:
player = que.popleft()
opponent = As[player][counters[player]] - 1
if As[opponent][counters[opponent]] - 1 == player:
days[player] = max(days[player], days[opponent]) + 1
days[opponent] = days[player]
counters[player] += 1
counters[opponent] += 1
que.append(player)
que.append(opponent)
for c in counters:
if c < N - 1:
print((-1))
break
else:
print((max(days))) | p02925 |
#!/usr/bin/env python3
import sys
def solve(N: int, A: "List[List[int]]"):
for i in range(N):
A[i] = A[i][::-1]
answer = 0
totalGame = 0
MAXGAME = (N*(N-1))//2
while True:
if totalGame == MAXGAME:
break
# 既にこのターンでマッチしたインデックスを保持
match = set()
for i in range(N):
if not A[i]:
continue
match_index = A[i][-1]-1
if not A[match_index]:
continue
if match_index in match or i in match:
continue
if A[match_index][-1]-1 == i:
A[i].pop()
A[match_index].pop()
match.add(i)
match.add(match_index)
totalGame += 1
if len(match) == 0:
print((-1))
return
answer += 1
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [[int(next(tokens)) for _ in range(N - 1)] for _ in range(N)] # type: "List[List[int]]"
solve(N, A)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, A: "List[List[int]]"):
for i in range(N):
A[i] = A[i][::-1]
answer = 0
totalGame = 0
MAXGAME = (N*(N-1))//2
match = set()
while True:
if totalGame == 0:
for i in range(N):
if not A[i]:
continue
match_index = A[i][-1]-1
if not A[match_index]:
continue
if match_index in match or i in match:
continue
if A[match_index][-1]-1 == i:
A[i].pop()
A[match_index].pop()
match.add(i)
match.add(match_index)
totalGame += 1
else:
if totalGame == MAXGAME:
break
check_needed = list(match)
# 既にこのターンでマッチしたインデックスを保持
match = set()
for i in check_needed:
if not A[i]:
continue
match_index = A[i][-1]-1
if not A[match_index]:
continue
if match_index in match or i in match:
continue
if A[match_index][-1]-1 == i:
A[i].pop()
A[match_index].pop()
match.add(i)
match.add(match_index)
totalGame += 1
if len(match) == 0:
print((-1))
return
answer += 1
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [[int(next(tokens)) for _ in range(N - 1)] for _ in range(N)] # type: "List[List[int]]"
solve(N, A)
if __name__ == '__main__':
main()
| p02925 |
from collections import deque
import sys
import copy
def main():
input = sys.stdin.readline
n = int(eval(input()))
a = [None]*n
for i in range(n):
a[i] = [int(x)-1 for x in input().split()]
count = 0
ans = 0
bef_checked = [int(x) for x in range(n)]
index = [0]*n
while True:
ans += 1
check = copy.deepcopy(bef_checked)
bef_checked = []
already = set()
flag = True
for v in check:
if v in already:
continue
flag = False
v2 = a[v][index[v]]
if v2 in already:
continue
if v != a[v2][index[v2]]:
continue
already = already|{v, v2}
index[v] += 1
index[v2] += 1
if index[v] == n-1:
count += 1
else:
bef_checked.append(v)
if index[v2] == n-1:
count += 1
else:
bef_checked.append(v2)
if flag:
print((-1))
sys.exit()
if count == n:
break
print(ans)
if __name__ == "__main__":
main() | import sys
from copy import deepcopy as copy
def main():
input = sys.stdin.readline
n = int(eval(input()))
a = [None]*n
for i in range(n):
a[i] = [int(x)-1 for x in input().split()]
index = [0]*n
search = [int(x) for x in range(n)]
ans = 0
while True:
already = set()
judge = True
sub = []
for key in search:
if index[key] == n-1:
continue
key2 = a[key][index[key]]
if index[key2] == n-1:
continue
if key != a[key2][index[key2]]:
continue
if key in already or key2 in already:
continue
already.add(key)
already.add(key2)
index[key] += 1
index[key2] += 1
sub.append(key)
sub.append(key2)
judge = False
if judge:
break
ans += 1
search = copy(sub)
for value in index:
if value != n-1:
print((-1))
sys.exit()
print(ans)
if __name__ == "__main__":
main() | p02925 |
from collections import deque
def main():
N = int(eval(input()))
A = [deque([int(x) - 1 for x in input().split()]) for _ in range(N)]
match_order = {k:v for k,v in enumerate(A)}
cnt_finished = 0
days = 1
flag = True
while flag:
flag = False
used = set()
complete = []
for i, order in list(match_order.items()):
if not order:
continue
if i in used:
continue
j = order[0]
if j in used:
continue
# それぞれの人について、残りの順番で初めに戦う相手がお互いになっている = その段階で試合ができる
if A[j][0] == i:
A[i].popleft()
A[j].popleft()
used.add(i)
used.add(j)
flag = True
# N-1人と戦い終わった人は次以降調べない
if not A[i]:
cnt_finished += 1
complete.append(i)
if not A[j]:
cnt_finished += 1
complete.append(j)
#print(i,j, cnt_finished)
if not flag:
print((-1))
exit()
if cnt_finished == N:
print(days)
exit()
else:
for i in complete:
del match_order[i]
days += 1
if __name__ == "__main__":
main() |
from collections import deque
N = int(eval(input()))
match_order = [deque([int(x) - 1 for x in input().split()]) for _ in range(N)]
q = deque(list(range(N)))
finish_by = [0] * N
next_opponent = [None] * N
while q:
a = q.popleft()
# aの残りの順で一番初めに戦う対戦相手を取り出す
b = match_order[a].popleft()
if next_opponent[b] == a:
finish_by[a] = finish_by[b] = max(finish_by[a], finish_by[b]) + 1
# a,bについて、まだ対戦相手が残っているならキューに積む
if match_order[a]:
q.append(a)
if match_order[b]:
q.append(b)
# bの残りの順で戦う相手がaではないなら、順番が来るまで待つ
else:
next_opponent[a] = b
# 対戦相手が残っている人がいる場合、条件通りに終わることができない
if any(match_order):
print((-1))
else:
print((max(finish_by))) | p02925 |
from collections import deque
N = int(eval(input()))
match_order = [deque([int(x) - 1 for x in input().split()]) for _ in range(N)]
q = deque(list(range(N)))
finish_by = [0] * N
next_opponent = [None] * N
while q:
a = q.popleft()
# aの残りの順で一番初めに戦う対戦相手を取り出す
b = match_order[a].popleft()
# 互いの初めに戦うべき相手がお互いであれば、そのペアで試合を行う
if next_opponent[b] == a:
# a,bが今までに試合した回数の多いほう+1（同じ人が日に二度試合を行えないので）
finish_by[a] = finish_by[b] = max(finish_by[a], finish_by[b]) + 1
# a,bについて、まだ対戦相手が残っているならキューに積む
if match_order[a]:
q.append(a)
if match_order[b]:
q.append(b)
# bの残りの順で戦う相手がaではないなら、順番が来るまで待つ
else:
next_opponent[a] = b
# 対戦相手が残っている人がいる場合、条件通りに終わることができない
if any(match_order):
print((-1))
else:
print((max(finish_by))) | """
ある試合(a,b)が行われるまでに消化しておくべき試合を管理して、それが0になった組からキューに積む
みたいな感じで雑にやるとTLEが取れなかった。
LeetCodeのTwoSum的に、
a -> bで試合ができない場合は、情報を残しておいて、b -> a が回ってきた時に試合が実施されるようにするとよいっぽい
"""
from collections import deque
N = int(eval(input()))
match_order = [deque([int(x) - 1 for x in input().split()]) for _ in range(N)]
q = deque(list(range(N)))
finish_by = [0] * N
next_opponent = [None] * N
while q:
a = q.popleft()
# aの残りの順で一番初めに戦う対戦相手を取り出す
b = match_order[a].popleft()
# 互いの初めに戦うべき相手がお互いであれば、そのペアで試合を行う
if next_opponent[b] == a:
# a,bが今までに試合した回数の多いほう+1（同じ人が日に二度試合を行えないので）
finish_by[a] = finish_by[b] = max(finish_by[a], finish_by[b]) + 1
# a,bについて、まだ対戦相手が残っているならキューに積む
if match_order[a]:
q.append(a)
if match_order[b]:
q.append(b)
# bの残りの順で一番初めに戦う相手がaではないなら、順番が来るまで待つ
# このあと(b,c)の試合が行われて、キューにb,cが積まれるとかで、aがbと試合するとかがあれば、消化される
else:
next_opponent[a] = b
# 対戦相手が残っている人がいる場合、条件通りに終わることができない
if any(match_order):
print((-1))
else:
print((max(finish_by))) | p02925 |
"""
ある試合(a,b)が行われるまでに消化しておくべき試合を管理して、それが0になった組からキューに積む
みたいな感じで雑にやるとTLEが取れなかった。
LeetCodeのTwoSum的に、
a -> bで試合ができない場合は、情報を残しておいて、b -> a が回ってきた時に試合が実施されるようにするとよいっぽい
"""
from collections import deque
N = int(eval(input()))
match_order = [deque([int(x) - 1 for x in input().split()]) for _ in range(N)]
q = deque(list(range(N)))
finish_by = [0] * N
next_opponent = [None] * N
while q:
a = q.popleft()
# aの残りの順で一番初めに戦う対戦相手を取り出す
b = match_order[a].popleft()
# 互いの初めに戦うべき相手がお互いであれば、そのペアで試合を行う
if next_opponent[b] == a:
# a,bが今までに試合した回数の多いほう+1（同じ人が日に二度試合を行えないので）
finish_by[a] = finish_by[b] = max(finish_by[a], finish_by[b]) + 1
# a,bについて、まだ対戦相手が残っているならキューに積む
if match_order[a]:
q.append(a)
if match_order[b]:
q.append(b)
# bの残りの順で一番初めに戦う相手がaではないなら、順番が来るまで待つ
# このあと(b,c)の試合が行われて、キューにb,cが積まれるとかで、aがbと試合するとかがあれば、消化される
else:
next_opponent[a] = b
# 対戦相手が残っている人がいる場合、条件通りに終わることができない
if any(match_order):
print((-1))
else:
print((max(finish_by))) |
from collections import deque
N = int(eval(input()))
A = [deque([int(x) - 1 for x in input().split()]) for _ in range(N)]
next_vs = [None] * N
day_finished = [0] * N
q = deque()
for i in range(N):
q.append(i)
"""
・試合したらそいつらをキューに積む
・試合できなかったら、次はこいつと戦いたいよリストにいれる
キューを全て確認したのに、 次はこいつと戦いたいよリストが残っている/未試合の相手が残っている 状態であれば、与えられた順では試合ができない
"""
while q:
x = q.popleft()
opp_x = A[x].popleft()
if next_vs[opp_x] == x:
day_finished[x] = day_finished[opp_x] = max(day_finished[x], day_finished[opp_x]) + 1
if A[x]:
q.append(x)
if A[opp_x]:
q.append(opp_x)
else:
next_vs[x] = opp_x
for i in range(N):
if A[i]:
print((-1))
exit()
print((max(day_finished))) | p02925 |
import sys
# input = sys.stdin.buffer.readline
N = int(eval(input()))
A = [list(map(int, input().split()))[::-1] for _ in range(N)]
day = 0
cnt = N
Last = [True] * N
while cnt:
flag = True
Done = [False] * N
for i, a in enumerate(A):
if not Last[i]:
continue
if len(a) == 0:
continue
if Done[i]:
continue
x = a[-1] - 1
if A[x] and (not Done[x]) and (A[x][-1] - 1 == i):
A[i].pop()
A[x].pop()
Done[i] = True
Done[x] = True
flag = False
if not A[i]:
cnt -= 1
if not A[x]:
cnt -= 1
Last = Done
if flag:
break
day += 1
if cnt:
print((-1))
else:
print(day) | import sys
# input = sys.stdin.buffer.readline
N = int(eval(input()))
A = [list(map(int, input().split()))[::-1] for _ in range(N)]
day = 0
cnt = N
Last = set([i for i in range(N)])
while cnt:
flag = True
Done = [False] * N
L = set()
for i in Last:
if len(A[i]) == 0:
continue
if Done[i]:
continue
x = A[i][-1] - 1
if A[x] and (not Done[x]) and (A[x][-1] - 1 == i):
A[i].pop()
A[x].pop()
Done[i] = True
Done[x] = True
L.add(i)
L.add(x)
flag = False
if not A[i]:
cnt -= 1
if not A[x]:
cnt -= 1
Last = L
if flag:
break
day += 1
if cnt:
print((-1))
else:
print(day) | p02925 |
def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(eval(input()))
P = 10**9+7
INF = 10**18+10
N = II()
A = []
for i in range(N):
A.append(deque([int(x)-1 for x in input().split()]))
dbg('hoge')
ans = 0
players = deque(list(range(N)))
calc = 0
match = defaultdict(lambda : -1)
first = True
while True:
mathced = False
next_players = deque()
next_match = defaultdict(lambda : -1)
# dbg('day',ans)
for i in players:
# dbg(i,ans,players,A,match)
calc += 1
a = A[i]
if len(a) == 0:
continue
j = a[0]
b = A[j]
if match[j] == i and match[i] == j:
# dbg(i,j)
b.popleft()
# if b[0] != i:
# dbg('fuga')
a.popleft()
mathced = True
match[i] = -1
match[j] = -1
if len(a) > 0:
next_match[i] = a[0]
next_players.append(i)
if len(b) > 0:
next_match[j] = b[0]
next_players.append(j)
else:
next_match[i] = a[0]
players = next_players
match.update(next_match)
if first:
dbg('hogehoge')
first = False
players = list(range(N))
continue
ans += 1
if not mathced or len(players) == 0:
break
print((ans if mathced and len(next_players)==0 else -1))
dbg(calc,mathced,len(next_players),len(a),len(b))
ans = 0
main() | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(eval(input()))
P = 10**9+7
INF = 10**18+10
N = II()
A = []
match = defaultdict(lambda : -1)
for i in range(N):
a = deque([int(x)-1 for x in input().split()])
match[i] = a[0]
A.append(a)
ans = 0
players = deque(list(range(N)))
matched = True
while matched and len(players) > 0:
matched = False
next_players = deque()
next_match = defaultdict(lambda : -1)
for i in players:
if match[i] == -1:
continue
a = A[i]
j = a[0]
b = A[j]
if match[j] == i and match[i] == j:
a.popleft()
b.popleft()
matched = True
match[i] = -1
match[j] = -1
if len(a) > 0:
next_match[i] = a[0]
next_players.append(i)
if len(b) > 0:
next_match[j] = b[0]
next_players.append(j)
else:
next_match[i] = a[0]
players = next_players
match.update(next_match)
ans += 1
print((ans if matched and len(next_players)==0 else -1))
ans = 0
main() | p02925 |
n = int(eval(input()))
g = [[-1, -1] for i in range(n*n)]
z = [0] * (n*n)
a = []
for _ in range(n):
a.append([int(i) for i in input().split()])
for i in range(n):
for j in range(n-2):
p, q = (i, a[i][j]-1)
r, s = (i, a[i][j+1]-1)
r, s = (min(r, s), max(r ,s))
if p < q:
g[p*n+q][0] = r*n + s
else:
g[q*n+p][1] = r*n + s
z[r*n+s] += 1
from collections import deque
qu = set([])
for i in range(n):
p, q = (i, a[i][0]-1)
p, q = (min(p, q), max(p ,q))
if z[p*n+q] == 0:
qu.add(p*n+q)
ans = 0
re = 0
qu = deque(qu)
while True:
nqu = deque()
while qu:
s = qu.popleft()
re += 1
for t in g[s]:
if t != -1:
z[t] -= 1
if z[t] == 0:
nqu.append(t)
ans += 1
qu = nqu
if not qu:
break
if re == n*(n-1)//2:
print(ans)
else:
print((-1)) | n = int(eval(input()))
g = [[-1, -1] for i in range(n*n)]
z = [0] * (n*n)
a = []
for _ in range(n):
a.append([int(i) for i in input().split()])
for i in range(n):
for j in range(n-2):
p, q = (i, a[i][j]-1)
r, s = (i, a[i][j+1]-1)
r, s = (min(r, s), max(r ,s))
if p < q:
g[p*n+q][0] = r*n + s
else:
g[q*n+p][1] = r*n + s
z[r*n+s] += 1
qu = set([])
for i in range(n):
p, q = (i, a[i][0]-1)
p, q = (min(p, q), max(p ,q))
if z[p*n+q] == 0:
qu.add(p*n+q)
ans = 0
re = 0
while True:
nqu = []
while qu:
s = qu.pop()
re += 1
for t in g[s]:
if t != -1:
z[t] -= 1
if z[t] == 0:
nqu.append(t)
ans += 1
qu = nqu
if not qu:
break
if re == n*(n-1)//2:
print(ans)
else:
print((-1)) | p02925 |
from collections import deque
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
graph = [[] for _ in range(N * N)]
ins = [0] * (N * N)
for i, nodes in enumerate(A):
for j1, j2 in zip(nodes[:-1], nodes[1:]):
n1 = max(i, j1 - 1) * N + min(i, j1 - 1)
n2 = max(i, j2 - 1) * N + min(i, j2 - 1)
graph[n1].append(n2)
ins[n2] += 1
visited = [False] * (N * N)
for i in range(N):
visited[N * i + i] = True
que = deque()
for i, v in enumerate(ins):
if v == 0:
que.append((i, 1))
dist = [0] * (N * N)
while que:
cur, d = que.popleft()
visited[cur] = True
dist[cur] = d
for v in graph[cur]:
if visited[v]:
continue
ins[v] -= 1
if ins[v] == 0:
que.append((v, d + 1))
print((max(dist) if all(visited) else -1))
| from collections import deque
N = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(N)]
graph = [[] for _ in range(N * N)]
ins = [0] * (N * N)
for i, nodes in enumerate(X):
for j1, j2 in zip(nodes[:-1], nodes[1:]):
n1 = max(i, j1 - 1) * N + min(i, j1 - 1)
n2 = max(i, j2 - 1) * N + min(i, j2 - 1)
graph[n1].append(n2)
ins[n2] += 1
dist = [0] * (N * N)
visited = [False] * (N * N)
q = deque()
for i in range(N):
visited[N * i + i] = True
for i, v in enumerate(ins):
if v == 0:
q.append((i, 1))
while q:
u, d = q.popleft()
visited[u] = True
dist[u] = d
for v in graph[u]:
if visited[v]:
continue
ins[v] -= 1
if ins[v] == 0:
q.append((v, d + 1))
print((max(dist) if all(visited) else -1))
| p02925 |
from collections import deque
N = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(N)]
graph = [[] for _ in range(N * N)]
ins = [0] * (N * N)
for i, nodes in enumerate(X):
for j1, j2 in zip(nodes[:-1], nodes[1:]):
n1 = max(i, j1 - 1) * N + min(i, j1 - 1)
n2 = max(i, j2 - 1) * N + min(i, j2 - 1)
graph[n1].append(n2)
ins[n2] += 1
dist = [0] * (N * N)
visited = [False] * (N * N)
q = deque()
for i in range(N):
visited[N * i + i] = True
for i, v in enumerate(ins):
if v == 0:
q.append(i)
visited[i] = True
dist[i] = 1
while q:
u = q.popleft()
for v in graph[u]:
if visited[v]:
continue
ins[v] -= 1
if ins[v] == 0:
visited[v] = True
dist[v] = dist[u] + 1
q.append(v)
print((max(dist) if all(visited) else -1))
|
from collections import deque
N = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(N)]
graph = [[] for _ in range(N * N)]
inserted = [0] * (N * N)
for i, nodes in enumerate(X):
for j1, j2 in zip(nodes[:-1], nodes[1:]):
n1 = max(i, j1 - 1) * N + min(i, j1 - 1)
n2 = max(i, j2 - 1) * N + min(i, j2 - 1)
graph[n1].append(n2)
inserted[n2] += 1
dist = [0] * (N * N)
visited = [False] * (N * N)
for i in range(N):
visited[i * N + i] = True
q = deque()
for i, v in enumerate(inserted):
if v == 0:
q.append(i)
visited[i] = True
dist[i] = 1
while q:
u = q.popleft()
for v in graph[u]:
if visited[v]:
continue
inserted[v] -= 1
if inserted[v] == 0:
visited[v] = True
dist[v] = dist[u] + 1
q.append(v)
print((max(dist) if all(visited) else -1))
| p02925 |
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 1 21:55:48 2019
@author: Yamazaki Kenichi
"""
N = int(eval(input()))
A = [list(map(int,input().split())) for i in range(N)]
T = [0 for i in range(N)]
today = [True for i in range(N)]
yesterday = [i for i in range(N)]
ans = 0
counta = 0
while counta < N:
today = [True for i in range(N)]
today_p = []
for i in yesterday:
if today[i]:
vs = A[i][T[i]] - 1
if A[vs][T[vs]] == i + 1 and today[vs]:
T[i] += 1
T[vs] += 1
if T[i] == N - 1:
T[i] = 0
counta += 1
if T[vs] == N - 1:
T[vs] = 0
counta += 1
today[i], today[vs] = False, False
today_p.extend([i,vs])
yesterday = today_p
# print(i,vs,today,T)
if len(today_p) == 0:
ans = -1
break
ans += 1
print(ans) | # -*- coding: utf-8 -*-
"""
Created on Sun Sep 1 21:55:48 2019
@author: Yamazaki Kenichi
"""
N = int(eval(input()))
A = [list(map(int,input().split())) for i in range(N)]
T = [0 for i in range(N)]
today = [True for i in range(N)]
yesterday = [i for i in range(N)]
ans = 0
counta = 0
while counta < N:
today = set([])
today_p = []
for i in yesterday:
if not i in today:
vs = A[i][T[i]] - 1
if A[vs][T[vs]] == i + 1 and not vs in today:
T[i] += 1
T[vs] += 1
if T[i] == N - 1:
T[i] = 0
counta += 1
if T[vs] == N - 1:
T[vs] = 0
counta += 1
today.add(i)
today.add(vs)
today_p.extend([i,vs])
yesterday = today_p
# print(i,vs,today,T)
if len(today_p) == 0:
ans = -1
break
ans += 1
print(ans)
| p02925 |
N = int(eval(input()))
# 初期化
G = [None] * (10 ** 6 + 1) # グラフ
for i in range(10 ** 6 + 1):
G[i] = set()
U = [None] * (10 ** 6 + 1) # 入次数
D = [0] * (10 ** 6 + 1) # 根からの距離
# 変換用
def x(i, j):
return j + 1000 * i
# グラフを構築
for i in range(1, N + 1):
A = list(map(int, input().split()))
for j in range(N - 2):
fv1, fv2 = min(i, A[j]), max(i, A[j])
tv1, tv2 = min(i, A[j + 1]), max(i, A[j + 1])
G[x(fv1, fv2)].add(x(tv1, tv2))
U[x(fv1, fv2)] = 0
U[x(tv1, tv2)] = 0
# 入次数をカウント
for i in range(10 ** 6 + 1):
for v in G[i]:
U[v] += 1
# トポロジカルソート
U_zero_nodes = []
for i in range(10 ** 6 + 1):
if U[i] is None:
continue
if U[i] == 0:
U_zero_nodes.append(i)
topological_order = []
while U_zero_nodes:
n = U_zero_nodes.pop()
topological_order.append(n)
for v in G[n]:
U[v] -= 1
if U[v] == 0:
U_zero_nodes.append(v)
# 不可能判定
if len(topological_order) != N * (N - 1) // 2:
print((-1))
exit()
# 最長経路を計算
for t_n in topological_order:
for v in G[t_n]:
D[v] = max(D[v], D[t_n] + 1)
print((max(D) + 1))
| N = int(eval(input()))
# 初期化
G = [[] for i in range(10 ** 6 + 1)] # グラフ
U = [None] * (10 ** 6 + 1) # 入次数
D = [0] * (10 ** 6 + 1) # 根からの距離
# 変換用
def x(i, j):
return j + 1000 * i
# グラフを構築
for i in range(1, N + 1):
A = list(map(int, input().split()))
for j in range(N - 2):
fv1, fv2 = min(i, A[j]), max(i, A[j])
tv1, tv2 = min(i, A[j + 1]), max(i, A[j + 1])
G[x(fv1, fv2)].append(x(tv1, tv2))
U[x(fv1, fv2)] = 0
U[x(tv1, tv2)] = 0
# 入次数をカウント
for i in range(10 ** 6 + 1):
for v in G[i]:
U[v] += 1
# トポロジカルソート
U_zero_nodes = []
for i in range(10 ** 6 + 1):
if U[i] is None:
continue
if U[i] == 0:
U_zero_nodes.append(i)
topological_order = []
while U_zero_nodes:
n = U_zero_nodes.pop()
topological_order.append(n)
for v in G[n]:
U[v] -= 1
if U[v] == 0:
U_zero_nodes.append(v)
# 不可能判定
if len(topological_order) != N * (N - 1) // 2:
print((-1))
exit()
# 最長経路を計算
for t_n in topological_order:
for v in G[t_n]:
D[v] = max(D[v], D[t_n] + 1)
print((max(D) + 1))
| p02925 |
N = int(eval(input()))
# 初期化
G = [[] for i in range(10 ** 6 + 1)] # グラフ
U = [None] * (10 ** 6 + 1) # 入次数
D = [0] * (10 ** 6 + 1) # 根からの距離
# 変換用
def x(i, j):
return j + 1000 * i
# グラフを構築
for i in range(1, N + 1):
A = list(map(int, input().split()))
for j in range(N - 2):
fv1, fv2 = min(i, A[j]), max(i, A[j])
tv1, tv2 = min(i, A[j + 1]), max(i, A[j + 1])
G[x(fv1, fv2)].append(x(tv1, tv2))
U[x(fv1, fv2)] = 0
U[x(tv1, tv2)] = 0
# 入次数をカウント
for i in range(10 ** 6 + 1):
for v in G[i]:
U[v] += 1
# トポロジカルソート
U_zero_nodes = []
for i in range(10 ** 6 + 1):
if U[i] is None:
continue
if U[i] == 0:
U_zero_nodes.append(i)
topological_order = []
while U_zero_nodes:
n = U_zero_nodes.pop()
topological_order.append(n)
for v in G[n]:
U[v] -= 1
if U[v] == 0:
U_zero_nodes.append(v)
# 不可能判定
if len(topological_order) != N * (N - 1) // 2:
print((-1))
exit()
# 最長経路を計算
for t_n in topological_order:
for v in G[t_n]:
D[v] = max(D[v], D[t_n] + 1)
print((max(D) + 1))
| N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split()]) + [-1] for i in range(N)]
ans = 0
matched = 0
marker = [0] * N
que = list(range(N))
while matched < N * (N - 1) // 2:
already_matched = set()
no_matched = True
next_que = []
while que:
player = que.pop()
partner = A[player][marker[player]]
if A[partner][marker[partner]] == player:
if not ((player not in already_matched) and (partner not in already_matched)):
continue
matched += 1
marker[player] += 1
marker[partner] += 1
already_matched.add(player)
already_matched.add(partner)
next_que.append(player)
next_que.append(partner)
no_matched = False
ans += 1
que = next_que[:]
if no_matched:
print((-1))
break
else:
print(ans)
| p02925 |
N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split()]) + [-1] for i in range(N)]
ans = 0
matched = 0
marker = [0] * N
que = list(range(N))
while matched < N * (N - 1) // 2:
already_matched = set()
no_matched = True
next_que = []
while que:
player = que.pop()
partner = A[player][marker[player]]
if A[partner][marker[partner]] == player:
if not ((player not in already_matched) and (partner not in already_matched)):
continue
matched += 1
marker[player] += 1
marker[partner] += 1
already_matched.add(player)
already_matched.add(partner)
next_que.append(player)
next_que.append(partner)
no_matched = False
ans += 1
que = next_que[:]
if no_matched:
print((-1))
break
else:
print(ans)
| N = int(eval(input()))
A = [list([int(x) - 1 for x in input().split()]) + [-1] for i in range(N)]
ans = 0
matched = 0
marker = [0] * N
que = list(range(N))
while matched < N * (N - 1) // 2:
already_matched = set()
next_que = []
while que:
player = que.pop()
partner = A[player][marker[player]]
if A[partner][marker[partner]] == player:
if not ((player not in already_matched) and (partner not in already_matched)):
continue
matched += 1
marker[player] += 1
marker[partner] += 1
already_matched.add(player)
already_matched.add(partner)
next_que.append(player)
next_que.append(partner)
if not next_que:
print((-1))
break
ans += 1
que = next_que[:]
else:
print(ans)
| p02925 |
N = int(eval(input()))
A = [list([int(x)-1 for x in input().split()]) for i in range(N)]
B = [0]*N
days = 0
games_amount = 0
while True:
C = [0]*N
for i in range(N):
if C[i] == 0 and B[i] != N-1:
b = A[i][B[i]]
if C[b] == 1:
continue
if A[b][B[b]] == i:
B[i] += 1
B[b] += 1
C[i], C[b] = 1, 1
if sum(C) == 0:
break
days += 1
print((days if sum(B) == N*(N-1) else -1)) | import time
start = time.time()
N = int(eval(input()))
A = [list([int(x)-1 for x in input().split()]) for i in range(N)]
B = [0]*N
days = 0
games_amount = 0
for i in range(N*(N-1)//2):
games = 0
played = set()
for j in range(N):
if len(A[j]) == 0 or j in played or A[j][0] in played:
continue
if A[A[j][0]][0] == j:
t1 = A[j].pop(0)
played.add(t1)
played.add(A[t1].pop(0))
games += 1
games_amount += 1
if games == 0:
print((-1))
exit(0)
else:
days += 1
if games_amount == N*(N-1)//2:
break
if time.time() - start > 1.9:
print((N*(N-1)//2))
exit(0)
print(days) | p02925 |
import sys
input=sys.stdin.readline
from collections import deque
def main():
N = int(eval(input()))
Q = [deque(list(map(int, input().split()))) for _ in range(N)]
games = N*(N-1)//2
days = 0
nxt = [i for i in range(N)] # 翌日に対戦相手を更新する選手のリスト
opp = [0]*N # 選手毎の、次の対戦相手のリスト
while 1:
days += 1
for i in nxt:
opp[i] = Q[i].popleft() - 1 if Q[i] else -1
gamed = [0]*N # 選手がその日に試合済みかどうか
tmp = [] # 次の日の更新のため、試合をした選手をメモ
for i in nxt:
if gamed[i] == 0 and opp[i] >= 0 and i == opp[opp[i]]:
# print("game:", i+1, opp[i]+1, days)
tmp.append(i)
tmp.append(opp[i])
gamed[i] = gamed[opp[i]] = 1
games -= 1
if games == 0:
break
elif not tmp:
print((-1))
return
nxt = tmp
print(days)
if __name__ == '__main__':
main() | import sys
input=sys.stdin.readline
from collections import deque
def main():
N = int(eval(input()))
Q = [deque(list(map(int, input().split()))) for _ in range(N)]
games = N*(N-1)//2
days = 0
nxt = [i for i in range(N)] # 翌日に対戦相手を更新する選手のリスト
opp = [0]*N # 選手毎の、次の対戦相手のリスト
while 1:
days += 1
for i in nxt:
opp[i] = Q[i].popleft() - 1 if Q[i] else -1
tmp = set() # 次の日の更新のため、試合をした選手をメモ
for i in nxt:
if i not in tmp and i == opp[opp[i]]:
# print("game:", i+1, opp[i]+1, days)
tmp.add(i)
tmp.add(opp[i])
games -= 1
if games == 0:
break
elif not tmp:
print((-1))
return
nxt = tmp
print(days)
if __name__ == '__main__':
main() | p02925 |
# ABC139E - League
from collections import deque
def main():
N, *A = list(map(int, open(0).read().split()))
B = {}
for i in range(N):
x = i * (N - 1)
B[i + 1] = deque(A[x : x + N - 1])
ans, flg, matched = 0, 0, set()
while B:
for i in list(B.keys()):
if i in B and i not in matched:
x = B[i][0]
if x in B and x not in matched and B[x][0] == i:
B[i].popleft(), B[x].popleft()
matched |= {i, x}
flg = 1
if not B[i]:
del B[i]
if not B[x]:
del B[x]
if flg:
ans += 1
flg, matched = 0, set()
else:
print((-1))
return
print(ans)
if __name__ == "__main__":
main() | # ABC139E - League
from collections import deque
def main():
N, *A = list(map(int, open(0).read().split()))
B = {}
for i in range(N):
x = i * (N - 1)
B[i + 1] = deque(A[x : x + N - 1])
ans, cnt, matched = 0, 0, set()
q = [i for i in range(1, N + 1)]
while q:
ans += 1
next_q = []
for i in q:
if i in B and i not in matched:
x = B[i][0]
if x in B and x not in matched and B[x][0] == i:
B[i].popleft(), B[x].popleft()
matched |= {i, x}
cnt += 1
if not B[i]:
del B[i]
else:
next_q += [i]
if not B[x]:
del B[x]
else:
next_q += [x]
q = next_q
matched = set()
flg = cnt == N * (N - 1) // 2
print((ans if flg else -1))
if __name__ == "__main__":
main() | p02925 |
# ABC139E - League
from collections import deque
def main():
N, *A = list(map(int, open(0).read().split()))
B = {}
for i in range(N):
x = i * (N - 1)
B[i + 1] = deque(A[x : x + N - 1])
cnt, cur, days = 0, [0] * (N + 1), [0] * (N + 1)
q = deque(list(range(1, N + 1)))
while q:
x = q.popleft()
if not B[x]: # player x has finished all games
continue
y = B[x].popleft()
if cur[y] == x: # player y's next game is against x and vice versa
cnt += 1
days[x] = days[y] = max(days[x], days[y]) + 1
cur[x], cur[y] = 0, 0
q.append(x), q.append(y)
else: # the opponent will do another game before playing against x
cur[x] = y
flg = cnt == N * (N - 1) // 2 # finished all scheduled games or not
print((max(days) if flg else -1))
if __name__ == "__main__":
main() | # ABC139E - League
from collections import deque
def main():
N = int(eval(input()))
A = [0] + list(deque(list(map(int, input().split()))) for _ in range(N))
cnt, cur, days = 0, [0] * (N + 1), [0] * (N + 1)
q = deque(list(range(1, N + 1)))
while q:
x = q.popleft()
if not A[x]: # player x has finished all games
continue
y = A[x].popleft() # the opponent of x
if cur[y] == x: # player y's next game is against x and vice versa
cnt += 1
days[x] = days[y] = max(days[x], days[y]) + 1 # day of playing the game
cur[x], cur[y] = 0, 0 # no next game is currently planned
q.append(x), q.append(y)
else: # the opponent will do another game before playing against x
cur[x] = y
flg = cnt == N * (N - 1) // 2 # finished all scheduled games or not
print((max(days) if flg else -1))
if __name__ == "__main__":
main() | p02925 |
from collections import deque
from typing import List, Optional, Tuple
def cycle_detectable_topological_sort(
graph: List[List[int]], in_degrees: List[int], first_index: int = 0
) -> Tuple[Optional[List[int]], Optional[List[int]]]:
"""Topological sort that uses Kahn's algorithm and detects a loop (DAG or not).
Returns:
if the given graph is DAG, a list of sorted vertices and a list of depths of
each vertex is returned.
Otherwise, (None, None) is returned.
"""
V = len(graph) + first_index
order = []
depths = [-1] * V # depths[i] := the length of the longest path to V_i
for i in range(first_index, V):
if not in_degrees[i]:
order.append(i)
depths[i] = 0
queue = deque(order)
while queue:
u = queue.popleft()
cur_depth = depths[u]
for v in graph[u]:
in_degrees[v] -= 1
if not in_degrees[v]:
depths[v] = max(depths[v], cur_depth + 1)
queue.append(v), order.append(v)
return (order, depths) if len(order) + first_index == V else (None, None)
def abc139_e():
N, *A = list(map(int, open(0).read().split()))
ids = [[-1] * (N + 1) for _ in range(N + 1)]
cur_id = 0
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
ids[i][j] = ids[j][i] = cur_id
cur_id += 1
graph = [[] for _ in range(N * (N - 1) // 2)]
in_degrees = [0] * (N * (N - 1) // 2)
for i, a in enumerate(zip(*[iter(A)] * (N - 1)), 1):
source = -1
for j in a:
target = ids[i][j]
if source != -1:
graph[source].append(target)
in_degrees[target] += 1
source = target
_, depths = cycle_detectable_topological_sort(graph, in_degrees)
print((max(depths) + 1 if depths is not None else -1))
if __name__ == "__main__":
abc139_e()
| from collections import deque
from typing import List, Optional, Tuple
def cycle_detectable_topological_sort(
graph: List[List[int]], in_degrees: List[int], first_index: int = 0
) -> Tuple[Optional[List[int]], Optional[List[int]]]:
"""Topological sort that uses Kahn's algorithm and detects a loop (DAG or not).
Returns:
if the given graph is DAG, a list of sorted vertices and a list of depths of
each vertex is returned.
Otherwise, (None, None) is returned.
"""
V = len(graph) + first_index
order = []
depths = [-1] * V # depths[i] := the length of the longest path to V_i
for i in range(first_index, V):
if not in_degrees[i]:
order.append(i)
depths[i] = 0
queue = deque(order)
while queue:
u = queue.popleft()
cur_depth = depths[u]
for v in graph[u]:
in_degrees[v] -= 1
if not in_degrees[v]:
depths[v] = cur_depth + 1
queue.append(v), order.append(v)
return (order, depths) if len(order) + first_index == V else (None, None)
def abc139_e():
# https://atcoder.jp/contests/abc139/tasks/abc139_e
N, *A = list(map(int, open(0).read().split()))
ids = [[-1] * (N + 1) for _ in range(N + 1)]
cur_id = 0
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
ids[i][j] = ids[j][i] = cur_id
cur_id += 1
graph = [[] for _ in range(N * (N - 1) // 2)]
in_degrees = [0] * (N * (N - 1) // 2)
for i, a in enumerate(zip(*[iter(A)] * (N - 1)), 1):
source = -1
for j in a:
target = ids[i][j]
if source != -1:
graph[source].append(target)
in_degrees[target] += 1
source = target
_, depths = cycle_detectable_topological_sort(graph, in_degrees)
print((max(depths) + 1 if depths else -1))
def grl_4_a():
# https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/4/GRL_4_A
V, _, *ST = list(map(int, open(0).read().split()))
graph = [[] for _ in range(V)]
in_degrees = [0] * V
for s, t in zip(*[iter(ST)] * 2):
graph[s].append(t)
in_degrees[t] += 1
res, _ = cycle_detectable_topological_sort(graph, in_degrees)
print((1 if res is None else 0))
if __name__ == "__main__":
abc139_e()
# grl_4_a()
| p02925 |
import sys
import collections
import copy
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [collections.deque([int(x) for x in input().split()]) for _ in range(N)]
day = 0
c = 0
nxt = [A[x][0] for x in range(N)]
for i in range(N):
A[i].popleft()
while c != N * (N - 1):
day += 1
nxt2 = copy.copy(nxt)
tmp = set()
for i in set(nxt):
if i == -1 or i in tmp:
continue
if i == nxt[nxt[i - 1] - 1]:
if A[i - 1]:
nxt2[i - 1] = A[i - 1].popleft()
else:
nxt2[i - 1] = -1
if A[nxt[i - 1] - 1]:
nxt2[nxt[i - 1] - 1] = A[nxt[i - 1] - 1].popleft()
else:
nxt2[nxt[i - 1] - 1] = -1
tmp.add(i)
tmp.add(nxt[i - 1])
c += 2
if not tmp:
print((-1))
return
nxt = copy.copy(nxt2)
print(day)
if __name__ == '__main__':
main()
| import sys
import collections
import copy
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [collections.deque([int(x) for x in input().split()]) for _ in range(N)]
day = 0
c = 0
nxt = [x for x in range(N)]
oppo = [0] * N
while c != N * (N - 1):
day += 1
for i in nxt:
oppo[i] = A[i].popleft() if A[i] else -1
tmp = set()
for i in nxt:
if i == -1 or i in tmp:
continue
if i == oppo[oppo[i] - 1] - 1:
tmp.add(i)
tmp.add(oppo[i] - 1)
c += 2
if not tmp:
print((-1))
return
nxt = tmp
print(day)
if __name__ == '__main__':
main()
| p02925 |
import sys
import collections
import copy
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [collections.deque([int(x) for x in input().split()]) for _ in range(N)]
day = 0
c = 0
nxt = [x for x in range(N)]
oppo = [0] * N
while c != N * (N - 1):
day += 1
for i in nxt:
oppo[i] = A[i].popleft() if A[i] else -1
tmp = set()
for i in nxt:
if i == -1 or i in tmp:
continue
if i == oppo[oppo[i] - 1] - 1:
tmp.add(i)
tmp.add(oppo[i] - 1)
c += 2
if not tmp:
print((-1))
return
nxt = tmp
print(day)
if __name__ == '__main__':
main()
| import sys
import collections
from collections import defaultdict
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[int(x) for x in input().split()] for _ in range(N)]
q = [collections.deque() for j in range(N)]
for i, a in enumerate(A):
for aa in a:
q[i].append(aa)
ans = 0
current = defaultdict(int)
for i, v in enumerate(q):
current[i + 1] = v[0]
while True:
v = set()
for k in list(current.keys()):
if k == q[current[k] - 1][0]:
v.add(k)
v.add(current[k])
current = defaultdict(int)
if len(v) == 0:
break
for vv in v:
q[vv - 1].popleft()
if len(q[vv - 1]):
current[vv] = q[vv - 1][0]
ans += 1
# 全て空なら
size = 0
for i in range(N):
size += len(q[i])
if size == 0:
print(ans)
else:
print((-1))
if __name__ == '__main__':
main()
| p02925 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
A = [[-1] + [int(x)-1 for x in row.split()][::-1] for row in sys.stdin.readlines()]
A.append([-1])
def f():
can_use = []
for n in range(N):
if A[A[n][-1]][-1] == n:
can_use.append(n)
for n in can_use:
A[n].pop()
return len(can_use)
answer = 0
rest = N*(N-1)
while True:
answer += 1
x = f()
if x == 0:
answer = -1
break
rest -= x
if rest == 0:
break
print(answer) | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
A = [[-1] + [int(x)-1 for x in row.split()][::-1] for row in sys.stdin.readlines()]
A.append([-1])
def f(cand):
cand1 = set()
can_use = []
for n in cand:
if A[A[n][-1]][-1] == n:
can_use.append(n)
for n in can_use:
A[n].pop()
cand1.add(n)
if A[n][-1] != -1:
cand1.add(A[n][-1])
return len(can_use),cand1
answer = 0
rest = N*(N-1)
cand = set(range(N))
while True:
answer += 1
x,cand = f(cand)
if x == 0:
answer = -1
break
rest -= x
if rest == 0:
break
print(answer)
| p02925 |
def resolve():
N = int(eval(input()))
A = []
for _ in range(N):
_a = list([int(x)-1 for x in input().split()])
A.append(_a)
ptrs = [0 for _ in range(N)]
day = 0
players = set([i for i in range(N)])
finished = set()
loops = 0
while loops < 10**5:
todays_players = set()
matched = False
if len(finished) == N:
break
#print("------")
for home in (players-finished):
if home in finished:
continue
away = A[home][ptrs[home]]
if away in finished:
continue
#print(home, away)
away_opp = A[away][ptrs[away]]
if home in todays_players or away in todays_players:
continue
if home == away_opp:
ptrs[home] += 1
ptrs[away] += 1
todays_players.add(home)
todays_players.add(away)
matched = True
if ptrs[home] == N-1:
finished.add(home)
if ptrs[away] == N-1:
finished.add(away)
#print(ptrs)
if matched:
day += 1
else:
day = -1
break
loops += 1
assert loops < 10**5, "error"
print(day)
if '__main__' == __name__:
resolve()
| def resolve():
N = int(eval(input()))
A = []
for _ in range(N):
_a = list([int(x)-1 for x in input().split()])
A.append(_a)
ptrs = [0 for _ in range(N)]
day = 0
players = set([i for i in range(N)])
finished = set()
yest_players = set([i for i in range(N)])
while True:
todays_players = set()
matched = False
if len(finished) == N:
break
#print("------")
for home in yest_players:
if home in finished:
continue
away = A[home][ptrs[home]]
if away in finished:
continue
#print(home, away)
away_opp = A[away][ptrs[away]]
if home in todays_players or away in todays_players:
continue
if home == away_opp:
ptrs[home] += 1
ptrs[away] += 1
todays_players.add(home)
todays_players.add(away)
matched = True
if ptrs[home] == N-1:
finished.add(home)
if ptrs[away] == N-1:
finished.add(away)
yest_players = todays_players
#print(ptrs)
if matched:
day += 1
else:
day = -1
break
print(day)
if '__main__' == __name__:
resolve()
| p02925 |
#16:07
n = int(eval(input()))
raw = []
for _ in range(n):
raw.append(list([int(x)-1 for x in input().split()]))
cnt = [0 for _ in range(n)]
now = []
for i in range(n):
j = raw[i][cnt[i]]
if i < j and i == raw[j][cnt[j]]:
now.append(i)
now.append(j)
ans = 0
while now:
ans += 1
last = now
now = []
for x in last:
cnt[x] += 1
if cnt[x] < n-1:
y = raw[x][cnt[x]]
if x == raw[y][cnt[y]]:
now.append(x)
now.append(y)
#print(now)
if cnt == [n-1 for _ in range(n)]:
print(ans)
else:
print((-1)) | #TLEの原因は毎回tmpを設定していたこと
#b08はansがとても大きいサンプル
#16:07
n = int(eval(input()))
raw = []
for _ in range(n):
raw.append(list([int(x)-1 for x in input().split()]))
cnt = [0 for _ in range(n)]
now = []
for i in range(n):
j = raw[i][cnt[i]]
if i < j and i == raw[j][cnt[j]]:
now.append(i)
now.append(j)
ans = 0
while now:
ans += 1
last = now
now = []
for x in last:
cnt[x] += 1
if cnt[x] < n-1:
y = raw[x][cnt[x]]
if x == raw[y][cnt[y]]:
now.append(x)
now.append(y)
#print(now)
if cnt == [n-1 for _ in range(n)]:
print(ans)
else:
print((-1)) | p02925 |
from collections import deque
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [deque([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = 0
while any(A):
ok = False
used = [False] * N
for i in range(N):
a = A[i]
if not a or used[i]:
continue
j = a[0]
b = A[j]
if not b or used[j]:
continue
if i == b[0]:
ok = True
A[i].popleft()
A[j].popleft()
used[i] = used[j] = True
if not ok:
print((-1))
exit()
ans += 1
print(ans)
if __name__ == '__main__':
main() | from collections import deque
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [deque([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = 0
used_prev = set(range(N))
while any(A):
used = set()
for i in used_prev:
a = A[i]
if not a or i in used:
continue
j = a[0]
b = A[j]
if not b or j in used:
continue
if i == b[0]:
A[i].popleft()
A[j].popleft()
used.add(i)
used.add(j)
if not used:
ans = -1
break
used_prev = used
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02925 |
from collections import deque
n = int(eval(input()))
lst = [deque(list(map(int, input().split()))) for _ in range(n)]
current = []
for i in range(n):
current.append(lst[i].popleft())
count = 0
players = set(range(1, n+1))
while True:
index_lst = []
for i in players:
candidate = current[i-1]
if candidate == 0:
continue
if current[candidate-1] == i:
index_lst += [i, candidate]
if len(index_lst) == 0:
if sum(current) == 0:
print(count)
break
else:
print((-1))
break
for i in set(index_lst):
if len(lst[i-1]) == 0:
current[i-1] = 0
else:
current[i-1] = lst[i-1].popleft()
players = index_lst
count += 1 | from collections import deque
n = int(eval(input()))
lst = [deque(list(map(int, input().split()))) for _ in range(n)]
current = []
for i in range(n):
current.append(lst[i].popleft())
count = 0
players = set(range(1, n+1))
while True:
index_lst = []
for i in players:
candidate = current[i-1]
if candidate in index_lst:
continue
if current[candidate-1] == i:
index_lst += [i, candidate]
if len(index_lst) == 0:
if sum(current) == 0:
print(count)
break
else:
print((-1))
break
for i in index_lst:
if len(lst[i-1]) == 0:
current[i-1] = 0
else:
current[i-1] = lst[i-1].popleft()
players = set(index_lst)
count += 1 | p02925 |
import sys
from collections import deque
input = lambda: sys.stdin.readline().rstrip()
def solve():
N = int(eval(input()))
A = [[] for _ in range(N)]
for i in range(N):
A[i] = list([int(x) - 1 for x in input().split()])
# print(A)
days = 0
ta = [i for i in range(N)]
while True:
ta2 = []
aset = set()
for i in ta:
if len(A[i]) == 0 or i in aset:
continue
if i == A[A[i][0]][0]:
ta2.append(i)
ta2.append(A[i][0])
aset |= set([i])
aset |= set([A[i][0]])
if len(ta2) > 0:
for t in ta2:
A[t].pop(0)
days += 1
ta = ta2
else:
break
empty = True
for i in range(N):
if len(A[i]) != 0:
empty = False
break
if empty:
print(days)
else:
print((-1))
if __name__ == '__main__':
solve()
| import sys
from collections import deque
input = lambda: sys.stdin.readline().rstrip()
def solve():
N = int(eval(input()))
A = [deque for _ in range(N)]
for i in range(N):
A[i] = deque(list([int(x) - 1 for x in input().split()]))
days = 0
ta = [i for i in range(N)]
while True:
ta2 = []
aset = set()
for i in ta:
if len(A[i]) == 0 or i in aset:
continue
if i == A[A[i][0]][0]:
ta2.append(i)
ta2.append(A[i][0])
aset |= set([i])
aset |= set([A[i][0]])
if len(ta2) > 0:
for t in ta2:
A[t].popleft()
days += 1
ta = ta2
else:
break
empty = True
for i in range(N):
if len(A[i]) != 0:
empty = False
break
if empty:
print(days)
else:
print((-1))
if __name__ == '__main__':
solve()
| p02925 |
import sys
input = sys.stdin.readline
from collections import deque
N = int(eval(input()))
A = [deque(list(map(int, input().split()))) for _ in range(N)]
q = []
def check(x):
if len(A[x]) == 0: return
tmp = A[x][0]-1
if A[tmp][0]-1 == x:
if tmp < x: x,tmp=tmp,x
q.append([x,tmp])
return
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
q = get_unique_list(q)
prevQ=[]
prevQ,q=q,prevQ
for i in range(len(prevQ)):
x,y=prevQ[i]
A[x].popleft()
A[y].popleft()
for i in range(len(prevQ)):
x,y=prevQ[i]
check(x)
check(y)
for i in range(N):
if len(A[i]) != 0:
print((-1))
sys.exit()
print(day)
| import sys
input = sys.stdin.readline
from collections import deque
N = int(eval(input()))
A = [deque(list(map(int, input().split()))) for _ in range(N)]
q = []
def check(x):
if len(A[x]) == 0: return
tmp = A[x][0]-1
if A[tmp][0]-1 == x:
if tmp < x: x,tmp=tmp,x
q.append((x,tmp))
return
for i in range(N):
check(i)
day = 0
while len(q) > 0:
day+=1
q = list(set(q))
prevQ=[]
prevQ,q=q,prevQ
for i in range(len(prevQ)):
x,y=prevQ[i]
A[x].popleft()
A[y].popleft()
for i in range(len(prevQ)):
x,y=prevQ[i]
check(x)
check(y)
for i in range(N):
if len(A[i]) != 0:
print((-1))
sys.exit()
print(day)
| p02925 |
#!/usr/bin/env python3
#ABC139 E
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
a = [deque() for _ in range(n)]
for i in range(1,n+1):
x = LI()
for j in x:
a[i-1].append((i,j))
ans = 0
for j in range(n*(n-1)//2):
check = [1]*n
flg = False
flg2 = False
for i in range(n):
if len(a[i]) == 0 or check[i] == 0:
continue
(x,y) = a[i].popleft()
flg2 = True
check[i] = 0
if a[y-1][0] == (y,x) and check[y-1]:
a[y-1].popleft()
flg = True
check[y-1] = 0
else:
a[i].appendleft((x,y))
if flg:
ans += 1
if not flg2:
print(ans)
quit()
for i in a:
if len(i) != 0:
print((-1))
quit()
print((n*(n-1)//2))
| #!/usr/bin/env python3
#ABC139 E
import sys
import math
import bisect
import time
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
a = [deque() for _ in range(n)]
for i in range(1,n+1):
x = LI()
for j in x:
a[i-1].append((i,j))
ans = 0
s = time.time()
for j in range(n*(n-1)//2):
check = [1]*n
flg = False
flg2 = False
if time.time() - s > 1.6:
print((n*(n-1)//2))
quit()
for i in range(n):
if len(a[i]) == 0 or check[i] == 0:
continue
(x,y) = a[i].popleft()
flg2 = True
check[i] = 0
if a[y-1][0] == (y,x) and check[y-1]:
a[y-1].popleft()
flg = True
check[y-1] = 0
else:
a[i].appendleft((x,y))
if flg:
ans += 1
if not flg2:
print(ans)
quit()
for i in a:
if len(i) != 0:
print((-1))
quit()
print(ans)
| p02925 |
import sys
input = sys.stdin.readline
from collections import deque
def main():
N = int( eval(input()))
A = [ deque( list(map( int, input().split()))) for _ in range(N)]
cnt = N*(N-1)
days = 0
W = [False]*N
while cnt > 0:
days += 1
now = cnt
V = [0]*N
for i in range(N):
if V[i] == 1 or W[i]:
continue
a = A[i][0]
a -= 1
if V[a] == 1 or W[a]:
continue
if i+1 == A[a][0]:
V[a] = 1
V[i] = 1
A[a].popleft()
A[i].popleft()
if not A[a]:
W[a] = True
if not A[i]:
W[i] = True
cnt -= 2
if now == cnt:
print((-1))
return
print( days)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
from collections import deque
def main():
N = int( eval(input()))
A = [deque()] + [deque( list(map( int, input().split()))) for _ in range(N)]
Days = [0]*(N+1)
NOW = [0]*(N+1)
# for i in range(1, N+1):
# a = A[i].popleft()
# if NOW[a] == i:
# Days[a] = Days[i] = max(Days[a], Days[i])
q = deque( [ i+1 for i in range(N)])
while q:
i = q.popleft()
if not A[i]:
continue
a = A[i].popleft()
if NOW[a] == i:
Days[a] = Days[i] = max(Days[a], Days[i])+1
q.append(i)
q.append(a)
NOW[a] = NOW[i] = 0
else:
NOW[i] = a
for i in range(1,N+1):
if A[i]:
print((-1))
return
print(( max(Days)))
if __name__ == '__main__':
main()
| p02925 |
import sys
N=int(eval(input()))
amat=[[-1]]
for i in range(N):
alist=list(map(int,input().split()))
amat.append(list(reversed(alist)))
#print(amat)
answer=0
matched_flag=[False]*(N+1)
for answer in range(1,N**3):
if N>900 and answer>5000:
print((N*(N-1)//2))
sys.exit()
matched_flag=[False]*(N+1)
unchanged=True
for i in range(1,N+1):
if matched_flag[i] or len(amat[i]) == 0:
continue
ai_next = amat[i][-1]
if amat[ai_next][-1]==i and not matched_flag[ai_next]:
#print(i,ai_next,answer)
matched_flag[amat[i].pop()]=True
matched_flag[amat[ai_next].pop()]=True
unchanged=False
if unchanged:
print((-1))
sys.exit()
else:
for i in range(1,N+1):
if len(amat[i])>0:
break
else:
print(answer)
sys.exit()
| import sys
N=int(eval(input()))
amat=[[-1]]
for i in range(N):
alist=list(map(int,input().split()))
amat.append(list(reversed(alist)))
#print(amat)
answer=0
matched_flag=[False]*(N+1)
for answer in range(1,N**3):
if N>900 and answer>3000:
print((N*(N-1)//2))
sys.exit()
matched_flag=[False]*(N+1)
unchanged=True
for i in range(1,N+1):
if matched_flag[i] or len(amat[i]) == 0:
continue
ai_next = amat[i][-1]
if amat[ai_next][-1]==i and not matched_flag[ai_next]:
#print(i,ai_next,answer)
matched_flag[amat[i].pop()]=True
matched_flag[amat[ai_next].pop()]=True
unchanged=False
if unchanged:
print((-1))
sys.exit()
else:
for i in range(1,N+1):
if len(amat[i])>0:
break
else:
print(answer)
sys.exit()
| p02925 |
import sys
N=int(eval(input()))
amat=[[-1]]
for i in range(N):
alist=list(map(int,input().split()))
amat.append(list(reversed(alist)))
#print(amat)
cleared_num=0
new_search_index=set(range(1,N+1))
for answer in range(1,N**3):
matched_flag=[False]*(N+1)
unchanged=True
search_index=new_search_index;
new_search_index=set()
for i in search_index:
if matched_flag[i]:
continue
ai_next = amat[i][-1]
if amat[ai_next][-1]==i and not matched_flag[ai_next]:
#print(i,ai_next,answer)
matched_flag[amat[i].pop()]=True
matched_flag[amat[ai_next].pop()]=True
if len(amat[i])==0:
cleared_num+=1
else:
new_search_index.add(i)
if len(amat[ai_next])==0:
cleared_num+=1
else:
new_search_index.add(ai_next)
unchanged=False
if unchanged:
print((-1))
sys.exit()
elif cleared_num==N:
print(answer)
sys.exit() | import sys
N=int(eval(input()))
amat=[[-1]]
for i in range(N):
alist=list(map(int,input().split()))
amat.append(list(reversed(alist)))
#print(amat)
cleared_num=0
new_search_index=set(range(1,N+1))
for answer in range(1,N**3):
matched_set=set()
unchanged=True
search_index=new_search_index;
new_search_index=set()
for i in search_index:
if i in matched_set:
continue
ai_next = amat[i][-1]
if amat[ai_next][-1]==i and not ai_next in matched_set:
#print(i,ai_next,answer)
matched_set.add(amat[i].pop())
matched_set.add(amat[ai_next].pop())
if len(amat[i])==0:
cleared_num+=1
else:
new_search_index.add(i)
if len(amat[ai_next])==0:
cleared_num+=1
else:
new_search_index.add(ai_next)
unchanged=False
if unchanged:
print((-1))
sys.exit()
elif cleared_num==N:
print(answer)
sys.exit() | p02925 |
import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1100000)
N = int(eval(input()))
side = [[[]for _ in range(N)]for _ in range(N)]
node = [[1]*N for i in range(N)]
for i in range(N):
A = list(map(int,input().split()))
for j in range(N-2):
a,b = min(i,A[j]-1),max(i,A[j]-1)
c,d = min(i,A[j+1]-1),max(i,A[j+1]-1)
side[a][b].append([c,d])
node[c][d] = 0
def DFS(x,y,l):
if l > N**2:
print((-1))
exit()
ret = l
for i,j in side[x][y]:
ret = max(ret, DFS(i,j,l+1))
return ret
ans = 0
for i in range(N):
for j in range(i+1,N):
if node[i][j]:
ans = max(DFS(i,j,1),ans)
if ans:
print(ans)
else:
print((-1))
| N = int(eval(input()))
A = list(list(map(int,input().split()))for _ in range(N))
c = [0]*(N)
p = []
for i in range(N):
j = A[i][c[i]]-1
if i == A[j][c[j]]-1 and i < j:
p.append((i,j))
ans = 0
while p:
q = []
for i,j in p:
c[i] += 1
c[j] += 1
if c[i] < N-1:
k = A[i][c[i]]-1
if A[k][c[k]]-1 == i:
q.append((i,k))
if c[j] < N-1:
k = A[j][c[j]]-1
if A[k][c[k]]-1 == j:
q.append((j,k))
ans += 1
p = q[:]
if min(c) != N-1:
print((-1))
else:
print(ans)
| p02925 |
n = int(eval(input()))
a = [0] * (n+1)
for i in range(n):
a[i+1] = tuple(map(int, input().split()))
from queue import Queue
todo = [0] * (n+1)
matched = Queue()
for i in range(1, n+1):
matched.put(i)
days = 0
while True:
update = []
while matched.empty() == False:
i = matched.get()
if todo[i] < n - 1 and i not in update:
p = a[i][todo[i]]
if a[p][todo[p]] == i:
update.append(i)
update.append(p)
for j in update:
todo[j] += 1
matched.put(j)
days += 1
#print(todo)
if update == []:
days = -1
break
elif todo[1:] == [n - 1] * n:
break
print(days)
| n = int(eval(input()))
a = []
for _ in range(n+1):
a.append([-1])
for i in range(n):
inp = list(map(int, input().split()))
for j in range(n-2, -1, -1):
a[i+1].append(inp[j])
matched = [i for i in range(1, n+1)]
finish = 0
days = 0
while True:
used = set()
while matched != []:
i = matched.pop()
p = a[i][-1]
if p != -1 and a[p][-1] == i and (i not in used) and (p not in used) :
a[i].pop()
a[p].pop()
used.add(i)
used.add(p)
if a[i][-1] == -1:
finish += 1
if a[p][-1] == -1:
finish += 1
days += 1
matched = list(used)
if len(used) == 0:
days = -1
break
elif finish == n:
break
print(days)
| p02925 |
import sys, time
def input():
return sys.stdin.readline()[:-1]
n = int(eval(input()))
a = [list(map(int, input().split()))[::-1] for _ in range(n)]
#print(*a, sep="\n")
opponent = [-1 for _ in range(n)]
played = list(range(n))
match = 0
day = 0
while match < n*(n-1)//2:
approved = False
for i in played:
if a[i] != []:
opponent[i] = a[i].pop()-1
played = []
#print(opponent)
for i in range(n):
if opponent[i] != -1 and opponent[opponent[i]] == i:
approved = True
match += 1
played += [i, opponent[i]]
opponent[opponent[i]] = -1
opponent[i] = -1
#print(opponent)
if not approved:
print((-1))
sys.exit()
day += 1
print(day) | import sys, time
def input():
return sys.stdin.readline()[:-1]
n = int(eval(input()))
a = [list(map(int, input().split()))[::-1] for _ in range(n)]
#print(*a, sep="\n")
opponent = [-1 for _ in range(n)]
played = list(range(n))
match = 0
day = 0
while match < n*(n-1)//2:
approved = False
for i in played:
if a[i] != []:
opponent[i] = a[i].pop()-1
played_next = []
#print(opponent)
for i in played:
if opponent[i] != -1 and opponent[opponent[i]] == i:
approved = True
match += 1
played_next += [i, opponent[i]]
opponent[opponent[i]] = -1
opponent[i] = -1
#print(opponent)
if not approved:
print((-1))
sys.exit()
day += 1
played = played_next
print(day) | p02925 |
n = int(eval(input()))
a = {i+1: list(map(int, input().split())) for i in range(n)}
ret = 1
while True:
pair = []
for k, v in list(a.items()):
if a[v[0]][0] == k:
pair.append(k)
for p in pair:
if len(a[p]) > 1:
a[p] = a[p][1:]
else:
a.pop(p)
if len(a) == 0:
break
if len(pair) == 0:
ret = -1
break
ret = ret + 1
print(ret) | n = int(eval(input()))
a = {i+1: list(map(int, input().split())) for i in range(n)}
ret = 1
pair = []
keys = list(a.keys())
while True:
for k in keys:
v = a[k][0]
if a[v][0] == k:
pair.append(k)
if v not in keys:
pair.append(v)
for p in pair:
if len(a[p]) > 1:
a[p] = a[p][1:]
else:
a.pop(p)
if len(a) == 0:
break
if len(pair) == 0:
ret = -1
break
ret = ret + 1
keys = [k for k in pair if k in a]
pair = []
print(ret) | p02925 |
import sys
readline = sys.stdin.readline
from collections import deque
N = int(readline())
G = [[] for i in range(N*N)]
deg = [0]*(N*N)
day = [0]*(N*N)
F = set()
for p in range(N):
*A, = list(map(int, readline().split()))
for k in range(N-1):
A[k] -= 1
prv = A[0]+p*N if A[0] < p else p+A[0]*N
F.add(prv)
for k in range(1, N-1):
i = A[k]+p*N if A[k] < p else p+A[k]*N
G[prv].append(i)
deg[i] += 1
prv = i
que = deque()
for i in F:
if deg[i] == 0:
que.append(i)
day[i] = 1
rest = N*(N-1)//2
while que:
v = que.popleft()
rest -= 1
d = day[v]
for w in G[v]:
deg[w] -= 1
if deg[w] == 0:
day[w] = day[v] + 1
que.append(w)
if rest > 0:
print((-1))
else:
print((max(day))) | import sys
from collections import deque
def solve():
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N*N)]
deg = [0]*(N*N)
day = [0]*(N*N)
F = set()
for p in range(N):
*A, = list(map(int, readline().split()))
for k in range(N-1):
A[k] -= 1
prv = A[0]+p*N if A[0] < p else p+A[0]*N
F.add(prv)
for a in A[1:]:
i = a+p*N if a < p else p+a*N
G[prv].append(i)
deg[i] += 1
prv = i
que = deque()
for i in F:
if deg[i] == 0:
que.append(i)
day[i] = 1
rest = N*(N-1)//2
pop = que.popleft
push = que.append
while que:
v = pop()
rest -= 1
d = day[v]+1
for w in G[v]:
deg[w] -= 1
if deg[w] == 0:
day[w] = d
push(w)
if rest > 0:
print((-1))
else:
print((d-1))
solve() | p02925 |
from collections import deque
import sys
input=sys.stdin.readline
def main():
a=int(eval(input()))
b=[[]for i in range(a)]
for i in range(a):
b[i]=deque(list(map(int,input().split())))
c=[[]for i in range(a)]
ans=0
d=[i for i in range(a)]
while d:
nextd=[]
f=[0 for i in range(a)]
ans+=1
T=0
for i in d:
if f[i]==0 and len(b[i])>0:
e=b[i][0]-1
if e in c[i]:
c[i].pop(c[i].index(e))
T=1
b[e].popleft()
b[i].popleft()
if len(b[i])>0:
nextd.append(i)
if len(b[e])>0:
nextd.append(e)
f[i]=1
f[e]=1
else:
c[e].append(i)
if T==0:
print((-1))
exit()
d=nextd
print(ans)
if __name__ == '__main__':
main()
| from collections import deque
import sys
input=sys.stdin.readline
def main():
a=int(eval(input()))
b=[[]for i in range(a)]
for i in range(a):
b[i]=deque(list(map(int,input().split())))
c=[[]for i in range(a)]
ans=0
d=[i for i in range(a)]
while d:
nextd=[]
f=set()
ans+=1
T=0
for i in d:
if i not in f and len(b[i])>0:
e=b[i][0]-1
if e in c[i]:
c[i].pop(c[i].index(e))
T=1
b[e].popleft()
b[i].popleft()
if len(b[i])>0:
nextd.append(i)
if len(b[e])>0:
nextd.append(e)
f|={i,e}
else:
c[e].append(i)
if T==0:
print((-1))
exit()
d=nextd
print(ans)
if __name__ == '__main__':
main()
| p02925 |
from collections import defaultdict, deque
outs = defaultdict(list)
ins = defaultdict(int)
def get_ab(h):
return h // 10000, h % 10000
def get_hash(a, b):
if a >= b:
return 10000*a + b
else:
return 10000*b + a
v = []
N = int(eval(input()))
for i in range(N):
nums = list(map(int, input().split()))
pred = get_hash(i+1, nums[0])
v.append(pred)
for j in range(len(nums)-1):
now = get_hash(i+1, nums[j+1])
outs[pred].append(now)
ins[now] += 1
pred = now
v = set(v)
q = deque(v1 for v1 in v if ins[v1] == 0)
res = []
ans = 0
before = []
while q:
v1 = q.popleft()
res.append(v1)
a, b = get_ab(v1)
if (a in before) or (b in before):
before = [a, b]
ans += 1
else:
before.append(a)
before.append(b)
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append(v2)
if len(res) < (N*(N-1)) // 2:
print((-1))
else:
print((ans+1))
| from collections import defaultdict, deque
outs = defaultdict(list)
ins = defaultdict(int)
def get_ab(h):
return h // 10000, h % 10000
def get_hash(a, b):
if a >= b:
return 10000*a + b
else:
return 10000*b + a
v = []
N = int(eval(input()))
for i in range(N):
nums = list(map(int, input().split()))
pred = get_hash(i+1, nums[0])
if pred not in v:
v.append(pred)
for j in range(len(nums)-1):
now = get_hash(i+1, nums[j+1])
outs[pred].append(now)
ins[now] += 1
pred = now
q = deque(v1 for v1 in v if ins[v1] == 0)
res = []
ans = 0
before = []
while q:
v1 = q.popleft()
res.append(v1)
a, b = get_ab(v1)
if (a in before) or (b in before):
before = [a, b]
ans += 1
else:
before.append(a)
before.append(b)
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append(v2)
if len(res) < (N*(N-1)) // 2:
print((-1))
else:
print((ans+1))
| p02925 |
from collections import deque
import copy
n = int(eval(input()))
a = [deque([int(x) - 1 for x in input().split()]) for _ in range(n)]
q = deque()
pre_q = deque()
day = 0
def check(p, q):
if not len(a[p]):
return
o = a[p][0]
if p == a[o][0]:
if p > o: p, o = o, p
if not (p, o) in q:
q.append((p, o))
fin = []
for p in range(n):
if not p in fin:
o = a[p][0]
if p == a[o][0]:
q.append((p, o))
fin += [p, o]
while q:
day += 1
pre_q = copy.copy(q)
q.clear()
for (p, o) in pre_q:
a[p].popleft()
a[o].popleft()
check(p, q)
check(o, q)
if all(map(len, a)):
print((-1))
else:
print(day) | from collections import deque
import copy, sys
input = sys.stdin.readline
n = int(eval(input()))
a = [deque([int(x) - 1 for x in input().split()]) for _ in range(n)]
q = deque()
pre_q = deque()
day = 0
def check(p, q):
if not len(a[p]):
return
o = a[p][0]
if p == a[o][0]:
if p > o: p, o = o, p
if not (p, o) in q:
q.append((p, o))
fin = []
for p in range(n):
if not p in fin:
o = a[p][0]
if p == a[o][0]:
q.append((p, o))
fin += [p, o]
while q:
day += 1
pre_q = copy.copy(q)
q.clear()
for (p, o) in pre_q:
a[p].popleft()
a[o].popleft()
check(p, q)
check(o, q)
if all(map(len, a)):
print((-1))
else:
print(day)
| p02925 |
import queue
def make_state(N):
state = [[-1 for j in range(N+1)] for i in range(N+1)]
min_state = 0
s = min_state
for i in range(1, N+1):
for j in range(1, i):
state[i][j] = s
state[j][i] = s
s += 1
return state
def solve(N, A):
state = make_state(N)
max_state = N * (N-1) // 2
n_prev_states = [0 for i in range(max_state)]
next_states = [set() for i in range(max_state)]
for i in range(1, N+1):
for k in range(N-2):
ps = state[i][A[i][k]]
ns = state[i][A[i][k+1]]
n_prev_states[ns] += 1
next_states[ps].add(ns)
today_states = queue.Queue()
for s in range(max_state):
if n_prev_states[s] == 0:
today_states.put_nowait(s)
n_days = 0
n_states_left = max_state
while today_states.qsize() > 0:
n_days += 1
n_today_states = today_states.qsize()
if n_today_states == 0:
break
for _ in range(n_today_states):
s = today_states.get_nowait()
n_states_left -= 1
for ns in next_states[s]:
n_prev_states[ns] -= 1
if n_prev_states[ns] == 0:
today_states.put_nowait(ns)
return n_days if n_states_left == 0 else -1
def main():
N = int(eval(input()))
A = list()
A.append([])
for i in range(N):
a = list(map(int, input().strip().split()))
A.append(a)
print((solve(N, A)))
if __name__ == "__main__":
main()
| def make_state(N):
state = [[-1 for j in range(N+1)] for i in range(N+1)]
min_state = 0
s = min_state
for i in range(1, N+1):
for j in range(1, i):
state[i][j] = s
state[j][i] = s
s += 1
return state
def solve(N, A):
state = make_state(N)
max_state = N * (N-1) // 2
n_prev_states = [0 for i in range(max_state)]
next_states = [set() for i in range(max_state)]
for i in range(1, N+1):
for k in range(N-2):
ps = state[i][A[i][k]]
ns = state[i][A[i][k+1]]
n_prev_states[ns] += 1
next_states[ps].add(ns)
today_states = set()
for s in range(max_state):
if n_prev_states[s] == 0:
today_states.add(s)
n_days = 0
n_states_left = max_state
while len(today_states) > 0:
n_days += 1
if len(today_states) == 0:
break
n_states_left -= len(today_states)
nextday_states = set()
for s in today_states:
for ns in next_states[s]:
n_prev_states[ns] -= 1
if n_prev_states[ns] == 0:
nextday_states.add(ns)
today_states = nextday_states
return n_days if n_states_left == 0 else -1
def main():
N = int(eval(input()))
A = list()
A.append([])
for i in range(N):
a = list(map(int, input().strip().split()))
A.append(a)
print((solve(N, A)))
if __name__ == "__main__":
main()
| p02925 |
from collections import defaultdict, deque
n=int(eval(input()))
es=[]
for i in range(n):
*A,=list(map(int,input().split()))
for j in range(n-2):
a=A[j]
x,y=min(a-1,i),max(a-1,i)
ith=((n-x)+(n-1))*x//2-1+(y-x)
b=A[j+1]
x,y=min(b-1,i),max(b-1,i)
jth=((n-x)+(n-1))*x//2-1+(y-x)
es.append([ith, jth])
#print(es)
v=n*(n-1)//2
outs = defaultdict(list)
ins = defaultdict(int)
for i,j in es:
outs[i].append(j)
ins[j] += 1
#print(outs, ins)
q = deque((v1,0) for v1 in range(n*(n-1)//2) if ins[v1] == 0)
res = []
while q:
v1,cnt = q.popleft()
res.append((v1,cnt))
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append((v2,cnt+1))
x=len(res)
if x!=n*(n-1)//2:
print((-1))
else:
print((res[-1][1]+1)) | from collections import defaultdict, deque
n=int(eval(input()))
v=n*(n-1)//2
es=[[] for _ in range(v)]
for i in range(n):
*A,=list(map(int,input().split()))
for j in range(n-2):
a=A[j]
x,y=min(a-1,i),max(a-1,i)
ith=((n-x)+(n-1))*x//2-1+(y-x)
b=A[j+1]
x,y=min(b-1,i),max(b-1,i)
jth=((n-x)+(n-1))*x//2-1+(y-x)
es[ith].append(jth)
outs = defaultdict(list)
ins = defaultdict(int)
for v1 in range(v):
for v2 in es[v1]:
outs[v1].append(v2)
ins[v2] += 1
q = deque((v1,0) for v1 in range(v) if ins[v1] == 0)
res = []
while q:
v1,cnt = q.popleft()
res.append((v1,cnt))
for v2 in outs[v1]:
ins[v2] -= 1
if ins[v2] == 0:
q.append((v2,cnt+1))
x=len(res)
if x!=v:
print((-1))
else:
print((res[-1][1]+1)) | p02925 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
from collections import defaultdict, Counter, deque
from copy import copy
n = int(readline())
edge = defaultdict(list)
count = Counter()
for x in range(1, n + 1):
a = list(map(int, readline().split()))
for j in range(n - 2):
y = a[j]
z = a[j + 1]
uf, us = min(x, y), max(x, y)
vf, vs = min(x, z), max(x, z)
edge[(uf, us)].append((vf, vs))
count[(uf, us)] += 0
count[(vf, vs)] += 1
ans = 0
rem = n * (n - 1) // 2
que = deque()
for key, val in list(count.items()):
if val == 0:
que.append(key)
que_tomorrow = deque()
while rem:
ans += 1
if not que:
print((-1))
return
while que:
cur_match = que.popleft()
for nx_match in edge[cur_match]:
count[nx_match] -= 1
if count[nx_match] == 0:
que_tomorrow.append(nx_match)
rem -= 1
que = copy(que_tomorrow)
que_tomorrow.clear()
print(ans)
if __name__ == '__main__':
main()
| import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
def calc_id(x, y):
return min(x, y) * 10007 + max(x, y)
from collections import defaultdict, Counter, deque
from copy import copy
n = int(readline())
edge = defaultdict(list)
count = Counter()
for x in range(1, n + 1):
a = list(map(int, readline().split()))
count[calc_id(x, a[0])] += 0
for j in range(n - 2):
y = a[j]
z = a[j + 1]
u_id = calc_id(x, y)
v_id = calc_id(x, z)
edge[u_id].append(v_id)
count[v_id] += 1
ans = 0
rem = n * (n - 1) // 2
que = deque()
for key, val in list(count.items()):
if val == 0:
que.append(key)
que_tomorrow = deque()
while rem:
ans += 1
if not que:
print((-1))
return
while que:
cur_match = que.popleft()
for nx_match in edge[cur_match]:
count[nx_match] -= 1
if count[nx_match] == 0:
que_tomorrow.append(nx_match)
rem -= 1
que = copy(que_tomorrow)
que_tomorrow.clear()
print(ans)
if __name__ == '__main__':
main()
| p02925 |
n=int(eval(input()));a=[0]*n;l=[list(map(int,input().split()))for i in a];d=1;k=n*~-n
while sum(a)<k and d<1e4:
L=[1]*n;y=0;d+=1
for i in range(n):
if a[i]<n-1:
x=l[i][a[i]]-1
if l[x][a[x]]*L[x]*L[i]==i+1:a[i]+=1;a[x]+=1;L[i]=L[x]=0;y=1
print(([k//2,d*y-1][d*y<1e4])) | n=int(eval(input()));a=[0]*n;l=[list(map(int,input().split()))for i in a];d=1;k=n*~-n
while sum(a)<k and d<1e4:
L=[1]*n;y=0;d+=1
for i in range(n):
if-~a[i]-n:
x=l[i][a[i]]-1
if l[x][a[x]]*L[x]*L[i]==i+1:a[i]+=1;a[x]+=1;L[i]=L[x]=0;y=1
print(([k//2,d*y-1][d*y<1e4])) | p02925 |
from collections import deque
n=int(eval(input()))
lis=[[] for i in range(n*(n-1)//2)]
num=[-1]*(n**2)
cnt=-1
for x in range(n**2):
if x//n<x%n:
cnt+=1
num[x]=cnt
for i in range(n):
a=list(map(int,input().split()))
for j in range(n-2):
x=a[j]-1
y=a[j+1]-1
px=num[min(i*n+x,x*n+i)]
py=num[min(i*n+y,y*n+i)]
lis[px].append(py)
node_in=[0]*(n*(n-1)//2)
for i in range(n*(n-1)//2):
for x in lis[i]:
node_in[x]+=1
zero=deque([])
days=[10**9]*(n*(n-1)//2)
for i in range(n*(n-1)//2):
if node_in[i]==0:
zero.append(i)
days[i]=1
while zero:
r=zero.popleft()
for x in lis[r]:
node_in[x]-=1
if node_in[x]==0:
zero.append(x)
days[x]=days[r]+1
if any([x==10**9 for x in days]):
print((-1))
else:
print((max(days)))
| def main():
from collections import deque
n=int(eval(input()))
battle=n*(n-1)//2
lis=[[] for i in range(battle)]
num=[-1]*(n**2)
cnt=-1
for x in range(n**2):
if x//n<x%n:
cnt+=1
num[x]=cnt
for i in range(n):
a=list(map(int,input().split()))
for j in range(n-2):
x=a[j]-1
y=a[j+1]-1
px=num[min(i*n+x,x*n+i)]
py=num[min(i*n+y,y*n+i)]
lis[px].append(py)
node_in=[0]*(battle)
for i in range(battle):
for x in lis[i]:
node_in[x]+=1
zero=deque([])
days=[10**9]*(battle)
for i in range(battle):
if node_in[i]==0:
zero.append(i)
days[i]=1
while zero:
r=zero.popleft()
for x in lis[r]:
node_in[x]-=1
if node_in[x]==0:
zero.append(x)
days[x]=days[r]+1
if 10**9 in days:
print((-1))
else:
print((max(days)))
if __name__ == '__main__':
main() | p02925 |
from collections import deque
N=int(eval(input()))
A=[list(map(int,input().split())) for _ in range(N)]
A=list([deque(x) for x in A])
#print(A)
ans=0
L=[]
for i in range(N):
L.append(len(A[i]))
#print(L)
while 1:
P=[0]*N
sw=0
C=[]
for i in range(N):
if L[i]:
if i+1==A[A[i][0]-1][0]:
P[i]=1
C.append(i)
sw=1
#print(P)
if sw:
for c in C:
if P[c]:
A[c].popleft()
L[c]-=1
ans+=1
else:
tmp=0
for a in A:
tmp+=len(a)
if tmp!=0:
ans=-1
break
print(ans)
| import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = [[]] + [list(map(int, input().split()))[::-1] for _ in range(N)]
pair = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
stack = []
for i in range(1, N + 1):
a = A[i].pop()
pair[i][a] += 1
if pair[i][a] == pair[a][i] == 1:
stack.append(i)
stack.append(a)
r = []
answer = 1
while stack:
while stack:
i = stack.pop()
if A[i]:
a = A[i].pop()
pair[i][a] += 1
if pair[i][a] == pair[a][i] == 1:
r.append(i)
r.append(a)
stack = r
if r:
answer += 1
r = []
flag = 1
for i in range(1, N + 1):
if A[i]:
flag = 0
break
if flag:
print(answer)
else:
print((-1)) | p02925 |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
c = [[int(i)-1 for i in input().split()] for j in range(N)]
from collections import defaultdict
edge = defaultdict(set)
deg = defaultdict(int)
for i, A in enumerate(c):
for j in range(N-2):
if i < A[j]:
if i < A[j+1]:
edge[(i, A[j])].add((i, A[j+1]))
deg[(i, A[j+1])] += 1
else:
edge[(i, A[j])].add((A[j+1], i))
deg[(A[j+1], i)] += 1
else:
if i < A[j+1]:
edge[(A[j], i)].add((i, A[j+1]))
deg[(i, A[j+1])] += 1
else:
edge[(A[j], i)].add((A[j+1], i))
deg[(A[j+1], i)] += 1
from collections import deque
que = deque()
dist = defaultdict(int)
for i in range(N):
for j in range(i+1, N):
if deg[(i, j)] == 0:
que.append((i, j)) # root
dist[(i, j)] = 1
while que:
u = que.popleft()
for v in edge[u]:
deg[v] -= 1
dist[v] = max(dist[v], dist[u] + 1)
if deg[v] == 0:
que.append(v)
if any(deg.values()):
# 閉路検出
print((-1))
else:
print((max(dist.values())))
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
c = [[int(i) for i in input().split()] for j in range(N)]
from collections import defaultdict
edge = defaultdict(set)
deg = defaultdict(int)
for i, A in enumerate(c, start=1):
for j in range(N-2):
if i < A[j]:
if i < A[j+1]:
edge[i*N+A[j]].add(i*N+A[j+1])
deg[i*N+A[j+1]] += 1
else:
edge[i*N+A[j]].add(A[j+1]*N+i)
deg[A[j+1]*N+i] += 1
else:
if i < A[j+1]:
edge[A[j]*N+i].add(i*N+A[j+1])
deg[i*N+A[j+1]] += 1
else:
edge[A[j]*N+i].add(A[j+1]*N+i)
deg[A[j+1]*N+i] += 1
from collections import deque
que = deque()
dist = defaultdict(int)
for i in range(1, N+1):
for j in range(i+1, N+1):
# print(i, j, i*N+j)
if deg[i*N+j] == 0:
que.append(i*N+j) # root
dist[i*N+j] = 1
while que:
u = que.popleft()
for v in edge[u]:
deg[v] -= 1
dist[v] = max(dist[v], dist[u] + 1)
if deg[v] == 0:
que.append(v)
if any(deg.values()):
# 閉路検出
print((-1))
else:
print((max(dist.values())))
if __name__ == '__main__':
main()
| p02925 |
def main():
N = int(eval(input()))
A = []
for _ in range(N):
a = list(map(int, input().split()))
a = [i-1 for i in a]
a.reverse()
A.append(a)
t = []
d = 0
n = set(range(N))
while True:
p = 0
l = set()
d += 1
for i in n:
if A[i] == [] or i in l:
continue
j = A[i][-1]
if A[i][-1] not in l and A[j][-1] == i:
l.add(i)
l.add(A[i][-1])
A[j] = A[j][:-1]
A[i] = A[i][:-1]
p += 1
n = l
if p == 0:
print((-1))
break
if sum([len(i) for i in A]) == 0:
print(d)
break
main()
| def main():
N = int(eval(input()))
A = []
for _ in range(N):
a = list(map(int, input().split()))
a = [i-1 for i in a]
a.reverse()
A.append(a)
t = N * (N - 1) / 2
d = 0
n = set(range(N))
while True:
p = 0
l = set()
d += 1
for i in n:
if A[i] == [] or i in l:
continue
j = A[i][-1]
if A[i][-1] not in l and A[j][-1] == i:
l.add(i)
l.add(A[i][-1])
A[j].pop()
A[i].pop()
t -= 1
p += 1
n = l
if t == 0:
print(d)
break
if p == 0:
print((-1))
break
main()
| p02925 |
#import numpy as np
n = int(eval(input()))
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
#print(A)
S = [0 for i in range(n)]
F = [[0 for i in range(n)] for j in range(2*n*n)]
n1n = n*(n-1)
d = 0
for ii in range(n*n*2):
co = 0
i = 0
ga = 0
while co < n:
if F[ii][i] == 0 and S[i] <= n-2:
aite = A[i][S[i]]
#print(S)
#print("aite",aite)
if aite < n and A[aite][S[aite]] == i and F[ii][aite] == 0:
#print("g", i, aite)
S[i] += 1
S[aite] += 1
F[ii][i] = 1
F[ii][aite] = 1
co = 0
ga += 1
i = (i-1) % n
co += 1
d += 1
#print("d", d)
if ga == 0:
if sum(S) == n1n:
print((d-1))
else:
print((-1))
break
| #import numpy as np
n = int(eval(input()))
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
#print(A)
S = [0 for i in range(n)]
#F = [[0 for i in range(n)] for j in range(2*n*n)]
n1n = n*(n-1)
d = 0
for ii in range(n*n*2):
F = [0 for i in range(n)]
co = 0
i = 0
ga = 0
for jj in range(n*n*2):
if F[i] == 0 and S[i] <= n-2:
aite = A[i][S[i]]
#print(S)
#print("aite",aite)
if aite < n and A[aite][S[aite]] == i and F[aite] == 0:
#print("g", i, aite)
S[i] += 1
S[aite] += 1
F[i] = 1
F[aite] = 1
co = 0
ga += 1
i = (i+1) % n
co += 1
if co == n-1:
break
d += 1
#print("d", d)
if ga == 0:
if sum(S) == n1n:
print((d-1))
else:
print((-1))
break
| p02925 |
import itertools
n = int(eval(input()))
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
taisen = list(itertools.combinations(list(range(n)), 2))
taisen_dic = {}
for i in range(len(taisen)):
taisen_dic[taisen[i]] = i
B = [[0] * (n-1) for i in range(n)]
for i in range(n):
for j in range(n-1):
key0, key1 = min(i, A[i][j]), max(i, A[i][j])
B[i][j] = taisen_dic[(key0, key1)]
#print(B)
nn = len(taisen)
G = [[] for i in range(nn)]
for i in range(n):
for j in range(n-2):
G[B[i][j]].append(B[i][j+1])
#print(G)
S = [[i, 0] for i in range(nn)]
D = [-1] * nn
dis = 0
while len(S) > 0 and dis <= nn:
now = S.pop()
now0 = now[0]
dis = now[1]
if dis > D[now0]:
D[now0] = dis
for i in G[now0]:
if dis+1 > D[i]:
S.append([i, dis+1])
#print(S)
if dis > nn:
print((-1))
else:
print((max(D) + 1)) | import sys
input = sys.stdin.readline
n = int(eval(input()))
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
AA = [[j for j in i] for i in A]
ID = [[-1] * n for i in range(n)]
id_ = 0
for i in range(n):
for j in range(i+1,n):
ID[i][j] = id_
ID[j][i] = id_
id_ += 1
for i in range(n):
for j in range(n-1):
A[i][j] = ID[i][A[i][j]]
M = [[] for i in range(id_)]
IN = [0] * id_
for i in range(n):
for j in range(n-2):
M[A[i][j]].append(A[i][j+1])
IN[A[i][j+1]] +=1
# print(A)
# print(M)
# 以下、トポロジカルソート
S = []
s = 0
for i in range(id_):
if IN[i] == 0:
S.append(i)
while s < len(S):
for x in M[S[s]]:
IN[x] -= 1
# print(x,IN)
if IN[x] == 0:
S.append(x)
s += 1
# print(S)
if len(S) < id_:
print((-1))
else:
T = [1] * id_
for i in range(id_):
for j in M[S[i]]:
T[j] = max(T[j], T[S[i]] + 1)
print((max(T)))
# 以下、閉路検出(今は削除)
# V = [0] * id_
# S = [0]
# V[0] = 1
# import sys
# def visit(x):
# if V[x] == 1:
# print(-1)
# sys.exit()
# elif V[x] == 0:
# V[x] = 1
# for i in M[x]:
# visit(i)
# V[x] = 2
# for i in range(id_):
# if V[i] == 0:
# visit(i)
# print("heironasi")
# 閉路検出ここまで
| p02925 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
ans = 0
A = [list(reversed(a)) for a in A]
s = Counter()
for i in range(1, N+1):
if A[i-1]:
d = A[i-1][-1]
n = (min(i, d), max(i, d))
s[n] += 1
while True:
c = 0
dell = []
adding = []
for k, v in s.items():
if v == 1:
continue
a, b = k
A[a-1].pop()
if A[a-1]:
d = A[a-1][-1]
n = (min(a, d), max(a, d))
adding.append(n)
A[b-1].pop()
if A[b-1]:
d = A[b-1][-1]
n = (min(b, d), max(b, d))
adding.append(n)
dell.append(k)
c += 1
for k in dell:
s.pop(k)
for k in adding:
s[k] += 1
if c == 0:
break
else:
ans += 1
for a in A:
if a:
return -1
return ans
def main():
N = read_int()
A = [read_int_n() for _ in range(N)]
print(slv(N, A))
# N = 1000
# A = []
# while True:
# for i in range(1, N+1):
# t = list(range(1, N+1))
# t.remove(i)
# random.shuffle(t)
# A.append(t)
# print(slv(N, A))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
ans = 0
A = [list(reversed(a)) for a in A]
s1 = set()
s2 = set()
for i in range(1, N+1):
if A[i-1]:
d = A[i-1][-1]
n = (min(i, d), max(i, d))
if n not in s1:
s1.add(n)
else:
s2.add(n)
s1.remove(n)
while True:
c = 0
dell = []
adding = []
for k in s2:
a, b = k
A[a-1].pop()
if A[a-1]:
d = A[a-1][-1]
n = (min(a, d), max(a, d))
adding.append(n)
A[b-1].pop()
if A[b-1]:
d = A[b-1][-1]
n = (min(b, d), max(b, d))
adding.append(n)
dell.append(k)
c += 1
for k in dell:
s2.remove(k)
for k in adding:
if k in s1:
s2.add(k)
s1.remove(k)
else:
s1.add(k)
if c == 0:
break
else:
ans += 1
for a in A:
if a:
return -1
return ans
def main():
N = read_int()
A = [read_int_n() for _ in range(N)]
print(slv(N, A))
# N = 1000
# A = []
# while True:
# for i in range(1, N+1):
# t = list(range(1, N+1))
# t.remove(i)
# random.shuffle(t)
# A.append(t)
# print(slv(N, A))
if __name__ == '__main__':
main()
| p02925 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
g = defaultdict(list)
rg = defaultdict(set)
V = set()
def ij2v(i, j):
if i > j:
i, j = j, i
return i * 10**6 + j
for i, a in enumerate(A, start=1):
for j in range(len(a)-1):
u = ij2v(i, a[j])
v = ij2v(i, a[j+1])
g[u].append(v)
rg[v].add(u)
V.add(u)
V.add(v)
s = []
for v in V:
if rg[v]:
pass
else:
s.append(v)
done = set(s)
ans = 0
while s:
ans += 1
ns = []
for u in s:
for v in g[u]:
if v in done:
continue
rg[v].remove(u)
if len(rg[v]) == 0:
ns.append(v)
done.add(v)
s = ns
if len(done) != N * (N-1) // 2:
return -1
return ans
def main():
N = read_int()
A = [read_int_n() for _ in range(N)]
print(slv(N, A))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
g = defaultdict(list)
rg = defaultdict(set)
V = set()
def ij2v(i, j):
if i > j:
i, j = j, i
return i * 10**6 + j
for i, a in enumerate(A, start=1):
for j in range(len(a)-1):
u = ij2v(i, a[j])
v = ij2v(i, a[j+1])
g[u].append(v)
rg[v].add(u)
V.add(u)
V.add(v)
s = []
for v in V:
if not rg[v]:
s.append(v)
done = set(s)
ans = 0
while s:
ans += 1
ns = []
for u in s:
for v in g[u]:
if v in done:
continue
rg[v].remove(u)
if len(rg[v]) == 0:
ns.append(v)
done.add(v)
s = ns
if len(done) != N * (N-1) // 2:
return -1
return ans
def main():
N = read_int()
A = [read_int_n() for _ in range(N)]
print(slv(N, A))
if __name__ == '__main__':
main()
| p02925 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
g = defaultdict(list)
rg = defaultdict(set)
V = set()
def ij2v(i, j):
if i > j:
i, j = j, i
return i * 10**6 + j
for i, a in enumerate(A, start=1):
for j in range(len(a)-1):
u = ij2v(i, a[j])
v = ij2v(i, a[j+1])
g[u].append(v)
rg[v].add(u)
V.add(u)
V.add(v)
s = []
for v in V:
if not rg[v]:
s.append(v)
done = len(s)
ans = 0
while s:
ans += 1
ns = []
for u in s:
for v in g[u]:
# if v in done:
# continue
rg[v].remove(u)
if len(rg[v]) == 0:
ns.append(v)
done += 1
s = ns
if done != N * (N-1) // 2:
return -1
return ans
def main():
N = read_int()
A = [read_int_n() for _ in range(N)]
print(slv(N, A))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
from collections import Counter, defaultdict
import sys
# sys.setrecursionlimit(10**6)
readline = sys.stdin.buffer.readline
# readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
g = defaultdict(list)
rg = defaultdict(set)
V = set()
def ij2v(i, j):
if i > j:
i, j = j, i
return i * 10**6 + j
for i, a in enumerate(A, start=1):
for j in range(len(a)-1):
u = ij2v(i, a[j])
v = ij2v(i, a[j+1])
g[u].append(v)
rg[v].add(u)
V.add(u)
V.add(v)
s = []
for v in V:
if not rg[v]:
s.append(v)
done = len(s)
ans = 0
while s:
ans += 1
ns = []
for u in s:
for v in g[u]:
# if v in done:
# continue
rg[v].remove(u)
if len(rg[v]) == 0:
ns.append(v)
done += 1
s = ns
if done != N * (N-1) // 2:
return -1
return ans
def main():
N = read_int()
A = [read_int_n() for _ in range(N)]
print(slv(N, A))
if __name__ == '__main__':
main()
| p02925 |
import sys
from collections import defaultdict, deque
def dfs(root, links):
pending = set()
ans = 0
q = [(r, 0, 1) for r in root]
while q:
node = q.pop()
if node[1] == 0:
v, _, d = node
ans = max(ans, d)
q.append((v, 1))
pending.add(v)
d += 1
for u in links[v]:
if u in pending:
return False
q.append((u, 0, d))
else:
pending.remove(node[0])
return ans
n = int(eval(input()))
links = defaultdict(set)
may_root = set()
in_cnt = defaultdict(lambda: 0)
for i, line in enumerate(sys.stdin):
aaa = list(map(int, line.split()))
j = aaa[0] - 1
a, b = (i, j) if i < j else (j, i)
prev = a * 1000 + b
may_root.add(prev)
for j in aaa[1:]:
j -= 1
a, b = (i, j) if i < j else (j, i)
key = a * 1000 + b
links[prev].add(key)
in_cnt[key] += 1
prev = key
may_root = {r for r in may_root if in_cnt[r] == 0}
if not may_root:
print((-1))
exit()
ans = dfs(may_root, links)
if ans == False:
print((-1))
exit()
print(ans)
| import sys
from collections import defaultdict
def dfs(root, links):
status = {}
topological = []
q = [(r, 0, 1) for r in root]
while q:
node = q.pop()
if node[1] == 0:
v, _, d = node
q.append((v, 1))
status[v] = 1
d += 1
for u in links[v]:
if u in status:
if status[u] == 1:
return False
else:
q.append((u, 0, d))
else:
v = node[0]
status[v] = 2
topological.append(v)
topological.reverse()
return topological
n = int(eval(input()))
links = defaultdict(set)
may_root = set()
in_cnt = defaultdict(lambda: 0)
for i, line in enumerate(sys.stdin):
aaa = list(map(int, line.split()))
j = aaa[0] - 1
a, b = (i, j) if i < j else (j, i)
prev = a * 1000 + b
may_root.add(prev)
for j in aaa[1:]:
j -= 1
a, b = (i, j) if i < j else (j, i)
key = a * 1000 + b
links[prev].add(key)
in_cnt[key] += 1
prev = key
may_root = {r for r in may_root if in_cnt[r] == 0}
if not may_root:
print((-1))
exit()
topological = dfs(may_root, links)
if topological == False:
print((-1))
exit()
ans = 0
depth = defaultdict(lambda: 1)
for v in topological:
d = depth[v] + 1
for u in links[v]:
depth[u] = max(depth[u], d)
print((max(depth.values())))
| p02925 |
import sys
from collections import deque
n = int(eval(input()))
matches = [[a - 1 for a in map(int, line.split())] for line in sys.stdin]
q = deque(list(range(n)))
depth = [0] * n
waiting = [-1] * n
while q:
a = q.popleft()
ma = matches[a]
if not ma:
continue
b = ma.pop()
if waiting[b] == a:
depth[a] = depth[b] = max(depth[a], depth[b]) + 1
q.append(a)
q.append(b)
else:
waiting[a] = b
if any(matches):
print((-1))
else:
print((max(depth)))
| import sys
from collections import deque
n = int(eval(input()))
matches = [[a - 1 for a in map(int, line.split())] for line in sys.stdin]
q = deque(list(range(n)))
depth = [0] * n
waiting = [-1] * n
while q:
a = q.popleft()
b = matches[a].pop()
if waiting[b] == a:
depth[a] = depth[b] = max(depth[a], depth[b]) + 1
if matches[a]:
q.append(a)
if matches[b]:
q.append(b)
else:
waiting[a] = b
if any(matches):
print((-1))
else:
print((max(depth)))
| p02925 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
li = [[int(x) for x in row.split()][::-1] for row in sys.stdin.readlines()]
cnt = 0
check = []
play = 0
while play < n*(n-1) // 2:
s = play
for i in range(1,n):
if i in check or len(li[i-1]) == 0:
continue
temp = li[i-1][-1]
if temp <= i:
continue
if li[temp-1][-1] == i and temp not in check:
del li[i-1][-1]
del li[temp-1][-1]
play += 1
check.append(temp)
cnt += 1
check = []
if s == play:
print((-1))
exit()
print(cnt) | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
A = [[-1] + [int(x)-1 for x in row.split()][::-1] for row in sys.stdin.readlines()]
A.append([-1])
def f(cand):
cand1 = set()
can_use = []
for n in cand:
if A[A[n][-1]][-1] == n:
can_use.append(n)
for n in can_use:
A[n].pop()
cand1.add(n)
if A[n][-1] != -1:
cand1.add(A[n][-1])
return len(can_use), cand1
answer = 0
rest = N*(N-1)
cand = set(range(N))
while True:
answer += 1
x,cand = f(cand)
if x == 0:
answer = -1
break
rest -= x
if rest == 0:
break
print(answer) | p02925 |
from sys import exit, setrecursionlimit
setrecursionlimit(1000000)
def dfs(v, dp, to):
t = dp[v]
if t >= 0:
return t
dp[v] = 0
t = 0
for u in to[v]:
res = dfs(u, dp, to)
if res == 0:
print('-1')
exit()
if res > t:
t = res
t += 1
dp[v] = t
return t
def toId(i, j, id_db):
if i < j:
return id_db[i][j]
else:
return id_db[j][i]
def main():
N = int(eval(input()))
a = [[int(e) - 1 for e in input().split()] for _ in range(N)]
id_db = [[0] * N for _ in range(N)]
dp = [-1] * (N * (N - 1) // 2)
to = [[] for _ in range(N * (N - 1) // 2)]
v = 0
for i in range(N):
for j in range(i + 1, N):
id_db[i][j] = v
v += 1
for i in range(N):
for j in range(N - 1):
a[i][j] = toId(i, a[i][j], id_db)
for j in range(N - 2):
to[a[i][j + 1]].append(a[i][j])
print((max(dfs(i, dp, to) for i in range(N * (N - 1) // 2))))
main()
| from sys import exit, setrecursionlimit
setrecursionlimit(1000000)
def dfs(v, dp, to):
t = dp[v]
if t >= 0:
return t
dp[v] = 0
t = 0
for u in to[v]:
res = dfs(u, dp, to)
if res == 0:
print('-1')
exit()
if res > t:
t = res
t += 1
dp[v] = t
return t
def toId(i, j, id_db):
if i < j:
return id_db[i][j]
else:
return id_db[j][i]
def main():
N = int(eval(input()))
a = [[int(e) - 1 for e in input().split()] for _ in range(N)]
id_db = [[0] * N for _ in range(N)]
dp = [-1] * (N * (N - 1) // 2)
to = [[] for _ in range(N * (N - 1) // 2)]
v = 0
for i in range(N):
for j in range(i + 1, N):
id_db[i][j] = v
v += 1
for i in range(N):
for j in range(N - 1):
a[i][j] = toId(i, a[i][j], id_db)
for j in range(N - 2):
to[a[i][j]].append(a[i][j + 1])
print((max(dfs(i, dp, to) for i in range(N * (N - 1) // 2))))
main()
| p02925 |
from sys import exit, setrecursionlimit
setrecursionlimit(1000000)
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * (N+1) for _ in range(N + 1)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges) for n in start_nodes)))
| from sys import exit, setrecursionlimit
setrecursionlimit(1000000)
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * (N+1) for _ in range(N + 1)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
| p02925 |
from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * (N+1) for _ in range(N + 1)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| p02925 |
from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1] * (N * (N - 1) // 2)
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| p02925 |
from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
setrecursionlimit(1000000)
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1] * (N * (N - 1) // 2)
print((max(dfs(n, edges, dp) for n in start_nodes)))
| from sys import setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1] * (N * (N - 1) // 2)
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(10 ** 6)
main()
| p02925 |
N = int(eval(input()))
A = [list([int(x)-1 for x in input().split()]) for i in range(N)]
B = [0]*N
S = 0
ans = 0
while True:
C = [0]*N
for n in range(N):
if C[n]==0 and B[n]!=N-1:
b = A[n][B[n]]
if C[b]==1: continue
if A[b][B[b]]==n:
B[n]+=1
B[b]+=1
C[n],C[b]=1,1
if sum(C)==0:break
ans +=1
print((ans if sum(B)==N*(N-1) else -1)) | import time
start = time.time()
N = int(eval(input()))
A = [list([int(x)-1 for x in input().split()]) for i in range(N)]
B = [0]*N
S = 0
ans = 0
while True:
C = [0]*N
for n in range(N):
if C[n]==0 and B[n]!=N-1:
b = A[n][B[n]]
if C[b]==1: continue
if A[b][B[b]]==n:
B[n]+=1
B[b]+=1
C[n],C[b]=1,1
if sum(C)==0:break
ans +=1
if time.time()-start>1.7:
print((N*(N-1)//2))
exit()
print((ans if sum(B)==N*(N-1) else -1)) | p02925 |
from collections import* #defaultdict Counter deque appendleft
import sys
input=sys.stdin.readline
import time
t=time.time()
def main():
n=int(eval(input()))
d=[[]]+[deque(list(map(int,input().split())))for i in n*[0]]
c=0
while any(d):
c+=1
f=0
skip=set()
for i in range(1,n+1):
if i not in skip:
if d[i]:
if d[i][0] in skip:
continue
elif i==d[d[i][0]][0]:
oppo=d[i].popleft()
d[oppo].popleft()
skip.add(oppo)
skip.add(i)
f=1
if not f:
print((-1))
exit()
if abs(time.time()-t)>1:
print((n*(n-1)//2))
print(c)
if __name__ == '__main__':
main() | from collections import* #defaultdict Counter deque appendleft
import sys
input=sys.stdin.readline
import time
t=time.time()
def main():
n=int(eval(input()))
d=[[]]+[deque(list(map(int,input().split())))for i in n*[0]]
c=0
while any(d):
c+=1
f=0
skip=set()
for i in range(1,n+1):
if i not in skip:
if d[i]:
if d[i][0] in skip:
continue
elif i==d[d[i][0]][0]:
oppo=d[i].popleft()
d[oppo].popleft()
skip.add(oppo)
skip.add(i)
f=1
if not f:
print((-1))
exit()
if abs(time.time()-t)>1:
print((n*(n-1)//2))
exit()
print(c)
if __name__ == '__main__':
main()
| p02925 |
from collections import defaultdict
N = int(eval(input()))
L = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
def make_hash(a, b):
a, b = min(a, b), max(a, b)
return N*a+b
def un_hash(n):
a = n//N
b = n % N
return a, b
from_to = defaultdict(lambda: set())
pointed = defaultdict(int)
pointing = defaultdict(int)
for i in range(N):
for node_from, node_to in zip(L[i], L[i][1:]):
#from_to[make_hash(i, node_to)].add(make_hash(i, node_from))
from_to[make_hash(i, node_from)].add(make_hash(i, node_to))
pointed[make_hash(i, node_to)] += 1
pointing[make_hash(i, node_from)] += 1
START = set()
DST = set()
for i in range(N):
for j in range(i+1, N):
h = make_hash(i, j)
pointed_i = pointed[h]
pointing_i = pointing[h]
if pointed_i == 0:
START.add(h)
if pointing_i == 0:
DST.add(h)
if len(START) == 0 or len(DST) == 0:
print((-1))
else:
Q = [v for v in START]
visited = set()
dist = 0
while Q:
tmp = []
dist += 1
for q in Q:
for nex in from_to[q]:
tmp.append(nex)
visited.add(nex)
Q = tmp
print(dist)
| from collections import deque
n = int(eval(input()))
matches = []
for _ in range(n):
matches.append(list([int(x)-1 for x in input().split()]))
q = deque(list(range(n)))
days = [0]*n # 各選手の現在の日付
pairs = [-1]*n # 次の対戦相手を管理(wait的な)
while q:
x = q.popleft() # 試合する人
if len(matches[x]) == 0: # 試合が全て終わってる?
continue
y = matches[x].pop(0) # xの次の対戦相手
if pairs[y] == x:
day = max(days[x], days[y])+1
days[x] = day
days[y] = day
q.append(x)
q.append(y)
else:
pairs[x] = y
if not any(matches): # 全ての試合をしょうか
print((max(days)))
else:
print((-1))
| p02925 |
from collections import deque
n = int(eval(input()))
matches = []
for _ in range(n):
matches.append(list([int(x)-1 for x in input().split()]))
q = deque(list(range(n)))
days = [0]*n # 各選手の現在の日付
pairs = [-1]*n # 次の対戦相手を管理(wait的な)
while q:
x = q.popleft() # 試合する人
if len(matches[x]) == 0: # 試合が全て終わってる?
continue
y = matches[x].pop(0) # xの次の対戦相手
if pairs[y] == x:
day = max(days[x], days[y])+1
days[x] = day
days[y] = day
q.append(x)
q.append(y)
else:
pairs[x] = y
if not any(matches): # 全ての試合をしょうか
print((max(days)))
else:
print((-1))
| from collections import deque
n = int(eval(input()))
matches = []
for _ in range(n):
matches.append(list([int(x)-1 for x in input().split()]))
q = deque(list(range(n)))
days = [0]*n # 各選手の現在の日付
while q:
x = q.popleft() # 試合する人
if len(matches[x]) == 0: # 試合が全て終わってる?
continue
y = matches[x][0] # xの次の対戦相手
if matches[y][0] == x:
day = max(days[x], days[y])+1
days[x] = day
days[y] = day
q.append(x)
q.append(y)
_ = matches[x].pop(0)
_ = matches[y].pop(0)
if not any(matches): # 全ての試合をしょうか
print((max(days)))
else:
print((-1))
| p02925 |
from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
game = {}
for i in range(1, n+1):
game[i] = deque((list(map(int, input().split()))))
count = 0
final = n*(n-1)//2
for day in range(1, 900000):
finish = [0]*(n+1)
possible = False
for me in range(1, n+1):
if finish[me] == 1 or game[me] == deque([]):
continue
you = game[me][0]
if finish[you] == 1:
continue
else:
if game[you][0] == me:
finish[game[you].popleft()] = 1
finish[game[me].popleft()] = 1
possible = True
count += 1
else:
continue
if not possible:
print((-1))
exit()
if count == final:
print(day)
exit()
| from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
game = {}
for i in range(1, n+1):
game[i] = deque((list(map(int, input().split()))))
count = 0
final = n*(n-1)//2
done = []
finish = [0] * (n + 1)
for me in range(1, n + 1):
if finish[me] == 1 or game[me] == deque([]):
continue
you = game[me][0]
if finish[you] == 1:
continue
else:
if game[you][0] == me:
done.append(you)
done.append(me)
finish[game[you].popleft()] = 1
finish[game[me].popleft()] = 1
possible = True
count += 1
else:
continue
for day in range(2, 1000000):
finish = [0]*(n+1)
possible = False
new_done = []
for me in done:
if finish[me] == 1 or game[me] == deque([]):
continue
you = game[me][0]
if finish[you] == 1:
continue
else:
if game[you][0] == me:
finish[game[you].popleft()] = 1
finish[game[me].popleft()] = 1
new_done.append(me)
new_done.append(you)
possible = True
count += 1
else:
continue
done = new_done
if not possible:
print((-1))
exit()
if count == final:
print(day)
exit() | p02925 |
def main():
import sys
input = sys.stdin.readline
N=int(eval(input()))
A = [list(map(int,input().split())) for _ in [0]*N]
V = {(i,j):0 for i in range(N) for j in range(i+1,N)}
Ef = {(i,j):[] for i in range(N) for j in range(i+1,N)}
for i,B in enumerate(A):
a0 = B[0]-1
k1 = (i,a0) if i<a0 else (a0,i)
for a1 in B[1:]:
a1 -= 1
k0 = k1
k1 = (i,a1) if i<a1 else (a1,i)
Ef[k0].append(k1)
V[k1] += 1
q = [k for k in V if V[k] == 0]
ans = 0
rmv = 0
while q:
qq = []
for k in q:
for k2 in Ef[k]:
V[k2] -= 1
rmv += 1
if V[k2] == 0 : qq.append(k2)
ans += 1
q = qq
if rmv != N*(N-2) : ans = -1
print(ans)
main()
| #"""
import sys
input = sys.stdin.readline
#"""
def main():
def get_key(i,j):
if i<j: i,j = j,i
return i*N+j
N=int(eval(input()))
A = [list(map(int,input().split())) for _ in [0]*N]
V = [-1]*(N*N)
for i in range(N):
for j in range(i+1,N):
V[get_key(i,j)] = 0
Ef = [[] for _ in V]
for i,B in enumerate(A):
a0 = B[0]-1
k1 = (i,a0)
for a1 in B[1:]:
a1 -= 1
k0 = k1
k1 = (i,a1)
Ef[get_key(*k0)].append(get_key(*k1))
V[get_key(*k1)] += 1
q = [i for i,v in enumerate(V) if v == 0]
ans = 0
rmv = 0
while q:
qq = []
for i in q:
for j in Ef[i]:
V[j] -= 1
rmv += 1
if V[j] == 0 : qq.append(j)
ans += 1
q = qq
if rmv != N*(N-2) : ans = -1
print(ans)
main() | p02925 |
from collections import deque, defaultdict
from time import time
N = int(eval(input()))
A = [deque([int(a) - 1 for a in input().split()]) for _ in range(N)]
S = time()
canBattle = defaultdict(lambda: False)
D = [0] * N
while True:
isChanged = False
for i, a in enumerate(A):
if not a:
continue
j = a[0]
canBattle[(i, j)] = True
if canBattle[(j, i)]:
isChanged = True
A[i].popleft()
A[j].popleft()
d = max(D[i], D[j])
D[i], D[j] = d + 1, d + 1
if all(len(a) == 0 for a in A):
print((max(D)))
exit()
if time() - S >= 1.800:
print((N * (N - 1) // 2))
exit()
if not isChanged:
break
print((-1))
| from collections import deque, defaultdict
from time import time
S = time()
N = int(eval(input()))
A = [deque([int(a) - 1 for a in input().split()]) for _ in range(N)]
canBattle = defaultdict(lambda: False)
D = [0] * N
while True:
isChanged = False
for i, a in enumerate(A):
if not a:
continue
j = a[0]
canBattle[(i, j)] = True
if canBattle[(j, i)]:
isChanged = True
A[i].popleft()
A[j].popleft()
d = max(D[i], D[j])
D[i], D[j] = d + 1, d + 1
if all(len(a) == 0 for a in A):
print((max(D)))
exit()
if time() - S >= 1.700:
print((N * (N - 1) // 2))
exit()
if not isChanged:
break
print((-1))
| p02925 |
from collections import deque, defaultdict
N = int(eval(input()))
A = [deque([int(a) - 1 for a in input().split()]) for _ in range(N)]
D = [0] * N
canBattle = defaultdict(lambda: False)
que = deque(list(range(N)))
while que:
i = que.popleft()
j = A[i].popleft()
canBattle[(i, j)] = True
if canBattle[(j, i)]:
day = max(D[i], D[j])
D[i] = D[j] = day + 1
if A[i]:
que.append(i)
if A[j]:
que.append(j)
if all(len(a) == 0 for a in A):
print((max(D)))
else:
print((-1))
| from collections import deque, defaultdict
N = int(eval(input()))
A = [deque([int(a) - 1 for a in input().split()]) for _ in range(N)]
D = [0] * N
Nx = [-1] * N
que = deque(list(range(N)))
while que:
i = que.popleft()
j = A[i].popleft()
Nx[i] = j
if Nx[j] == i:
day = max(D[i], D[j])
D[i] = D[j] = day + 1
if A[i]:
que.append(i)
if A[j]:
que.append(j)
if all(len(a) == 0 for a in A):
print((max(D)))
else:
print((-1))
| p02925 |
import sys
def input():
return sys.stdin.readline()[:-1]
import time
N = int(eval(input()))
A = [[int(x)-1 for x in input().split()] for i in range(N)]
P = [0] * N
cnt = 0
ALL = N*(N-1)//2
s = time.time()
for day in range(ALL):
if time.time()-s > 1.9:
print((N*(N-1)//2))
break
used = [0] * N
flag = 0
for i, p in enumerate(P):
if p != N-1 and used[i] == 0:
x = A[i][p]
if x < N and used[x] == 0 and A[x][P[x]] == i:
P[i] += 1
P[x] += 1
used[i] = 1
used[x] = 1
flag = 1
cnt += 1
if cnt == ALL:
print((day+1))
break
if flag == 0:
print((-1))
break
| import sys
def input():
return sys.stdin.readline()[:-1]
import time
N = int(eval(input()))
A = [[int(x)-1 for x in input().split()] for i in range(N)]
P = [0] * N
cnt = 0
ALL = N*(N-1)//2
s = time.time()
for day in range(ALL):
if time.time()-s > 1.6:
print((N*(N-1)//2))
break
used = [0] * N
flag = 0
for i, p in enumerate(P):
if p != N-1 and used[i] == 0:
x = A[i][p]
if x < N and used[x] == 0 and A[x][P[x]] == i:
P[i] += 1
P[x] += 1
used[i] = 1
used[x] = 1
flag = 1
cnt += 1
if cnt == ALL:
print((day+1))
break
if flag == 0:
print((-1))
break
| p02925 |
import sys
# sys.setrecursionlimit(100000)
from collections import deque
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] = deque(input_int_list())
day = 0
matches = 0
while True:
played = set()
for a, v in list(d.items()):
if d[a] and a not in played:
b = d[a][0]
if d[b] and a == d[b][0] and b not in played:
d[a].popleft()
d[b].popleft()
played.add(a)
played.add(b)
matches += 1
if not played:
break
day += 1
if matches == (n * (n - 1)) // 2:
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.