input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
x, t = list(map(int, input().split()))
print((max(0, x - t)))
| x, t = list(map(int, input().split()))
print((max(x - t, 0)))
| p03609 |
x,t=list(map(int,input().split()))
print((0 if x<=t else x-t)) | x,t=list(map(int,input().split()))
print(("0" if x-t<0 else x-t)) | p03609 |
X,t=list(map(int,input().split()))
if (X-t)<0:
print("0")
else:
print((X-t))
| X,t=list(map(int,input().split()))
print((max(X-t,0))) | p03609 |
class RangeMaximumQuery:
def __init__(self, n):
self.size = n
self.dat = [0] * (2 * n - 1)
def update(self, i, x):
i += self.size - 1
self.dat[i] = x
while i > 0:
i = (i - 1) // 2
d1 = self.dat[i * 2 + 1]
d2 = self.dat[i... | def solve():
n = int(eval(input()))
dp = [0] * (n + 1)
def update(i, x):
while i <= n:
if dp[i] < x:
dp[i] = x
i += i & -i
def get_sum(i):
s = 0
while i > 0:
t = dp[i]
if s < t:
... | p01545 |
from itertools import accumulate
N=int(eval(input()))
t=[]
s=list(map(int,input().split()))
for i in range(2,N-1):
p=10**9
for j in range(1,len(s[:i])):
a=sum(s[:i][:j])
b=sum(s[:i][j:])
q=abs(a-b)
if p>q:
p=q
(x,y)=(a,b)
p=10**9
... | from itertools import accumulate
N=int(eval(input()))
s=list(accumulate(list(map(int,input().split()))))
ans=10**9
p=0
q=2
for i in range(2,N-1):
while p<i-1 and abs(s[i-1]-2*s[p+1])<abs(s[i-1]-2*s[p]):
p+=1
if q<i:
q+=1
while q<N and abs(s[i-1]-2*s[q+1]+s[-1])<abs(s[i-1]-2*s[q]+s... | p03310 |
from itertools import accumulate
N=int(eval(input()))
s=list(accumulate(list(map(int,input().split()))))
ans=s[-1]
p=0
q=2
for i in range(2,N-1):
while abs(s[i-1]-2*s[p])>abs(s[i-1]-2*s[p+1]):
p+=1
while abs(s[q]*2-s[i-1]-s[-1])>abs(s[q+1]*2-s[i-1]-s[-1]):
q+=1
t=[s[i-1]-s[p],s[p]... | from itertools import accumulate
N=int(eval(input()))
s=list(accumulate(list(map(int,input().split()))))
def f(N,s):
ans=s[-1]
p=0
q=2
for i in range(2,N-1):
while abs(s[i-1]-2*s[p])>abs(s[i-1]-2*s[p+1]):
p+=1
while abs(s[q]*2-s[i-1]-s[-1])>abs(s[q+1]*2-s[i-1]-s[-1]... | p03310 |
from itertools import accumulate
from bisect import bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
A = list(accumulate(A))
ans = float('inf')
# 切る位置を全探索
for mid in range(2, N - 1):
L, R = A[:mid], A[mid:]
L_target, R_target = L[-1] / 2, (L[-1] + R[-1]) / 2
L_index, R_inde... | from itertools import accumulate
from bisect import bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
A = list(accumulate(A))
ans = float('inf')
# 切る位置を全探索
for mid in range(1, N):
L_target, R_target = A[mid] // 2, (A[mid] + A[-1]) // 2
L_index, R_index = bisect_left(A, L_target),... | p03310 |
N = int(eval(input()))
A = list(map(int,input().split()))
S = [0]
for i in range(N):
S.append(S[i]+A[i])
a_before = 1
c_before = 3
ans_tmp = []
for b in range(2,N-1):
if S[a_before] > S[b] - S[a_before]:
a=a_before
else:
for i in range(a_before,b):... | N = int(eval(input()))
A = list(map(int,input().split()))
S = [0]
for i in range(N):
S.append(S[i]+A[i])
a = 1
c = 3
ans_tmp = []
for b in range(2,N-1):
while abs(S[b]-S[a]-S[a]) > abs(S[b]-S[a+1]-S[a+1]):
a += 1
while abs((S[N]-S[c]) - (S[c]-S[b])) > abs((S[N]-S... | p03310 |
#!/usr/bin/env python3
import bisect
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = []
t = 0
for a in A:
t += a
B.append(t)
i2 = bisect.bisect_left(B, B[N - 1] / 2, lo = 1, hi = N - 2)
i1 = bisect.bisect_left(B, B[i2] / 2, hi = i2)... | #!/usr/bin/env python3
import bisect
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = []
t = 0
for a in A:
t += a
B.append(t)
T = B[N - 1]
i2 = bisect.bisect_left(B, T / 2, lo = 1, hi = N - 2)
i1 = bisect.bisect_left(B, B[i2] ... | p03310 |
import sys
from bisect import bisect_left as bl
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int,input().split()))
cs = [0] * N
cs[0] = a[0]
for i in range(N - 1): cs[i + 1] = cs[i] + a[i + 1]
res = float("inf")
for m in range(1, N - 1):
l = bl(cs[: m], cs[m] // 2)
r = bl(cs[m: ], cs[m]... | import sys
from bisect import bisect_left as bl
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int,input().split()))
cs = [0] * N
cs[0] = a[0]
for i in range(N - 1): cs[i + 1] = cs[i] + a[i + 1]
res = float("inf")
for m in range(1, N - 1):
l = bl(cs, cs[m] // 2, hi = m)
r = bl(cs, cs[m] +... | p03310 |
import itertools
n = int(eval(input()))
lst = list(map(int, input().split()))
lst_accum = list(itertools.accumulate(lst))
def shaku(lst_accum, first):
all_sum = lst_accum[-1]
min_diff = 10**100
for k in range(len(lst_accum)-1):
diff = abs(all_sum - 2*lst_accum[k] + first)
if m... | import itertools
n = int(eval(input()))
lst = list(map(int, input().split()))
lst_accum = list(itertools.accumulate(lst))
min_diff = 10**100
first_cut = 0
third_cut = 2
all_sum = lst_accum[-1]
for k in range(1, len(lst_accum)-2):
second_last = lst_accum[k]
P = lst_accum[first_cut]
Q = secon... | p03310 |
n = int(eval(input()))
A = list(map(int, input().split()))
F = [int()] * n
F[0] = A[0]
for b in range(1, n):
F[b] = F[b - 1] + A[b]
res = [0]*4
data = [10 ** 18] * 2
ex = [0]*4
ans = 10 ** 18
s = 0
t = 2
for i in range(1, n - 2):
bl = [True, True]
for j in range(s, i):
res[0] = F[... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
F = [int()] * n
F[0] = A[0]
for b in range(1, n):
F[b] = F[b - 1] + A[b]
res = [0]*4
data = [10 ** 18] * 2
ex = [0]*4
ans = 10 ** 18
s = 0
... | p03310 |
INF = float('inf')
from bisect import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
S = [0]*N
for i in range(N):
S[i] = S[i-1]+A[i]
ans = INF
for i in range(2,N-1):
l = S[:i]
r = S[i:]
j = bisect(l,l[-1]/2)
k = bisect(r,(r[-1]+l[-1])/2)
for p in {j-1,min(j,len(l... | INF = float('inf')
from bisect import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
S = [0]*N
for i in range(N):
S[i] = S[i-1]+A[i]
ans = INF
for i in range(2,N-1):
j = bisect(S,S[i-1]/2)
k = bisect(S,(S[-1]+S[i-1])/2)
for p in {j-1,min(j,i-2)}:
for q in {k-1,i,m... | p03310 |
from statistics import mean
N = int(eval(input()))
A = list(map(int, input().split()))
S = [A[0]]
for i in range(1, N):
S.append(S[i - 1] + A[i])
ans = float('inf')
for middle in range(1, N - 2):
left_middle = 0
right_middle = middle + 1
left_sum = S[left_middle]
right_sum = ... | from statistics import mean
N = int(eval(input()))
A = list(map(int, input().split()))
S = [A[0]]
for i in range(1, N):
S.append(S[i - 1] + A[i])
left_middle = 0
right_middle = 2
ans = float('inf')
for middle in range(1, N - 2):
left_sum = S[left_middle]
right_sum = S[middle] - left_... | p03310 |
from itertools import accumulate
import bisect
n = int(eval(input()))
a = list(map(int, input().split()))
arev = list(reversed(a))
front = list(accumulate(a))
back = list(accumulate(arev))
ans = float('inf')
for i in range(1,n-2):
b = bisect.bisect_left(front,front[i]//2,0,i-1)
c = bisect.bi... | # 解説の方法
from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
acc = list(accumulate(a))
l = 0
r = 2
ans = float('inf')
for y in range(1,n-2):
for x in range(l,y-1):
if abs(acc[y]-acc[x]*2)>=abs(acc[y]-acc[x+1]*2):
l = x+1
... | p03310 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
s=sum(a)
ans=s
b=a[0]
for i in range(n-3):
b=0
for l in range(i+2):
b+=a[l]
c=s-b
j=0
k=0
while k-b/2<0:
k+=a[j]
j+=1
if k-b/2>b/2+a[j-1]-k:
k-=a[j-1]
x=min(k,b-k)
y=max(k,b-k)
j=-1
k=0
while k-c/2<0:
k+=a[j]
j-=1
... | n=int(eval(input()))
a=[int(i) for i in input().split()]
s=[a[0]]
for i in range(n-1):
s.append(s[i]+a[i+1])
ans=s[n-1]
j=0
k=2
for i in range(1,n-2):
while abs(s[i]-2*s[j]) > abs(s[i]-2*s[j+1]):
j=j+1
while abs(s[n-1]-2*s[k]+s[i]) > abs(s[n-1]-2*s[k+1]+s[i]):
k=k+1
t=max(s[j],s[i]-s[j],s[k]-s[i]... | p03310 |
from itertools import accumulate as acc
from bisect import bisect_left as bl
def ans(n):
tmp=0
for i in range(N):
tmp+=abs(a[i]-a[n-1])
return tmp
N=int(eval(input()))
a=list(map(int,input().split()))
a=list(acc(a))
ans=10**18
p=0
q=2
for j in range(1,N-2):
q=min(q,j+1)
... | from itertools import accumulate as acc
from bisect import bisect_left as bl
def ans(n):
tmp=0
for i in range(N):
tmp+=abs(a[i]-a[n-1])
return tmp
N=int(eval(input()))
a=list(map(int,input().split()))
a=list(acc(a))
ans=10**18
p=0
q=2
for j in range(1,N-2):
q=max(q,j+1)
... | p03310 |
from itertools import accumulate
from bisect import bisect
def half(T, h):
b = bisect(T,h)
if abs(T[b-1]*2 - T[-1] - T[0]) <= abs(T[b]*2 - T[-1] - T[0]):
return T[b-1] - T[0], T[-1]-T[b-1]
return T[b] - T[0], T[-1]-T[b]
N = int( eval(input()))
A = list( map( int, input().split()))
S = [0]... | from itertools import accumulate
N = int( eval(input()))
A = list( map( int, input().split()))
a, b = 0, 2
ans = 10**9 + 1
S = list(accumulate(A))
for i in range(1,N-2):
while S[a] < S[i] - S[a+1]:
a += 1
b = max(b,i+1)
while S[b] - S[i] < S[-1] - S[b+1]:
b += 1
ans = min( ... | p03310 |
N=int(eval(input()))
alist=list(map(int,input().split()))
def bs_left(mid,mp):
sum2=abs(2*slist[mid]-slist[mp])
if mid==0:
sum1=sum2
else:
sum1=abs(2*slist[mid-1]-slist[mp])
if mid==mp:
sum3=sum2
else:
sum3=abs(2*slist[mid+1]-slist[mp])
if sum2<=sum1 and sum2<=sum3:
retu... | N=int(eval(input()))
alist=list(map(int,input().split()))
def bs_left(mid,mp):
sum1=sum2=abs(2*slist[mid]-slist[mp])
sum3=abs(2*slist[mid+1]-slist[mp])
if mid>0:
sum1=abs(2*slist[mid-1]-slist[mp])
if sum2<=sum1 and sum2<=sum3:
return 0
elif sum1<sum2:
return -1
elif sum2>sum3:
... | p03310 |
from itertools import accumulate
from bisect import bisect_left, bisect_right
n = int(eval(input()))
a = list(map(int, input().split()))
ts = list(accumulate(a))+[0]
r = 0
def calc(st, ed):
t0 = ts[ed-1] - ts[st-1]
i1 = bisect_left(ts, (ts[ed-1]+ts[st-1])/2, st+1, ed-1)
t11 = ts[i1-1] - ts[st... | n = int(eval(input()))
a = list(map(int, input().split()))
from itertools import accumulate
accum = list(accumulate(a))
i_left = 0
i_right = 2
ans = 10**18
for i in range(1, n-2):
while True:
p = accum[i_left]
q = accum[i] - p
p_new = accum[i_left+1]
q_new = accum[i] ... | p03310 |
import sys
from itertools import accumulate
from bisect import bisect_left as bi_l
n, *a = list(map(int, sys.stdin.read().split()))
def main():
s = list(accumulate(a))
ans = float('inf')
for center in range(1, n-2):
pq = s[center]
left = bi_l(s, pq / 2)
if left == 0:
... | import sys
from itertools import accumulate
n, *a = list(map(int, sys.stdin.read().split()))
def main():
ans = float('inf')
left = 0; right = 2
p = a[0]; q = 0; r = sum(a[1:3]); s = sum(a[3:])
for c in range(1, n-2):
q += a[c]; r -= a[c]
while left < c - 1:
nex ... | p03310 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(1, N):
A[i] += A[i - 1]
def calc(lst, min_num):
total = lst[-1] - min_num
# print (total)
lb = -1
ub = len(lst)
while (ub - lb) > 1:
mid = (lb + ub)//2
if lst[mid] - min_num > total/2:
... | #PypyでもTLE A[:half]のような箇所が遅い？
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(1, N):
A[i] += A[i - 1]
def calc(lb, ub):
max_num = A[ub]
lb -= 1
if lb == -1:
min_num = 0
else:
min_num = A[lb]
total = A[ub] - min_num
# print (total)
... | p03310 |
from itertools import accumulate
def S(a, b):
return cl[b] - (0 if a == 0 else cl[a-1])
def partial(start, end, last):
odiff = None
for c in range(start, end+1):
p = S(start,c)
q = S(c+1,end)
diff = abs(p-q)
if odiff is None:
odiff = diff
if... | from itertools import accumulate
def Sdiff(s, m, e):
# Sdiff(s, m, e) = [A_s, A_s+1 ..., A_m] [A_m+1 .... A_e]
# L = cl[m]-cl[s-1], R = cl[e] - cl[m]
# diff(L,R) = abs(cl[m] - cl[s-1] - cl[e] + cl[m]) = abs(2*cl[m] - cl[s-1] - cl[e])
x = 0 if s == 0 else cl[s-1]
return abs(2*cl[m] - x -... | p03310 |
N = int(eval(input()))
A = list(map(int, input().split()))
cum_sum = [0] + [sum(A[:i + 1]) for i in range(N)]
ans = float("inf")
def get_diff(left, center, right):
return abs((cum_sum[center] - cum_sum[left]) - (cum_sum[right] - cum_sum[center]))
l_point = 1
r_point = 3
for C in range(2, N):
... | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
aa = [0]
for i in range(n):
aa.append(aa[i] + a[i])
ans = sys.maxsize
def getdiff(left, center, right):
return abs((aa[center] - aa[left]) - (aa[right] - aa[center]))
L = 1
R = 3
for C in range(2, n):
while L + ... | p03310 |
#dame datta
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Al = [A[0]]
r = (10**9)*(2*(10**5))
for i in A[1:]:
Al.append(Al[-1] + i)
for t in range(2, N-1):
t1 = -1
m = (10**9)*(2*(10**5))
for i in range(1,t):
ii = a... | #dame datta
def binsearch(l, r, fn):
while r - l > 1:
m = (l + r) // 2
t = fn(m+1) - fn(m)
if t == 0:
return fn(m)
if t < 0:
l = m + 1
else:
r = m
if fn(l) < fn(r):
return l
else:
return r
def main():
... | p03310 |
N=int(eval(input()))
a=[int(i) for i in input().split()]
from itertools import accumulate
l=[0]+list(accumulate(a))
s=l[-1]
ans=10000000000000
import bisect
for i in range(2,N-1):
ll=l[0:i+1]
lr=l[i:N+1]
lls=ll[-1]
lrs=lr[-1]-lr[0]
n=bisect.bisect_left(ll,lls//2)
if n+1>=len(ll):
... | n=int(eval(input()))
a=[int(i) for i in input().split()]
for i in range(n-1):
a[i+1]+=a[i]
j=0
k=2
ans=10**9
for i in range(1,n-1):
while abs(a[j]*2-a[i])>abs(a[j+1]*2-a[i]):
j+=1
while abs(a[k]*2-a[i]-a[n-1])>abs(a[k+1]*2-a[i]-a[n-1]):
k+=1
t=[a[j],a[i]-a[j],a[k]-a[i],... | p03310 |
# https://atcoder.jp/contests/abc102/tasks/arc100_b
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
def main():
n = int(eval(input()))
al = list(map(int, input().split()))
l, ... | # https://atcoder.jp/contests/abc102/tasks/arc100_b
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
def main():
n = int(eval(input()))
al = list(map(int, input().split()))
l, ... | p03310 |
from itertools import accumulate
import bisect
N=int(eval(input()))
A=[int(x) for x in input().split()]
S=list(accumulate(A))
def solve(x):
cnt=S[x]
L=bisect.bisect_left(S,cnt/2)
R=bisect.bisect_left(S,(cnt+S[N-1])/2)
L2=bisect.bisect_right(S,cnt/2)
R2=bisect.bisect_right(S,(cnt+S[N-1])/2)
re... | from itertools import accumulate
import bisect
N=int(eval(input()))
A=[int(x) for x in input().split()]
S=list(accumulate(A))
def solve(x):
cnt=S[x]
L=bisect.bisect_left(S,cnt/2)
R=bisect.bisect_left(S,(cnt+S[N-1])/2)
L2=L-1
R2=R-1
res=10**10
if R < N:
ans=[S[L],cnt-S[L],S[R]-cnt,S[N-... | p03310 |
def solve():
N = int(eval(input()))
A = tuple(map(int, input().split()))
from itertools import accumulate
CA = list(accumulate(A))
mindiff = CA[-1]
for c in range(1,N-2):
# left side
p = 0
q = CA[-1]
left = 0
# for i in range(0, c):
... | N = int(eval(input()))
A = tuple(map(int, input().split()))
from itertools import accumulate
CA = list(accumulate(A))
mindiff = CA[-1]
left = 0
right = 2
for c in range(1,N-1):
# left side
p = CA[left]
q = CA[c] - CA[left]
while True:
pi = CA[left+1]
qi = CA[c] - CA[left... | p03310 |
N = int(eval(input()))
A = list(map(int, input().split()))
S = [0] * (N+1)
for i in range(N) :
S[i+1] = S[i] + A[i]
leftMiddle = 0
rightMiddle = 2
ans = float('inf')
for middle in range(2, N-1) :
leftS = S[leftMiddle]
rightS = S[middle] - leftS
diff = abs(leftS - rightS)
# 左側の更... | N = int(eval(input()))
A = tuple(map(int, input().split()))
def calc(B):
P, Q = B[0], B[1]
ret = [None] * N
ret[1] = (P, Q)
mid = 1
for right in range(2, N - 2):
Q += B[right]
while mid < right:
newP = P + B[mid]
newQ = Q - B[mid]
... | p03310 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
def found_cut(X):
p1 = sum(X)/2
count1 = 0
for i in range(len(X)):
count1 += X[i]
if p1 <= count1:
if abs(count1-p1) < abs(count1-X[i]-p1):
index = i
break
else:
... | N = int(eval(input()))
A = [int(a) for a in input().split()]
S = [0]*N
S[0] = A[0]
for i in range(1, N):
S[i] = A[i]+S[i-1]
ans = 2*10**14
l = 0
temp = 2*10**14
r = 2
#for i in range(2, N):
# if abs(S[-1]-2*S[i]+S[1]) < temp:
# temp = abs(S[-1]-2*S[r]+S[1])
# r = i
f... | p03310 |
from bisect import bisect_left
N = int(eval(input()))
A = [int(i) for i in input().split()]
s = sum(A)
for i in range(1, N) :
A[i] += A[i-1]
def check(d) :
ifr = bisect_left(A, (s - 3 * d) // 4)
ito = bisect_left(A, (s + 3 * d) // 4)
for i in range(ifr, min(N, ito + 1)) :
jfr =... | from bisect import bisect_left
N = int(eval(input()))
A = [int(i) for i in input().split()]
s = sum(A)
for i in range(1, N) :
A[i] += A[i-1]
ret = float('inf')
for b in range(1, N - 1) :
a = bisect_left(A, A[b] / 2)
c = bisect_left(A, A[b] + (s - A[b]) / 2)
for i in [a - 1, a] :
... | p03310 |
N = int(eval(input()))
A = list(map(int, input().split()))
arrSum = list(sum(A[:idx+1]) for idx in range(N))
ans = float('inf')
##2分する区切り目の左のインデックスi: 1 ～ (N - 3)
nextJ, nextK = -1, -1
for i in range(1, (N - 3) + 1):
##左側の区間の右端はi番目まである
##区切り目の左のインデックスj: 0 ～ (i - 1)
buf = float('inf')
nextJ ... | ##https://beta.atcoder.jp/contests/abc102/submissions/2779056
n = int(eval(input()))
a = list(map(int, input().split()))
s = [a[0]]
for i in range(n-1):
s.append(s[i] + a[i+1])
ans = s[n-1]
##i,j,kは左側の区間の右端
##iは1からN-3まで
j = 0
k = 2
for i in range(1, (n - 3) + 1):
##BC(i)DE
##BCの区... | p03310 |
def get_num_f(data, sum_data):
left1, left2 = 0, sum_data
for i in range(len(data)- 1):
if left1 + data[i] >= left2 - data[i]:
pre_d = abs(left1 - left2)
now_d = abs((left1 + data[i]) - (left2 - data[i]))
if now_d < pre_d:
left1 += data[i]
... |
def main():
num = int(eval(input()))
data = list(map(int, input().split()))
l, c, r = 1, 2, 3
P = sum(data[:l])
Q = sum(data[l:c])
R = sum(data[c:r])
S = sum(data[r:])
ans = max(P, Q, R, S) - min(P, Q, R, S)
while c <= num-2:
while True:
if abs(... | p03310 |
# -*- coding: utf-8 -*-
from itertools import combinations
n = int(eval(input()))
a = [int(_) for _ in input().split()]
combs = combinations(list(range(1, n)), 3)
grief = 10**10
for comb in combs:
p = sum(a[:comb[0]])
q = sum(a[comb[0]:comb[1]])
r = sum(a[comb[1]:comb[2]])
s = sum(a[comb... | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(_) for _ in input().split()]
# my initial trial below ##############################
# from itertools import combinations
# combs = combinations(range(1, n), 3)
# grief = 10**10
# for comb in combs:
# p = sum(a[:comb[0]])
# q = sum(a[comb[0]:com... | p03310 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(_) for _ in input().split()]
# my initial trial below ##############################
# from itertools import combinations
# INF = 10 ** 15
# combs = combinations(range(1, n), 3)
# grief = INF
# for comb in combs:
# p = sum(a[:comb[0]])
# q = su... | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(_) for _ in input().split()]
# my initial attempt below ############################
# from itertools import combinations
# INF = 10 ** 15
# combs = combinations(range(1, n), 3)
# grief = INF
# for comb in combs:
# p = sum(a[:comb[0]])
# q = su... | p03310 |
# -*- coding: utf-8 -*-
def two_pointers(ary, l, r, split, ary_func, comb_func, comp_func):
'''
This function is supposed to be repeatedly called so that 'split' keeps
renewing, under an assumption that 'split' increases monotonously.
('l' and 'r' just specify the region to be searched in 'ary')
... | # -*- coding: utf-8 -*-
def two_pointers(ary, l, r, split, ary_func, comb_func, comp_func):
'''
This function is supposed to be repeatedly called so that 'split' keeps
renewing, under an assumption that 'split' increases monotonously.
('l' and 'r' just specify the region to be searched in 'ary')
... | p03310 |
from itertools import accumulate
from bisect import bisect_left
N, *A = list(map(int, open(0).read().split()))
A = [0] + list(accumulate(A))
ans = float("inf")
for i in range(2, N - 1):
lm = A[i] // 2
l = bisect_left(A, lm)
if abs(A[l - 1] - lm) < abs(A[l] - lm):
l -= 1
rm = (A... | from itertools import accumulate
from bisect import bisect_left
def main():
N, *A = list(map(int, open(0).read().split()))
A = [0] + list(accumulate(A))
ans = float("inf")
for i in range(2, N - 1):
lm = A[i] // 2
l = bisect_left(A, lm)
if abs(A[l - 1] - lm) < abs(A... | p03310 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
SUM = [0] * N
SUM[0] = A[0]
for i in range(1, N):
SUM[i] = SUM[i - 1] + A[i]
left_min = right_min = ans = float('INF')
left_max = right_max = 0
for r in range(2, N - 1):
# 左のしゃくとり
P, Q = P2, Q2 = -1, -1
p = 0
q = 1
w... | N = int(eval(input()))
A = [int(x) for x in input().split()]
SUM = [0] * N
SUM[0] = A[0]
for i in range(1, N):
SUM[i] = SUM[i - 1] + A[i]
left_min = right_min = ans = float('INF')
left_max = right_max = 0
p = 0
q = 1
r = N // 2
s = r + 1
for r in range(2, N - 1):
# 左
P1, Q1 = P2, Q2 = -1, ... | p03310 |
#102_D
N = int(eval(input()))
A = [int(i) for i in input().split()]
s = 0
AS = []
for i in range(N):
s += A[i]
AS.append(s)
#尺取り法
Ans = AS[N-1]+1
L = 0
R = 2
for Mid in range(1, N-2):
Sum_L = AS[Mid]
Sum_R = AS[N-1]-Sum_L
while abs((Sum_L - AS[L]) - AS[L]) > abs((Sum_L - AS[L+1]) - AS... | N = int(eval(input()))
A_list = [int(i) for i in input().split()]
Total_list = []
s = 0
for num in A_list:
s += num
Total_list.append(s)
L = 0
R = 2
ans = Total_list[N-1]+1
for Mid in range(1, N-2):
sum_L = Total_list[Mid]
sum_R = Total_list[N-1] - sum_L
while abs(sum_L - 2*Total_list[L]) >... | p03310 |
from itertools import *
n=int(eval(input()))
sumA=[0]+list(accumulate(list(map(int,input().split()))))
def check(l,m,r):
if m==r:return False
tmp=sumA[r]+sumA[l]
return abs(tmp-sumA[m+1]*2)<abs(tmp-sumA[m]*2)
res=float('inf')
li,ri=1,3
for mid in range(2,n-1):
while check(0,li,mid):li+=1
... | from itertools import *
eval(input())
s=list(accumulate(list(map(int,input().split()))))
l,r,t=0,2,s[-1];a=t
for m in s[1:-2]:
while abs(t-2*s[r]+m)>abs(t-2*s[r+1]+m):r+=1
while abs(m-2*s[l])>abs(m-2*s[l+1]):l+=1
x=sorted([s[l],m-s[l],s[r]-m,t-s[r]])
a=min(a,x[3]-x[0])
print(a) | p03310 |
def run(n, a):
sum_a = [sum(a[0:i+1]) for i in range(n)]
ret = sum_a[n - 1]
for i in range(2, n-1):
j_l = search_j(sum_a[: i], 0)
j_r = search_j(sum_a[i:], sum_a[i - 1]) + i
p = sum_a[j_l]
q = sum_a[i - 1] - p
r = sum_a[j_r] - q - p
s = sum_a[n - 1] -... | from itertools import accumulate
def run(n, a):
# sum_a = [sum(a[0:i+1]) for i in range(n)]
sum_a = list(accumulate(a))
li = 0
ri = 2
t = sum_a[-1]
diff = sum_a[-1]
# 真ん中の切れ込みを順に変更
# 左の切れ込みの位置はiに対して単調増加
# 左の切れ込みで真ん中の項を移動するかどうかは、
# 真ん中の項を除いて、小さい方に入れる
# ただし単調増加な... | p03310 |
from collections import deque
import bisect
n = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * (n + 1)
for i in range(n):
b[i + 1] = b[i] + a[i]
l, r = deque([b[1]]), deque(b[3 : n])
lenl, lenr = len(l), len(r)
ans = 1145141919810
for i in range(2, n - 1):
cl, cr = b[i] / 2, (b[n]... | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * (n + 1)
for i in range(n):
b[i + 1] = b[i] + a[i]
x = [[0, 0] for _ in range(n - 3)]
j = 1
for i in range(2, n - 1):
while True:
if i == j + 1:
x[i - 2][0] = b[j]
break
if abs(b[i] - 2 * b[j]... | p03310 |
# 整数列A
# 3箇所で切って、４つに
# それぞれの総和の最大値と最小値の差の絶対値の最小値
# 中央を固定することを考える(結局、その固定を全検索するが)
# 中央固定後、左側について、両方が同じくらいの値になるのが最適と考えて良いらしい
from itertools import accumulate
N=int(eval(input()))
A=list(map(int,input().split()))
SumA=list(accumulate(A))
tmpP=tmpQ=tmpR=tmpS=0
P=Q=R=S=0
left = -1
ans=10e9
for mid in... | # 整数列A
# 3箇所で切って、４つに
# それぞれの総和の最大値と最小値の差の絶対値の最小値
# 中央を固定することを考える(結局、その固定を全検索するが)
# 中央固定後、左側について、両方が同じくらいの値になるのが最適と考えて良いらしい
from itertools import accumulate
N=int(eval(input()))
A=list(map(int,input().split()))
SumA=list(accumulate(A))
tmpP=tmpQ=tmpR=tmpS=0
P=Q=R=S=0
ans=10e9
l = 0
r = 2
# midとm... | p03310 |
# 整数列A
# 3箇所で切って、４つに
# それぞれの総和の最大値と最小値の差の絶対値の最小値
# 中央を固定することを考える(結局、その固定を全検索するが)
# 中央固定後、左側について、両方が同じくらいの値になるのが最適と考えて良いらしい
from itertools import accumulate
N=int(eval(input()))
A=list(map(int,input().split()))
SumA=list(accumulate(A))
tmpP=tmpQ=tmpR=tmpS=0
P=Q=R=S=0
ans=10e9
l = 0
r = 2
# midとm... | # 整数列A
# 3箇所で切って、４つに
# それぞれの総和の最大値と最小値の差の絶対値の最小値
# 中央を固定することを考える(結局、その固定を全検索するが)
# 中央固定後、左側について、両方が同じくらいの値になるのが最適と考えて良いらしい
from itertools import accumulate
N=int(eval(input()))
A=list(map(int,input().split()))
SumA=list(accumulate(A))
tmpP=tmpQ=tmpR=tmpS=0
P=Q=R=S=0
ans=10e9
l = 0
r = 2
# midとm... | p03310 |
N=int(eval(input()))
A=list(map(int,input().split()))
cut_1=1
cut_2=2
cut_3=3
A_0=A[:cut_1]
S_0=sum(A_0)
A_1=A[cut_1:cut_2]
S_1=sum(A_1)
A_2=A[cut_2:cut_3]
S_2=sum(A_2)
A_3=A[cut_3:]
S_3=sum(A_3)
def irekae(S,T,i):
if abs(S-T)>abs((S-A[i-1])-(T+A[i-1])):
S=S-A[i-1]
... | N=int(eval(input()))
A=list(map(int,input().split()))
SUM=[0]
for a in A:
SUM.append(SUM[-1]+a)
i=1
j=2
k=3
P=SUM[i]
Q=SUM[j]-SUM[i]
R=SUM[k]-SUM[j]
S=SUM[N]-SUM[k]
ANS=10**10
check=1
while j<N-1:
check=1
while check==1:
check=0
if i<j-1:
if abs(P-Q)>... | p03310 |
# encoding: utf-8
import math
N = int(eval(input()))
A = list(map(int, input().split()))
def binsearch(seq, l, r, tar):
# print("##", l, r, LmR[l:r + 1], tar)
m = l + (r - l) // 2
if l >= r: return l
elif seq[m] < tar: return binsearch(seq, m + 1, r, tar)
else: return binsearch(seq, l, m,... | # encoding: utf-8
import math
N = int(eval(input()))
A = list(map(int, input().split()))
def binsearch(seq, l, r, tar):
# print("##", l, r, LmR[l:r + 1], tar)
m = l + (r - l) // 2
if l >= r: return l
elif seq[m] < tar: return binsearch(seq, m + 1, r, tar)
else: return binsearch(seq, l, m,... | p03310 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
def binary_search(A, x):
low = 0
high = len(A) - 1
mid = (low + high) // 2
while low <= high:
if A[mid] == x:
break
elif A[mid] < x:
low = mid + 1
... | # coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
B = A[:]
# 累積和
for i in range(1, N):
B[i] = B[i] + B[i - 1]
ans = INF
mid_l = 0
mid_r = 2
t = B[-1]
for mid in range(1, N - 1):
while mid_l < mid and abs(2 * B[mid... | p03310 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
B = A[:]
# 累積和
for i in range(1, N):
B[i] = B[i] + B[i - 1]
ans = INF
mid_l = 0
mid_r = 2
t = B[-1]
for mid in range(1, N - 1):
while mid_l < mid and abs(2 * B[mid... | # coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
B = A[:]
# 累積和
for i in range(1, N):
B[i] = B[i] + B[i - 1]
ans = INF
mid_l = 0
mid_r = 2
t = B[-1]
for mid in range(1, N - 1):
while B[mid] > B[mid_l] + B[mid_l +... | p03310 |
N = int(eval(input()))
A = list(map(int, input().split()))
R = [0] * (N + 1)
for i in range(N):
R[i + 1] += R[i] + A[i]
#print(R)
ans = 10 ** 15
for i in range(3, N):#R[:i]とR[i:]に切る
l, r = 2, i + 1
#R[:l], R[l:i], R[i:r], R[r:]
#R[l - 1] と R[i - 1] - R[l - 1] の差を考える
while abs(R[i - 1] - 2 *... | N = int(eval(input()))
A = list(map(int, input().split()))
R = [0] * (N + 1)
for i in range(N):
R[i + 1] += R[i] + A[i]
#print(R)
ans = 10 ** 15
l, r = 2, 4
for i in range(3, N):#R[:i]とR[i:]に切る
#R[:l], R[l:i], R[i:r], R[r:]
#R[l - 1] と R[i - 1] - R[l - 1] の差を考える
while abs(R[i - 1] - 2 * R[l])... | p03310 |
import math
n = int(eval(input()))
a = [int(i) for i in input().split(" ")]
ar = a[::-1]
a = [0] + a
ar = [0] + ar
s = [0] * (n + 1)
sr = [0] * (n + 1)
for i in range(1, n + 1):
s[i] = a[i] + s[i - 1]
sr[i] = ar[i] + sr[i - 1]
def bs(s, l, r, rr):
if l == r:
return l
else... | import math
n = int(eval(input()))
a = [int(i) for i in input().split(" ")]
ar = a[::-1]
a = [0] + a
ar = [0] + ar
s = [0] * (n + 1)
sr = [0] * (n + 1)
li = 0
ri = n
for i in range(1, n + 1):
s[i] = a[i] + s[i - 1]
sr[i] = ar[i] + sr[i - 1]
def f(a):
return max(a) - min(a)
def f... | p03310 |
from itertools import accumulate
n=int(eval(input()))
a=list(map(int, input().split()))
acc=list(accumulate(a))
sumA=acc[-1]
cut=[0, 1, 2, len(a)-1]
score=[acc[cut[0]], acc[cut[1]]-acc[cut[0]], acc[cut[2]]-acc[cut[1]], acc[cut[3]]-acc[cut[2]]]
ans=max(score)-min(score)
for i in range(1,len(a)-1):
cut[1]=i ... | from itertools import accumulate
n=int(eval(input()))
a=list(map(int, input().split()))
acc=list(accumulate(a))
left=0; right=2
ans=float('inf')
for center in range(1,n-1):
while abs(acc[center]-acc[left]-acc[left]) > abs(acc[center]-acc[left+1]-acc[left+1]):
left+=1
while abs(acc[n-1]-acc[rig... | p03310 |
from itertools import accumulate
n=int(eval(input()))
a=list(map(int, input().split()))
acc=list(accumulate(a))
left=0; right=2
ans=float('inf')
for center in range(1,n-1):
while abs(acc[center]-acc[left]-acc[left]) > abs(acc[center]-acc[left+1]-acc[left+1]):
left+=1
while abs(acc[n-1]-acc[rig... | from itertools import accumulate
n=int(eval(input()))
a=list(map(int, input().split()))
acc=list(accumulate(a))
left=0; center=1; right=2
ans=float('inf')
score=[acc[left], acc[center]-acc[left], acc[right]-acc[center], acc[n-1]-acc[right]]
nextS=[acc[left+1], acc[center]-acc[left+1], acc[right+1]-acc[center], a... | p03310 |
def min_diff(x, base=0):
n = len(x)
ok = - 1 # x[ok] - base < x[n - 1] - x[ok]
ng = n - 1
while ng - ok > 1:
mid = (ok + ng) // 2
if x[mid] - base < x[n - 1] - x[mid]:
ok = mid
else:
ng = mid
d_ok = abs((x[ok] - base) - (x[n - 1] - x[ok]))
... | def main():
N = int(eval(input()))
A = list(map(int, input().split(' ')))
X = [0 for _ in range(N + 1)] # cum sum
for i in range(N):
X[i + 1] = X[i] + A[i]
# split to 2 parts (X_0, ..., X_i), (X_(i+1), ..., X_N)
ans = 10**10
left = 0
right = 2
for i in range(1, N):... | p03310 |
n=int(eval(input()))
a=list(map(int,input().split()))
a=[sum(a[:i])+a[i] for i in range(len(a))]
j=0
k=2
ans=10**9
for i in range(1,n-1):
while abs(a[j]*2-a[i])>abs(a[j+1]*2-a[i]):
j+=1
while abs(a[k]*2-a[i]-a[n-1])>abs(a[k+1]*2-a[i]-a[n-1]):
k+=1
t=[a[j],a[i]-a[j],a[k]-a[i],a[n... | n=int(eval(input()))
a=[int(i) for i in input().split()]
for i in range(n-1):
a[i+1]+=a[i]
j=0
k=2
ans=10**9
for i in range(1,n-1):
while abs(a[j]*2-a[i])>abs(a[j+1]*2-a[i]):
j+=1
while abs(a[k]*2-a[i]-a[n-1])>abs(a[k+1]*2-a[i]-a[n-1]):
k+=1
t=[a[j],a[i]-a[j],a[k]-a[i],... | p03310 |
INF = 2 * 10**5 * 10**9
n = int(eval(input()))
a = list(map(int,input().split()))
s = [0]
for x in a:
s.append(s[-1]+x)
ans = INF
p1 = 1
p = 2
p2 = 3
def update():
global ans
if p1 < p and p2 < n:
ans = min(ans , max(s[p1],s[p]-s[p1],s[p2]-s[p],s[n]-s[p2]) - min(s[p1],s[p]-s[p1],s[p2]-... | INF = 2 * 10**5 * 10**9
n = int(eval(input()))
a = list(map(int,input().split()))
s = [0]
for x in a:
s.append(s[-1]+x)
ans = INF
p1 = 1
p = 1
p2 = 3
while True:
p += 1
if p + 1 >= n:
break
while p1 < p and abs(s[p1] - s[p] + s[p1]) > abs(s[p1+1] - s[p] + s[p1 + 1]):
p1 +=... | p03310 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = a[0]
c = a[1]
d = a[2]
e = sum(a[3:n])
p = 0
q = 1
r = 2
while r+1 <= n-2 and abs((d+a[r+1])-(e-a[r+1])) < abs(d-e):
r += 1
d += a[r]
e -= a[r]
m = max(b,c,d,e) - min(b,c,d,e)
while q <= n-4:
q += 1
c += a[q]
d -= a[q]
... | n = int(eval(input()))
a = list(map(int,input().split()))
b,c,d,e = 0,a[0],a[1],sum(a[2:n])
p,q,r = -1,1,1
m = sum(a)
while q <= n-3:
c += a[q]
d -= a[q]
while p+1 <= q-1 and abs(b-c+2*a[p+1]) <= abs(b-c):
p += 1
b += a[p]
c -= a[p]
while r+1 <= n-2 and abs(d-e+2*a[r+1]) <= abs(d-e):... | p03310 |
import bisect
n = int(eval(input()))
a = list(map(int, input().split()))
cum = [0] * (n+1)
for i in range(n):
cum[i+1] = cum[i] + a[i]
cum.append(10**10)
mincost = 10 ** 10
for mid in range(2,n-1):
ll = bisect.bisect_left(cum[:mid], cum[mid]//2)
rl = bisect.bisect_left(cum[mid:], cum[mid+1] + (cum... | n = int(eval(input()))
a = list(map(int, input().split()))
cum = [0] * (n+1)
for i in range(n):
cum[i+1] = cum[i] + a[i]
llsum = a[0]
lrsum = a[1]
l = [0] * n
l[2] = 1
for mid in range(3, n-1):
new = a[mid-1]
lrsum += new
l[mid] = l[mid-1]
unk = a[l[mid]]
while(abs(lrsum - llsum) >... | p03310 |
N=int(eval(input()))
A=list(map(int,input().split()))
h=[0]
for a in A:
h.append(a+h[-1])
h.pop(0)
def spl_l(i,b):
while abs(h[i]-2*h[b])>abs(h[i]-2*h[b+1]):
b+=1
return b
def spl_r(i,b):
while abs(h[-1]-2*h[b]+h[i])>abs(h[-1]-2*h[b+1]+h[i]):
b+=1
return b
def calc(j,i,... | N=int(eval(input()))
A=list(map(int,input().split()))
h=[0]
for a in A:
h.append(a+h[-1])
h.pop(0)
def spl_l(i,b):
while abs(h[i]-2*h[b])>abs(h[i]-2*h[b+1]):
b+=1
return b
def spl_r(i,b):
while abs(h[-1]-2*h[b]+h[i])>abs(h[-1]-2*h[b+1]+h[i]):
b+=1
return b
def calc(j,i,... | p03310 |
n,m=list(map(int,input().split()))
List=[]
for i in range(m):
road=list(map(int,input().split()))
List.append(road)
road=[road[1],road[0]]
List.append(road)
ans=0
for i in range(1,n+1):
for j in range(len(List)):
if i==List[j][0]:
ans+=1
print(ans)
ans=0
| n,m=list(map(int,input().split()))
List=[]
for i in range(m):
a,b=list(map(int,input().split()))
List.append([a,b])
List.append([b,a])
ans=0
for i in range(1,n+1):
for j in range(len(List)):
if i==List[j][0]:
ans+=1
print(ans)
ans=0 | p03720 |
n, m = list(map(int, input().split()))
route_lists = [input().split() for i in range(m)]
new_lists = []
for i in route_lists:
for j in range(2):
new_lists.append(i[j]) ... | n, m = list(map(int, input().split()))
route_lists = [input().split() for i in range(m)]
new_lists = []
for i in route_lists:
for j in range(2):
new_lists.append(i[j]) ... | p03720 |
n, m = list(map(int, input().split()))
d = []
for i in range(m):
a, b = list(map(int, input().split()))
d.append(a)
d.append(b)
d = sorted(d)
for i in range(1, n + 1):
count = 0
for j in range(len(d)):
if d[j] == i:
count += 1
print(count)
| n, m = list(map(int, input().split()))
d = [0]*n
for i in range(m):
a, b = list(map(int, input().split()))
d[a - 1] += 1
d[b - 1] += 1
for i in d:
print(i) | p03720 |
n, m = (int(i) for i in input().split())
city2city = [0] * n
for i in range(m):
a,b = (int(i) for i in input().split())
city2city[a-1] += 1
city2city[b-1] += 1
for c in city2city:
print(c)
| def main():
N, M = (int(i) for i in input().split())
c = [0 for i in range(N)]
for i in range(M):
a, b = (int(i) for i in input().split())
c[a-1] += 1
c[b-1] += 1
print(*c, sep="\n")
if __name__ == '__main__':
main()
| p03720 |
N,_,*L=map(int,open(0).read().split())
A=[0]*N
for l in L: A[l-1]+=1
print(*A,sep='\n')
| N,_,*L=list(map(int,open(0).read().split()))
for n in range(N):print((L.count(n+1))) | p03720 |
import sys
from collections import Counter
sys.setrecursionlimit(10**7)
inf = 1<<100
def solve():
N, M = map(int, input().split())
ans = [0]*N
for i in range(M):
ai, bi = map(int, input().split())
ai -= 1
bi -= 1
ans[ai] += 1
ans[bi] += 1
... | import sys
def solve():
N, M = map(int, input().split())
deg = [0] * N
for i in range(M):
ai, bi = map(int, input().split())
ai, bi = ai - 1, bi - 1
deg[ai] += 1
deg[bi] += 1
print(*deg, sep='\n')
if __name__ == '__main__':
solve()
| p03720 |
from collections import Counter
n,m=list(map(int,input().split()))
L=[0]*(2*m)
for i in range(m):
L[2*i],L[2*i+1]=list(map(int,input().split()))
s=Counter(L)
for i in range(n):
print((s[i+1])) | n,m=map(int,input().split())
ans=[0]*n
for _ in range(m):
a,b=map(int,input().split())
ans[a-1] += 1
ans[b-1] += 1
print(*ans, sep="\n")
| p03720 |
N,M= list(map(int,input().split()))
f = [0] * (N + 2)
for i in range(M):
x,y = list(map(int,input().split()))
f[x]+=1
f[y]+=1
for i in range(1,N+1):
print((f[i])) | # 061 B
N,M= list(map(int,input().split()))
f = [0] * (N + 20)
for i in range(M):
x,y = list(map(int,input().split()))
f[x]+=1
f[y]+=1
for i in range(1,N+1):
print((f[i])) | p03720 |
n, m = list(map(int, input().split()))
a = [0] * m
b = [0] * m
for i in range(m):
a[i], b[i] = list(map(int, input().split()))
count = 0
for i in range(1, n + 1):
count = a.count(i) + b.count(i)
print(count) | n, m = list(map(int, input().split()))
a = [0] * m
b = [0] * m
for i in range(m):
a[i], b[i] = list(map(int, input().split()))
road = [0] * n
for i in range(m):
road[a[i] - 1] += 1
road[b[i] - 1] += 1
for i in range(n):
print((road[i])) | p03720 |
# -*- coding: utf-8 -*-
import sys
import subprocess
import json
import time
import math
import re
import sqlite3
N, M = list(map(int, input().split()))
l = []
for i in range(N):
l.append(0)
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1; b -= 1;
l[a] += 1
l[b... | # -*- coding: utf-8 -*-
import sys
import subprocess
import json
import time
import math
import re
import sqlite3
N, M = list(map(int, input().split()))
l = [0] * N
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1; b -= 1;
l[a] += 1
l[b] += 1
for i in range(N):
... | p03720 |
from collections import defaultdict
N, M = list(map(int, input().split()))
city_road_nums = defaultdict(int)
for _ in range(M):
a, b = list(map(int, input().split()))
city_road_nums[a] += 1
city_road_nums[b] += 1
for i in range(1, N+1):
print((city_road_nums[i]))
| N, M = list(map(int, input().split()))
ABs = [input().split() for i in range(M)]
MPs = {}
for a, b in ABs:
a = int(a)
b = int(b)
if a not in MPs:
MPs[a] = 1
else:
MPs[a] += 1
if b not in MPs:
MPs[b] = 1
else:
MPs[b] += 1
for mp in range(1, N... | p03720 |
N, M = list(map(int, input().split()))
A = []
B = []
for i in range(M):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
AB = A + B
# 各都市間の道路の本数は、ABに含まれる各都市の個数（番号）に等しい
roadsCntArray = []
# 入力に含まれる都市の個数を数える
for i in range(N):
roadsCntArray.append(AB.count(i+1))
for i in r... | N, M = list(map(int, input().split()))
A = []
B = []
for i in range(M):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
AB = A + B
# 各都市間の道路の本数は、ABに含まれる各都市の個数（番号）に等しい
roadsCntArray = []
# 入力に含まれる都市の個数を数える
for i in range(N):
roadsCntArray.append(AB.count(i+1))
print((r... | p03720 |
n, m = list(map(int, input().split()))
RD = list(list(map(int, input().split())) for _ in range(m))
for i in range(1, n + 1):
ans = 0
for j in RD:
ans += j.count(i)
print(ans) | n, m = list(map(int, input().split()))
NRD = list(0 for i in range(n))
for i in range(m):
r1, r2 = list(map(int, input().split()))
NRD[r1 - 1] += 1
NRD[r2 - 1] += 1
for i in range(n):
print((NRD[i])) | p03720 |
N,M=list(map(int,input().split()))
li=[]
for i in range(M):
a,b=list(map(int,input().split()))
li.append(a)
li.append(b)
ans=[0]*N
for j in range(1,N+1):
cj=li.count(j)
ans[j-1]=cj
for k in range(N):
print((ans[k]))
| N,M=list(map(int,input().split()))
li=[0]*N
for i in range(M):
a,b=list(map(int,input().split()))
li[a-1]+=1
li[b-1]+=1
for j in range(N):
print((li[j]))
| p03720 |
a = list(map(int,input().split()))
b = [list(map(int,input().split())) for i in range(a[1])]
c = []
for i in range(a[0]):
d = []
for j in range(a[1]):
d.append(b[j].count(i+1))
else:
c.append(sum(d))
else:
for i in range(a[0]):
print((c[i])) | N,M = list(map(int,input().split()))
z = []
for i in range(M):
a,b = list(map(int,input().split()))
z.append(a)
z.append(b)
for i in range(N):
print((z.count(i+1)))
| p03720 |
N,M,*A=list(map(int,open(0).read().split()));l=[0]*N
for a,b in zip(A[::2],A[1::2]):l[a-1]+=1;l[b-1]+=1
for r in l:print(r) | N,M,*A=list(map(int,open(0).read().split()));l=[0]*N
for a in A:l[a-1]+=1
for r in l:print(r) | p03720 |
def getlist():
return list(map(int, input().split()))
n,m = getlist()
cities = [0 for i in range(n)]
for i in range(m):
a,b = getlist()
cities[a-1] += 1
cities[b-1] += 1
print(("\n".join(list(map(str, cities))))) | n,m = list(map(int, input().split()))
cities = [0 for i in range(n)]
for i in range(m):
bridges = list(map(int, input().split()))
cities = [x+1 if i+1 in bridges else x for i,x in enumerate(cities)]
print(("\n".join(list(map(str, cities))))) | p03720 |
n,m = list(map(int, input().split()))
adj = [[] for i in range(n)]
for i in range(m):
a,b = list(map(int, input().split()))
a-=1
b-=1
adj[a].append(b)
adj[b].append(a)
for i in adj:
print((len(i))) | N,M = (int(x) for x in input().split())
result = [0]*N
for i in range(M):
a,b = (int(x) for x in input().split())
result[a-1] += 1
result[b-1] += 1
for i in result:
print(i) | p03720 |
N, M = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(M)]
d = {}
for i in range(1,N+1):
d[i] = 0
for i in range(M):
a, b = A[i][0], A[i][1]
d[a] += A[i].count(a)
d[b] += A[i].count(b)
for k, v in list(d.items()):
print(v) | N, M = list(map(int,input().split()))
d = [0]*(N)
for _ in range(M):
a, b = list(map(int,input().split()))
d[a-1] += 1
d[b-1] += 1
for v in d:
print(v) | p03720 |
n,m = list(map(int,input().split()))
abm = [list(map(int,input().split())) for _ in range(m)]
countDic = {}
for nn in range(n+1):
countDic[nn] = 0
for ab in abm:
countDic[ab[0]] += 1
countDic[ab[1]] += 1
ks = list(countDic.keys())
ks = sorted(ks)[1:]
for k in ks:
print((countDic[k])) | n,m = list(map(int,input().split()))
ans = [0]*n
for _ in range(m):
a,b = list(map(int,input().split()))
ans[a-1]+=1
ans[b-1]+=1
for an in ans:
print(an) | p03720 |
n,m=list(map(int,input().split()))
ls=[0]*(n+1)
for i in range(m):
a,b= list(map(int,input().split()))
ls[a]+=1
ls[b]+=1
for j in range(1,n+1):
print((ls[j])) | n,m=list(map(int,input().split()))
s=[0]*(n+1)
for i in range(m):
a,b=list(map(int,input().split()))
s[a]+=1
s[b]+=1
for i in range(1,n+1):
print((s[i])) | p03720 |
N,M = list(map(int,input().split()))
cint = [0,0]*M
for i in range(M):
cint[i]=list(map(int,input().split()))
for i in range(1,N+1):
count=0
for j in range(M):
if cint[j][0] == i or cint[j][1] == i:
count +=1
print(count) | N,M = list(map(int,input().split()))
count =[0]*N
for i in range(M):
ca,cb=list(map(int,input().split()))
count[ca-1] +=1
count[cb-1] +=1
for i in range(N):
print((count[i]))
| p03720 |
class Dice(object):
"""Dice Class
"""
def __init__(self, numbers):
"""
Args:
numbers:
"""
self.numbers_inverse = {numbers[0]: 1, numbers[1]: 2, numbers[2]: 3, numbers[3]: 4, numbers[4]: 5,
numbers[5]: 6}
self... | class Dice(object):
"""Dice Class
"""
def __init__(self, numbers):
"""
Args:
numbers:
"""
self.numbers_inverse = {numbers[0]: 1, numbers[1]: 2, numbers[2]: 3, numbers[3]: 4, numbers[4]: 5,
numbers[5]: 6}
self... | p02386 |
import random
class Dice:
def __init__(self, num_list):
self.top = num_list[0]
self.dside = num_list[1]
self.rside = num_list[2]
self.lside = num_list[3]
self.uside = num_list[4]
self.bottom = num_list[5]
self.dlist = num_list
def north(self):
... | import random
class Dice:
def __init__(self, num_list):
self.top = num_list[0]
self.dside = num_list[1]
self.rside = num_list[2]
self.lside = num_list[3]
self.uside = num_list[4]
self.bottom = num_list[5]
self.dlist = num_list
def north(self):
... | p02386 |
n = int(input())
dice = [[0 for i in range(6)] for j in range(n)]
for i in range(n):
dice[i] = list(map(int, input().split()))
def rolling(inst, dice):
if inst == 'E':
dice[5], dice[2], dice[0], dice[3] = dice[2], dice[0], dice[3], dice[5]
elif inst == 'W':
dice[5], dice[3], dic... | n = int(input())
dice = [[0 for i in range(6)] for j in range(n)]
for i in range(n):
dice[i] = list(map(int, input().split()))
def rolling(inst, dice):
if inst == 'E':
dice[5], dice[2], dice[0], dice[3] = dice[2], dice[0], dice[3], dice[5]
elif inst == 'W':
dice[5], dice[3], dic... | p02386 |
from itertools import*
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
for k in range(n):
b=a[k];b[3],b[4]=b[4],b[3]
t=0
lst=list(combinations(a,2))
for d,e in lst:
for i in range(6):
m=('012345','152043','215304','302541','410352','514320')[i]
f=[d[int(k)]for k in m]
if f[0]... | n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
for k in range(n):
b=a[k];b[3],b[4]=b[4],b[3]
t=0
for i in range(n-1):
d=a[i]
for j in range(i+1,n):
e=a[j]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
if f[0]==e[0]and f[5]==e[5... | p02386 |
import sys
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
if f[0]==e[0]and f[5]=... | n=int(input())
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
if f[0]==e[0]and f[5]==... | p02386 |
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
g=f[1:5]*2
f... | n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
if f[0]==e[0]:
... | p02386 |
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[k]for k in ... | n=int(eval(input()))
a=[[int(s)for s in input().split()]for _ in range(n)]
def f():
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[k]for k i... | p02386 |
from itertools import*
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for p,q in list(combinations(a,2)):
d=p[:];d[3],d[4]=d[4],d[3]
e=q[:];e[3],e[4]=e[4],e[3]
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[k]for k... | from itertools import*
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
for k in range(n):
b=a[k];b[3],b[4]=b[4],b[3]
def f():
for d,e in list(combinations(a,2)):
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[k]for k in p]
... | p02386 |
from itertools import*
def g():
n=int(eval(input()))
a=[[s for s in input().split()]for _ in range(n)]
for b in a:
b[3:5]=b[4],b[3]
t=0
for d,e in combinations(a,2):
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(i)]for i in p]
if f[0]==e[0]and f[5]==e[5]:
f=f[1:... | from itertools import*
n=int(eval(input()))
a=[input().split()for _ in[0]*n]
for b in a:
b[3:5]=b[4],b[3]
def f():
for d,e in combinations(a,2):
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[i]for i in p]
if f[0]==e[0]and f[5]==e[5]:
f=f[1:5]... | p02386 |
from itertools import*
n=int(eval(input()))
a=[input().split()for _ in[0]*n]
for b in a:
b[3:5]=b[4],b[3]
def f():
for d,e in combinations(a,2):
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[i]for i in p]
if f[0]==e[0]and f[5]==e[5]:
f=f[1:5]... | from itertools import*
n=int(eval(input()))
a=[input().split()for _ in[0]*n]
for b in a:
b[3:5]=b[4],b[3]
def g():
for d,e in combinations(a,2):
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[i]for i in p]
if f[0::5]==e[0::5]:
f=f[1:5]*2
... | p02386 |
class Dice:
def __init__(self):
self.u=1
self.w=2
self.s=3
self.e=4
self.n=5
self.d=6
self.dic={"W":0,"S":1,"E":2,"N":3}
def __init__(self,u,w,s,e,n,d):
self.u=u
self.w=w
self.s=s
self.e=e
self.n=... | class Dice:
def __init__(self):
self.u=1
self.w=2
self.s=3
self.e=4
self.n=5
self.d=6
self.dic={"W":0,"S":1,"E":2,"N":3}
def __init__(self,u,w,s,e,n,d):
self.u=u
self.w=w
self.s=s
self.e=e
self.n... | p02386 |
class Dice:
def __init__(self):
self.u=1
self.w=2
self.s=3
self.e=4
self.n=5
self.d=6
self.dic={"W":0,"S":1,"E":2,"N":3}
def __init__(self,u,w,s,e,n,d):
self.u=u
self.w=w
self.s=s
self.e=e
self.n... | class Dice:
def __init__(self):
self.u=1
self.w=2
self.s=3
self.e=4
self.n=5
self.d=6
self.dic={"W":0,"S":1,"E":2,"N":3}
def __init__(self,u,w,s,e,n,d):
self.u=u
self.w=w
self.s=s
self.e=e
self.n... | p02386 |
import random
class Dice(object):
def __init__(self):
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
def __init__(self, faces):
self.t = faces[0]
self.s = faces[1]
self.e = faces[2]
self.w = fac... | import random
class Dice(object):
def __init__(self):
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
def __init__(self, faces):
self.t = faces[0]
self.s = faces[1]
self.e = faces[2]
self.w = fac... | p02386 |
def main():
n = int(eval(input()))
dices = []
for i in range(n):
dices.append(Dice(list(map(int, input().split(' ')))))
if not equals_any(dices):
print('Yes')
else:
print('No')
def equals_any(dices):
for i, d1 in enumerate(dices):
for d2 in [d for... | class Dice:
def __init__(self, nums):
self.top = nums[0]
self.front = nums[1]
self.right = nums[2]
self.left = nums[3]
self.back = nums[4]
self.bottom = nums[5]
def toN(self):
tmp = self.top
self.top = self.front
self.... | p02386 |
def roll(die, d):
if d == "E":
return [die[3], die[1], die[0], die[5], die[4], die[2]]
if d == "N":
return [die[1], die[5], die[2], die[3], die[0], die[4]]
if d == "S":
return [die[4], die[0], die[2], die[3], die[5], die[1]]
if d == "W":
return [die[2], die[1], di... | def roll(die, d):
if d == "E":
return [die[3], die[1], die[0], die[5], die[4], die[2]]
if d == "N":
return [die[1], die[5], die[2], die[3], die[0], die[4]]
if d == "S":
return [die[4], die[0], die[2], die[3], die[5], die[1]]
if d == "W":
return [die[2], die[1], di... | p02386 |
import copy, sys
class Dice(object):
def __init__(self, nums):
self.top, self.front, self.right, self.left, self.back, self.bottom = nums
def roll(self, directions):
if directions == 'E':
self.top, self.right, self.left, self.bottom = self.left, self.top, self.bottom, self.... | import copy, sys
class Dice(object):
def __init__(self, nums):
self.top, self.front, self.right, self.left, self.back, self.bottom = nums
def roll(self, directions):
if directions == 'E':
self.top, self.right, self.left, self.bottom = self.left, self.top, self.bottom, self.... | p02386 |
class Dice:
def __init__(self):
# 初期値がない場合
# 上, 南、東、西、北、下にそれぞれ1, 2, 3, 4, 5, 6がくる想定
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
self.rotway = {"S": 0, "N": 1, "E": 2, "W": 3}
def __init__(self, t, s, e, ... | class Dice:
def __init__(self):
# 初期値がない場合
# 上, 南、東、西、北、下にそれぞれ1, 2, 3, 4, 5, 6がくる想定
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
self.rotway = {"S": 0, "N": 1, "E": 2, "W": 3}
def __init__(self, t, s, e, ... | p02386 |
class Dice:
def __init__(self):
# 初期値がない場合
# 上, 南、東、西、北、下にそれぞれ1, 2, 3, 4, 5, 6がくる想定
self.t = 1
self.s = 2
self.e = 3
self.w = 4
self.n = 5
self.b = 6
self.rotway = {"S": 0, "N": 1, "E": 2, "W": 3}
def __init__(self, t, s, e, ... | def main():
n = int(eval(input()))
dices=[]
same = 0
for _ in range(n):
dices.append(list(map(int, input().split())))
for i in range(n-1):
for j in range(i+1,n):
same += check_dice(dices[i], dices[j])
if same >= 1:
print('No')
... | p02386 |
def check(x, y):
z = [0, 1, 2]
for i in range(6):
order = [0, 0, 0]
for j in range(3):
if {x[j], x[-j-1]} != {y[z[j]], y[-z[j]-1]}:
break
if x[j] == y[z[j]]:
order[j] = 1
if x[j] == x[-j-1]:
o... | def check(x, y):
for i in range(6):
order = [0, 0, 0]
for j in range(3):
if {x[j], x[-j-1]} != {y[z[i][j]], y[-z[i][j]-1]}:
break
if x[j] == y[z[i][j]]:
order[j] = 1
if x[j] == x[-j-1]:
order[j] = 2
... | p02386 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.