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
... | # 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... | 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
... | 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:
an... | 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_h... | 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 =... | 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(... | 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:
... | 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((... | 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()]
de... | 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) f... | 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
... | 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)
... | 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:
... | 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 c... | 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の組み合わせ... | 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 ... | 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[... | 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 ... | 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... | 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
# 既にこのターンでマッチしたインデックスを保持
... | #!/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... | 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:
... | 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:
... | 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
u... |
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()
... | 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()
... | """
ある試合(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 ... | 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 ... |
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)
"""
・試合したらそいつらをキューに積む
・試合できなかったら、次はこいつと戦いたいよリストにいれる
キューを全て確認したのに、 次はこいつと戦いたいよリスト... | 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 l... | 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:
... | 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 *so... | 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 *so... | 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 ... | 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 ... | 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(... | 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(... | 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(... |
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 =... | 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 <... | # -*- 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 <... | 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()))
... | 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,... | 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,... | 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()
... | 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()
... | 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[playe... | 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... | 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:... | 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... | 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... | 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()):
... | # 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:
... | 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)))
... | # 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 ... | 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 ... | 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 ... | 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()
... | 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):
... | 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):
... | 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(... | 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)
... | 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:
... | 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:
to... | 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)])
... | 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... | #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)
... | 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]
... | 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[... | 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 = c... | 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 = cu... | 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)]
... | 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 ... | 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... | 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... | 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 ite... | #!/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 operat... | 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
... | 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] =... | 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_fla... | 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_fla... | 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_searc... | 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;
... | 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... | 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:... | 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()
... | 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 != []:
... | 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... | 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... | 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:
... | 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... | 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... | 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):
... | 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)]
... | 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
... | 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(... | 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(... | 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 n... | 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... | 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):
st... | 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... | 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... | 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(... | 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(... | 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())
... | 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[mi... | 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]... | 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]... | 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:
... | 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):
... | 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(... | 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... | 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
... | 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):
... | #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):
... | 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] *... | 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):
... | 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, produc... | # -*- 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, produc... | 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... | # -*- 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... | 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... | # -*- 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... | 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))
pen... | 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
... | 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... | 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] ... | 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
... | 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:
... | 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
... | 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
... | 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 = ... | 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
resul... | 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[no... | 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[no... | 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[no... | 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[no... | 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[no... | 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]... | 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]+=... | 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]... | 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()
... | 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()
... | 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())
pointe... | 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: ... | 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: ... | 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
... | 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(... | 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[... | 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
... | #"""
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,... | 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:
... | 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:
... | 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
... | 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],... | 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
... | 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
... | 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()
f... | import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(eval(input()))
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = dict()
for i in range(1, n + 1):
... | p02925 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.