input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def search_delete(data):
del_target = -1
max_count = 1
for i in range(len(data)):
count = 0
for j in range(i+1, len(data)):
if data[i][1] > data[j][0]:
count += 1
else:
break
if count >= max_count:
del_tar... | def main():
n = int(eval(input()))
data = []
for i in range(n):
x, l = list(map(int, input().split()))
data.append([x-l, x+l])
data.sort(key=lambda x: x[1])
ans = 1
min_value = data[0][1]
for i in range(1, n):
if min_value <= data[i][0]:
ans +... | p02796 |
N = int(eval(input()))
P = [list(map(int, input().split())) for _ in range(N)]
P.sort(key=lambda x: x[0]+x[1])
leave = []
for i in range(N):
# ロボットpiが既に残すと決めたロボットに重ならないことをチェック
# print('Checking Robot P{}: {}'.format(i, P[i]))
# print('S:{} P:{} T:{}'.format(P[i][0]-P[i][1], P[i][0] , P[i][0]+P[i... | N = int(eval(input()))
P = [list(map(int, input().split())) for _ in range(N)]
P.sort(key=lambda x: x[0]+x[1])
leave = [P[0]]
for i in range(1, N):
# leaveの最大を取得
leave_max = leave[-1][0] + leave[-1][1]
p_min = P[i][0] - P[i][1]
if leave_max <= p_min:
leave.append(P[i])
else:
... | p02796 |
n = int(eval(input()))
LeftEnd = [0 for i in range(n)]
Center = [0 for i in range(n)]
RightEnd = [0 for i in range(n)]
for i in range(n):
robot, arm = list(map(int, input().split()))
LeftEnd[i] = robot - arm
Center[i] = robot
RightEnd[i] = robot + arm
now_rightend = min(RightEnd)
for counter in ra... | n = int(eval(input()))
List = [[0 for i in range(3)] for j in range(n)]
for i in range(n):
robot, arm = list(map(int, input().split()))
List[i][0] = robot - arm # LeftEnd
List[i][1] = robot # Center
List[i][2] = robot + arm # RightEnd
sorted_List = sorted(List, key=lambda x: x[2])
now_righte... | p02796 |
def find_dex(list,dex):
for j in range(len(list)):
if list[j][0] == dex:
return j
return 0
n = int(eval(input()))
d = []
left = []
right = []
for i in range(n):
x,l = list(map(int, input().split()))
# num , left , right
left.append([i,x-l+1,x+l-1])
right.append([... | n = int(eval(input()))
d = []
left = []
right = []
for i in range(n):
x,l = list(map(int, input().split()))
# num , left , right
d.append([x-l,x+l])
d.sort()
p = d[0][1]
ans = n
for i in range(1,n):
if d[i][0] < p:
ans -= 1
p = min(p,d[i][1])
else:
p = d[i][... | p02796 |
import sys
from operator import itemgetter
input = sys.stdin.readline
def main():
N = int(eval(input()))
LR = [None] * N
for i in range(N):
X, L = list(map(int, input().split()))
LR[i] = (X - L, X + L)
LR.sort(key=itemgetter(0))
ans = N
cur_R = LR[0][1]
fo... | import sys
from operator import itemgetter
input = sys.stdin.readline
def main():
N = int(eval(input()))
LR = [None] * N
for i in range(N):
X, L = list(map(int, input().split()))
LR[i] = (X - L, X + L)
LR.sort(key=itemgetter(0))
ans = N
cur_R = LR[0][1]
fo... | p02796 |
N = int(eval(input()))
ts=[]
for i in range(N):
x, l = list(map(int,input().split()))
s = max(x-l,0)
t = min(10**9,x+l)
ts.append([t,s])
ts.sort()
count = 0
lastT = 0
for i in ts:
if i[1]>=lastT:
count+=1
lastT=i[0]
print(count) | N = int(eval(input()))
st = []
for i in range(N):
x,l=list(map(int,input().split()))
s = max(x-l,0)
t = min(x+l,10**9)
st.append([t,s])
st.sort()
count = 0
lastT=0
for i in range(N):
if st[i][1]>=lastT:
count+=1
lastT = st[i][0]
print(count) | p02796 |
n=int(eval(input()))
l=sorted([list(map(int,input().split())) for _ in range(n)])
c=0
x=[0]*n
def d_min(a,b):
return a-b
def d_max(a,b):
return a+b
for i in range(n-1):
if x[i] != 0:
continue
for k in range(1,n-i):
if d_max(*l[i]) > d_min(*l[i+k]):
c+=1
... | n=int(eval(input()))
r=[]
cnt=1
for _ in range(n):
x,l=list(map(int,input().split()))
s=x-l
t=x+l
r.append([s,t])
r=sorted(r,key=lambda x: x[1])
t0=r[0][1]
for s,t in r[1:]:
if t0<=s:
cnt+=1
t0=t
print(cnt) | p02796 |
import sys
from operator import itemgetter
read = sys.stdin.read
N, *XL = list(map(int, read().split()))
seq = []
for X, L in zip(*[iter(XL)] * 2):
seq.append((X - L, X + L))
seq.sort(key=itemgetter(1))
answer = 0
left = -10 ** 10
for i, j in seq:
if left <= i:
answer += 1
l... | import sys
from operator import itemgetter
read = sys.stdin.read
N, *XL = list(map(int, read().split()))
seq = [(X - L, X + L) for X, L in zip(*[iter(XL)] * 2)]
seq.sort(key=itemgetter(1))
answer = 0
left = -10 ** 10
for i, j in seq:
if left <= i:
answer += 1
left = j
print(answe... | p02796 |
#!/usr/bin/env python3
import sys
INF = float("inf")
def solve(N: int, X: "List[int]", L: "List[int]"):
# 区間に変換する
segs = [(x-l, x+l) for x, l in zip(X, L)]
segs.sort(key=lambda x: x[1]) # 尻でソート
# DP i個目の区間まで考えた時の残せる数
DP = [0]*N
DP[0] = 1
for i in range(1, N):
# 重な... | #!/usr/bin/env python3
import sys
INF = float("inf")
def solve(N: int, X: "List[int]", L: "List[int]"):
# 区間に変換する
segs = [(x-l, x+l) for x, l in zip(X, L)]
segs.sort(key=lambda x: x[1]) # 尻でソート
last = -INF
count = 0
for i in range(N):
if last <= segs[i][0]:
... | p02796 |
N = int(eval(input()))
arr = [list(map(int,input().split())) for i in range(N)]
arr = sorted(arr)
F = [True]*N
P = [0]*N
for i in range(N):
P[i] = [arr[i][0]-arr[i][1], arr[i][0]+arr[i][1]]
for i in range(N):
for j in range(i+1,N):
if F[i]:
if P[i][1] > P[j][0]:
F[j] = False
else... | N = int(eval(input()))
arr = [list(map(int,input().split())) for i in range(N)]
arr = sorted(arr, key=lambda x: x[0])
F = [True]*N
P = [0]*N
for i in range(N):
P[i] = [arr[i][0]-arr[i][1], arr[i][0]+arr[i][1]]
P = sorted(P,key=lambda x:x[1])
ind = 0
for i in range(1,N):
if P[i][0] < P[ind][1]:
F[i] =... | p02796 |
def main():
N = int(eval(input()))
X = []
L = []
for i in range(N):
x, l = [int(s) for s in input().split()]
X.append(x)
L.append(l)
ranges = []
for i in range(N):
ranges.append((X[i] - L[i], X[i] + L[i]))
ranges.sort(key=lambda x: x[0])
wh... | def main():
N = int(eval(input()))
X = []
L = []
for i in range(N):
x, l = [int(s) for s in input().split()]
X.append(x)
L.append(l)
ranges = []
for i in range(N):
ranges.append((X[i] - L[i], X[i] + L[i]))
ranges.sort(key=lambda x: x[1])
cn... | p02796 |
n=int(eval(input()))
s=[]
t=[]
for i in range(n):
x,l=list(map(int,input().split()))
s.append(x-l)
t.append(x+l)
itv = []
for i in range(n):
itv.append([t[i],s[i]])
itv.sort()
ass=0
tt=-10000000000
for i in range(n):
if tt<=itv[i][1]:
ass+=1
tt=itv[i][0]
print(ass)... | n=int(eval(input()))
sec=[list(map(int,input().split())) for i in range(n)]
for i in range(n):
sec[i][0]+=sec[i][1]
sec[i][1]*=-2
sec[i][1]+=sec[i][0]
sec.sort()
ans=0
#-inf
t=-10000000000
for i in range(n):
#=をつけるのを忘れずに
if t<=sec[i][1]:#スタートがロボットアームのある最大の座標以上でなければならない
ans+=1#... | p02796 |
N = int(eval(input()))
X = [0]*N
L = [0]*N
XpL = [0]*N
XmL = [0]*N
cnt = 0
for i in range(N):
X[i], L[i] = list(map(int, input().split()))
XpL[i] = X[i]+L[i]
XmL[i] = max(0, X[i]-L[i])
for j in range(i):
if(XmL[i] < XpL[j] and XmL[j] < XpL[i]):
cnt += 1
... | import sys
N = int(eval(input()))
a = sorted([(x+l, x-l) for x, l in (list(map(int, l.split())) for l in sys.stdin)])
last = a[0][0]
ans = 1
for r, l in a[1:]:
if(last <= l):
ans += 1
last = r
print(ans) | p02796 |
from functools import lru_cache
def prepare(n, MOD):
f = 1
factorials = [1] * (n + 1)
for m in range(1, n + 1):
f = f * m % MOD
factorials[m] = f
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv = inv * m % MOD... | def prepare(n, MOD):
f = 1
factorials = [1] * (n + 1)
for m in range(1, n + 1):
f = f * m % MOD
factorials[m] = f
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv = inv * m % MOD
invs[m - 1] = inv
re... | p02965 |
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 998244353
N, M = list(map(int, sys.stdin.readline().split()))
def get_factorials(max, mod=None):
"""
階乗 0!, 1!, 2!, ..., max!
:par... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 998244353
N, M = list(map(int, sys.stdin.readline().split()))
def get_factorials(max, mod=None):
"""
階乗 0!, 1!, 2!, ..., max!
:par... | p02965 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, s... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, s... | p02965 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, s... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p02965 |
import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
mod=998244353
#階乗テーブル
g1=[1,1]
for i in range(2,3*M//2+N+2):
g1.append(g1[-1]*i%mod)
def cmb(n,r):
return g1[n]*pow(g1[r],mod-2,mod)*pow(g1[n-r],mod-2,mod)%mod
#奇数の和で場合分け
#iは奇数の数
ans=0
for i in range(min(N+1,M+1)):
... | import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
mod=998244353
inv=[0]*(3*M//2+N+2)
inv[1]=1
for i in range(2,3*M//2+N+2):
inv[i]=-(mod//i)*inv[mod%i]%mod
#階乗テーブル
g1=[1,1]
g2=[1,1]
for i in range(2,3*M//2+N+2):
num_1=g1[-1]*i%mod
g1.append(num_1)
g2.append(g2[-1]*... | p02965 |
o=998244353
r=2500100
f=[1]
for i in range(1,r):f.append(f[-1]*i%o)
def c(n,k):return f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)%o
n,m=list(map(int,input().split()))
w=3*m
a=(c(n+w-1,n-1)-n*c(n+m-2,n-1))%o
if n>m+1:
for i in range(m+1,min(w,n)+1):
if w-i&1:continue
a=(a-c(n,i)*c((w-i)//2+n-1,n-1))%o
print(... | o=998244353
f=[1]
for i in range(1,2500100):f.append(f[-1]*i%o)
def c(n,k):return f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)%o
n,m=list(map(int,input().split()))
w=3*m
u=n-1
a=c(w+u,u)-n*c(n+m-2,u)
if u>m:
for i in range(m+1,min(w,n)+1):
if w-i+1&1:a=(a-c(n,i)*c((w-i)//2+u,u))%o
print((a%o)) | p02965 |
o=998244353
f=[1]
for i in range(1,2500100):f.append(f[-1]*i%o)
def c(n,k):return f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()))
w=3*m
u=n-1
a=c(w+u,u)-n*c(n+m-2,u)
if u>m:
for i in range(m+1,min(w,n)+1):
if w-i+1&1:a=(a-c(n,i)*c((w-i)//2+u,u))%o
print((a%o)) | o=998244353
f=[1]
for i in range(1,2500100):f.append(f[-1]*i%o)
def c(n,k):return f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()))
w=3*m
u=n-1
a=c(w+u,u)-n*c(n+m-2,u)
if u>m:
for i in range(m+1,min(w,n)+1):
if w-i+1&1:a-=c(n,i)*c((w-i)//2+u,u)
print((a%o)) | p02965 |
o,f=998244353,[1]
for i in range(1,2500100):f.append(f[-1]*i%o)
def c(n,k):return f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()))
w,u=3*m,n-1
a=c(w+u,u)-n*c(n+m-2,u)
if u>m:
for i in range(m+1,min(w,n)+1):
if w-i+1&1:a-=c(n,i)*c((w-i)//2+u,u)
print((a%o)) | o,f=998244353,[1]
for i in range(1,2500100):f.append(f[-1]*i%o)
c=lambda n,k:f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()))
w,u=3*m,n-1
a=c(w+u,u)-n*c(n+m-2,u)
if u>m:
for i in range(m+1,min(w,n)+1):
if w-i+1&1:a-=c(n,i)*c((w-i)//2+u,u)
print((a%o)) | p02965 |
o,f,i=998244353,[1],1
while i<o/399:f+=[f[-1]*i%o];i+=1
c=lambda n,k:f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()))
w,u=3*m,n-1
a=c(w+u,u)-n*c(n+m-2,u)
if u>m:
for i in range(m+1,min(w,n)+1):
if w-i+1&1:a-=c(n,i)*c((w-i)//2+u,u)
print((a%o)) | o,f,i=998244353,[1],1
while i<o/399:f+=[f[-1]*i%o];i+=1
c=lambda n,k:f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()))
w,u,j=3*m,n-1,m+1
a=c(w+u,u)-n*c(n+m-2,u)
if w-j&1:j+=1
while j<=min(w,n):a-=c(n,j)*c((w-j)//2+u,u);j+=2
print((a%o)) | p02965 |
o,f,i=998244353,[1],1
while i<o>>8:f+=[f[-1]*i%o];i+=1
c=lambda n,k:f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
n,m=list(map(int,input().split()));w,u=3*m,n-1;a=c(w+u,u)-n*c(n+m-2,u)
while-~m<min(w,n):m+=2;a-=c(n,m)*c(2*u+w-m>>1,u)
print((a%o)) | n,m=list(map(int,input().split()))
w,u=3*m,n-1
o,f,i=998244353,[1],1
while i<w+n:f+=[f[-1]*i%o];i+=1
c=lambda n,k:f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
a=c(w+u,u)-n*c(n+m-2,u)
while-~m<min(w,n):m+=2;a-=c(n,m)*c(2*u+w-m>>1,u)
print((a%o)) | p02965 |
n,m=list(map(int,input().split()))
w,u=3*m,n-1
o,f,i=998244353,[1],1
while i<w+n:f+=[f[-1]*i%o];i+=1
c=lambda n,k=u:f[n]*pow(f[n-k],o-2,o)*pow(f[k],o-2,o)
a=c(w+u)-n*c(n+m-2)
while~-n>m<w:m+=2;a-=c(n,m)*c(2*u+w-m>>1)
print((a%o)) | n,m=list(map(int,input().split()))
o,f,i=998244353,[1],1
while i<3*m+n:f+=[f[-1]*i%o];i+=1
c=lambda x,y=n-1:f[x]*pow(f[x-y]*f[y]%o,o-2,o)
a=c(-1)-n*c(n+m-2)
while~-n>m<i-n:m+=2;a-=c(n,m)*c(n-1+i-m>>1)
print((a%o)) | p02965 |
graph = []
def init():
global graph
graph = [[False] * 26 + [True] for _ in range(27)]
graph[26][26] = False
def atoi(c):#index
if c == "#":
return 26
return ord(c) - ord("a")
def make_graph(L):
global graph, count
cur = 0
L = [L[0]] + [L[i] for i in range(1, le... | graph = []
def init():
global graph
graph = [[False] * 26 + [True] for _ in range(27)]
graph[26][26] = False
def atoi(c):#index
if c == "#":
return 26
return ord(c) - ord("a")
def make_graph(L):
global graph
cur = 0
L = [L[0]] + [L[i] for i in range(1, len(L)) i... | p01646 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
X,Y = MI()
print(('Alice' if abs(X-Y) >= 2 else 'Brown'))
| p03740 |
X, Y = list(map(int, input().split()))
memo = [[[-1, -1] for _ in range(X + Y + 1)] for _ in range(X + Y + 1)]
def search(x, y, person):
if x <= 1 and y <= 1:
return False if person == 0 else True
if x == 2 and y == 0 or x == 0 and y == 2:
return True if person == 0 else False
i... | X, Y = list(map(int, input().split()))
if abs(X - Y) <= 1:
print('Brown')
else:
print('Alice') | p03740 |
import sys
sys.setrecursionlimit(10**9)
X, Y = list(map(int, input().split()))
def rec(x, y) :
flg = False
for i in range(2, x + 1, 2) :
flg = flg or not rec(x-i, y+i//2)
for i in range(2, y + 1, 2) :
flg = flg or not rec(x+i//2, y-i)
return flg
if rec(X, Y)... | X, Y = list(map(int, input().split()))
if abs(X-Y) <= 1 :
print('Brown')
else :
print('Alice') | p03740 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))
while True:
if A == 0 and B == 0:
print("Brown")
break
while A > 1:
A -= 2
B += 1
while B > 1:
B -= 2
A += 1
if A == 1 and B == 0:
print("Brown")
break
elif A == 0 and B == 1:
print... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))
if abs(A - B) < 2:
print("Brown")
else:
print("Alice")
| p03740 |
import sys
from collections import deque
readline = sys.stdin.readline
n = int(readline())
li = list(map(int, readline().split()))
def square(P):
G = []
L = deque()
for i, v in enumerate(P):
if not L:
L.append((i, v))
continue
if v > L[-1][1]:
... | import sys
from collections import deque
readline = sys.stdin.readline
n = int(readline())
li = list(map(int, readline().split()))
def square(P):
G = []
L = deque()
for i, v in enumerate(P):
if not L:
L.append((i, v))
continue
if v > L[-1][1]:
... | p02328 |
n = int(eval(input()))
hs = list(map(int, input().split()))
maxh = max(hs)
dp = [-1] * (maxh + 1)
ans = 0
for i, h in enumerate(hs):
for j in range(h + 1):
if dp[j] == -1:
dp[j] = i
for j in range(h + 1, maxh + 1):
if dp[j] != -1:
ans = max(ans, j * (i - dp[j... | n = int(eval(input()))
hs = list(map(int, input().split()))
stack = []
ans = 0
for i, h in enumerate(hs):
j = -1
while stack and stack[-1][1] > h:
j, h2 = stack.pop()
ans = max(ans, (i - j) * h2)
if not stack or stack[-1][1] < h:
stack.append((i if j == -1 else j, h))
an... | p02328 |
import sys
def solve(N, R):
print((R if N >= 10 else R + 100 * (10 - N)))
if __name__ == '__main__':
N, R = list(map(int, sys.stdin.readline().strip().split(" ")))
solve(N, R) | import sys
N, R = list(map(int, sys.stdin.readline().split()))
print((R if 10 <= N else R + 100 * (10 - N))) | p02765 |
N, R = list(map(int, input().split()))
if N >= 10:
print(R)
else:
print((R+(100*(10-N)))) | N, R= list(map(int, input().split()))
if N <= 10:
print((R+(100*(10-N))))
else:
print(R) | p02765 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,R = MI()
print((R if N >= 10 else R+100*(10-N)))
| p02765 |
n, r = list(map(int, input().split()))
if n >= 10:
print(r)
else:
print((r + 100*(10-n)))
| import sys
stdin = sys.stdin
ni = lambda: int(ns())
ns = lambda: stdin.readline().rstrip()
na = lambda: list(map(int, stdin.readline().split()))
# code here
N, R = na()
if N >= 10:
print(R)
else:
print((R + 100*(10-N)))
| p02765 |
n,r = list(map(int,input().split()))
rate = 100*(10 - n)
if n >= 10:
print(r)
elif n < 10:
rate2 = rate + r
print((str(rate2))) | n,r = list(map(int,input().split()))
rate = 100*(10 - n)
if n >= 10:
print(r)
else:
rate2 = rate + r
print((str(rate2))) | p02765 |
#!/usr/bin/env python3
k,n = list(map(int,input().split()))
if k >= 10:
print(n)
else:
print((n+100*(10-k))) | #!/usr/bin/env python3
n,r = list(map(int,input().split()))
print((r+100*max(0,10-n))) | p02765 |
n,r=list(map(int,input().split()))
if n<10:
print((r+100*(10-n)))
else:
print(r) | n,r=list(map(int,input().split()));print((r+(n<10)*100*(10-n))) | p02765 |
N, R = list(map(int, input().split()))
print((R+max(0, 10-N)*100))
| N, R = list(map(int, input().split()))
if N >= 10:
print(R)
else:
print((R+100*(10-N)))
| p02765 |
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy
sys.setrecursionlimit(10**9)
mod = 10**7+9
inf = 10**20
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlin... | n,r = list(map(int,input().split()))
if n>=10:
print(r)
else:
t = 100*(10-n)
print((r+t)) | p02765 |
n, r = list(map(int, input().split()))
ans = r
if n < 10:
ans += 100*(10-n)
print(ans) | n, r = list(map(int, input().split()))
if n >= 10:
ans = r
else:
# r = ans - 100 * (10 - n)
ans = r + 100 * (10 - n)
print(ans) | p02765 |
n,r=list(map(int,input().split()))
if n>=10:
print(r)
else:
ans=r+100*(10-n)
print(ans) | n, r = list(map(int, input().split()))
if n >= 10:
print(r)
else:
print((r + 100 * (10 - n)))
| p02765 |
#!/usr/bin/env python3
import sys
import itertools
def solve(N: int, C: int, D: "List[List[int]]", c: "List[List[int]]"):
c_list = list(itertools.permutations(list(range(C)),3))
answer = 10**9
for zero,one,two in c_list:
a = 0
for i in range(N):
for j in range(N):
... | #!/usr/bin/env python3
import sys
import itertools
def solve(N: int, C: int, D: "List[List[int]]", c: "List[List[int]]"):
answer = 10**9
cost = [[0 for _ in range(C)] for _ in range(3)]
for i in range(1,N+1):
for j in range(1,N+1):
cost[(i+j)%3][c[i-1][j-1]-1] += 1
... | p03330 |
import sys
from itertools import permutations
N, C = list(map(int, sys.stdin.readline().rstrip().split()))
d = []
for _ in range(C):
d.append(tuple(map(int, sys.stdin.readline().rstrip().split())))
r_0 = []
r_1 = []
r_2 = []
for i in range(N):
g = list(map(int, sys.stdin.readline().rstrip().split(... | import sys
from itertools import permutations
N, C = list(map(int, sys.stdin.readline().rstrip().split()))
d = []
for _ in range(C):
d.append(tuple(map(int, sys.stdin.readline().rstrip().split())))
r_0 = []
r_1 = []
r_2 = []
for i in range(N):
g = list(map(int, sys.stdin.readline().rstrip().split(... | p03330 |
n,c = list(map(int,input().split()))
D_list = [[int(i) for i in input().split()] for _ in range(c)]
c_list = [[int(i) for i in input().split()] for _ in range(n)]
ans = 10 ** 10
for i in range(1,c**3):
x=i%c
y=(i%c**2)//c
z=i//c**2
if x==y or y==z or z==x:
continue
else:
... | n,c = list(map(int,input().split()))
D_list = [[int(i) for i in input().split()] for _ in range(c)]
c_list = [[int(i) for i in input().split()] for _ in range(n)]
c_num=[[0 for _ in range(3)] for __ in range(c)]
for a in range(n):
for b in range(n):
c_num[c_list[b][a]-1][(a+b+2)%3] += 1
ans... | p03330 |
# divide this matrix into 3 groups according to the remainder
# then consider the cost
from itertools import permutations
N, C = [int(elem) for elem in input().split(' ')]
D_matrix = [[int(elem) for elem in input().split(' ')] for _ in range(C)]
assert len(D_matrix) == C
assert len(D_matrix[0]) == C
c_matrix... | from itertools import permutations
N, C = [int(elem) for elem in input().split(' ')]
D_matrix = [[int(elem) for elem in input().split(' ')] for _ in range(C)]
assert len(D_matrix) == C
assert len(D_matrix[0]) == C
c_matrix = [[int(elem) for elem in input().split(' ')] for _ in range(N)]
assert len(c_matrix) == ... | p03330 |
# ABC099D - Good Grid
import sys
input = sys.stdin.readline
from collections import Counter
from itertools import product
def main():
N, C = list(map(int, input().split()))
D = [0] + list([0] + list(map(int, input().split())) for _ in range(C))
grid = tuple(tuple(map(int, input().split())) for... | # ABC099D - Good Grid
import sys
readline = sys.stdin.buffer.readline
from collections import Counter
from itertools import product
def main():
N, C = list(map(int, readline().split()))
D = [0] + list([0] + list(map(int, readline().split())) for _ in range(C))
grid = tuple(tuple(map(int, rea... | p03330 |
# ABC099D - Good Grid
import sys
input = sys.stdin.readline
from collections import defaultdict
from itertools import product
def main():
N, C = list(map(int, input().split()))
D = [0] + list([0] + list(map(int, input().split())) for _ in range(C))
grid = tuple(tuple(map(int, input().split()))... | # ABC099D - Good Grid
import sys
input = sys.stdin.readline
from collections import Counter
from itertools import product
def main():
N, C = list(map(int, input().split()))
D = [0] + list([0] + list(map(int, input().split())) for _ in range(C))
grid = tuple(tuple(map(int, input().split())) for... | p03330 |
N,C = list(map(int,input().split()))
D = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i) for i in input().split()] for _ in range(N)]
D_sum = [[0]*C for _ in range(3)]
for i in range(C):
for j in range(N):
for k in range(N):
D_sum[(j+k)%3][i] += D[c[j][k]-1][i]
... | N,C = list(map(int,input().split()))
D = [[int(i) for i in input().split()] for j in range(C)]
c = [[int(i) for i in input().split()] for j in range(N)]
c_sum = [[0]*C for _ in range(3)]
for i in range(N):
for j in range(N):
c_sum[(i+j)%3][c[i][j]-1] += 1
D_sum = [[0]*C for _ in range(3)]
for i ... | p03330 |
# 1. 入出力 (二次元配列)
N, C = list(map(int, input().split()))
D = [ list(map(int, input().split())) for _ in range(C) ]
col = [ list(map(int, input().split())) for _ in range(N) ]
ans = 1 << 60
for i in range(C):
for j in range(C):
for k in range(C):
if i == j or j == k or k == i:
... | # 1. 入出力 (二次元配列)
N, C = list(map(int, input().split()))
D = [ list(map(int, input().split())) for _ in range(C) ]
col = [ list(map(int, input().split())) for _ in range(N) ]
ans = 1 << 60
info = [ [0 for j in range(C)] for i in range(3) ]
for i in range(N):
for j in range(N):
mod = (i + j) %... | p03330 |
from collections import Counter
from itertools import permutations
import sys
input = sys.stdin.buffer.readline
N, C = list(map(int, input().split()))
D = [[int(x) for x in input().split()] for _ in range(C)]
cnt = [Counter() for _ in range(3)]
for i in range(N):
c = [int(x)-1 for x in input().split()]
... | from collections import Counter
from itertools import permutations
def main():
N, C = list(map(int, input().split()))
D = [[int(x) for x in input().split()] for _ in range(C)]
cnt = [Counter() for _ in range(3)]
for i in range(N):
c = [int(x)-1 for x in input().split()]
for... | p03330 |
from itertools import product, permutations
n, c = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(c)]
grid = [list(map(int, input().split())) for _ in range(n)]
cost = [[0] * c for _ in range(3)]
for i, j, k in product(list(range(n)), list(range(n)), list(range(c))):
# c... | #%% D
from itertools import product, permutations
n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C = [list(map(int, input().split())) for _ in range(n)]
X = [[0] * c for i in range(3)]
for i in range(n):
for j in range(n):
X[(i + j + 2) % 3][C[i]... | p03330 |
import sys
input = sys.stdin.buffer.readline
def main():
n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C_ = [list(map(int, input().split())) for _ in range(n)]
C = [0]*n
for i, c_ in enumerate(C_):
c_ = [x-1 for x in c_]
C[i... | import sys
input = sys.stdin.buffer.readline
def main():
n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C_ = [list(map(int, input().split())) for _ in range(n)]
C = [0]*n
for i, c_ in enumerate(C_):
c_ = [x-1 for x in c_]
C[i... | p03330 |
n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C = [list(map(int, input().split())) for _ in range(n)]
for i, l in enumerate(C):
l = [x-1 for x in l]
C[i] = l
import itertools
ans = 10**18
for p in itertools.permutations(list(range(c)), 3):
temp =... | n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C = [list(map(int, input().split())) for _ in range(n)]
for i, l in enumerate(C):
l = [x-1 for x in l]
C[i] = l
import itertools
ans = 10**18
X = [[0]*3 for _ in range(c)]
for i in range(n):
for j ... | p03330 |
N,C=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(C)]
grid=[list(map(int,input().split())) for i in range(N)]
a=[[0]*C for i in range(3)]
for i in range(N):
tmp=i%3
for j in range(N):
a[tmp][grid[i][j]-1]+=1
tmp=(tmp+1)%3
b=[[0]*C for i in ran... | N,C=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(C)]
grid=[list(map(int,input().split())) for i in range(N)]
a=[[0]*C for i in range(3)]
for i in range(N):
for j in range(N):
a[(i+j)%3][grid[i][j]-1]+=1
b=[[0]*C for i in range(3)]
for i in range(3):
... | p03330 |
N,C=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(C)]
grid=[list(map(int,input().split())) for i in range(N)]
a=[[0]*C for i in range(3)]
for i in range(N):
for j in range(N):
a[(i+j)%3][grid[i][j]-1]+=1
b=[[0]*C for i in range(3)]
for i in range(3):
... | N,C=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(C)]
grid=[list(map(int,input().split())) for i in range(N)]
a=[[0]*C for i in range(3)]
for i in range(N):
tmp=i%3
for j in range(N):
a[tmp][grid[i][j]-1]+=1
tmp=(tmp+1)%3
b=[[0]*C for i in ran... | p03330 |
#!/usr/bin/env python3
import sys
def calc(order, groups, D):
ret = 0
for i, G in enumerate(groups):
target = order[i]
for elm in G:
#print(elm, target)
ret += D[elm - 1][target]
return ret
def dfs(idx, current, used, groups, D):
if idx == 3:
... | #!/usr/bin/env python3
import sys
def calc_(order, d):
ret = 0
for i in range(3):
target = order[i]
ret += d[i][target]
return ret
def calc(G, target, D):
ret = 0
for elm in G:
ret += D[elm - 1][target]
return ret
def dfs(idx, current, used, d):
if... | p03330 |
N,C=list(map(int,input().split()))
Dmat=[]
for i in range(C):
array=list(map(int,input().split()))
Dmat.append(array)
#print(Dmat)
cmat=[]
for i in range(N):
array=list(map(int,input().split()))
cmat.append(array)
#print(cmat)
grid_list=[{},{},{}]
for i in range(N):
for j in range(N):
c=... | N,C=list(map(int,input().split()))
Dmat=[]
for i in range(C):
array=list(map(int,input().split()))
Dmat.append(array)
#print(Dmat)
grid_list=[{},{},{}]
for i in range(N):
array=list(map(int,input().split()))
for j in range(N):
c=array[j]-1
mod=(i+j)%3
if c in grid_list[mod]:
... | p03330 |
from collections import defaultdict
from itertools import permutations
n, c = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(c)]
cmat = [list(map(int, input().split())) for _ in range(n)]
dcnt = [defaultdict(int) for _ in range(3)]
for i, ci in enumerate(cmat):
for j,... | from itertools import permutations
n, c = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(c)]
cmat = [list(map(int, input().split())) for _ in range(n)]
dcnt = [[0] * c for _ in range(3)]
for i, ci in enumerate(cmat):
for j, cij in enumerate(ci):
mod = (i + j) ... | p03330 |
N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for i in range(C)]
c = [list(map(int, input().split())) for i in range(N)]
col = [[0]*3 for i in range(C)]
for i in range(N):
for j in range(N):
p = c[i][j]-1
for k in range(C):
col[k][(i+j)%3] += D[p][k]... | N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for i in range(C)]
c = [list(map(int, input().split())) for i in range(N)]
col = [[0]*C for i in range(3)]
for i in range(N):
ci = c[i]
for j in range(N):
cc = col[(i+j)%3]
dd = D[ci[j]-1]
for k in range... | p03330 |
from itertools import permutations
n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C = [list(map(int, input().split())) for _ in range(n)]
colors = [[0]*c for _ in range(3)]
for i in range(n):
for j in range(n):
c_ij = C[i][j]-1
index = (i+j)%... | from itertools import permutations
n, c = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(c)]
C = [list(map(int, input().split())) for _ in range(n)]
colors = [[0]*c for _ in range(3)]
for i in range(n):
for j in range(n):
c_ij = C[i][j]-1
index = (i+j)%... | p03330 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digi... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digi... | p03330 |
N,C = list(map(int,input().split()))
D = []
for i in range(C):
d = list(map(int,input().split()))
D.append(d)
A = []
for i in range(N):
a = list(map(int,input().split()))
A.append(a)
X0,X1,X2 = [],[],[]
for i in range(N):
for j in range(N):
if (i+j)%3 == 0:
X0.appe... | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# --------------------------------------... | p03330 |
n,c = list(map(int, input().split()))
color, grid = [], []
for _ in range(c):
color.append(list(map(int, input().split())))
grid = {i:{} for i in range(3)}
for i in range(n):
for j,t in enumerate(map(int, input().split())):
t -= 1
if t not in grid[(i+j + 2) % 3]:
grid[(i+j... | import sys
input = sys.stdin.readline
n,c = list(map(int, input().split()))
color = []
for _ in range(c):
color.append(list(map(int, input().split())))
grid = {i:{} for i in range(3)}
for i in range(n):
for j,t in enumerate(map(int, input().split())):
t -= 1
if t not in grid[(i+j +... | p03330 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | p03330 |
# ContestName
# URL
import sys
#import numpy as np
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.re... | # ContestName
# URL
import sys
#import numpy as np
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.re... | p03330 |
n,m=list(map(int,input().split()))
d=[list(map(int,input().split())) for _ in range(m)]
c=[list(map(int,input().split())) for _ in range(n)]
ans0=[0]
ans1=[0]
ans2=[0]
for k in range(1,m+1):
a0=0
a1=0
a2=0
for i in range(n):
for j in range(n):
if (i+j+2)%3==0:
... | N,C=list(map(int,input().split()))
d=[list(map(int,input().split())) for _ in range(C)]
c=[list(map(int,input().split())) for _ in range(N)]
x=[[0]*(C+1) for _ in range(3)]
for i in range(N):
for j in range(N):
x[(i+j+2)%3][c[i][j]]+=1
from itertools import permutations
ans=1<<32
for ch in permut... | p03330 |
from itertools import*
import sys
input=sys.stdin.readline
n,c=list(map(int,input().split()))
cost=[list(map(int,input().split()))for i in range(c)]
d=[[],[],[]]
for i in range(n):
for j,v in enumerate(map(int,input().split())):
d[(i+j+2)%3].append(v-1)
ans=[]
for cmb in permutations(list(range(c)... | from itertools import*
n,c=list(map(int,input().split()))
cost=[list(map(int,input().split()))for i in range(c)]
d=[[0]*c for i in range(3)]
for i in range(n):
for j,v in enumerate(map(int,input().split())):
d[(i+j)%3][v-1]+=1
print((min(sum(cost[j][cmb[i]]*d[i][j]for j in range(c)for i in range(3))f... | p03330 |
n,c = [int(i) for i in input().split()]
d = []
for i in range(c):
d.append(list(map(int, input().split())))
color = []
for i in range(n):
color.append(list(map(int, input().split())))
wrongfeeling = [[0 for i in range(3)] for j in range(c)]
for a in range(c):
for l in range(n):
for row in ... | n,c = [int(i) for i in input().split()]
d = [[int(i) for i in input().split()]for i in range(c)]
#d[A][B] はAからBになるときの違和感
color = [[int(i) for i in input().split()]for i in range(n)]
devcol = [[0 for i in range(3)] for j in range(c)]
for l in range(n):
for row in range(n):
devcol[color[l][ro... | p03330 |
from itertools import permutations
# use faster method than input()
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, C = list(map(int, input().split()))
D = []
for _ in range(C):
D.append(list(map(int, input().split())))
# それぞれのグループで、color_iが何個あるかをカウント
mod_0 = [0]*C
mod_1 = [... | from itertools import permutations
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, C = list(map(int, input().split()))
D = []
for _ in range(C):
D.append(list(map(int, input().split())))
# それぞれのグループで、color_iが何個あるかをカウント
mod_0 = [0]*C
mod_1 = [0]*C
mod_2 = [0]*C
for i in ra... | p03330 |
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
c = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = 10000*N*N
for i in range(C):
cur_score = 0
for x in range(N):
for y in range((-x)%3,N,3):
cur_score += D[c[x][y]][i]
... | N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
c = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
n = [[0]*C for _ in range(3)]
for i in range(N):
for j in range(N):
n[(i+j)%3][c[i][j]] += 1
ans = 500*500*1000
for c0 in range(C):
f... | p03330 |
s=input().split()
N=int(s[0])
C=int(s[1])
d=[]
for i in range(C):
s=input().split()
temp=[]
for item in s:
temp.append(int(item))
d.append(temp)
if N==1:
print("0")
else:
c=[[],[],[]]
cost=[[],[],[]]
for j in range(N):
s=input().split()
for i in r... | s=input().split()
n=int(s[0])
c=int(s[1])
d=[[0 for i in range(c+1)] for j in range(c+1)]
for i in range(c):
s=input().split()
for j in range(c):
d[i+1][j+1]=int(s[j])
cnt=[[0 for i in range(c+1)],[0 for i in range(c+1)],[0 for i in range(c+1)]]
for i in range(n):
s=input().split()
for j in range(n):
... | p03330 |
N,C = list(map(int,input().split()))
D = []
for i in range(C):
D.append(list(map(int,input().split())))
c = []
for i in range(N):
c.append(list(map(int,input().split())))
current_minimum = 1000 * 500 * 500 + 1
import itertools
for (c0,c1,c2) in itertools.permutations(list(range(C)), 3):
color = [... | N,C = list(map(int,input().split()))
D = []
for i in range(C):
D.append(list(map(int,input().split())))
c = []
for i in range(N):
c.append(list(map(int,input().split())))
import itertools
current_minimum = 1000 * 500 * 500 + 1
Z = []
Z.append([0]*C)
Z.append([0]*C)
Z.append([0]*C)
#print(Z)
fo... | p03330 |
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
G = [list(map(int,input().split())) for _ in range(N)]
g1 = []
g2 = []
g3 = []
for i in range(N):
for j in range(N):
G[i][j] -= 1
if (i+j)%3 == 0:
g1.append(G[i][j])
if (i+j)%... | N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
G = [list(map(int,input().split())) for _ in range(N)]
g1 = []
g2 = []
g3 = []
for i in range(N):
for j in range(N):
G[i][j] -= 1
if (i+j)%3 == 0:
g1.append(G[i][j])
if (i+j)%... | p03330 |
N,C = list(map(int,input().split()))
D = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i) for i in input().split()] for _ in range(N)]
modl = [[] for i in range(3)]
for i in range(N):
for j in range(N):
modl[((i+1)+(j+1))%3].append(c[i][j])
ans = float('inf')
for i in range(C):
... | N,C = list(map(int,input().split()))
D = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i) for i in input().split()] for _ in range(N)]
modl = [[0 for i in range(C)] for i in range(3)]
for i in range(N):
for j in range(N):
modl[((i+1)+(j+1))%3][c[i][j]-1] += 1
ans = float('inf')
for... | p03330 |
lngN, lngC = list(map(int, input().split()))
## lstD[x][y]
## 1 オリジン の C × C グリッド として扱うために、[False] * lngC を第一行と第一列に追加
## x -> y に塗り替えたときの違和感
## x, y: 0 ... lngC - 1
lstD = []
lstD.append([False] * lngC)
for i in range(lngC):
lstD.append([False] + list(map(int, input().split())))
## lstC[i][j]
## 1... | n, c = list(map(int, input().split()))
arrD = list(list(map(int, input().split())) for i in range(c))
arrC = list(list(map(int, input().split())) for i in range(n))
##剰余r=0,1,2で、
##色の出現数を確認する -> いずれかの色に統一する
##どの色に統一するか全パターンを実施して、違和感を算出
##和を取る
## arrCCnt[r][c]: 剰余rグループにおける初期色cのマス数
arrCCnt = []
... | p03330 |
def iin(): return int(eval(input()))
def nl(): return list(map(int, input().split()))
def ary(r, c, v): return [[v for _ in range(c)] for _ in range(r)]
N, C = nl()
d = [nl() for _ in range(C)]
c = [nl() for _ in range(N)]
ans = float('inf')
for c0 in range(1, C + 1):
for c1 in range(1, C + 1):
... | def iin(): return int(eval(input()))
def nl(): return list(map(int, input().split()))
def ary(r, c, v): return [[v for _ in range(c)] for _ in range(r)]
N, C = nl()
d = [nl() for _ in range(C)]
c = [nl() for _ in range(N)]
color_count_by_r = []
for i in range(3):
color_count_by_r.append(dict())
for i i... | p03330 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03330 |
# -*- coding: utf-8 -*-
from itertools import permutations
N, C = list(map(int, input().split()))
D = [int(_) for c in range(C) for _ in input().split()]
G = [int(_) for n in range(N) for _ in input().split()]
table = [0] * C * 3
for row in range(N):
for col in range(N):
i = (row + col) % 3
... | # -*- coding: utf-8 -*-
N, C = list(map(int, input().split()))
D = []
for c in range(C):
D.append([int(d) for d in input().split()])
Gmod = [[0 for i in range(C)] for i in range(3)]
for n in range(N):
for m, g in enumerate(input().split()):
Gmod[(n + m) % 3][int(g) - 1] += 1
K = []
for c... | p03330 |
from itertools import permutations
n,m=list(map(int,input().split()))
cost=[]
for i in range(m):
cost.append([int(i) for i in input().split()])
clr=[]
for i in range(n):
clr.append([int(i) for i in input().split()])
l=[i for i in range(m)]
ind=[[] for i in range(4)]
for i in range(n):
for j in r... | from itertools import permutations
n,m=list(map(int,input().split()))
cost=[]
for i in range(m):
cost.append([int(i) for i in input().split()])
clr=[]
for i in range(n):
clr.append([int(i) for i in input().split()])
l=[i for i in range(m)]
ind=[[0 for j in range(m)] for i in range(4)]
for i in range(... | p03330 |
N, C = [int(x) for x in input().split()]
D = [[0] * C for _ in range(C)]
c = [[0] * N for _ in range(N)]
for i in range(C):
D[i] = [int(x) for x in input().split()]
for i in range(N):
c[i] = [int(x) for x in input().split()]
I = [[0, 0, 0] for _ in range(C)]
for i in range(N):
for j in rang... | N, C = [int(x) for x in input().split()]
D = [[0] * C for _ in range(C)]
c = [[0] * N for _ in range(N)]
for i in range(C):
D[i] = [int(x) for x in input().split()]
for i in range(N):
c[i] = [int(x) for x in input().split()]
I = [[0, 0, 0] for _ in range(C)]
COL = [[0, 0, 0] for _ in range(C)]
... | p03330 |
from itertools import *
N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in [0]*C]
c = [list(map(int, input().split())) for _ in [0]*N]
tri = [[] for _ in [0]*3]
for i in range(1, N+1):
for j in range(1, N+1):
tri[(i+j) % 3] += [c[i-1][j-1] - 1]
incom = [[0]*C for _ ... | from itertools import *
N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in [0]*C]
tri = [[0]*C for _ in [0]*3]
for i in range(N):
for j,x in enumerate(map(int, input().split())):
tri[(i+j)%3][x-1] += 1
res = 1<<30
for p in permutations(list(range(C)), 3):
tt = ... | p03330 |
def run(N, C, D, c):
'''
マス番号に応じて3色に塗る必要がある
(i+j)%3が0, 1, 2それぞれに対して、ある色に塗るコストを計算する
0, 1, 2それぞれのC色のコストのパターンができる
上記コストに対してC色から3色を選択する全パターンのうち最小のコストを求める
'''
cost0 = {}
cost1 = {}
cost2 = {}
for k in range(C):
cost0[k] = 0
cost1[k] = 0
cost2[k] = ... | def run(N, C, D, c):
'''
マス番号に応じて3色に塗る必要がある
(i+j)%3が0, 1, 2それぞれに対して、何色が何個あるか計算しておく
ある色に塗るコストを計算する
0, 1, 2それぞれのC色のコストのパターンができる
上記コストに対してC色から3色を選択する全パターンのうち最小のコストを求める
'''
color0 = {}
color1 = {}
color2 = {}
for k in range(C):
color0[k] = 0
color1[k]... | p03330 |
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
de... | from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
de... | p03330 |
def main():
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
c = [list(map(int,input().split())) for _ in range(N)]
mod_0 = [0 for _ in range(C)]
mod_1 = [0 for _ in range(C)]
mod_2 = [0 for _ in range(C)]
for i in range(N):
for j in... | import sys
input = sys.stdin.readline
def main():
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
c = [list(map(int,input().split())) for _ in range(N)]
mod_0 = [0 for _ in range(C)]
mod_1 = [0 for _ in range(C)]
mod_2 = [0 for _ in range(C)]... | p03330 |
import sys
input = sys.stdin.buffer.readline
from itertools import permutations
def main():
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
col = [list(map(int,input().split())) for _ in range(N)]
mod_color = [[],[],[]]
for i in range(N):
... | import sys
input = sys.stdin.buffer.readline
from itertools import permutations
def main():
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
col = [list(map(int,input().split())) for _ in range(N)]
mod_color = [[0]*C,[0]*C,[0]*C]
for i in ra... | p03330 |
n,C = list(map(int,input().split()))
d = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i)-1 for i in input().split()] for _ in range(n)]
cnt = [[0]*C for _ in range(3)]
for i in range(n):
for j in range(n):
for k in range(C):
for r in range(3):
if (i+j... | n,C = list(map(int,input().split()))
d = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i)-1 for i in input().split()] for _ in range(n)]
cnt = [[0]*C for _ in range(3)]
for i in range(n):
for j in range(n):
for k in range(C):
cnt[(i+j)%3][k] += d[c[i][j]][k]
ans = f... | p03330 |
N,C=list(map(int,input().split()))
D=[[int(x) for x in input().split()] for y in range(C)]
c=[[int(x)-1 for x in input().split()] for y in range(N)]
a=10**9
for c0 in range(C):
for c1 in range(c0+1,C):
for c2 in range(c1+1,C):
s1,s2,s3=0,0,0
for i in range(N):
for j in range(N):
... | N,C=list(map(int,input().split()))
D=[[int(x) for x in input().split()] for y in range(C)]
c=[[int(x)-1 for x in input().split()] for y in range(N)]
d=[[0 for x in range(C)] for y in range(3)]
for i in range(N):
for j in range(N):
d[(i+j)%3][c[i][j]] += 1
a=10**9
for c0 in range(C):
for c1 in range... | p03330 |
N,C=list(map(int,input().split()))
D=[[int(x) for x in input().split()] for y in range(C)]
c=[[int(x)-1 for x in input().split()] for y in range(N)]
d=[[0 for x in range(C)] for y in range(3)]
for i in range(N):
for j in range(N):
d[(i+j)%3][c[i][j]] += 1
a=10**9
for c0 in range(C):
for c1 in range... | N,C=list(map(int,input().split()))
D=[[int(x) for x in input().split()] for y in range(C)]
c=[[int(x)-1 for x in input().split()] for y in range(N)]
d=[[0 for x in range(C)] for y in range(3)]
for i in range(N):
for j in range(N):
d[(i+j)%3][c[i][j]]+=1
a=10**9
for c0 in range(C):
for c1 in range(C... | p03330 |
n,c = list(map(int,input().split()))
d = [list(map(int,input().split())) for i in range(c)]
g = [list(map(int,input().split())) for i in range(n)]
# mod=0,1,2について、色iに変えた時のコストをまとめておく
cost = [[0]*c for i in range(3)]
for i in range(3):
for j in range(c):
cost[i][j] = sum([d[g[a][b]-1][j] for a in range... | n,c = list(map(int,input().split()))
d = [list(map(int,input().split())) for i in range(c)]
g = [list(map(int,input().split())) for i in range(n)]
# mod=0,1,2について、色iに変えた時のコストをまとめておく
cost = [[0]*c for i in range(3)]
for i in range(3):
for j in range(c):
for a in range(n):
for b in range(n... | p03330 |
import itertools
N,C=list(map(int,input().split()))
D=[None]*C
for i in range(C):
D[i]=list(map(int,input().split()))
c=[None]*N
for i in range(N):
c[i]=list(map(int,input().split()))
c_0=[]
c_1=[]
c_2=[]
for i in range(N):
for j in range(N):
if (i+j+2)%3==0:
c_0+... | import itertools
N,C=list(map(int,input().split()))
D=[None]*C
for i in range(C):
D[i]=list(map(int,input().split()))
c=[None]*N
for i in range(N):
c[i]=list(map(int,input().split()))
c_0=[]
c_1=[]
c_2=[]
for i in range(N):
for j in range(N):
if (i+j+2)%3==0:
c_0+... | p03330 |
import itertools
n, cs = list(map(int, input().split()))
d = [list(map(int, input().split())) for i in range(cs)]
c = [list(map(int, input().split())) for i in range(n)]
for i, j in itertools.product(list(range(n)), repeat=2):
c[i][j] -= 1
ans = 10**20
for i, j, k in itertools.permutations(list(range(cs)), 3):... | import itertools
n, cs = list(map(int, input().split()))
d = [list(map(int, input().split())) for i in range(cs)]
c = [list(map(int, input().split())) for i in range(n)]
color_count = [[0] * cs for i in range(3)]
for i, j in itertools.product(list(range(n)), repeat=2):
color_count[(i + j) % 3][c[i][j] - 1] += 1... | p03330 |
import itertools
N, C = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(C)]
c = [list(map(int, input().split())) for _ in range(N)]
memo = [[0 for i in range(C)]for j in range(3)]
for i in range(N):
for j in range(N):
cij = c[i][j]
a = (i + j + 2) % ... | import itertools
N, C = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(C)]
c = [list(map(int, input().split())) for _ in range(N)]
memo = [[0 for i in range(C)]for j in range(3)]
for i in range(N):
for j in range(N):
cij = c[i][j]
a = (i + j + 2) % ... | p03330 |
import itertools
N, C = list(map(int, input().split()))
D = []
for _ in range(C):
D.append(list(map(int, input().split())))
c = []
for _ in range(N):
c.append(list([int(x) - 1 for x in input().split()]))
min_diff = float("inf")
for ccs in itertools.permutations(list(range(C)), 3):
diff = 0
... | import itertools
N, C = list(map(int, input().split()))
# N, C = 500, 30
D = []
for _ in range(C):
D.append(list(map(int, input().split())))
# D.append([100] * C)
diff_by_pos_color_pair = [[0 for _ in range(C)] for _ in range(3)]
for i in range(N):
for j, color_from in enumerate([int(x) - 1 f... | p03330 |
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
c = [list(map(int,input().split())) for _ in range(N)]
cst = [[0,0,0] for i in range(C)]
for clr in range(1,C+1):
for i in range(N):
for j in range(N):
cst[clr-1][(i+j+2)%3] += D[c[i][j]-1][clr... | N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for _ in range(C)]
c = [list(map(int,input().split())) for _ in range(N)]
cst = [[0,0,0] for i in range(C)]
for i in range(N):
for j in range(N):
cst[c[i][j]-1][(i+j)%3] += 1
ans = 10**10
for i in range(C):
for j i... | p03330 |
# your code goes here
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for i in range(C)]
c = [list(map(int,input().split())) for i in range(N)]
ans = 1145141919810
for i in range(C):
for j in range(C):
if j == i:
continue
for k in range(C):
if k == i or k == j:
conti... | # your code goes here
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for i in range(C)]
c = [list(map(int,input().split())) for i in range(N)]
Color = [[0 for i in range(C)] for j in range(3)]
for x in range(N):
for y in range(N):
Color[(x+y+2)%3][c[x][y]-1] += 1
ans = 1145141... | p03330 |
N,C=list(map(int,input().split(' ')))
D=[]
for _ in range(C):
D.append([ x for x in map(int,input().split(' '))])
c=[]
for _ in range(N):
c.append([ x for x in map(int,input().split(' '))])
x=float('inf')
for seq in [[0,1,2],[0,2,1],[1,0,2],[1,2,0],[2,0,1],[2,1,0]]:
counter=[[0]*C for _ in range(3)... | N,C=list(map(int,input().split(' ')))
D=[]
for _ in range(C):
D.append([ x for x in map(int,input().split(' '))])
c=[]
for _ in range(N):
c.append([ x for x in map(int,input().split(' '))])
x=float('inf')
memo={}
counter=[[0]*C for _ in range(3)]
for i in range(N):
for j in range(N):
b=i%3... | p03330 |
from itertools import *
N,C=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(C)]
c=[list(map(int,input().split())) for i in range(N)]
lst=[[],[],[]]
for y in range(N):
for x in range(N):
lst[(y+x)%3].append(c[y][x])
Revalue=10**18
for Color1,Color2,Color3 in... | from itertools import *
N,C=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(C)]
c=[list(map(int,input().split())) for i in range(N)]
lst=[[],[],[]]
for y in range(N):
for x in range(N):
lst[(y+x)%3].append(c[y][x])
Revalue=10**18
valuelst=[[0 for i in range... | p03330 |
N,C = list(map(int,input().split()))
D = []
for i in range(C):
D.append(list(map(int,input().split())))
G = []
for i in range(N):
G.append(list(map(int,input().split())))
X = [[] for i in range(3)]
for i in range(N):
for j in range(N):
X[(i+j+2)%3].append(G[i][j])
ans = float('inf')
fo... | N,C = list(map(int,input().split()))
D = []
for i in range(C):
D.append(list(map(int,input().split())))
G = []
for i in range(N):
G.append(list(map(int,input().split())))
X = [[] for i in range(3)]
for i in range(N):
for j in range(N):
X[(i+j+2)%3].append(G[i][j])
ans = float('inf')
... | p03330 |
from itertools import*
from math import*
from collections import*
from heapq import*
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf = 10**18
mod = 10**9+7
from functools import reduce
import sys
sys.setrecursionlimit(10**7)
n,c = list(map(int,input().split()))
D = [list(map(int,... | from itertools import*
from math import*
from collections import*
from heapq import*
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf = 10**18
mod = 10**9+7
from functools import reduce
import sys
sys.setrecursionlimit(10**7)
n,c = list(map(int,input().split()))
D = [list(map(int,... | p03330 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.