input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
(n, k) = list(map(int, input().split(" ")))
pts = []
for _ in range(n):
(x, y) = list(map(int, input().split(" ")))
pts += [(x, y)]
pts.sort()
res = float("inf")
for a in pts:
for b in pts:
for c in pts:
for d in pts:
l = a[0]
r = b[0]
... | (n, k) = list(map(int, input().split(" ")))
xs = []
ys = []
pts = []
for _ in range(n):
(x, y) = list(map(int, input().split(" ")))
xs += [x]
ys += [y]
pts += [(x, y)]
xs.sort()
ys.sort()
res = float("inf")
for a in xs:
for b in xs:
ci = 0
di = 1
while d... | p03576 |
n,k = list(map(int,input().split()))
xyl = []
for _ in range(n):
x,y = list(map(int,input().split()))
xyl.append((x,y))
ans = float("inf")
for i in range(n):
for j in range(i+1, n):
for h in range(n):
for g in range(h+1, n):
x1 = min(xyl[i][0], xyl[j][0], xyl[... | N, K = list(map(int, input().split()))
P = sorted([tuple(map(int, input().split())) for _ in range(N)])
ans = 1e30
for lx in range(N):
for rx in range(lx+K, N+1):
Q = sorted(P[lx:rx], key=lambda x:x[1])
for ly in range(len(Q)):
R = Q[ly:ly+K]
if len(R)>=K: ans = min... | p03576 |
from itertools import product as pd
n,k=list(map(int,input().split()))
o=[tuple(map(int,input().split())) for _ in range(n)]
def calc(a,b,c,d):
lx=min(o[a][0],o[b][0])
rx=max(o[a][0],o[b][0])
dy=min(o[c][1],o[d][1])
uy=max(o[c][1],o[d][1])
cnt=0
for i in o:
if lx<=i[0]<=rx and dy<=i[1]<=uy... | from itertools import combinations as comb
n,k=list(map(int,input().split()))
f=lambda x,y:(min(x,y),max(x,y))
o=[tuple(map(int,input().split())) for _ in range(n)]
v=float("inf")
for (a,b) in comb(list(range(n)),2):
for (c,d) in comb(list(range(n)),2):
lx,rx=f(o[a][0],o[b][0])
dy,uy=f(o[c][1],o[d][... | p03576 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, k = list(map(int, readline().split()))
xy = [list(map(int, readline().split())) for _ in range(n)]
ans = float('inf')
for i, (ix, _) in enumerate(xy):
for ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, k = list(map(int, readline().split()))
xy = []
xx = []
yy = []
for _ in range(n):
x, y = list(map(int, readline().split()))
xx.append(x)
yy.appe... | p03576 |
n,k=list(map(int,input().split()))
p=[]
for i in range(n):
x,y=list(map(int,input().split()))
p.append([x,y])
ret=10**25
for a in range(n):
for b in range(n):
for c in range(n):
for d in range(n):
l=min(p[a][0],p[b][0],p[c][0],p[d][0])
r=max(p[a... | n,k=list(map(int,input().split()))
p=[]
for i in range(n):
x,y=list(map(int,input().split()))
p.append([x,y])
ret=10**25
for a in range(n):
for b in range(a):
r=max(p[a][0],p[b][0])
l=min(p[a][0],p[b][0])
for c in range(n):
for d in range(c):
u... | p03576 |
import itertools
N,K = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(N)]
tup = ()
for i in range(N):
tup += (i,)
data = list(itertools.combinations(tup,2))
ans = []
for x in range(len(data)):
for y in range(len(data)):
cnt = 0
x_side = data[x]... | n,K = list(map(int,input().split()))
x,y = [],[]
xx,yy = [],[]
for i in range(n):
X,Y = list(map(int,input().split()))
x.append(X)
xx.append(X)
y.append(Y)
yy.append(Y)
xx.sort()
yy.sort()
ans = 10**20
for i in range(n):
for j in range(i):
lx,rx = xx[j],xx[i]
... | p03576 |
from itertools import*
n,k=list(map(int,input().split()))
a=10**20
for z in combinations(sorted(list(map(int,input().split()))for _ in range(n)),k):
y=[j for _,j in z]
a=min(a,(z[-1][0]-z[0][0])*(max(y)-min(y)))
print(a) | n,k=list(map(int,input().split()))
z=[list(map(int,input().split()))for _ in range(n)]
z.sort()
a=10**20
for i in range(n):
for j in range(i+1,n):
x=z[j][0]-z[i][0]
l=sorted(t[1]for t in z[i:j+1])
for u,v in zip(l,l[k-1:]):
a=min(a,x*(v-u))
print(a) | p03576 |
n,m=list(map(int,input().split()))
x=[0]*n
y=[0]*n
for i in range(n):
x[i],y[i]=list(map(int,input().split()))
ans=10**19
for i in range(n):
for j in range(n):
for k in range(n):
for l in range(n):
xl=min(x[i],x[j],x[k],x[l])
xr=max(x[i],x[j],x[k],x[l])
yl=min(y[i],y[j]... | n,m=list(map(int,input().split()))
x=[0]*n
y=[0]*n
for i in range(n):
x[i],y[i]=list(map(int,input().split()))
ans=10**19
for i in range(n):
for j in range(i,n):
for k in range(j,n):
for l in range(k,n):
xl=min(x[i],x[j],x[k],x[l])
xr=max(x[i],x[j],x[k],x[l])
yl=min(y[i... | p03576 |
def main():
N, K = list(map(int, input().split()))
dots = []
for _ in range(N):
x, y = list(map(int, input().split()))
dots.append((x,y))
ans = float('inf')
for i in range(N):
for j in range(N):
for k in range(N):
for l in range(N):
... | def main():
N, K = list(map(int, input().split()))
x = [0] * N
y = [0] * N
for i in range(N):
x[i], y[i] = list(map(int, input().split()))
ans = float('inf')
for i in range(N):
for j in range(N):
for k in range(N):
for l in range(... | p03576 |
# -*- coding: utf-8 -*-
from itertools import product, combinations
from operator import itemgetter
def inpl(): return tuple(map(int, input().split()))
# B以下の数-A未満の数→bisect(L, B) - bisect_left(L, A)
N, K = inpl()
X = []
Y = []
Px = []
Py = []
for i in range(N):
x, y = inpl()
X.append(x)
Y... | # -*- coding: utf-8 -*-
from itertools import product, combinations
from operator import itemgetter
def inpl(): return tuple(map(int, input().split()))
N, K = inpl()
X = []
Y = []
Px = []
Py = []
for i in range(N):
x, y = inpl()
X.append(x)
Y.append(y)
Px.append((x, i))
Py.append((... | p03576 |
n,K=list(map(int,input().split()))
lists=[]
for i in range(n):
x,y=list(map(int,input().split()))
lists.append((x,y))
anslist=[]
for i in range(n):
for j in range(i+1,n):
for k in range(n):
for l in range(k+1,n):
a=lists[i][0]
b=lists[j][... | #atcoder -take a rest-(easy)
def main():
N,K = list(map(int,input().split()))
que = []
que_x = []
que_y = []
for i in range(N):
x,y = list(map(int,input().split()))
que_x.append(x)
que_y.append(y)
que.append((x,y))
que_x.sort()
que_y.sort()
... | p03576 |
N,K=list(map(int,input().split()))
xy_list = []
for i in range(N):
xy_list.append(list(map(int,input().split())))
min_s = 10**28
for i in range(N):
for j in range(i+1,N):
for k in range(N):
for l in range(k+1,N):
max_x = max(xy_list[i][0],xy_list[j][0])
... | N,K = list(map(int,input().split()))
X = []
Y = []
Z = []
for i in range(N):
x,y = list(map(int,input().split()))
X.append(x)
Y.append(y)
Z.append([x,y])
X.sort()
Y.sort()
min_rec=10**27
for i in range(N-1):
for j in range(i+1,N):
for k in range(N-1):
for l... | p03576 |
from collections import defaultdict
def main():
n,k=list(map(int,input().split()))
xy=[list(map(int,input().split())) for _ in range(n)]
xwl=dict((c[0],i) for i,c in enumerate(xy))
ywl=dict((c[1],i) for i,c in enumerate(xy))
x=list(xwl.keys())
y=list(ywl.keys())
x.sort()
y.sort()
xdict=d... | from collections import defaultdict
def main():
n,k=list(map(int,input().split()))
xy=[list(map(int,input().split())) for _ in range(n)]
x=[p[0] for p in xy]
y=[p[1] for p in xy]
x.sort()
y.sort()
s1=[[0]*n for _ in range(n)]
s2=[[0]*n for _ in range(n)]
s3=[[0]*n for _ in range(n)]
s... | p03576 |
N, K = list(map(int, input().split()))
ps = []
for i in range(N):
ps.append(list(map(int, input().split())))
xsorted = list(zip(*sorted(ps, key=lambda p: p[0])))[0]
ysorted = list(zip(*sorted(ps, key=lambda p: p[1])))[1]
ans = float('inf')
for i in range(N):
bottom = ysorted[i]
for j in range(i+K-1, ... | N, K = list(map(int, input().split()))
ps = []
for i in range(N):
ps.append(list(map(int, input().split())))
xsorted = list(zip(*sorted(ps, key=lambda p: p[0])))[0]
ysorted = list(zip(*sorted(ps, key=lambda p: p[1])))[1]
ans = float('inf')
for i in range(N):
bottom = ysorted[i]
for j in range(i+K-1, ... | p03576 |
n,k_num = list(map(int,input().split()))
info =[list(map(int,input().split())) for i in range(n)]
li_x = []
li_y = []
for i in range(n):
if info[i][0] not in li_x:
li_x.append(info[i][0])
if info[i][1] not in li_y:
li_y.append(info[i][1])
li_x = sorted(li_x)
li_y = sorted(li_y)
ans = float(... | n,k_num = list(map(int,input().split()))
info =[list(map(int,input().split())) for i in range(n)]
li_x = []
li_y = []
for i in range(n):
# if info[i][0] not in li_x:
li_x.append(info[i][0])
# if info[i][1] not in li_y:
li_y.append(info[i][1])
li_x = sorted(li_x)
li_y = sorted(li_y)
bunpu = [[... | p03576 |
from itertools import combinations
def count(x1,y1,x2,y2):
res = 0
for i in range(N):
s1 = x[i]
s2 = y[i]
if x1 <= s1 <= x2 and y1 <= s2 <= y2:
res += 1
return res
N,K = list(map(int,input().split()))
x = []
y = []
y_dict = {}
for i in range(N)... | from itertools import combinations as comb
def count(x1,y1,x2,y2):
res = 0
for x,y in point:
if x1 <= x <= x2 and y1 <= y <= y2:
res += 1
return res
N,K = list(map(int,input().split()))
x = []
point = []
y_dict = {}
for i in range(N):
a,b = list(map(int,input... | p03576 |
from itertools import product
n, k = list(map(int, input().split()))
p = [list(map(int, input().split())) for i in range(n)]
ans = float("inf")
for i, j, l, m in product(list(range(n)), repeat=4):
cnt = 0
for g in range(n):
if p[i][0] <= p[g][0] <= p[j][0] and p[l][1] <= p[g][1] <= p[m][1]:... | n, k = list(map(int, input().split()))
p = [list(map(int, input().split())) for i in range(n)]
ans = float("inf")
p.sort()
for i in range(n-k+1):
for j in range(i+k-1, n):
x = p[j][0] - p[i][0]
yl = sorted(p[i:j+1],key=lambda x:x[1])
for l in range(len(yl)-k+1):
y = yl... | p03576 |
from itertools import combinations
import bisect
N, K = list(map(int, input().split()))
xy = [tuple(map(int, input().split())) for i in range(N)]
xy.sort(key=lambda x: x[0])
X = [x[0] for x in xy]
ans = 40**18
for a, b in combinations(list(range(N)), 2):
A, B = max(xy[a][0], xy[b][0]), min(xy[a][0], xy[b]... | def main():
from itertools import combinations
import bisect
N, K = list(map(int, input().split()))
xy = [tuple(map(int, input().split())) for i in range(N)]
xy.sort(key=lambda x: x[0])
X = [x[0] for x in xy]
ans = 40**18
for a, b in combinations(list(range(N)), 2):
A,... | p03576 |
n, k = list(map(int, input().split()))
x = [0 for _ in range(n)]
y = [0 for _ in range(n)]
for i in range(n):
x[i], y[i] = list(map(int, input().split()))
min_x = min(x)
min_y = min(y)
for i in range(n):
x[i] -= min_x
y[i] -= min_y
sx = sorted(x)
sy = sorted(y)
if n == k:
print((sx[... | n, k = list(map(int, input().split()))
x = [0 for _ in range(n)]
y = [0 for _ in range(n)]
for i in range(n):
x[i], y[i] = list(map(int, input().split()))
min_x = min(x)
min_y = min(y)
for i in range(n):
x[i] -= min_x
y[i] -= min_y
sx = sorted(x)
sy = sorted(y)
if n == k:
print((sx[... | p03576 |
N,K = list(map(int,input().split()))
xy = []
for i in range(N):
x,y = list(map(int,input().split()))
xy.append([x,y])
ans = float("inf")
for p1 in range(N):
for p2 in range(N):
for p3 in range(N):
for p4 in range(N):
left = min(xy[p1][0],... |
N,K = list(map(int,input().split()))
xy = []
xlis = []
ylis = []
for i in range(N):
x,y = list(map(int,input().split()))
xy.append([x,y])
if x not in xlis:
xlis.append(x)
if y not in ylis:
ylis.append(y)
ans = float("inf")
xlis.sort()
ylis.sort()
for rp in r... | p03576 |
def main():
N,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*N]
iX = sorted(x for x,y in XY)
iY = sorted(y for x,y in XY)
X = {x:i for i,x in enumerate(iX)}
Y = {y:i for i,y in enumerate(iY)}
c = [[0]*(N+1) for i in [0]*(N+1)]
for x,y... | n,k=list(map(int,input().split()))
points=[]
for _ in range(n):
x,y=list(map(int,input().split()))
points.append((x,y))
points.sort()
ans=float('inf')
for i in range(n-k+1):
for j in range(i+k-1,n):
y_sorted=sorted(points[i:j+1],key=lambda x:x[1])
height_min=float('inf')
f... | p03576 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | p03576 |
N, K = list(map(int, input().split()))
x = [list(map(int, input().split())) for i in range(N)]
ans = 10**30
for i in range(N):
for j in range(N):
for k in range(N):
for l in range(N):
x0, y0 = x[i]
x1, y1 = x[j]
x2, y2 = x[k]
... | n, k = list(map(int, input().split()))
p = [list(map(int, input().split())) for i in range(n)]
p = sorted(p, key=lambda _: _[0])
ans = 10**30
for b in range(n):
x_b, y_b = p[b]
for t in range(n):
x_t, y_t = p[t]
if y_t <= y_b:
continue
v = [_ for _ in p if y_b <= _[... | p03576 |
import itertools
n,k = list(map(int,input().split()))
x = []
a = []
b = []
for i in range(n):
x1,y1=[int(i) for i in input().split()]
x.append([x1,y1])
a.append(x1)
b.append(y1)
ue = list(itertools.combinations(a,2))
mi = list(itertools.combinations(b,2))
ans = float("inf")
for u,d in ue:
... | import itertools
n,k = list(map(int,input().split()))
x = []
a = []
b = []
for i in range(n):
x1,y1=[int(i) for i in input().split()]
x.append([x1,y1])
a.append(x1)
b.append(y1)
ue = list(itertools.combinations(a,2))
mi = list(itertools.combinations(b,2))
e = len(ue)
ue.extend(mi)
ans = fl... | p03576 |
from collections import defaultdict
N, K = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 19
acc = defaultdict(int)
x = [-INF]
y = [-INF]
for ex, ey in xy:
acc[(ex, ey)] = 1
x.append(ex)
y.append(ey)
x.sort()
y.sort()
for i in range(N):
... | n, k = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(n)]
INF = 10 ** 19
xy.sort()
ans = INF
for i in range(n):
for j in range(i + k - 1, n):
width = xy[j][0] - xy[i][0]
y = [xy[idx][1] for idx in range(i, j + 1)]
y.sort()
for e1, e2 in zip(y, y[k-1:]):
... | p03576 |
n, k = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(n)]
INF = 10 ** 19
xy.sort()
ans = INF
for i in range(n):
for j in range(i + k - 1, n):
width = xy[j][0] - xy[i][0]
y = [xy[idx][1] for idx in range(i, j + 1)]
y.sort()
for e1, e2 in zip(y, y[k-1:]):
... | n, k = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(n)]
xy.sort()
ans = float("inf")
for i in range(n):
for j in range(i + k - 1, n):
width = xy[j][0] - xy[i][0]
y = [e for _, e in xy[i:j+1]]
y.sort()
for e1, e2 in zip(y, y[k-1:]):... | p03576 |
import itertools
N,K=list(map(int,input().split()))
XY=[list(map(int,input().split())) for i in range(N)]
l=[i for i in range(N)]
ans=float("inf")
for v in itertools.combinations(l,2):
xmax=max(XY[v[0]][0],XY[v[1]][0])
xmin=min(XY[v[0]][0],XY[v[1]][0])
ymax=max(XY[v[0]][1],XY[v[1]][1])
ymin=min(XY[v[0]... | import itertools
N,K=list(map(int,input().split()))
XY=[list(map(int,input().split())) for i in range(N)]
ans=float("inf")
for xv in itertools.combinations( [xy[0] for xy in XY] ,2):
for yv in itertools.combinations( [xy[1] for xy in XY] ,2):
xmax=max(xv[0],xv[1])
xmin=min(xv[0],xv[1])
ymax=max(... | p03576 |
N,K = list(map(int,input().split()))
points1 = []
points2 = []
for i in range(N):
x,y = tuple((list(map(int,input().split()))))
points1.append((x,y))
points2.append(y)
points1.sort()
points2.sort()
xDict = {}
index = 0
for x,y in points1:
if index in xDict:
if xDict[index] != x:
index += 1
... | N,K = list(map(int,input().split()))
points1 = []
points2 = []
for i in range(N):
x,y = tuple((list(map(int,input().split()))))
points1.append((x,y))
points2.append(y)
points1.sort()
points2.sort()
xDict = {}
index = 0
for x,y in points1:
if index in xDict:
if xDict[index] != x:
index += 1
... | p03576 |
n,k=list(map(int,input().split()))
xy=[list(map(int,input().split())) for _ in range(n)]
x=[t[0] for t in xy]
y=[t[1] for t in xy]
res=[]
for i in range(n):
for j in range(n):
for a in range(n):
for b in range(n):
l=min(x[i],x[j])
r=max(x[i],x[j])
... | n,k=list(map(int,input().split()))
xy=[list(map(int,input().split())) for _ in range(n)]
x=[t[0] for t in xy]
y=[t[1] for t in xy]
res=[]
for i in range(n-1):
for j in range(i+1,n):
for a in range(n-1):
for b in range(a+1,n):
l=min(x[i],x[j])
r=max(x[i... | p03576 |
N,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for i in range(N)]
ans = float("inf")
import itertools
I = [i for i in range(N)]
for B in itertools.combinations(I,4):
i,j,k,kk = B
x1,y1 = XY[i]
x2,y2 = XY[j]
x3,y3 = XY[k]
x4,y4 = XY[kk]
u = max(y1,y2,y3,y... | N,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for i in range(N)]
ans = float("inf")
for i in range(N):
x1,y1 = XY[i]
for j in range(i+1,N):
x2,y2 = XY[j]
u2 = max(y1,y2)
d2 = min(y1,y2)
r2 = max(x1,x2)
l2 = min(x1,x2)
for k... | p03576 |
inf = float('inf')
N,K = list(map(int,input().split()))
ans = inf
X = []
Y = []
XY = []
for _ in range(N):
x,y = list(map(int,input().split()))
X.append(x)
Y.append(y)
XY.append((x,y))
X = sorted(X)
Y = sorted(Y)
for i in range(N):
for j in range(i+1,N):
for k in range(N... | inf = float('inf')
N,K = list(map(int,input().split()))
ans = inf
X = []
Y = []
XY = []
for _ in range(N):
x,y = list(map(int,input().split()))
X.append(x)
Y.append(y)
XY.append((x,y))
X = sorted(X)
Y = sorted(Y)
for i, left in enumerate(X):
for right in X[i+1:]:
for j, ... | p03576 |
n,k=list(map(int,input().split()))
x,y=[[0,0] for i in range(n)],[[0,0] for i in range(n)]
xy=[list(map(int,input().split())) for i in range(n)]
for i in range(n):
x_sub,y_sub=xy[i]
x[i][0]=x_sub
x[i][1]=i
y[i][0]=y_sub
y[i][1]=i
x.sort(key=lambda z:z[0])
y.sort(key=lambda z:z[0])
ans=(10... | n,k=list(map(int,input().split()))
x,y=[[0,0] for i in range(n)],[[0,0] for i in range(n)]
xy=[list(map(int,input().split())) for i in range(n)]
for i in range(n):
x_sub,y_sub=xy[i]
x[i][0]=x_sub
x[i][1]=i
y[i][0]=y_sub
y[i][1]=i
x.sort()
y.sort()
ans=(10**18)*5
for i1 in range(n):
... | p03576 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(N):
ans += a[-2]
a = a[1:-2]
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = 0
count = 0
for i in range(1, N*3+1, 2):
if count == N:
break
else:
ans += a[i]
count += 1
print(ans)
| p03767 |
n=int(eval(input()))
a=list(map(int, input().split()))
a.sort(reverse=True)
print((sum(a[1:2*n:2]))) | n=int(eval(input()))
a=sorted(list(map(int, input().split())), reverse=True)
print((sum(a[1:2*n:2]))) | p03767 |
N = int(eval(input()))
a = [int(i) for i in input().split()]
_sum = 0
for i in range(N):
a.remove(max(a))
_sum += max(a)
a.remove(max(a))
print(_sum)
| N = int(eval(input()))
a = [int(i) for i in input().split()]
a.sort(reverse=True)
print((sum(a[1:2*N][::2]))) | p03767 |
# AGC012A - AtCoder Group Contest
def main():
n = int(eval(input()))
A = sorted(map(int, input().rstrip().split()))[n:]
print((sum(A[::2])))
if __name__ == "__main__":
main() | # AGC012A - AtCoder Group Contest
def main():
n = int(eval(input()))
A = sorted(map(int, input().rstrip().split()))
print((sum(A[n::2])))
if __name__ == "__main__":
main() | p03767 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
while len(A) > 0:
ans += A[1]
A = A[2:-1]
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
for i in range(1, 2*N, 2):
ans += A[i]
print(ans) | p03767 |
N=int(eval(input()))
a = sorted(list(map(int,input().split())),reverse=True)
ans=0
for i in range(2*N):
tmp=a.pop(0)
if i%2==1:
ans+=tmp
print(ans) | N=int(eval(input()))
a = sorted(list(map(int,input().split())),reverse=True)
ans=0
for i in range(N):
ans+=a[2*i+1]
print(ans) | p03767 |
N = int(eval(input()))
A = list(sorted(list(map(int, input().split()))))
# N = 2
# A = list(sorted([5,2,8,5,1,5]))
group = []
ret = 0
for n in range(N):
group.append([A.pop(0), A.pop(), A.pop()])
for g in group:
ret += list(sorted(g))[1]
print(ret) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ret = 0
for n in range(N, N*3, 2):
ret += A[n]
print(ret) | p03767 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
tot = 0
while A:
A.pop()
tot += A.pop()
A.pop(0)
return tot
if __name__ == '__main__':
print((main())) | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
tot = 0
for i in range(N):
tot += A[3*N-2-2*i]
return tot
if __name__ == '__main__':
print((main())) | p03767 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse = True)
sum = 0
for i in range(n):
a.pop(0)
sum += a.pop(0)
print(sum)
| n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse = True)
print((sum(a[1::2][:n])))
| p03767 |
# _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest-
# Atcoder_Grand_Contest-
# TODO https://atcoder.jp/contests/abc/tasks/abc_
import time
from contextlib import contextmanager
# from time import sleep
@contextmanager
def timer(title):
t0 = time.time()
yield
print(("{} - done in {:.0f}s".format(title,t... | # _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest-
# Atcoder_Grand_Contest012-A
# https://atcoder.jp/contests/agc012/tasks/agc012_a
def maxLevel(memberNumber,orgMemberLevelList):
maxLevelSortedList = sorted(orgMemberLevelList,reverse=True)
maxLevelScore = 0
checkMemberCountRange = list(range(0,memberNu... | p03767 |
N = int(eval(input()))
A = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for a in A[1:2*N:2]:
ans += a
print(ans)
| import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = sorted(list(map(int, input().split())), reverse=True)
print((sum(A[1:2*N:2])))
if __name__ == '__main__':
main()
| p03767 |
n,a=int(eval(input())),sorted(list(map(int,input().split())))[::-1];print((sum([a[i]*(i%2==1)for i in range(2*n)]))) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=1)
ans=0
for i in range(1,2*n+1,2):ans+=a[i]
print(ans) | p03767 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
A = a[1:len(a):2]
ans = 0
for i in range(N):
ans += A[i]
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
print((sum(a[1:2*N:2]))) | p03767 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(N, 3 * N, 2):
ans += a[i]
print (ans) | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
# ans = 0
# for i in range(N, 3 * N, 2):
# ans += a[i]
# print (ans)
print((sum(a[N::2]))) | p03767 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
ans = sum(a[n::2])
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
#print(a)
# @0~N-1, !N,N+1,!N+2,N+3,!N+4, ... ,!N+N=2N
a = a[N::2]
print((sum(a))) | p03767 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
a = sorted(a,reverse=True)
ans = 0
for i in range(0,2*n):
if i%2==1:
ans += a[i]
print(ans) | n = int(eval(input()))
a = [int(i) for i in input().split()]
a = sorted(a)[::-1]
ans = 0
for i in range(2*n):
if (i+1)%2==0:
ans += a[i]
print(ans) | p03767 |
N = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
a.reverse()
A = a[1:2*N:2]
B = a[N:2*N]
print((max(sum(A),sum(B)))) | N = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
a.reverse()
print((sum(a[1:2*N:2]))) | p03767 |
N = int(eval(input()))
member = sorted(map(int, input().split()))
ans = 0
while member:
member.pop()
ans += member.pop()
member.pop(0)
print(ans)
| N = int(eval(input()))
member = sorted(map(int, input().split()))
ans = sum(member[N::2])
print(ans)
| p03767 |
n=int(eval(input()))
a_list=[int(i) for i in input().split()]
a_list.sort(reverse=True)
#print(a_list)
b_list=a_list[1:2*n:2]
#print(b_list)
print((sum(b_list))) | n=int(eval(input()))
a_list=[int(i) for i in input().split()]
a_list.sort(reverse=True)
second_list=a_list[1:2*n:2]
print((sum(second_list)))
| p03767 |
n = int(eval(input()))
a = sorted(map(int, input().split()))
ans = 0
l = 0
r = 3*n-1
while l < r:
ans += a[r-1]
l += 1
r -= 2
# print(l, r)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
a.sort(reverse=True)
for i in range(n):
ans += a[2*i+1]
print(ans) | p03767 |
def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
print((sum(A[3*N-2:N-1:-2])))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
print((sum(A[-2:-2*N-1:-2])))
if __name__ == '__main__':
main()
| p03767 |
N = int(eval(input()))
a = sorted(list(map(int, input().split())))
s = 0
while a:
x = [a[0]] + a[-2:]
s += x[1]
a = a[1:-2]
print(s) | N = int(eval(input()))
a = sorted(list(map(int, input().split())))
print((sum(a[-2 * (i+1)] for i in range(N))))
| p03767 |
N = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
idx = 0
for i in range(N - 1):
a.insert(2+idx, a.pop())
idx += 3
print((sum(a[1::3]))) | N = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a[1:len(a)-N:2])))
| p03767 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(N, len(a), 2):
ans += a[i]
print(ans) | N = int(eval(input()))
print((sum(sorted(map(int, input().split()))[N:3*N:2]))) | p03767 |
N=int(eval(input()))
t = list(map(int,input().split()))
newLi = sorted(t, reverse=True)
li = []
ans = 0
for i in range(N):
k = [newLi.pop(0), newLi.pop(0), newLi.pop(-1)]
ans += k[1]
print(ans) | N=int(eval(input()))
t = list(map(int,input().split()))
newLi = sorted(t, reverse=True)
ans = 0
for i in range(N):
ans += newLi[i * 2 + 1]
print(ans) | p03767 |
import sys
n = int(sys.stdin.readline().rstrip())
a = list(map(int, sys.stdin.readline().rstrip().split()))
a.sort()
# print(a)
ans = 0
for i in range(n):
a = a[1:]
a = a[:-1]
ans += a[-1]
a = a[:-1]
print(ans) | import sys
n = int(sys.stdin.readline().rstrip())
a = list(map(int, sys.stdin.readline().rstrip().split()))
a.sort()
# print(a)
ans = 0
a = a[n:]
a.reverse()
print((sum(a[1::2]))) | p03767 |
#
# agc012 a
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
ou... | #
# agc012 a
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
ou... | p03767 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
res = 0
for i in range(n):
A.pop(0)
A.pop(-1)
res += A[-1]
A.pop(-1)
print(res)
... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
res = 0
for i in range(n):
res += A[-(i + 1) * 2]
print(res)
if __name__ == '__main__':
resolve()
| p03767 |
n = int(eval(input()))
data = list(map(int,input().split()))
data = sorted(data, reverse=True)
sum = 0
while data != []:
del data[0]
del data[-1]
sum += data[0]
del data[0]
print(sum) | n = int(eval(input()))
data = list(map(int,input().split()))
data = sorted(data, reverse=True)
sum = 0
for i in range(n):
sum += data[1+2*i]
print(sum) | p03767 |
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
print((sum(A[-2:-2 * n - 1:-2]))) | n = int(eval(input()))
print((sum(sorted(list(map(int, input().split())))[n::2]))) | p03767 |
n=int(eval(input()))
a=sorted(map(int,input().split()),reverse=True)
b=[]
while len(a):
for i in range(n):
a.remove(max(a))
b.append(max(a))
a.remove(max(a))
a.remove(min(a))
print((sum(b))) | n=int(eval(input()))
a=sorted(map(int,input().split()))
print((sum(a[n::2]))) | p03767 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03767 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
A.sort()
A = A[N:]
ans = 0
for i in range(N):
ans += A[2*i]
print(ans) | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
A.sort(reverse = True)
ans = 0
for i in range(N):
ans += A[2 * i + 1]
print(ans)
return 0
if __name__ == "__main__":
solve() | p03767 |
N = int(eval(input()))
participants = sorted([ int(v) for v in input().split(" ") ], reverse=True)
# 1 2 4 5 5 5 7 8 9
# 1 2 5 5 5 8
sum = 0
for i in range(N):
#print(participants)
c_max = participants.pop(0)
n_max = participants.pop(0)
c_min = participants.pop(-1)
sum += n_max
print(sum) | N = int(eval(input()))
participants = sorted([ int(v) for v in input().split(" ") ], reverse=True)
# 1 2 4 5 5 5 7 8 9
# 1 2 5 5 5 8
sum = 0
for i in range(0, N):
#print(participants)
#c_max = participants.pop(0)
#n_max = participants.pop(0)
#c_min = participants.pop(-1)
sum += participants[2*i... | p03767 |
N = int(eval(input()))
l = list(map(int,input().split()))
l.sort(reverse=True)
ans = 0
teams = []
for i in range(N):
teams.append([l[0],l[1],l[-1]])
l.remove(l[0])
l.remove(l[1])
l.remove(l[-1])
print((sum([i[1] for i in teams]))) | N = int(eval(input()))
l = list(map(int,input().split()))
l.sort(reverse=True)
ans = l[1::2]
print((sum(ans[:N]))) | p03767 |
n = int(eval(input()))
players_powers = sorted(list(map(int, input().rstrip("\n").split())), reverse=True)
print((sum(players_powers[1::2][:n])))
| n = int(eval(input())); print((sum(sorted(map(int, input().split()), reverse=True)[1:2*n + 1:2])))
| p03767 |
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sy... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p03767 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
print((sum(a[n::2]))) | def solve():
n = int(eval(input()))
a= list(map(int,input().split()))
a = sorted(a,reverse=True)
res = sum(a[1:2*n:2])
print(res)
if __name__=='__main__':
solve() | p03767 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a.reverse()
ans = 0
for i in a[1:-n:2]:
ans += i
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a.reverse()
print((sum(a[1:-n:2])))
| p03767 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
a.sort(reverse=True)
print((sum(a[1:n*2:2])))
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
a.sort(reverse=True)
t = 0
for i in range(1, n * 2, 2):
t += a[i]
print(t)
if __name__ == '__main__':
solve()
| p03767 |
N = eval(input())
arr = list(map(int, input().split()))
arr.sort()
sum = 0
for i in range(3*N-2, N-1, -2):
sum += arr[i]
print(sum) | N = int(eval(input()))
src = list(map(int,input().split()))
src.sort(reverse=True)
print((sum(src[1:2*N+1:2])))
| p03767 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a[1:n * 2:2]))) | n = int(eval(input()))
a = sorted(list(map(int, input().split())))
print((sum(a[n:3 * n:2]))) | p03767 |
N = int(eval(input()))
a = list(map(int,input().split()))
a.sort(reverse = True)
x = 0
for i in range(N):
x += a[2 * i + 1]
print(x) | N = int(eval(input()))
a = sorted(list(map(int, input().split())),reverse=True)
x = 0
for i in range(N):
x += a[2*i+1]
print(x) | p03767 |
n = int(eval(input()))
k = n // 3
a = list(map(int, input().split()))
a = sorted(a, reverse = True)
ans = 0
for i in range(2*n):
if i % 2 == 1:
ans += a[i]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
ans = 0
for i in range(n):
ans += a[2 * i + 1]
print(ans) | p03767 |
N = int(eval(input()))
A = list(sorted(map(int, input().split())))
# N = 10
# A = [1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 100000... | # https://atcoder.jp/contests/agc012/tasks/agc012_a
N = int(eval(input()))
a = list(sorted(map(int, input().split())))
print((sum(a[N::2])))
| p03767 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
a.sort(reverse=True)
ans=0
for i in range(n):
del a[0]
ans+=a[0]
del a[0]
print(ans) | n=int(eval(input()))
a=[int(i) for i in input().split()]
a.sort(reverse=True)
ans=0
for i in range(n):
ans+=a[i*2+1]
print(ans) | p03767 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
print((max(sum(A[N:2*N]),sum(A[1:2*N:2])))) | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
print((sum(A[1:2*N:2]))) | p03767 |
n = int(eval(input()))
l = list(map(int, input().split()))
l.sort()
power = 0
for i in range(len(l)//3):
power += l[-2]
l = l[1:-2]
print(power) | n = int(eval(input()))
l = list(map(int, input().split()))
l.sort()
power = 0
for i in range(1,len(l)//3+1):
power += l[-2*i]
print(power) | p03767 |
N = eval(input())
N =int(N)
nums= list(map(int,input().split(" ")))
nums.sort()
ans = 0
for _ in range(N):
nums.pop(-1)
ans += nums.pop(-1)
nums.pop(0)
print(ans) | N = eval(input())
N =int(N)
nums= list(map(int,input().split(" ")))
nums.sort()
ans = 0
for _ in range(N):
nums.pop()
ans += nums.pop()
print(ans) | p03767 |
print(sum(sorted(list([float(None==exec("N=int(input())"))] + list(map(int, input().split()))), reverse=True,key=lambda x: 10 ** 10 if type(x) == float else x)[2:2*N+1:2]))
| print(sum(sorted(list(map(int,exec("N=int(input())")or input().split())))[-2:-2*N-1:-2]))
| p03767 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = int(0)
#一番チームで最弱のやつを取り出す
for i in range(n):
ans = sum(a[n:3*n:2])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = int(0)
#一番チームで最弱のやつを取り出す
ans = sum(a[n:3*n:2])
print(ans)
| p03767 |
def a_atCoder_group_contest(N, A):
A.sort()
ans = 0
for k in range(N):
group = [A[k], A[3 * N - (2 * k + 2)], A[3 * N - (2 * k + 1)]]
ans += group[1]
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((a_atCoder_group_contest(N, A))) | def a_atCoder_group_contest(N, A):
A.sort(reverse=True)
ans = sum(A[1:2 * N:2]) # Aが0-indexedなので、 1, 3,..., 2N-1 番の和をとる
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((a_atCoder_group_contest(N, A))) | p03767 |
n = eval(input())
elem = list(map(int, input().split()))
elem.sort()
ans = 0
while len(elem) > 0:
elem.pop(0)
ans = ans + elem.pop(-2)
elem.pop(-1)
print(ans) | n = int(eval(input()))
elem = list(map(int, input().split()))
elem.sort()
ans = sum(elem[n::2])
print(ans) | p03767 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(n):
ans += a[i * 2 + 1]
print(ans) | n = int(eval(input()))
a = sorted(map(int, input().split()))
print((sum(a[n::2]))) | p03767 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(1, 2*n, 2):
ans += a[i]
print(ans) | n = int(eval(input()))
A = sorted(list(map(int, input().split())), reverse=True)
#print(A)
ans = 0
for i in range(1, 2*n+1, 2):
ans += A[i]
print(ans) | p03767 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
ans = 0
for i in range(N):
A.pop(-1)
ans += A.pop(-1)
A.pop(0)
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
A.reverse()
ans = 0
for i in range(1,2*N + 1,2):
ans += A[i]
print(ans) | p03767 |
# Reference: https://note.nkmk.me/python-union-find/
class UnionFind:
# if x is root: self.parents[x] = -(the number of the group nodes)
# else: self.parents[x] = the parent of x
def __init__(self, n):
self.n = n
self.parents = [-1] * n
# return the parent of x
def find(sel... | # Reference: https://note.nkmk.me/python-union-find/
class UnionFind:
# if x is root: self.parents[x] = -(the number of the group nodes)
# else: self.parents[x] = the parent of x
def __init__(self, n):
self.n = n
self.parents = [-1] * n
# return the parent of x
def find(sel... | p02540 |
class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*(n+1)
self.rank=[0]*(n+1)
def FindRoot(self,x):
if self.root[x]<0:
return x
else:
self.root[x]=self.FindRoot(self.root[x])
return self.root[x]
def Unite(self,x,y):
x=self.FindRoot(x)
y=self.... | class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*(n+1)
self.rank=[0]*(n+1)
def FindRoot(self,x):
if self.root[x]<0:
return x
else:
self.root[x]=self.FindRoot(self.root[x])
return self.root[x]
def Unite(self,x,y):
x=self.FindRoot(x)
y=self.... | p02540 |
import sys
class UnionFind:
def __init__(self, n):
self._n = n
self._parents = [-1] * n
def find(self, x):
if self._parents[x] < 0:
return x
else:
self._parents[x] = self.find(self._parents[x])
return self._parents[x]
def... | import sys
class UnionFind:
def __init__(self, n):
self._n = n
self._parents = [-1] * n
def find(self, x):
if self._parents[x] < 0:
return x
else:
self._parents[x] = self.find(self._parents[x])
return self._parents[x]
def... | p02540 |
import sys
class UnionFind:
def __init__(self, n):
self._n = n
self._parents = [-1] * n
def find(self, x):
if self._parents[x] < 0:
return x
else:
self._parents[x] = self.find(self._parents[x])
return self._parents[x]
def... | import sys
class UnionFind:
def __init__(self, n):
self._n = n
self._parents = [-1] * n
def find(self, x):
if self._parents[x] < 0:
return x
else:
self._parents[x] = self.find(self._parents[x])
return self._parents[x]
def... | p02540 |
n = int(input())
xy = []
idx = [None]*n
ys = [None]*n
ans = [None]*n
accumx = [None]*n
accumn = [None]*n
for i in range(n):
x, y = map(int, input().split())
idx[x-1] = i
ys[x-1] = y-1
accumx[-1] = ys[-1]
for i in range(n-2, -1, -1):
accumx[i] = max(accumx[i+1], ys[i])
accumn[0] = ys[0]
fo... | n = int(input())
xy = []
idx = [None]*n
ys = [None]*n
ans = [None]*n
accumn = [None]*n
for i in range(n):
x, y = map(int, input().split())
idx[x-1] = i
ys[x-1] = y-1
accumn[0] = ys[0]
for i in range(1, n):
accumn[i] = min(accumn[i-1], ys[i])
b = 0
for i in range(n):
if accumn[i]==n-... | p02540 |
import sys
input = sys.stdin.readline
class Unionfind:
def __init__(self,n):
self.uf = [-1]*n
def find(self,x):
if self.uf[x] < 0:
return x
else:
self.uf[x] = self.find(self.uf[x])
return self.uf[x]
def same(self,x,y):
... | import sys
input = sys.stdin.readline
class Unionfind:
def __init__(self,n):
self.uf = [-1]*n
def find(self,x):
if self.uf[x] < 0:
return x
else:
self.uf[x] = self.find(self.uf[x])
return self.uf[x]
def same(self,x,y):
... | p02540 |
class Union:
def __init__(s, num):
s.T = [-1 for i in range(num)]
def root(s, x):
if s.T[x] < 0: return x, -s.T[x]
t, k = s.root(s.T[x])
s.T[x] = t
return t, k
def merge(s, x, y):
an, am = s.root(x)
bn, bm = s.root(y)
if an == bn: return False
if am < bm: an, ... | class Union:
def __init__(s, num):
s.T = [-1 for i in range(num)]
def root(s, x):
if s.T[x] < 0: return x, -s.T[x]
t, k = s.root(s.T[x])
s.T[x] = t
return t, k
def merge(s, x, y):
an, am = s.root(x)
bn, bm = s.root(y)
if an == bn: return False
if am < bm: an, ... | p02540 |
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
class Segtree:
def __init__(self, A, ide_ele, initialize = True, segf = max):
self.N = len(A)
... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
class Segtree:
def __init__(self, A, ide_ele, initialize = True, segf = max):
self.N = len(A)
... | p02540 |
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | p02540 |
import heapq
from collections import deque
def bfs(i, c):
color[i] = c
cnt[c] += 1
q = deque()
q.append(i)
while q:
j = q.popleft()
for k in G[j]:
if color[k] == -1:
color[k] = c
cnt[c] += 1
q.append(k)
r... | import heapq
from collections import deque
def bfs(i, c):
color[i] = c
cnt[c] += 1
q = deque()
q.append(i)
while q:
j = q.popleft()
for k in G[j]:
if color[k] == -1:
color[k] = c
cnt[c] += 1
q.append(k)
r... | p02540 |
import heapq
from collections import deque
def bfs(i, c):
color[i] = c
cnt[c] += 1
q = deque()
q.append(i)
while q:
j = q.popleft()
for k in G[j]:
if color[k] == -1:
color[k] = c
cnt[c] += 1
q.append(k)
r... | import heapq
from collections import deque
def bfs(i, c):
color[i] = c
cnt[c] += 1
q = deque()
q.append(i)
while q:
j = q.popleft()
for k in G[j]:
if color[k] == -1:
color[k] = c
cnt[c] += 1
q.append(k)
r... | p02540 |
import heapq
from collections import deque
def bfs(i, c):
color[i] = c
cnt[c] += 1
q = deque()
q.append(i)
while q:
j = q.popleft()
for k in G[j]:
if color[k] == -1:
color[k] = c
cnt[c] += 1
q.append(k)
r... | import heapq
from collections import deque
def bfs(i, c):
color[i] = c
cnt[c] += 1
q = deque()
q.append(i)
while q:
j = q.popleft()
for k in G[j]:
if color[k] == -1:
color[k] = c
cnt[c] += 1
q.append(k)
r... | p02540 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.