input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
numbers = list(map(int, input().split()))
def checkCondition():
for i in range(n-1):
if numbers[i] > numbers[i+1]:
if numbers[i] - numbers[i+1] > 1:
return False
for i in range(-1, -n, -1):
if numbers[i-1] - numbers[i] == 1:
numbers[i-1] -= 1
elif n... | n = int(eval(input()))
numbers = list(map(int, input().split()))
def checkCondition():
for i in range(n-1):
if numbers[i] > numbers[i+1] + 1:
return False
for i in range(-1, -n, -1):
if numbers[i-1] - numbers[i] == 1:
numbers[i-1] -= 1
elif numbers[i-1] - numbers[i] > 1:
re... | p02953 |
n = int(eval(input()))
numbers = list(map(int, input().split()))
def checkCondition():
for i in range(n-1):
if numbers[i] > numbers[i+1] + 1:
return False
for i in range(-1, -n, -1):
if numbers[i-1] - numbers[i] == 1:
numbers[i-1] -= 1
elif numbers[i-1] - numbers[i] > 1:
re... | n = int(eval(input()))
numbers = list(map(int, input().split()))
def checkCondition():
for i in range(n-1):
if numbers[i] > numbers[i+1]:
if numbers[i] - numbers[i+1] > 1:
return False
for i in range(-1, -n, -1):
sub = numbers[i-1] - numbers[i]
if sub == 1:
numbers[i-1] -... | p02953 |
import sys
import bisect
input = sys.stdin.readline
def main():
n=int(eval(input()))
h = list(map(int,input().split()))
ans="Yes"
for i in range(n-1):
b=h[0]
h.pop(0)
if(b>=min(h)+2):
ans="No"
if(ans=="No"):
break
... | import sys
import bisect
input = sys.stdin.readline
def main():
n=int(eval(input()))
h = list(map(int,input().split()))
ans="Yes"
m=0
for i in range(n):
if(m>=h[i]+2):
ans="No"
else:
m=max(m,h[i])
if(ans=="No"):
break
... | p02953 |
def c_build_stairs(N, H):
for i in range(N - 1):
if H[i] < H[i + 1]:
H[i + 1] -= 1
for i in range(N - 1):
if H[i] > H[i + 1]:
return 'No'
return 'Yes'
N = int(eval(input()))
H = [int(i) for i in input().split()]
print((c_build_stairs(N, H))) | def c_build_stairs(N, H):
for i in range(N - 1, 0, -1):
if H[i - 1] - H[i] >= 2:
return 'No'
elif H[i - 1] - H[i] == 1:
H[i - 1] -= 1
return 'Yes'
N = int(eval(input()))
H = [int(i) for i in input().split()]
print((c_build_stairs(N, H))) | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(N-1):
minh = min(H[i+1:]) # i+1以降のリストをスライス
if H[i] - minh >= 2:
print('No')
break
else:
continue
else:
print('Yes')
"""
# よく考えたら最大だけじゃダメだった
m = H.index(max(H)) # 複数の候補がある場合は最初のインデックスを返す
pr... | N = int(eval(input()))
H = list(map(int, input().split()))
highest = 0
for i in range(N-1):
highest = max(highest, H[i])
if highest - 1 <= H[i+1]:
continue
else:
print('No')
break
else:
print('Yes')
| p02953 |
n=int(eval(input()))
h=list(map(int,input().split()))
for i in range(n-1):
for j in range(i,n):
if h[i]-h[j]>=2:
print('No')
exit()
print('Yes') | n=int(eval(input()))
h=list(map(int,input().split()))
for i in range(1,n):
if h[i]-1>=h[i-1]:
h[i]-=1
x=sorted(h)
print(('Yes' if x==h else 'No'))
| p02953 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
h = [int(i) for i in input().split()]
flag = True
for i in reversed(list(range(n - 1))):
if h[i] - h[i + 1] == 1:
h[i] -= 1
elif h[i] > h[i + 1]:
flag = False
if flag:
print("Yes")
else:
print("No")
| # -*- coding: utf-8 -*-
n = int(eval(input()))
h = [int(i) for i in input().split()]
flag = True
for i in reversed(list(range(n - 1))):
if h[i] - h[i + 1] == 1:
h[i] -= 1
elif h[i] > h[i + 1]:
flag = False
break
if flag:
print("Yes")
else:
print("No")
| p02953 |
import sys
sys.setrecursionlimit(10**6)
def solve(n, h, cur, l):
if cur > n:
return True
else:
if l < h[cur]:
return solve(n, h, cur+1, h[cur]-1) or solve(n, h, cur+1, h[cur])
elif l == h[cur]:
return solve(n, h, cur+1, h[cur])
else:
return False
N = int(eval(input(... | import sys
sys.setrecursionlimit(10**6)
def solve(n, h, cur, l):
if cur > n:
return True
else:
if l < h[cur]:
return solve(n, h, cur+1, h[cur]-1)
elif l == h[cur]:
return solve(n, h, cur+1, h[cur])
else:
return False
N = int(eval(input()))
H = [-1]+list(map(int, in... | p02953 |
N = int(eval(input()))
H = [int(i) for i in input().split()]
t = 0
if N >= 2:
for i in range(N-1):
if H[i] >= min(H[i+1:N]) + 2:
t += 1
if t == 0:
print("Yes")
else:
print("No") | N = int(eval(input()))
H = [int(i) for i in input().split()]
t = 0
s = 0
if N >= 2:
for i in range(N-1):
if H[i] > H[i+1]:
t += 1
if t == 2:
s += 1
if H[i] < H[i+1]:
t = 0
if H[i] >= H[i+1] +2:
s += 1
if s == 0:
print("Yes")
else:
print("No") | p02953 |
n = int(eval(input()))
h=list(map(int,input().split()))
maxh = [i for i, x in enumerate(h) if x==max(h)]
minh = [i for i, x in enumerate(h) if x==min(h)]
if min(maxh)<max(minh) and max(h)-1>min(h):
print("No")
else:
print("Yes") | n = int(eval(input()))
h=list(map(int,input().split()))
def jud(n,h):
for i in list(reversed(list(range(0,n-1)))):
# print(h[i],h[i+1])
if h[i+1]-h[i]==-1:
h[i]-=1
# print(h[i])
continue
if h[i]-h[i+1]>1:
return "No"
brea... | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
for i in range(N - 1):
head = H[i]
remains = min(H[i + 1:])
if head - remains >= 2:
print("No")
break
else:
print("Yes") | N = int(eval(input()))
H = list(map(int,input().split()))
head = 0
for i in range(N):
if H[i] >= head:
head = H[i]
if head - H[i] >= 2:
print("No")
break
else:print("Yes") | p02953 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
S,T=read().rstrip().decode().split()
ans=0
for s,t in zip(S,T):
if s!=t:
ans+=1
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
S,T=read().rstrip().decode().split()
print((sum(s!=t for s,t in zip(S,T)))) | p02622 |
import os
import sys
from collections import Counter
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __init__(self, size):
"""
:param int size:
"""
self._bit = [0] * size
self._size = size
def add(self, i, w):
"""
... | import os
import sys
from collections import Counter
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __init__(self, size):
"""
:param int size:
"""
self._bit = [0] * size
self._size = size
def add(self, i, w):
"""
... | p03483 |
#coding:utf-8
N = int(eval(input()))
trees = [list(input().split()) for i in range(N)]
class BinaryTree:
def __init__(self,key,p=None,l=None,r=None):
self.key = key
self.p = p
self.l = l
self.r = r
def Insert(root,z):
y = None
x = root
while x != None:
... | #coding:utf-8
N = int(eval(input()))
trees = [list(input().split()) for i in range(N)]
class BinaryTree:
def __init__(self,key,p=None,l=None,r=None):
self.key = key
self.p = p
self.l = l
self.r = r
def Insert(root,z):
y = None
x = root
while x != None:
... | p02285 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
input:
18
insert 8
insert 2
insert 3
insert 7
insert 22
insert 1
find 1
find 2
find 3
find 4
find 5
find 6
find 7
find 8
print
delete 3
delete 7
print
output: finded + in_order + pre_order
yes
yes
yes
no
no
no
yes
yes
1 2 3 7 8 22
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
input:
18
insert 8
insert 2
insert 3
insert 7
insert 22
insert 1
find 1
find 2
find 3
find 4
find 5
find 6
find 7
find 8
print
delete 3
delete 7
print
output: finded + in_order + pre_order
yes
yes
yes
no
no
no
yes
yes
1 2 3 7 8 22
... | p02285 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
input:
18
insert 8
insert 2
insert 3
insert 7
insert 22
insert 1
find 1
find 2
find 3
find 4
find 5
find 6
find 7
find 8
print
delete 3
delete 7
print
output: finded + in_order + pre_order
yes
yes
yes
no
no
no
yes
yes
1 2 3 7 8 22
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
input:
18
insert 8
insert 2
insert 3
insert 7
insert 22
insert 1
find 1
find 2
find 3
find 4
find 5
find 6
find 7
find 8
print
delete 3
delete 7
print
output: finded + in_order + pre_order
yes
yes
yes
no
no
no
yes
yes
1 2 3 7 8 22
... | p02285 |
class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
class BST:
root = None
def insert(self, key):
x = self.root
y = None
z = Node(key)
while x != None:
y = x
if(z.key < y.key):
x = x.left
elif(y.key < z.key):... | class Node:
def __init__(self, key):
self.key = key
self.right = None
self.left = None
class BST:
root = None
def insert(self, key):
x = self.root
y = None
z = Node(key)
while x != None:
y = x
if(z.key < y.key):
x = x.left
elif(y.key < z.key):... | p02285 |
import sys, os
from io import StringIO
class BinaryTree:
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringI... | import sys, os
from io import StringIO
class BinaryTree:
class Node:
def __init__(self, key):
self.key = key
self.left = None
self.right = None
self.parent = None
def __init__(self):
self.root = None
self.output = StringI... | p02285 |
import heapq
class Heapq:
def __init__(self, arr, desc=False):
if desc:
arr = [-a for a in arr]
self.sign = -1 if desc else 1
self.hq = arr
heapq.heapify(self.hq)
def pop(self):
return heapq.heappop(self.hq) * self.sign
def push(self, a):
... | from heapq import heappop, heappush, heapify
N = int(eval(input()))
A = list(map(int, input().split()))
L = A[:N]
heapify(L)
sumL = [sum(A[:N])]
for i in range(N):
x = heappop(L)
if x < A[N + i]:
sumL.append(sumL[-1] - x + A[N + i])
heappush(L, A[N + i])
else:
sumL.... | p03714 |
with open(0) as f:
N, *a = list(map(int, f.read().split()))
F = [x for x in a[:N]] #Fの要素は加えるか取り除くかの2択
C = [x for x in a[N:2*N]]
B = [-x for x in a[2*N:]] #Bの要素は引くか取り除くかの二択
import heapq as hq
hq.heapify(F)
hq.heapify(B)
#Cを二分し、前半はFと、後半はBとで演算を行う
#演算方法(c in C)
#前半：cがF[0]より大きければF[0]を取り除くN個の一つとし、cをスコアに加える
... | with open(0) as f:
N, *a = list(map(int, f.read().split()))
F = [x for x in a[:N]] #Fの要素は加えるか取り除くかの2択
C = [x for x in a[N:2*N]]
B = [-x for x in a[2*N:]] #Bの要素は引くか取り除くかの二択
import heapq as hq
#ヒープにして常に最小値を追跡
hq.heapify(F)
hq.heapify(B)
#Cを二分し、前半はFと、後半はBとで演算を行う
#演算方法(c in C)
#前半：cがF[0]より大きければF[0]を取り除くN個... | p03714 |
import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
# 準備
left, right = A[:N], A[-N:]
right = list([-x for x in right])
left_sum, right_sum = [sum(left)], [-sum(right)]
heapq.heapify(left)
heapq.heapify(right)
# left処理
for i in range(N, 2*N):
heapq.heappush(left, A[i])
low... | import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
Left, Right = A[:N], list([-a for a in A[-N:]])
heapq.heapify(Left)
heapq.heapify(Right)
Left_SUM, Right_SUM = [sum(Left)], [-sum(Right)]
M = A[N:2*N]
# 左側
for k in range(N):
lo = heapq.heappushpop(Left, M[k])
Left_SUM.append... | p03714 |
import heapq
import copy
n = int(eval(input()))
alist = list(map(int, input().split()))
ante, post = alist[:n], alist[-n:]
startante = sum(ante)
startpost = sum(post)
post = list([-x for x in post])
heapq.heapify(ante)
heapq.heapify(post)
ans = None
for k in range(n+1):
_ante = copy.deepcopy(ante)
... | import heapq
n = int(eval(input()))
alist = list(map(int, input().split()))
ante, post = alist[:n], alist[-n:]
antesums = [0 for _ in range(n+1)]
postsums = [0 for _ in range(n+1)]
antesums[0] = sum(ante)
postsums[0] = sum(post)
post = list([-x for x in post])
heapq.heapify(ante)
heapq.heapify(post)
fo... | p03714 |
N=int(eval(input()))
A=list(map(int,input().split()))
from collections import deque
import bisect
x,y,z=[],[],[]
for i in range(3*N):
if 0<=i<N:x.append(A[i])
elif N<=i<2*N:y.append(A[i])
elif 2*N<=i<3*N:z.append(A[i])
a=x+y
a.sort()
mae=[sum(a[N:2*N])]
line=N-1
used=set()
for i in range(N-1... | from heapq import heappush,heappop
dataX=[]
dataY=[]
mae=dict()
ushiro=dict()
N=int(eval(input()))
A=list(map(int,input().split()))
X=A[0:N]
Y=A[N:2*N]
Z=A[2*N:3*N]
for i in range(N):
heappush(dataX,X[i])
heappush(dataY,-1*Z[i])
mae[0]=sum(X)
ushiro[0]=-1*sum(Z)
for i in range(1,N+1):
mae[i]... | p03714 |
N = int(eval(input()))
import heapq as h
A = list(map(int, input().split()))
# use 0 based index
sum_red, sum_blue = [], []
head = A[:N]
tail = [-x for x in A[-N:]]
h.heapify(head)
h.heapify(tail)
sum_red.append(sum(head))
sum_blue.append(-sum(tail))
for k in range(N, 2*N):
h.heappushpop(head, A[k... | N = int(eval(input()))
import heapq as h
A = list(map(int, input().split()))
# use 0 based index
sum_red, sum_blue = [], []
head = A[:N]
tail = [-x for x in A[-N:]]
h.heapify(head)
h.heapify(tail)
sum_red.append(sum(head))
sum_blue.append(-sum(tail))
# keypoint: いちいちsumすると線形時間かかるのでsum_hoge[-1]でアクセスする
... | p03714 |
import heapq
N = int( eval(input()))
A = list( map( int, input().split()))
fsum = [0]*(N+1)
bsum = [0]*(N+1)
forward = A[:N]
back = A[2*N:]
back = list([-x for x in back])
heapq.heapify(forward)
heapq.heapify(back)
fsum[0] = sum(forward)
bsum[N] = -sum(back)
for i in range(1,N+1):
heapq.heappushpop(for... | import heapq
N = int( eval(input()))
A = list( map( int, input().split()))
fsum = [0]*(N+1)
bsum = [0]*(N+1)
forward = A[:N]
back = A[2*N:]
back = list([-x for x in back])
heapq.heapify(forward)
heapq.heapify(back)
fsum[0] = sum(forward)
fsumnow = fsum[0]
bsum[N] = -sum(back)
bsumnow = bsum[N]
for i in ra... | p03714 |
N=int(eval(input()))
alist=list(map(int,input().split()))
#dp[3N][N]
dp=[[0 for _ in range(N+1)] for _ in range(3*N+1)]
for i in range(1,3*N+1):
for j in range(1,N+1):
if i<j:
break
dp[i][j]=max(dp[i-1][j],alist[i-1]+dp[i-1][j-1])
#print(dp)
alist_rev=alist[::-1]
dp_rev=[[float("inf") for... | N=int(eval(input()))
alist=list(map(int,input().split()))
answer=-float("inf")
for i in range(N,2*N+1):
alist1=alist[:i]
alist2=alist[i:]
#print(alist1,alist2)
alist1.sort(reverse=True)
alist2.sort()
maxn_a1=sum(alist1[:N])
minn_a2=sum(alist2[:N])
#print(maxn_a1,minn_a2)
answer=max(a... | p03714 |
import copy as cp
n = int(eval(input()))
a = input().split()
a = [int(m) for m in a]
t1 = []
t2 = []
t3 = []
for i in range(3 * n):
if i < (3 * n) // 3:
t1.append(a[i])
elif (3 * n) // 3 <= i < (3 * n) // 3 * 2:
t2.append(a[i])
else:
t3.append(a[i])
t1.sort()
t3.sort(r... | from heapq import heappush, heappop
n = int(eval(input()))
a = input().split()
a = [int(m) for m in a]
t1 = []
t2 = []
mt3 = []
for i in range(3 * n):
if i < (3 * n) // 3:
t1.append(a[i])
elif (3 * n) // 3 <= i < (3 * n) // 3 * 2:
t2.append(a[i])
else:
mt3.append(-a[i])
... | p03714 |
from heapq import heapify, heapreplace
n = int(eval(input()))
a = list(map(int, input().split()))
a1 = a[:n]
heapify(a1)
a2 = a[n:2*n]
a3 = [-i for i in a[2*n:]]
heapify(a3)
b1 = [sum(a1)]
b2 = [sum(a3)]
for i in range(n):
b1.append(a2[i]-heapreplace(a1, a2[i]))
b2.append(-heapreplace(a3, -a2[n-i-1]... | from heapq import heapify, heappushpop
n = int(eval(input()))
a = list(map(int, input().split()))
a1 = a[:n]
heapify(a1)
a2 = a[n:2*n]
a3 = [-i for i in a[2*n:]]
heapify(a3)
b1 = [sum(a1)]
b2 = [sum(a3)]
for i in range(n):
b1.append(b1[-1]+a2[i]-heappushpop(a1, a2[i]))
b2.append(b2[-1]-heappushpop(a... | p03714 |
def f(a):
q=a[:n];s=sum(q);heapify(q);yield s
for e in a[n:2*n]:s+=e-heappushpop(q,e);yield s
from heapq import*;r=reversed;n,*a=list(map(int,open(0).read().split()));print((max(list(map(sum,list(zip(f(a),r(list(f([-e for e in r(a)])))))))))) | def f(a):
q=a[:n];s=sum(q);heapify(q);yield s
for e in a[n:2*n]:s+=e-heappushpop(q,e);yield s
from heapq import*;n,*a=list(map(int,open(0).read().split()));print((max(list(map(sum,list(zip(f(a),list(f([-e for e in a[::-1]]))[::-1]))))))) | p03714 |
def f(x):
y=x[:n];heapify(y);z=sum(y);s=[z]
for i in x[n:n*2]:z+=i-heappushpop(y,i);s+=[z]
return s
from heapq import*;n,*a=list(map(int,open(0).read().split()));print((max(list(map(sum,list(zip(f([-i for i in a[n:][::-1]]),f(a)[::-1]))))))) | def f(x):
y=x[:n];heapify(y);z=sum(y);yield z
for i in x[n:n*2]:z+=i-heappushpop(y,i);yield z
from heapq import*;n,*a=list(map(int,open(0).read().split()));print((max(list(map(sum,list(zip(f([-i for i in a[n:][::-1]]),list(f(a))[::-1]))))))) | p03714 |
import heapq
N=int(eval(input()))
A=list(map(int, input().split()))
A_rev = [-x for x in A[::-1]]#逆順にして各要素を-1倍する
ans=-float("inf")
for k in range(N, 2*N+1):
left=A[:k]
right=A_rev[:(3*N-k)]
heapq.heapify(left)
heapq.heapify(right)
for _ in range(k-N):
heapq.heappop(left)
for _ in range(2*N-k):
... | #########################ABC解説実装#########################
import heapq
N=int(eval(input()))
A=list(map(int, input().split()))
left, right = A[:N], [-1 * i for i in A[2*N:]]
sum_left, sum_right = sum(left), sum(right)
results = [0] * (N+1)
results[0] = sum_left
results[N] = sum_right
heapq.heapify(left)
... | p03714 |
import heapq
N = int(eval(input()))
a_list = list(map(int, input().split()))
max_score = - float("inf")
red_list = a_list[:N]
blue_list = [-a for a in a_list[2 * N:]]
heapq.heapify(red_list)
heapq.heapify(blue_list)
red_sum = [sum(red_list)]
blue_sum = [sum(blue_list)]
for i in range(N, 2 * N):
h... | import heapq
N = int(eval(input()))
a_list = list(map(int, input().split()))
max_score = - float("inf")
red_list = a_list[:N]
blue_list = [-a for a in a_list[2 * N:]]
heapq.heapify(red_list)
heapq.heapify(blue_list)
red_sum = [sum(red_list)]
blue_sum = [sum(blue_list)]
for i in range(N, 2 * N):
h... | p03714 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | p03714 |
from heapq import heapify, heappop, heappush
from collections import deque
n = int(eval(input()))
a = list(map(int, input().split()))
L = a[:n]
sum_l = [sum(L)]
heapify(L)
ML = a[n:2 * n]
ML = deque(ML)
R = list([(-1) * x for x in a[2 * n:]])
sum_r = [sum(R)] # あとでReverseする
heapify(R)
MR = list([... | def main():
from heapq import heappush, heappushpop
n = int(eval(input()))
*a, = list(map(int, input().split())) # [0,n),[n,2n),[2n,3n)
to_rm = [0] * (n * 3)
h = []
for x in a[:n]:
heappush(h, x)
mid = tuple(enumerate(a[n:n * 2], n))
t = 0
for i, x in mid... | p03714 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/arc074/editorial.pdf
・優先度付きキュー
"""
import sys
def input(): return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
from heapq import heappush, heappushpop
N = int(eval(input()))
aN = list(map(int, input().split()))
mids = aN[N:N*2]
L... | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/arc074/editorial.pdf
・優先度付きキュー
"""
import sys
def input(): return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
from heapq import heapify, heappushpop
N = int(eval(input()))
aN = list(map(int, input().split()))
mids = aN[N:N*2]
# ... | p03714 |
import heapq, copy
N = int(eval(input()))
A = [int(i) for i in input().split()]
Aleft = copy.deepcopy(A[:N])
sumLeft = sum(Aleft)
heapq.heapify(Aleft)
Aright = sorted(copy.deepcopy(A[N:]))
Rlim = Aright[N-1]
sumRight = sum(Aright[:N])
score = sumLeft - sumRight
for i in range(N):
a = A[N+i]
heapq.... | import heapq
N = int(eval(input()))
A = [int(i) for i in input().split()]
sumLeft = [0] * (N+1) #A[:N+i]中のN要素の和の最大値のリスト
sumLeft[0] = sum(A[:N])
Aleft = A[:N]
heapq.heapify(Aleft)
sumRight = [0] * (N+1) #A[N+i:]中のN要素の和の最小値のリスト
sumRight[-1] = sum(A[2*N:])
Aright = [-1*i for i in A[2*N:]] #最大値をpopするために要素を-1倍... | p03714 |
import itertools
import copy
N=eval(input())
a=[]
a=list(map(int, input().split()))
#print N
#print a
n_l=[ i for i in range(len(a))]
#print n_l
c = list(itertools.combinations(n_l,N))
#c=[(3,1)]
#print c
score=0.1
for i in c:
a_t=copy.deepcopy(a)
#print "#Loop start"
#print i
for j in range(N)... | import itertools
from heapq import heapify,heappush,heappop
N=eval(input())
a=[]
a=list(map(int, input().split()))
a1=a[0:N]
#print a1
heapify(a1)
l1=[]
sum_a1=sum(a1)
l1.append(sum_a1)
# Max
for i in range(N,2*N):
if a[i]>a1[0]:
sum_a1=sum_a1+a[i]-a1[0]
heappop(a1)
heappush(a1, a[i])
... | p03714 |
import itertools
import datetime
from heapq import heapify,heappush,heappop
N=eval(input())
a=[]
a=list(map(int, input().split()))
a1=a[:N]
#print a1
heapify(a1)
l1=[]
sum_a1=sum(a1)
l1.append(sum_a1)
# Max
for i in range(N,2*N):
if a[i]>a1[0]:
sum_a1=sum_a1+a[i]-a1[0]
heappop(a1)... | n=int(eval(input()))
import heapq
a=list(map(int, input().split()))
q=a[:n]
heapq.heapify(q)
x=[sum(q)]
for k in range(n,2*n):
v=heapq.heappushpop(q,a[k])
x.append(x[-1]+a[k]-v)
a=a[::-1]
q=[-v for v in a[:n]]
heapq.heapify(q)
y=[-sum(q)]
for k in range(n,2*n):
v=-heapq.heappushpop(q,-a[k])
... | p03714 |
from heapq import heapify,heappush, heappop
N=eval(input())
A=list(map( int, input().split() ))
q=A[:N]
heapify(q)
q_sum=sum(q)
B=[ float("-inf") for i in range(3*N)]
B[N-1]=q_sum
for i in range(N,2*N):
x=A[i]
if x>q[0]:
tmp=heappop(q)
q_sum-=tmp
q_sum+=x
heappush(q,x)
B[i]=q_sum
q... | from heapq import heapify,heappush, heappop
N=eval(input())
A=list(map(int, input().split()))
hq1=A[:N]
heapify(hq1)
sum1=sum(hq1)
T1=[]
T1.append(sum1)
for i in range(N, 2*N):
x=A[i]
if hq1[0]<x:
u=heappop(hq1)
heappush(hq1,x)
sum1+=(x-u)
T1.append(sum1)
hq2=[x*-1 for x in A[2*N:... | p03714 |
from heapq import heappush, heappop
n=int(eval(input()))
a=list(map(int,input().split()))
l=[]
for v in a[:n]:
heappush(l,v)
suml=[sum(a[:n])]
for i in range(n):
suml.append(suml[i]+a[n+i])
heappush(l,a[n+i])
suml[i+1]-=heappop(l)
r=[]
for v in a[2*n:]:
heappush(r,(10**10-v,v))
sumr=[sum(a[2*n:]... | def f(a):
q=a[:n];s=sum(q);heapify(q)
for e in a[n:n-~n]:yield s;s+=e-heappushpop(q,e)
from heapq import*;n,*a=list(map(int,open(0).read().split()));print((max(list(map(sum,list(zip(f(a),list(f([-e for e in a[::-1]]))[::-1]))))))) | p03714 |
import heapq
def solve():
n = int(input())
ar = input().split(' ')
iar = [int(s) for s in ar]
early = iar[:n]
mid = iar[n:-n]
late = iar[-n:]
heapq.heapify(early)
tmpsum = sum(early)
esums = [tmpsum]
for i in range(n):
heapq.heappush(early, mid[i])
emin = heapq.heappop(e... | import heapq
N = int(eval(input()))
src = list(map(int,input().split()))
lsum = sum(src[:N])
lmem = [lsum]
lq = src[:N][:]
heapq.heapify(lq)
for a in src[N:2*N]:
if a <= lq[0]:
lmem.append(lmem[-1])
else:
lsum += a - heapq.heappop(lq)
heapq.heappush(lq, a)
lmem.app... | p03714 |
import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
L = A[:N]
heapq.heapify(L)
sum_L = [0] * (N+1)
sum_L[0] = sum(L)
for i in range(N):
min_L = heapq.heappushpop(L, A[N+i])
sum_L[i+1] = sum_L[i] + A[N+i] - min_L
#print(L, i, A[N+i], min_L, sum_L)
R = A[N*2:]
rev_R... | import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
L = A[:N]
heapq.heapify(L)
sum_L = [0] * (N+1)
sum_L[0] = sum(L)
for i in range(N):
min_L = heapq.heappushpop(L, A[N+i])
sum_L[i+1] = sum_L[i] + A[N+i] - min_L
#print(L, i, A[N+i], min_L, sum_L)
R = A[N*2:]
rev_R... | p03714 |
import heapq
n=int(eval(input()))
A=[int(i) for i in input().split()]
AL=A[:n]
AR=[]
for i in range(2*n,3*n):
AR.append(-A[i])
ALS,ARS=[0]*(n+1),[0]*(n+1)
ALS[0],ARS[0]=sum(AL),-sum(AR)
heapq.heapify(AL)
heapq.heapify(AR)
for i in range(n):
heapq.heappushpop(AL,A[n+i])
ALS[i+1]+=sum(AL)
heapq.heap... | import heapq
n=int(eval(input()))
A=[int(i) for i in input().split()]
AL=A[:n]
AR=[0]*n
for i in range(2*n,3*n):
AR[i-2*n]-=A[i]
ALS,ARS=[0]*(n+1),[0]*(n+1)
ALS[0],ARS[0]=sum(AL),sum(AR)
heapq.heapify(AL)
heapq.heapify(AR)
for i in range(n):
l,r=A[n+i],-A[2*n-i-1]
heapq.heappush(AL,l)
ALS[i+1]=ALS... | p03714 |
from heapq import heappop, heappush
inf = float('inf')
N = int(eval(input()))
A = list(map(int,input().split()))
# sum_max[k] : [0,k)のうちN個までの総和の最大値
# sum_min[k] : (3N-1-k,3N-1]のうちN個までの総和の最小値
sum_max = [0]*(3*N+1)
sum_min = [0]*(3*N+1)
def init_max():
res = 0
hq = []
for i, a in enumerate(... | from heapq import heappop, heappush
inf = float('inf')
N = int(eval(input()))
A = list(map(int,input().split()))
l = []
res = 0
for i in range(N):
heappush(l, A[i])
res += A[i]
ls = []
ls.append(res)
for i in range(N, 2*N):
heappush(l, A[i])
res += A[i]
res -= heappop(l)
ls.... | p03714 |
def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement, product
setrecursionlimit(10**6)
dbg = (l... | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement, product
setrecursionlimit(10**6)
dbg = (l... | p02604 |
import bisect
import copy
import heapq
import sys
import itertools
import math
from functools import lru_cache
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(... | import bisect
import copy
import heapq
import sys
import itertools
import math
from functools import lru_cache
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(... | p02604 |
INF = 10 ** 12
N = int(eval(input()))
X = [0] * N
Y = [0] * N
P = [0] * N
for i in range(N):
X[i], Y[i], P[i] = list(map(int,input().split()))
score_X = []
for i in range(2 ** N):
x = []
I = i
for j in range(N):
i = I
score = abs(X[j]) * P[j]
for k in range(N)... | INF = 10 ** 12
N = int(eval(input()))
X = [0] * N
Y = [0] * N
P = [0] * N
for i in range(N):
X[i], Y[i], P[i] = list(map(int,input().split()))
score_X = []
for i in range(2 ** N):
x = []
I = i
for j in range(N):
i = I
score = abs(X[j]) * P[j]
for k in range(N)... | p02604 |
N = int(eval(input()))
X = []; Y = []; P = []
INF = float("inf")
for i in range(N):
x,y,p = list(map(int,input().split()))
X.append(x);Y.append(y);P.append(p)
ans = [INF for _ in range(N+1)] #0本置いた時からN本置いた時までN+1個
def calc(A):
n = len(A) #Aにはいくつ入っているか。つまり、xoryで選ばれたものはいくつあるか。
A.sort()
res = [INF for _... | N = int(eval(input()))
X = []; Y = []; P = []
INF = float("inf")
for i in range(N):
x,y,p = list(map(int,input().split()))
X.append(x);Y.append(y);P.append(p)
ans = [INF for _ in range(N+1)] #0本置いた時からN本置いた時までN+1個
def calc(A):
n = len(A) #Aにはいくつ入っているか。つまり、xoryで選ばれたものはいくつあるか。
A.sort()
dp = [[INF]*(n... | p02604 |
# Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
def abs(N):
... | # Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
def abs(N):
... | p02604 |
# Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
def abs(N):
... | # Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
def abs(N):
... | p02604 |
# Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
def abs(N):
... | # Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
minCost = [float("inf... | p02604 |
# Fast IO (only use in integer input)
# TLE
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
minCost = [float("inf... | # Fast IO (only use in integer input)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
N = int(eval(input()))
Resident = []
for i in range(N):
x,y,p = list(map(int,input().split()))
Resident.append((x,y,p))
minCost = [float("inf")] * (N+... | p02604 |
# writer解(c++)を写経した．answerのfor文のところ何やってるかさっぱりわかりませんが…
# https://atcoder.jp/contests/m-solutions2020/submissions/15122924
import sys
input = sys.stdin.readline
INF = 10**13
def main():
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
X_dist = [[0]*N for _ in range(... | # writer解(c++)を写経した．answerのfor文のところ何やってるかさっぱりわかりませんが…
# https://atcoder.jp/contests/m-solutions2020/submissions/15122924
import sys
input = sys.stdin.readline
INF = 10**13
def main():
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
X_dist = [[0]*N for _ in range(... | p02604 |
import sys
input = sys.stdin.readline
INF = 10**13
def main():
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
X_dist = [[0]*N for _ in range(1 << N)]
Y_dist = [[0]*N for _ in range(1 << N)]
for bit in range(1 << N):
cur_x = [0]
cur_y ... | import sys
input = sys.stdin.readline
INF = 10**13
def main():
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
X_dist = [[0]*N for _ in range(1 << N)]
Y_dist = [[0]*N for _ in range(1 << N)]
for bit in range(1 << N):
cur_x = [0]
cur_y ... | p02604 |
n = int(eval(input()))
towns = [tuple(map(int, input().split())) for _ in range(n)]
INF = 10 ** 18
ans = [INF] * (n + 1)
default_dist = [min(abs(x), abs(y)) for x, y, p in towns]
for bit in range(1 << n):
k = (bit & 0x5555) + (bit >> 1 & 0x5555)
k = (k & 0x3333) + (k >> 2 & 0x3333)
k = (k & 0x... | import sys
n, *towns = list(map(int, sys.stdin.buffer.read().split()))
xxx = towns[0::3]
yyy = towns[1::3]
ppp = towns[2::3]
INF = 10 ** 18
ans = [INF] * (n + 1)
precalc_dist_x = []
precalc_dist_y = []
for bit in range(1 << n):
dists_x = []
dists_y = []
for i in range(n):
x = xxx[... | p02604 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p02604 |
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
l = [list(map(int,input().split())) for i in range(n)]
xcal = [[0]*n for i in range(1<<n)]
ycal = [[0]*n for i in range(1<<n)]
for i in range(1<<n):
for j in range(n):
xcal[i][j] = abs(l[j][0])
... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
l = [list(map(int,input().split())) for i in range(n)]
xcal = [[0]*n for i in range(1<<n)]
ycal = [[0]*n for i in range(1<<n)]
for i in range(1<<n):
for j in range(n):
xcal[i][j] = abs(l[j][0])
... | p02604 |
from itertools import product
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
X = [x for x, _, _ in XYP]
Y = [y for _, y, _ in XYP]
P = [p for _, _, p in XYP]
INF = 10**18
def calcCost(AP, A):
ret = [[INF] * N for _ in range(1 << N)... | from itertools import product
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
X = [x for x, _, _ in XYP]
Y = [y for _, y, _ in XYP]
P = [p for _, _, p in XYP]
INF = 10**18
def calcCost(AP, A):
ret = [[INF] * N for _ in range(1 << N)... | p02604 |
from itertools import product
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
X = [x for x, _, _ in XYP]
Y = [y for _, y, _ in XYP]
P = [p for _, _, p in XYP]
INF = 10**18
def calcCost(AP, A):
ret = [[INF] * N for _ in range(1 << N)... | from itertools import product
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
XYP.sort(key=lambda xyp: abs(xyp[0] * xyp[1] * xyp[2]), reverse=True)
X = [x for x, _, _ in XYP]
Y = [y for _, y, _ in XYP]
P = [p for _, _, p in XYP]
INF = 10**18... | p02604 |
from itertools import product
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
XYP.sort(key=lambda xyp: abs(xyp[0] * xyp[1] * xyp[2]), reverse=True)
X = [x for x, _, _ in XYP]
Y = [y for _, y, _ in XYP]
P = [p for _, _, p in XYP]
INF = 10**18... | from itertools import product
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
XYP.sort(key=lambda xyp: xyp[2], reverse=True)
X = [x for x, _, _ in XYP]
Y = [y for _, y, _ in XYP]
INF = 10**18
def calcCost(AP, A):
ret = [[INF] * N ... | p02604 |
from itertools import product
from random import randint, seed
from time import time
seed(time())
def sol():
N = int(input())
XYP = [tuple(map(int, input().split())) for _ in range(N)]
XYP.sort(key=lambda xyp: xyp[2], reverse=(randint(0, 3) != 0))
X = [x for x, _, _ in XYP]
Y = [y for _... | from itertools import product
INF = 10**18
N = int(input())
def calcCost(AP, A):
ret = [[INF] * N for _ in range(1 << N)]
for state in range(1 << N):
useA = [a for i, a in enumerate(A) if (state & (1 << i)) != 0]
for i, (a, p) in enumerate(AP):
cost = abs(a)
fo... | p02604 |
import bisect
N=int(eval(input()))
city=[]
for i in range(N):
x,y,p=list(map(int,input().split()))
city.append((x,y,p))
xx=[[abs(city[j][0]) for j in range(N)] for i in range(2**N)]
yy=[[abs(city[j][1]) for j in range(N)] for i in range(2**N)]
for i in range(2**N):
X=[0]
rest=[]
for... | import bisect
N=int(eval(input()))
city=[]
for i in range(N):
x,y,p=list(map(int,input().split()))
city.append((x,y,p))
xx=[[abs(city[j][0]) for j in range(N)] for i in range(2**N)]
yy=[[abs(city[j][1]) for j in range(N)] for i in range(2**N)]
for i in range(2**N):
X=[0]
rest=[]
for... | p02604 |
import sys
input = sys.stdin.readline
INF = float('inf')
N = int(input().strip())
data = [list(map(int, input().split())) for _ in range(N)]
cost_b = []
cost_D = []
for b in range(1<<N):
towns = []
cost = INF
for i in range(N):
if (b>>i)&1:
towns.append(data[i])
for i in range(len(tow... | import sys
input = sys.stdin.readline
INF = float('inf')
N = int(input().strip())
data = [list(map(int, input().split())) for _ in range(N)]
cost_b = []
cost_D = []
for b in range(1<<N):
towns = []
cost = INF
for i in range(N):
if (b>>i)&1:
towns.append(data[i])
for i in range(len(tow... | p02604 |
import sys
input = sys.stdin.readline
INF = float('inf')
N = int(input().strip())
data = [list(map(int, input().split())) for _ in range(N)]
cost_b = []
cost_D = []
for b in range(1<<N):
towns = []
cost = INF
for i in range(N):
if (b>>i)&1:
towns.append(data[i])
for i in range(len(tow... | import sys
input = sys.stdin.readline
INF = float('inf')
N = int(input().strip())
data = [list(map(int, input().split())) for _ in range(N)]
cost_b = []
cost_D = []
for b in range(1<<N):
towns = []
cost = INF
for i in range(N):
if (b>>i)&1:
towns.append(data[i])
for i in range(len(tow... | p02604 |
def main():
n = int(eval(input()))
xyp = [list(map(int, input().split())) for _ in [0]*n]
d = []
def calc(seq):
m = len(seq)
dp = [[0]]
for i in range(m):
dp2 = [[10**15]*(i+2) for _ in [0]*(i+2)]
for j in range(i+1):
dp2[j][0] ... | def main():
n = int(eval(input()))
xyp = [list(map(int, input().split())) for _ in [0]*n]
d = []
def calc(seq):
m = len(seq)
dp = [[10**15]*(m+1) for _ in [0]*(m+1)]
dp[0][0] = 0
for i in range(m):
for j in range(i+1):
temp = dp[j][... | p02604 |
import sys, queue, math, copy, itertools, bisect, collections, heapq
def main():
INF = 10 ** 15
LI = lambda: [int(x) for x in sys.stdin.readline().split()]
NI = lambda: int(sys.stdin.readline())
N = NI()
X = []
Y = []
P = []
for _ in range(N):
a, b, c = LI()
... | import sys, queue, math, copy, itertools, bisect, collections, heapq
def main():
INF = 10 ** 15
LI = lambda: [int(x) for x in sys.stdin.readline().split()]
NI = lambda: int(sys.stdin.readline())
N = NI()
X = []
Y = []
P = []
for _ in range(N):
a, b, c = LI()
... | p02604 |
N = int(eval(input()))
city = []
for i in range(N):
x,y,p = list(map(int,input().split()))
city.append((x,y,p))
xx = [ [ abs(city[j][0]) for j in range(N) ] for i in range(2<<N) ]
yy = [ [ abs(city[j][1]) for j in range(N) ] for i in range(2<<N) ]
for i in range(2<<N):
X = [0]
rest = []
for j in... | N=int(eval(input()))
city=[]
for i in range(N):
x,y,p=list(map(int,input().split()))
city.append((x,y,p))
xx=[[abs(city[j][0]) for j in range(N)] for i in range(2**N)]
yy=[[abs(city[j][1]) for j in range(N)] for i in range(2**N)]
for i in range(2**N):
X=[0]
rest=[]
for j in range(N):... | p02604 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(eval(input()))
li = []
for _ in range(n):
xi, yi, pi = list(map(int, input().split()))
li.append([xi, yi, pi])
li.sort(key=lambda x: x[2],reverse=True)
xx=[[abs(li[j][0]) for j in range(n)] fo... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(eval(input()))
li = []
for _ in range(n):
xi, yi, pi = list(map(int, input().split()))
li.append([xi, yi, pi])
li.sort(key=lambda x: x[2], reverse=True)
xx = [[abs(li[j][0]) for j in range(n... | p02604 |
def popcnt(n):
c = (n & 0x5555) + ((n>>1) & 0x5555)
c = (c & 0x3333) + ((c>>2) & 0x3333)
c = (c & 0x0f0f) + ((c>>4) & 0x0f0f)
c = (c & 0x00ff) + ((c>>8) & 0x00ff)
return c
N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
... | def popcnt(n):
c = (n & 0x5555) + ((n>>1) & 0x5555)
c = (c & 0x3333) + ((c>>2) & 0x3333)
c = (c & 0x0f0f) + ((c>>4) & 0x0f0f)
c = (c & 0x00ff) + ((c>>8) & 0x00ff)
return c
N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
... | p02604 |
N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * (1 << N) for _ in range(N)]
DY = [[0] * (1 << N) for _ in range(N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * (1 << N) for _ in range(N)]
DY = [[0] * (1 << N) for _ in range(N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | p02604 |
N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * (1 << N) for _ in range(N)]
DY = [[0] * (1 << N) for _ in range(N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * N for _ in range(1 << N)]
DY = [[0] * N for _ in range(1 << N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | p02604 |
N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * N for _ in range(1 << N)]
DY = [[0] * N for _ in range(1 << N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * N for _ in range(1 << N)]
DY = [[0] * N for _ in range(1 << N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | p02604 |
N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * N for _ in range(1 << N)]
DY = [[0] * N for _ in range(1 << N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | N = int(input())
X = []
Y = []
P = []
for _ in range(N):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * N for _ in range(1 << N)]
DY = [[0] * N for _ in range(1 << N)]
for i, x in enumerate(X):
for k in range(1 << N):
d = abs(x)
... | p02604 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int, readline().split()))
xyp = [tuple(map(int, readline().split())) for _ in range(n)]
N = 1<<n
INF = 1<<60
resx = []
resy = []
for i in range(n):
x,y,p = xyp[i]
rx = [min(abs(x),abs(... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int, readline().split()))
xyp = tuple(tuple(map(int, readline().split())) for _ in range(n))
N = 1<<n
INF = 1<<60
resx = []
resy = []
for i in range(n):
x,y,p = xyp[i]
rx = [min(abs(x)... | p02604 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int, readline().split()))
xyp = tuple(tuple(map(int, readline().split())) for _ in range(n))
N = 1<<n
INF = 1<<60
resx = []
resy = []
for i in range(n):
x,y,p = xyp[i]
rx = [abs(x)]*N
... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int, readline().split()))
xyp = tuple(tuple(map(int, readline().split())) for _ in range(n))
N = 1<<n
INF = 1<<60
resx = []
resy = []
for i in range(n):
x,y,p = xyp[i]
rx = [abs(x)]*N
... | p02604 |
inf = 10**15
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
X = []
Y = []
P = []
for _ in range(N):
x, y, p = list(map(int, input().split()))
X.append(x)
Y.append(y)
P.append(p)
dx = [[inf] * N for _ in range(... | inf = 10**15
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
X = []
Y = []
P = []
for _ in range(N):
x, y, p = list(map(int, input().split()))
X.append(x)
Y.append(y)
P.append(p)
dx = [[inf] * N for _ in range(... | p02604 |
N = int(eval(input()))
A = [tuple(map(int,input().split())) for _ in range(N)]
#準備：S_の外延表記sを求める
def settify(S):
s = []
i = 0
while S > 0:
if (S & 1):
s.append(i)
S = S >> 1
i += 1
return s
Sets = []
for S_ in range(2**N):#MLEの可能性あり
Sets.append(settify(S_))
#前処理：集合に... | N = int(eval(input()))
A = [tuple(map(int,input().split())) for _ in range(N)]
#準備：S_の外延表記sを求める
def settify(S):
s = []
i = 0
while S > 0:
if (S & 1):
s.append(i)
S = S >> 1
i += 1
return s
Sets = [settify(S_) for S_ in range(2**N)]
b = [2 ** i for i in range(N)] #2べき
de... | p02604 |
# 解説と 提出 #15122924 を参考に作成.
# 遅い. PyPyで出すと通る. はず.
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N, X, Y, P):
inf = 10 ** 18
cnb_N = 2 ** N
# 前計算
# # 集落の部分集合毎の、Y軸X軸へのそれぞれの最短経路
... | # 解説と 提出 #15122924 を参考に作成.
# 遅い. PyPyで出すと通る. はず.
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N, X, Y, P):
inf = 10 ** 18
cnb_N = 2 ** N
# 前計算
# # 集落の部分集合毎の、Y軸X軸へのそれぞれの最短経路
... | p02604 |
#! /usr/bin/env python3
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
XYP = [list(map(int, readline().split())) for _ in range(N)]
x_cost = [0] * ((1 << N) *... | #! /usr/bin/env python3
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
XYP = [list(map(int, readline().split())) for _ in range(N)]
costs = [sys.maxsize] * N
... | p02604 |
n = int(input())
X, Y, P = [], [], []
for i in range(n):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * n for s in range(2**n)]
DY = [[0] * n for s in range(2**n)]
for s in range(2**n):
for i in range(n):
DX[s][i] = abs(X[i]) * P[i]
... | n = int(input())
XYP = [tuple(map(int, input().split())) for i in range(n)]
X = [x for x, y, p in XYP]
Y = [y for x, y, p in XYP]
P = [p for x, y, p in XYP]
pow2 = [2**i for i in range(n + 1)]
DX = [[0] * n for s in range(pow2[n])]
DY = [[0] * n for s in range(pow2[n])]
for s in range(1 << n):
for i in r... | p02604 |
n = int(input())
XYP = [tuple(map(int, input().split())) for i in range(n)]
X = [x for x, y, p in XYP]
Y = [y for x, y, p in XYP]
P = [p for x, y, p in XYP]
pow2 = [2**i for i in range(n + 1)]
DX = [[0] * n for s in range(pow2[n])]
DY = [[0] * n for s in range(pow2[n])]
for s in range(1 << n):
for i in r... | n = int(input())
X, Y, P = [], [], []
for i in range(n):
x, y, p = map(int, input().split())
X.append(x)
Y.append(y)
P.append(p)
DX = [[0] * n for s in range(1 << n)]
DY = [[0] * n for s in range(1 << n)]
for s in range(1 << n):
for i in range(n):
DX[s][i] = abs(X[i]) * P[i]
... | p02604 |
from heapq import heappush,heappop
from sys import setrecursionlimit
setrecursionlimit(10**6)
N,M,s,t=list(map(int,input().split()))
table=[[] for i in range(N)]
rtable=[[] for i in range(N)]
for i in range(M):
u,v,a,b=list(map(int,input().split()))
u,v=u-1,v-1
table[u].append([a,v])
table[v].... | from heapq import heappush,heappop
from sys import setrecursionlimit
setrecursionlimit(10**6)
N,M,s,t=list(map(int,input().split()))
table=[[] for i in range(N)]
rtable=[[] for i in range(N)]
for i in range(M):
u,v,a,b=list(map(int,input().split()))
u,v=u-1,v-1
table[u].append((a,v))
table[v].... | p03305 |
import heapq
dif = 10 ** 6
initial = 10 ** 15
def di(links, s):
costs = [initial] * n
costs[s] = 0
node_list = []
serched_node = set()
heapq.heappush(node_list, s)
while(len(node_list) != 0 and len(serched_node) != n):
index = heapq.heappop(node_list) % dif
if inde... | import heapq
initial_cost = 10 ** 9
initial = 10 ** 15
def di(link_costs, s):
costs = [initial] * n
costs[s] = 0
q = []
heapq.heappush(q, (0, s))
while(len(q) != 0):
index_cost, index = heapq.heappop(q)
if costs[index] < index_cost:
continue
... | p03305 |
import heapq
def dijkstra(G, s):
dist = [float("inf")]*len(G)
q = []
dist[s] = 0
heapq.heapify(q)
heapq.heappush(q, [0, s])
while 0 < len(q):
pre_cost, p = heapq.heappop(q)
if dist[p] < pre_cost:
continue
for v, d in G[p]:
if dist[v] > ... | import heapq
def dijkstra(G, s):
dist = [float("inf")]*len(G)
q = []
dist[s] = 0
heapq.heapify(q)
heapq.heappush(q, [0, s])
while 0 < len(q):
pre_cost, p = heapq.heappop(q)
if dist[p] < pre_cost:
continue
for v, d in G[p]:
if dist[v] > ... | p03305 |
import heapq
import sys
input = sys.stdin.readline
INF = 10**18
n,m,s,t = list(map(int,input().split()))
edge = [list(map(int,input().split())) for _ in range(m)]
graph_s = [[] for _ in range(n)]
graph_t = [[] for _ in range(n)]
for e in edge:
graph_s[e[0]-1].append([e[1]-1,e[2]])
graph_s[e[1]... | from heapq import heappop, heappush, heapify
class Graph(): #non-directed
def __init__(self, n, edge, indexed=1):
self.n = n
self.edge = edge
self.indexed = indexed
self.graph = [[] for _ in range(n)]
for e in edge:
self.graph[e[0] - indexed].append((e[... | p03305 |
N, M, S, T = map(int, input().split())
S, T = S - 1, T - 1
G_yen = [[] for i in range(N)]
G_snuuk = [[] for i in range(N)]
for i in range(M):
u, v, a, b = map(int, input().split())
u, v = u - 1, v - 1
G_yen[u].append([v, a])
G_yen[v].append([u, a])
G_snuuk[u].append([v, b])
G_snuuk[v].... | N, M, S, T = map(int, input().split())
S, T = S - 1, T - 1
G_yen = [[] for i in range(N)]
G_snuuk = [[] for i in range(N)]
for i in range(M):
u, v, a, b = map(int, input().split())
u, v = u - 1, v - 1
G_yen[u].append([v, a])
G_yen[v].append([u, a])
G_snuuk[u].append([v, b])
G_snuuk[v].... | p03305 |
import heapq
from collections import defaultdict
WHITE = 0
GRAY = 1
BLACK = 2
INFTY = 10**16
def dijkstra(s, VC):
color = [WHITE for i in range(N)]
d = [INFTY for i in range(N)]
d[s] = 0
pq = []
heapq.heappush(pq, (0, s))
while len(pq) != 0:
u = heapq.heappop(pq)[1]
... | import heapq
WHITE = 0
GRAY = 1
BLACK = 2
INFTY = 10**16
def dijkstra(s, VC):
color = [WHITE for i in range(N)]
d = [INFTY for i in range(N)]
d[s] = 0
pq = []
heapq.heappush(pq, (0, s))
while len(pq) != 0:
u = heapq.heappop(pq)[1]
color[u] = BLACK
for v,... | p03305 |
import heapq
from itertools import accumulate
n,m,s,t = map(int,input().split())
inf = 1000000000000000
gyen = [[] for _ in range(n)]
gsnuk = [[] for _ in range(n)]
for _ in range(m):
u,v,a,b = map(int,input().split())
gyen[u-1].append([v-1,a])
gyen[v-1].append([u-1,a])
gsn... | import heapq
import sys
from itertools import accumulate
n,m,s,t = map(int,next(sys.stdin).split(" "))
inf = 1000000000000000
gyen = [dict() for _ in range(n)]
gsnuk = [dict() for _ in range(n)]
for _ in range(m):
u,v,a,b = map(int,next(sys.stdin).split(" "))
gyen[u-1][v-1] = gyen[v-1][u-1]... | p03305 |
def main():
import collections
import heapq
class Dijkstra:
def __init__(self):
self.e = collections.defaultdict(list)
def add(self, u, v, d): # 無向グラフの場合
self.e[u].append([v, d])
self.e[v].append([u, d])
def delete(self, u, v):
... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def main():
import collections
import heapq
class Dijkstra:
def __init__(self):
self.e = collections.defaultdict(list)
def add(self, u, v, d): # 無向グラフの場合
self.e[u].append(... | p03305 |
import sys
from collections import defaultdict as dd
import heapq
input = sys.stdin.readline
n, m, s, t = list(map(int, input().split()))
e = dd(list)
money = 10 ** 15
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
e[u].append((v, a))
e[v].append((u, a))
e[u + n].append((v + n, b))
... | import sys
from collections import defaultdict as dd
input = sys.stdin.readline
N, M, s, t = list(map(int, input().split()))
e = dd(list)
ee = dd(list)
for i in range(M):
u, v, a, b = list(map(int, input().split()))
e[u].append((v, a))
e[v].append((u, a))
ee[u].append((v, b))
ee[v].append((u, b))
... | p03305 |
import heapq
def dijkstra(adj, start):
ans = [float("inf")] * len(adj)
q = [(0, start)]
while len(q):
cost, node = heapq.heappop(q)
if cost > ans[node]:
continue
ans[node] = cost
for nxt in adj[node]:
heapq.heappush(q, (cost + adj[node][n... | from heapq import heappush, heappop
def dijkstra(N, adj, start=0):
ans = [float("inf")] * N
q = [(0, start)]
while len(q):
cost, i = heappop(q)
if ans[i] <= cost:
continue
ans[i] = cost
for nxt in adj[i]:
if ans[nxt] == float("inf"):
... | p03305 |
from collections import defaultdict
import heapq
n,m,s,t=list(map(int, input().strip().split()))
links_y=defaultdict(list)
links_s=defaultdict(list)
for i in range(m):
u,v,a,b=list(map(int, input().strip().split()))
links_y[u-1].append((v-1,a))
links_y[v-1].append((u-1,a))
links_s[u-1].append((... | import heapq
n,m,s,t=list(map(int, input().strip().split()))
links_y=[[]for i in range(n) ]
links_s=[[]for i in range(n) ]
INF=float('inf')
for i in range(m):
u,v,a,b=list(map(int, input().strip().split()))
links_y[u-1].append((v-1,a))
links_y[v-1].append((u-1,a))
links_s[u-1].append((v-1,b))
... | p03305 |
from heapq import heappush, heappop
def dijkstra(graph:list, node:int, start:int) -> list:
# graph[node] = [(cost, to)]
inf = float('inf')
dist = [inf]*node
dist[start] = 0
heap = [(0,start)]
while heap:
cost,thisNode = heappop(heap)
for NextCost,NextNode in graph[this... | from heapq import heappush, heappop
def dijkstra(graph:list, node:int, start:int) -> list:
# graph[node] = [(cost, to)]
inf = float('inf')
dist = [inf]*node
dist[start] = 0
heap = [(0,start)]
while heap:
cost,thisNode = heappop(heap)
for NextCost,NextNode in graph[this... | p03305 |
import sys
input = sys.stdin.readline
from collections import defaultdict, deque
from itertools import accumulate
n,m,s,t= list(map(int,input().split()))
uvab = [list(map(int,input().split())) for i in range(m)]
g = defaultdict(list)
c = {}
for i in range(1,n+1):
g[i].append(n+i)
c[(i,n+i)] = 0
for... | import sys
input = sys.stdin.readline
from collections import defaultdict, deque
from itertools import accumulate
n,m,s,t= list(map(int,input().split()))
uvab = [list(map(int,input().split())) for i in range(m)]
g = defaultdict(list)
c = {}
'''
for i in range(1,n+1):
g[i].append(n+i)
c[(i,n+i)] = 0... | p03305 |
import heapq
import sys
n, m, s, t = [int(i) for i in input().split()]
s -= 1
t -= 1
snuuk_dict = dict()
yen_dict = dict()
snuuk_que = []
yen_que = []
for i in range(m):
u, v, a, b = [int(i) for i in sys.stdin.readline().split()]
u -= 1
v -= 1
if snuuk_dict.get(u) is None:
snuuk_di... | import heapq
import sys
n, m, s, t = [int(i) for i in input().split()]
s -= 1
t -= 1
snuuk_dict = dict()
yen_dict = dict()
snuuk_que = []
yen_que = []
for i in range(m):
u, v, a, b = [int(i) for i in sys.stdin.readline().split()]
u -= 1
v -= 1
if snuuk_dict.get(u) is None:
snuuk_di... | p03305 |
import sys
from collections import namedtuple
from heapq import heappush, heappop
INF = sys.maxsize
P = namedtuple('P', 'cost v')
Edage = namedtuple('Edge', 'to cost')
n, m, s, t = list(map(int, input().split()))
s, t = s - 1, t - 1
# 円とスヌークそれぞれグラフを構成する
Yen = [[] for _ in range(n)]
Snuuk = [[] for _... | import sys
from collections import namedtuple
from heapq import heappush, heappop
INF = sys.maxsize
P = namedtuple('P', 'cost v')
Edage = namedtuple('Edge', 'to cost')
n, m, s, t = list(map(int, input().split()))
s, t = s - 1, t - 1
# 円とスヌークそれぞれグラフを構成する
Yen = [[] for _ in range(n)]
Snuuk = [[] for _... | p03305 |
#!/usr/bin/env python3
#SoundHound D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import... | #!/usr/bin/env python3
#SoundHound D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import... | p03305 |
#!/usr/bin/env python3
#SoundHound D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import... | #!/usr/bin/env python3
#SoundHound D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import... | p03305 |
import heapq
class SegmentTree(object):
def __init__(self, A, dot, unit):
n = 1 << (len(A) - 1).bit_length()
tree = [unit] * (2 * n)
for i, v in enumerate(A):
tree[i + n] = v
for i in range(n - 1, 0, -1):
tree[i] = dot(tree[i << 1], tree[i << 1 | 1])... | import heapq
class SegmentTree(object):
def __init__(self, A, dot, unit):
n = 1 << (len(A) - 1).bit_length()
tree = [unit] * (2 * n)
for i, v in enumerate(A):
tree[i + n] = v
for i in range(n - 1, 0, -1):
tree[i] = dot(tree[i << 1], tree[i << 1 | 1])... | p03305 |
n, m, s, t = list(map(int, input().split()))
root1 = []
for i in range(n):
root1_ = [0] * n
root1.append(root1_)
root2 = []
for i in range(n):
root2_ = [0] * n
root2.append(root2_)
for i in range(m):
root = list(map(int, input().split()))
root1[root[0] - 1][root[1] - 1] = root... | n, m, s, t = list(map(int, input().split()))
root1 = {}
root2 = {}
for i in range(m):
u, v, a, b = list(map(int, input().split()))
root1[(u, v)] = a
root2[(u, v)] = b
def edge(G, x):
return([(b, G[(a, b)]) for (a, b) in G if a == x] + [(a, G[(a, b)]) for (a, b) in G if b == x])
def m... | p03305 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.