input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from math import ceil
L=[]
X=0
M=int(eval(input()))
L.append(M)
for i in range(4) :
A=int(eval(input()))
L.append(A)
if A%10 < M%10 and A%10!=0 :
M=A
L.remove(M)
for i in L :
X+=ceil(i/10)*10
print((X+M)) | L=[]
M=[0]
for i in range(5) :
A=int(eval(input()))
L.append(A)
if A%10!=0 :
M.append(10-A%10)
print((sum(L+M)-max(M))) | p03076 |
from math import ceil
ord = [int(eval(input())) for _ in range(5)]
max_wait = 0
max_idx = 0
for i in range(5):
cur = ceil(ord[i] / 10) * 10 - ord[i]
if max_wait < cur:
max_wait = cur
max_idx = i
ans = 0
for i in range(5):
if i != max_idx:
ans += ceil(ord[i] / 10) * 10
an... | ant = [int(eval(input())) for _ in range(5)]
minidx = 0
minval = 124
i = 0
for a in ant:
while 10 < a:
a %= 10
if a == 0:
a = 10
if a < minval:
minidx = i
minval = a
i += 1
ans = 0
for i in range(5):
if i == minidx:
continue
fa... | p03076 |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime,random
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
aa = [int(eval(input())) for _ i... | from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())
order = [int(eval(input())) for _ in range... | p03076 |
"""
author : halo2halo
date : 9, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
DISH = list(map(int, read().split()))
temp = 10
im = 0
for num, i in enumerate(DISH):
if i % 10 < t... | """
author : halo2halo
date : 9, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
DISH = [int(readline()) for _ in range(5)]
Ceiled = [(i + 9) // 10 * 10 for i in DISH]
div = [y - x for x, y ... | p03076 |
import math
import sys
ts = [int(i) for i in sys.stdin.read().split('\n') if i != '']
ds = [int(math.ceil(t / 10) * 10) - t for t in ts]
m = max(ds)
ds.remove(m)
ans = sum(ts) + sum(ds)
print(ans)
| import math
import sys
ts = [int(i) for i in sys.stdin.read().strip().split('\n')]
ds = [int(math.ceil(t / 10) * 10) - t for t in ts]
ans = sum(ts) + sum(ds) - max(ds)
print(ans)
| p03076 |
a = [[int(eval(input())), 0]for i in range(5)]
for i in range(5):
if a[i][0] % 10 == 0:
a[i][1] = 9
else:
a[i][1] = a[i][0] % 10
a = sorted(a, key=lambda x: x[1], reverse=True)
b = 0
for i in range(5):
if i == 4:
b += a[i][0]
else:
b += (a[i][0] + 9) // 10 * 1... | a = []
for i in range(5):
b = int(eval(input()))
a.append([(b+9) % 10, b])
a = sorted(a, reverse=True)
c = 0
for i in range(4):
c += (a[i][1] + 9) // 10 * 10
print((c + a[4][1]))
| p03076 |
import itertools
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
ls = [A,B,C,D,E]
ls2 = []
for i in itertools.permutations(ls, 5):
ls2.append(list(i))
minimum = 10**9+7
for i in range(120):
ls3 = ls2[i]
now = 0
for j in range(5):... | import itertools
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
ls = [A,B,C,D,E]
ls2 = []
for i in itertools.permutations(ls,5):
ls2.append(list(i))
minimum = 10**5
for i in ls2:
now = 0
for j in range(5):
if j == 0:
now ... | p03076 |
A = 0
B = []
B.append(0)
for i in range(5):
I = int(eval(input()))
A += I
T = I % 10
if T != 0:
B.append(10 - T)
print((A + sum(B) - max(B)))
| import math
A = [int(eval(input())) for _ in range(5)]
B = 10
ans = 0
for i in range(5):
if A[i] % 10 < B and A[i]%10 > 0:
B = A[i] % 10
ans = -10+B
for j in A:
ans += math.ceil(j/10)*10
print(ans)
| p03076 |
import itertools
import math
import fractions
import functools
import copy
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
original = [a,b,c,d,e]
sum = 0
minimum = 10
index = 0
for i in range(len(original)):
if original[i] % 10 !=... | def main():
# s = int(input())
# n, k = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
total = 0
li = [a, b, c, d, ... | p03076 |
import math
al = []
for _ in range(5):
al.append(int(eval(input())))
tmp = 11
log = -1
for idx,a in enumerate(al):
point = a % 10
if point == 0:
point = 10
if tmp > point:
tmp = point
log = idx
ans = 0
for idx, a in enumerate(al):
if idx != log:
... | ans = 0
def ceil(a, b):
return a // b + (a % b > 0)
big = 0
for _ in range(5):
a = int(eval(input()))
ans += ceil(a, 10) * 10
if a % 10 != 0:
big = max(big, 10-(a%10))
print((ans-big))
| p03076 |
import math
Z = [int(eval(input())) for _ in range(5)]
ans = 0
r = 0
for z in Z:
if z%10 != 0:
r = max(10 - z%10, r)
ans += math.ceil(z/10) * 10
print((ans - r)) | Z = [int(eval(input())) for _ in range(5)]
ans = 0
r = 0
for z in Z:
time = (z+9) // 10 * 10
r = max(r, time - z)
ans += time
print((ans - r)) | p03076 |
import itertools
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
ans = 10**18
for v in itertools.permutations([a, b, c, d, e], 5):
m = 0
for i in range(len(v)):
m += v[i]
if i == len(v)-1:
break
... | import itertools
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
l = sorted([a, b, c, d, e], key=lambda x: x % 10)
ans = 0
flag = False
for i in range(len(l)):
if l[i] % 10 == 0:
ans += l[i]
elif flag == False:
a... | p03076 |
a = []
for i in range(5):
b = int(eval(input()))
c = b % 10 if b % 10 != 0 else 9
d = (b + 10 - 1) // 10 * 10
a.append([b, c, d])
a = sorted(a, key=lambda x: x[1], reverse=True)
total = 0
for i in range(len(a)):
total += a[i][2]
print((total - a[i][2] + a[i][0]))
| import itertools
a = [int(eval(input())) for _ in range(5)]
mi = 10 ** 10
for i in itertools.permutations(a, 5):
t = 0
for j, v in enumerate(i):
if j == 4:
t += v
else:
t += ((v + 9) // 10 * 10)
mi = min(t, mi)
print(mi)
| p03076 |
import math
# 定義
minutes = [int(eval(input())) for i in range(5)]
m = [math.ceil(minutes[k] / 10) * 10 for k in range(5)]
# 最後に注文するやつを決める
last = min((minutes[l] - 1) % 10 for l in range(5))
last += 1
# 出力
print((m[0] + m[1] + m[2] + m[3] + m[4] + last - 10))
| from math import ceil
A = [int(eval(input())) for _ in range(5)]
mmin = 10
ans = 0
for ai in A:
ans += 10*ceil(ai/10)
if ai%10 != 0:
mmin = min(mmin, ai%10)
if mmin%10 == 0:
print(ans)
else:
print((ans - 10 + mmin))
| p03076 |
import math
S = []
L = []
for i in range(5):
D = int(eval(input()))
T = math.ceil(D/10)
S.append(T)
L.append(T-D/10)
print((int((sum(S) - max(L))*10))) | import math
s = []
l = []
for i in range(5):
d = int(eval(input()))
t = math.ceil(d / 10)
s.append(t)
l.append(t-d/10)
print((int((sum(s) - max(l))*10))) | p03076 |
ans = 0
b = 0
for i in range(5):
a = int(eval(input()))
ans += -(-a//10)*10
b = max(b, (10-a%10)%10)
ans -= b
print(ans) | ans = 0
b = 0
for i in range(5):
a = int(eval(input()))
ans += -(-a//10)*10
b = max(b, -a%10)
ans -= b
print(ans) | p03076 |
from itertools import permutations
from math import ceil
times = list(int(eval(input())) for _ in range(5))
orders = list(permutations(times, 5))
minimum = sum(ceil(time/10)*10 for time in times)
for order in orders:
cnt = order[0]
for i in range(1, 5):
cnt += ceil(order[i]/10)*10
minim... | from itertools import permutations
from math import ceil
times = list(int(eval(input())) for _ in range(5))
orders = list(permutations(times, 5))
minimum = sum(ceil(time/10)*10 for time in times)
for order in orders:
total = order[0]
for i in range(1, 5):
total += ceil(order[i]/10)*10
m... | p03076 |
a = [int(eval(input())) for i in range(5)]
if all(n%10==0 for n in a):
b = sum([((k//10)+1)*10 for k in a if k%10 != 0])
b += sum([l for l in a if l%10 ==0])
print(b)
else:
A = min([j%10 for j in a if j%10 != 0])
b = sum([((k//10)+1)*10 for k in a if k%10 != 0])
b += sum([l for l in a if... | l = [int(eval(input())) for _ in range(5)]
l.sort(key=lambda x: 10 if x%10==0 else x%10)
l = l[::-1]
ans = 0
for i in range(5):
if i == 4 or l[i]%10==0:
ans += l[i]
else:
ans += ((l[i]//10)+1)*10
print(ans) | p03076 |
import itertools
import math
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
tlist = [A, B, C, D, E]
l = itertools.permutations(tlist, 5)
t = []
count = 0
for i in l:
count = 0
for j in range(5):
if j != 4 :
count +=... | import math
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
tlist = [A, B, C, D, E]
mod_list = [A % 10, B % 10, C % 10, D % 10, E % 10]
mod_list_2 = mod_list[:]
count = 0
already = 0
while 0 in mod_list_2:
mod_list_2.pop(mod_list_2.i... | p03076 |
from itertools import permutations
cook_times = [int(eval(input())) for _ in range(5)]
ans = float('inf')
for ts in permutations(cook_times):
total = 0
for t in ts[:-1]:
if t % 10 == 0:
total += t
else:
total += (t + 9) // 10 * 10
ans = min(ans, total + ... | cook_times = sorted([int(eval(input())) for _ in range(5)], key=lambda x: (x + 9) // 10 * 10 - x)
ans = 0
for t in cook_times[:-1]:
ans += (t + 9) // 10 * 10
print((ans + cook_times[-1])) | p03076 |
def stupid():
from itertools import permutations
ret = float('inf')
for p in permutations(a):
time = 0
for dish in p:
time += (10 - (time % 10)) % 10
time += dish
ret = min(ret, time)
return ret
a = [int(eval(input())) for _ in range(5)]
pri... | def stupid(a):
from itertools import permutations
ret = float('inf')
for p in permutations(a):
time = 0
for dish in p:
time += (10 - (time % 10)) % 10
time += dish
ret = min(ret, time)
return ret
def fast(a):
temp = a[::]
temp.sort(ke... | p03076 |
from functools import reduce
l = [int(eval(input())) for _ in range(5)]
r = [10 if i % 10 == 0 else i % 10 for i in l]
m = [i if i % 10 == 0 else i // 10 * 10 + 10 for i in l]
print((sum(m) + min(r) - 10)) | l = [int(eval(input())) for _ in range(5)]
r = [10 if i % 10 == 0 else i % 10 for i in l]
m = [i if i % 10 == 0 else i // 10 * 10 + 10 for i in l]
print((sum(m) + min(r) - 10)) | p03076 |
import math
a = [input().rstrip() for _ in range(5)]
a = sorted(a, key=lambda x: x[-1], reverse=True)
while True:
m = a.pop()
if m[-1] == '0':
a.insert(0, m)
else:
break
s = sum([math.ceil(int(n) / 10) * 10 for n in a])
s += int(m)
print(s)
| s = 0
mod = 0
for _ in range(5):
i = int(eval(input()))
m = i % 10
if m != 0:
if mod == 0:
mod = m
else:
mod = min(mod, m)
s += (i // 10 + 1) * 10
else:
s += i
if mod != 0:
s = s - 10 + mod
print(s)
| p03076 |
A = [int(eval(input())) for i in range(5)]
B = [(10 - a % 10) % 10 for a in A]
print((sum(A) + sum(B) - max(B)))
| A = [int(eval(input())) for i in range(5)]
# A = [101, 86, 119, 108, 57]
# A = [29, 20, 7, 35, 120]
# A = [123, 123, 123, 123, 123]
B = [(10-a % 10) % 10 for a in A]
C = [-(-a//10)*10 for a in A]
print((sum(C)-max(B)))
| p03076 |
"""ABC091 2D Plane 2N Points diff:
"""
N = int(eval(input()))
ab = [tuple(map(int, input().split())) for _ in range(N)]
cd = [tuple(map(int, input().split())) for _ in range(N)]
ans_x = 0
cd.sort(key=lambda x: x[0])
ab.sort(key=lambda x: x[1], reverse=True)
ab_used = [0]*N
for i, (c, d) in enumerate(cd):... | """ABC091 2D Plane 2N Points diff:
"""
N = int(eval(input()))
ab = [tuple(map(int, input().split())) for _ in range(N)]
cd = [tuple(map(int, input().split())) for _ in range(N)]
ans_x = 0
cd.sort(key=lambda x: x[0])
ab.sort(key=lambda x: x[1], reverse=True)
ab_used = [0]*N
for i, (c, d) in enumerate(cd):... | p03409 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | p03409 |
n = int(eval(input()))
red = [list(map(int,input().split())) for _ in range(n)]
blue = [list(map(int,input().split())) for _ in range(n)]
red_count = []
import copy
for i in range(n):
index_list = []
for j in range(n):
if blue[j][0]>red[i][0] and blue[j][1]>red[i][1]:
index_list.append(j)
re... | n = int(eval(input()))
lired = [list(map(int,input().split())) for _ in range(n)]
liblue = [list(map(int,input().split())) for _ in range(n)]
lired = sorted(lired,key = lambda x:-x[1])
liblue = sorted(liblue,key = lambda x:x[0])
li = list(range(n))
count = 0
for i in range(n):
for j in li:
if lired[i][... | p03409 |
n = int(eval(input()))
red = [list(map(int,input().split())) for _ in range(n)]
blue = [list(map(int,input().split())) for _ in range(n)]
blue.sort(key=lambda x:(x[0],x[1]))
check = [False]*n
for i in range(n):
a = -1
c = -1
for j in range(n):
if check[j]:continue
if blue[i][0] > r... | n = int(eval(input()))
red = [list(map(int,input().split())) for _ in range(n)]
red.sort(key=lambda x:(x[1]))
blue = sorted(list(map(int,input().split())) for _ in range(n))
blue.sort(key=lambda x:(x[0],x[1]))
seen = [False]*n
for i in range(n):
check = -1
for j in range(n):
if seen[j]:continue... | p03409 |
import heapq
N = int(eval(input()))
red = []
for i in range(N):
x,y = list(map(int, input().split()))
heapq.heappush(red, (-y, x))
blue = []
for i in range(N):
x,y = list(map(int, input().split()))
heapq.heappush(blue, (x,y))
ans = 0
for i in range(N):
tmp = []
bx,by = heapq... |
N = int(eval(input()))
r = []
for _ in range(N):
x,y = list(map(int, input().split()))
r.append((-y,x))
b = []
for _ in range(N):
x,y = list(map(int, input().split()))
b.append((x,y))
r.sort()
b.sort()
ans = 0
for my,x in r:
for j in range(len(b)):
if -my < b[j][... | p03409 |
n=int(eval(input()))
ab=[list(map(int, input().split())) for _ in range(n)]
cd=[list(map(int, input().split())) for _ in range(n)]
#ab = sorted(ab, key=lambda x:x[1]*(-1))
ab.sort(key=lambda x: x[1],reverse=True)
cd=sorted(cd)
cnt=0
for i in range(n):#ab
for j in range(len(cd)):#cd
if ab[i][0... | n=int(eval(input()))
ab=[list(map(int, input().split())) for _ in range(n)]
cd=[list(map(int, input().split())) for _ in range(n)]
#ab = sorted(ab, key=lambda x:x[1]*(-1))
ab.sort(key=lambda x: x[0],reverse=True)
ab.sort(key=lambda x: x[1],reverse=True)
cd=sorted(cd)
cnt=0
for i in range(n):#ab
for j... | p03409 |
import sys
sys.setrecursionlimit(10000)
def resolve():
N = int(eval(input()))
Reds = [list(map(int, input().split(" "))) for i in range(N)]
Blues = [list(map(int, input().split(" "))) for i in range(N)]
maxpairs = 0
BluePerms = permutations(Blues)
for blues in BluePerms:
npairs ... | import sys
import itertools
sys.setrecursionlimit(10000)
def resolve():
N = int(eval(input()))
Reds = [list(map(int, input().split(" "))) for i in range(N)]
Blues = [list(map(int, input().split(" "))) for i in range(N)]
maxpairs = 0
for blues in itertools.permutations(Blues, N):
npa... | p03409 |
n = int(eval(input()))
r=[list(map(int, input().split())) for i in range(n)]
b=[list(map(int, input().split())) for i in range(n)]
p=[]
v=[0]*n
def dfs(li,m,num):
global ma
if num==n:
ma=max(ma,m)
return
for i in p[num]:
if li[i]==0:
li[i]=1
... | n = int(eval(input()))
r=[list(map(int, input().split())) for i in range(n)]
b=[list(map(int, input().split())) for i in range(n)]
b.sort(key=lambda x:x[0])
p=[]
r_used=[0]*n
for i in range(n):
q=[]
for j in range(n):
if r[j][0]<b[i][0] and r[j][1]<b[i][1]:
q.append([r[j][1],j])
... | p03409 |
import itertools
N = int(eval(input()))
red = [tuple(map(int, input().split())) for i in range(N)]
blue = [tuple(map(int, input().split())) for i in range(N)]
res = 0
for _blue in itertools.permutations(blue):
sum_pair = len([1 for (a, b), (c, d) in zip(red, _blue) if a < c and b < d])
res = max(res,... |
N = int(eval(input()))
red = [list(map(int, input().split())) for i in range(N)]
blue = [list(map(int, input().split())) for i in range(N)]
red.sort(key=lambda x:x[1], reverse=True)
blue.sort()
c = 0
for bx, by in blue:
for i, (rx, ry) in enumerate(red):
if rx<bx and ry<by:
c += 1... | p03409 |
import sys
def resolve():
readline = sys.stdin.readline # 1行だけ文字列にする
N = int(readline())
NN = 2 * N + 1
# 青色はx座標をlistのindex,y座標をlistのvalueとして入力，赤は逆
red = [[] for _ in [0] * NN]
blue = [[] for _ in [0] * NN]
for _ in [0] * N:
a, b = list(map(int, readline().split()... | def resolve():
import sys
readline = sys.stdin.readline # 1行だけ文字列にする
N = int(readline())
# 赤，青点をx,y座標の2次元リストとして入力
red = [list(map(int, readline().split())) for _ in [0] * N]
blue = [list(map(int, readline().split())) for _ in [0] * N]
# 赤はy座標で降順ソート，青はx座標で昇順ソート
red.... | p03409 |
# AtCoder Beginner Contest 091
# C - 2D Plane 2N Points
# https://atcoder.jp/contests/abc091/tasks/arc092_a
N = int(eval(input()))
A = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
A.sort(key=lambda x: x[0])
B.sort(key=lambda x: x[0])
used = ... | N = int(eval(input()))
A = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
A.sort()
B.sort()
cnt = 0
for u, v in B:
maxy = -1
maxi = -1
for i, (x, y) in enumerate(A):
if x >= u:
break
if y >= v:
... | p03409 |
N=int(eval(input()))
AB=list()
for i in range(N):
AB.append(list(map(int,input().split())))
CD=list()
for i in range(N):
CD.append(list(map(int,input().split())))
import itertools
ans=0
for v in itertools.permutations(CD):
s=0
for x,y in zip(AB,v):
if x[0]<y[0] and x[1]<y[1]:
... | n=int(eval(input()))
ab=list()
cd=list()
for i in range(n):
ab.append(list(map(int,input().split())))
for j in range(n):
cd.append(list(map(int,input().split())))
cd.sort(key=lambda x:x[0])
AB=[[-1,-1]]*n
for i in range(n):
S=[x for x in ab if x[0]<cd[i][0] and x[1]<cd[i][1]]
S.sort(key=lambd... | p03409 |
n = int(eval(input()))
red_point_list = [[int(j) for j in input().split()] for i in range(n)]
blue_point_list = [[int(j) for j in input().split()] for i in range(n)]
px = red_point_list[0][0]
py = red_point_list[0][1]
tmp = []
for i, p in enumerate(blue_point_list):
if px < p[0] and py < p[1]:
n... | n = int(eval(input()))
red_point_list = [[int(j) for j in input().split()] for i in range(n)]
blue_point_list = [[int(j) for j in input().split()] for i in range(n)]
count = 0
for c, d in sorted(blue_point_list, key=lambda x: x[0]):
tmp_index = 0
tmp_y = -1
for i, p in enumerate(red_point_list):
... | p03409 |
#入力
N = int(eval(input()))
red_x = []
red_y = []
for i in range(N):
a = list(map(int, input().split()))
red_x += [a]
red_y += [a[::-1]]
red_x.sort(reverse = False)
red_y.sort(reverse = False)
#print (red_x, red_y)
blue_x = []
blue_y = []
for i in range(N):
a = list(map(int, input()... | #入力
N = int(eval(input()))
#赤の座標を取得-->並び替えて左ほど小さくする
red = []
for i in range(N):
a = list(map(int, input().split()))
red += [a]
red.sort(reverse = False)
#青の座標を取得-->並び替えて左ほど小さくする
blue = []
for i in range(N):
a = list(map(int, input().split()))
blue += [a]
blue.sort(reverse = False)
#b... | p03409 |
N = int(eval(input()))
red = [list(map(int, input().split())) for _ in range(N)]
blue = [list(map(int, input().split())) for _ in range(N)]
# x座標でソート
blue.sort(key=lambda x: x[1])
# y座標で降順ソート
red.sort(reverse=True)
# print(blue)
# print(red)
# blue_list = [0] * N
red_list = [0] * N
for b in range... | N = int(eval(input()))
red = [list(map(int, input().split())) for _ in range(N)]
blue = [list(map(int, input().split())) for _ in range(N)]
# 青をx座標で昇順ソート
blue.sort(key=lambda x: x[1])
# 赤をy座標で降順ソート
red.sort(key=lambda x: x[0], reverse=True)
red_list = [0] * N
for b in range(N):
for r in range(N):
... | p03409 |
def f(blue, red, ans):
c = 0
for i, b in enumerate(blue):
for j, r in enumerate(red):
if b[0] >= r[0] and b[1] >= r[1]:
blue.pop(i)
red.pop(j)
c = max(c, f(blue, red, ans + 1))
blue.insert(i, b)
red.inse... | def main():
N = int(eval(input()))
red = sorted(
[list(map(int, input().split())) for _ in range(N)],
key=lambda x: x[1],
reverse=True
)
blue = sorted(
[list(map(int, input().split())) for _ in range(N)],
key=lambda x: x[0]
)
ans = 0
for b ... | p03409 |
from collections import deque
class Dinic:
def __init__(self, N0, N1):
self.N0 = N0
self.N1 = N1
self.N = N = 2+N0+N1
self.G = [[] for i in range(N)]
for i in range(N0):
forward = [2+i, 1, None]
forward[2] = backward = [0, 0, forward]
... | from collections import deque
class Dinic:
def __init__(self, N0, N1):
self.N0 = N0
self.N1 = N1
self.N = N = 2+N0+N1
self.G = [[] for i in range(N)]
for i in range(N0):
forward = [2+i, 1, None]
forward[2] = backward = [0, 0, forward]
... | p03409 |
# https://atcoder.jp/contests/abc091/tasks/arc092_a
import sys
input = sys.stdin.readline
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
"""
:param to: 終点ノード
:param cap: 残された容量
:param rev: 遂になる逆向きのエッ... | class Dinic:
def __init__(self, len_X, len_Y):
self.len_X, self.len_Y = len_X, len_Y
self.edges = [[] for _ in range(len_X)]
self.matched = [-1] * len_Y
self.visited = set()
def add_edge(self, x, y):
self.edges[x].append(y)
def dfs(self, x):
"""
... | p03409 |
import os
import sys
from collections import deque
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N = int(sys.stdin.readline())
AB = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
CD = ... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
class Dinic:
def __init__(self, graph=None, residual=None):
"""
:param list of (list of (int, int)) graph: (to, c... | p03409 |
N = int(eval(input()))
R = [tuple([int(x) for x in input().split()]) for _ in range(N)]
B = [tuple([int(x) for x in input().split()]) for _ in range(N)]
xl = [set() for _ in range(2 * N + 1)]
yl = [set() for _ in range(2 * N + 1)]
for b in B:
x, y = b
for i in range(x):
xl[i].add(b)
for... | N = int(eval(input()))
R = [[int(x) for x in input().split()] for _ in range(N)]
B = [[int(x) for x in input().split()] for _ in range(N)]
import operator
R.sort(key=operator.itemgetter(1), reverse=True)
B.sort()
ans = 0
for b in B:
xb, yb = b
for r in R:
xr, yr = r
if xr < xb and... | p03409 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import deque
class Dinic(object):
def __init__(self,n):
self.__n=n
self.__E=[[] for _ in range(n)]
self.__level=None
self.__iter=None
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import deque
class HopcroftKarp:
def __init__(self, N0, N1):
self.N0 = N0
self.N1 = N1
self.N = N = 2+N0+N1
self.G = [[] for i in range(... | p03409 |
from operator import itemgetter
n = int(eval(input()))
r = [tuple(map(int, input().split())) for i in range(n)]
b = [tuple(map(int, input().split())) for i in range(n)]
r = sorted(r, key=itemgetter(1), reverse=True)
b.sort()
ans = 0
pair = [False]*n
for i in range(n):
for j in range(n):
if... | from operator import itemgetter
n = int(eval(input()))
r = [tuple(map(int, input().split())) for i in range(n)]
b = [tuple(map(int, input().split())) for i in range(n)]
r = sorted(r, key=itemgetter(1), reverse=True)
b.sort()
pair = [False]*n
for i in range(n):
for j in range(n):
if b[i][0] ... | p03409 |
N = int(eval(input()))
R = [(-1, -1)] * N
for n in range(N):
x, y = list(map(int, input().split()))
R[n] = (x, y)
B = [(-1, -1)] * N
for n in range(N):
x, y = list(map(int, input().split()))
B[n] = (x, y)
B = sorted(B)
R = sorted(R, reverse=True)
ans = 0
for i, b in enumerate(B):
tm... | N = int(eval(input()))
R = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
R = sorted(R)
B = sorted(B)
res = 0
for bx, by in B:
idx = -1
tmp = -1
for i, (rx, ry) in enumerate(R):
if rx < bx and ry < by:
if ry >= t... | p03409 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache
#############
# Constants #
#############
M... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache
#############
# Constants #
#############
M... | p03409 |
n = int(eval(input()))
AB = list(list(map(int,input().split())) for _ in range(n))
CD = list(list(map(int,input().split())) for _ in range(n))
CD.sort() # sort x in ascending order
AB.sort(key=lambda z: z[1], reverse=True) # sort x in descending order
dim_b = [[] for _ in range(n)]
for b in range(n):
for... | n = int(eval(input()))
AB = list(list(map(int,input().split())) for _ in range(n))
CD = list(list(map(int,input().split())) for _ in range(n))
CD.sort() # sort x in ascending order
AB.sort(key=lambda z: z[1], reverse=True) # sort x in descending order
dim_b = [[] for _ in range(n)]
for b in range(n):
for... | p03409 |
N=int(eval(input()))
ab=[list(map(int,input().split())) for _ in range(N)]
cd=[list(map(int,input().split())) for _ in range(N)]
ab=[x[0]+x[1]*1j for x in ab]
cd=[x[0]+x[1]*1j for x in cd]
def comp(a,b):
if a.real<b.real and a.imag<b.imag:
return True
else:
return False
abd=dict()
cdd=dict()
f... | N=int(eval(input()))
ab=sorted([list(map(int,input().split())) for _ in [0]*N],key=lambda x:x[1],reverse=True)
cd=sorted([list(map(int,input().split())) for _ in [0]*N],key=lambda x:x[0])
cnt=0
for i in range(N):
for a in ab:
if a[0]<cd[i][0] and a[1]<cd[i][1]:
ab.remove(a)
c... | p03409 |
def sort_x(a):
min = 100000
min_num = 0
n = len(a)
A=[[0, 0] for i in range(n)]
left_list = [1 for i in range(n)]
for j in range(n):
for i in range(n):
if left_list[i]==1 and int(a[i][0]) < min:
min = int(a[i][0])
min_num = i
... | def sort_x(a):
min = 100000
min_num = 0
n = len(a)
A=[[0, 0] for i in range(n)]
left_list = [1 for i in range(n)]
for j in range(n):
for i in range(n):
if left_list[i]==1 and int(a[i][0]) < min:
min = int(a[i][0])
min_num = i
... | p03409 |
casen=0
if casen==0:
a=[]
c=[]
n=int(eval(input()))
for i in range(n):
ai,bi=list(map(int,input().split()))
a.append([ai,bi])
for i in range(n):
ci,di=list(map(int,input().split()))
c.append([ci,di])
elif casen==1:
n=3
a=[[2,0],[3,1],[1,3]]
c... | casen=0
if casen==0:
a=[]
c=[]
n=int(eval(input()))
for i in range(n):
ai,bi=list(map(int,input().split()))
a.append([ai,bi])
for i in range(n):
ci,di=list(map(int,input().split()))
c.append([ci,di])
elif casen==1:
n=3
a=[[2,0],[3,1],[1,3]]
c... | p03409 |
casen=0
if casen==0:
a=[]
c=[]
n=int(eval(input()))
for i in range(n):
ai,bi=list(map(int,input().split()))
a.append([ai,bi])
for i in range(n):
ci,di=list(map(int,input().split()))
c.append([ci,di])
elif casen==1:
n=3
a=[[2,0],[3,1],[1,3]]
c... |
n=int(eval(input()))
r=[[0]*3 for i in range(n)]
b=[[0]*2 for i in range(n)]
for i in range(n):
r[i]=list(map(int,input().split()))+[0]
for i in range(n):
b[i]=list(map(int,input().split()))
r.sort(key=lambda x:x[1],reverse=True)
b.sort()
psum=0
for i in range(n):
for ii in range(n):
# ... | p03409 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
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... | p03409 |
# -*- coding: utf-8 -*-
"""
参考：https://www.hamayanhamayan.com/entry/2018/03/18/085108
http://vartkw.hatenablog.com/entry/2016/12/02/002703
https://ikatakos.com/pot/programming_algorithm/graph_theory/maximum_flow
・二部最大マッチング
・最大流アルゴリズム(Dinic法)
・まだ理解不十分な点はあると思うけど、初めて見た時よりは見慣れた。
"""
from collections impo... | # -*- coding: utf-8 -*-
"""
参考：https://ikatakos.com/pot/programming_algorithm/graph_theory/bipartite_matching
・二部最大マッチング
"""
class BipartiteMatching:
"""
XとYの二部グラフの最大マッチング X={0,1,2,...|X|-1} Y={0,1,2,...,|Y|-1}
edges[x]: xとつながるYの頂点のset
match1[x]: xとマッチングされたYの頂点
match2[y]: yとマッチングされたXの頂... | p03409 |
from collections import defaultdict
n=int(eval(input()))
ab=[[int(i) for i in input().split()] for j in range(n)]
cd=[[int(i) for i in input().split()] for j in range(n)]
ab.sort()
cd.sort()
ans=0
for i in cd:
check=-1
pair=[-1,-1]
for j in ab:
if j[0]>i[0]:
... | import bisect
n=int(eval(input()))
ab=[[int(i) for i in input().split()] for j in range(n)]
cd=[[int(i) for i in input().split()] for j in range(n)]
ab.sort()
cd.sort()
ans=0
for c,d in cd:
now_y=-1
check=False
for a,b in ab:
if a>=c:
break
if b<d and b>now_y:
... | p03409 |
n = int(eval(input()))
red_list = []
blue_list = []
for i in range(n):
x, y = list(map(int, input().split()))
red_list.append([x, y])
for i in range(n):
x, y = list(map(int, input().split()))
blue_list.append([x, y])
#2. search
#2.1 red:descending order in y
red_list.sort(key=lambda x:(x[... | N = int(eval(input()))
R = []
B = []
for i in range(N):
R.append(list(map(int, input().split())))
for i in range(N):
B.append(list(map(int, input().split())))
R.sort(key=lambda x:x[0], reverse=True)
B.sort(key=lambda x:x[1], reverse=False)
ans = 0
for r in R:
for b in B:
if r[0]<b[0]... | p03409 |
from itertools import permutations
N = int(eval(input()))
rn = [list(map(int,input().split())) for _ in range(N)]
bn = [list(map(int,input().split())) for _ in range(N)]
ans = 0
for p in permutations(list(range(N))):
ans = max(ans, sum([1 if rn[i][0] < bn[p[i]][0] and rn[i][1] < bn[p[i]][1] else 0 for i in rang... | N = int(eval(input()))
rn = [[True]+list(map(int,input().split())) for _ in range(N)]
bn = sorted([list(map(int,input().split())) for _ in range(N)])
rn.sort(key=lambda x: -x[2])
for bp in bn:
bx,by = bp
for rp in rn:
f,rx,ry = rp
if f and rx<bx and ry<by:
rp[0] = False
break
print((s... | p03409 |
n = int(eval(input()))
red = []
for i in range(n):
red.append(list(map(int, input().split())))
blue = []
for i in range(n):
blue.append(list(map(int, input().split())))
red_sort = sorted(red, key=lambda x: x[1], reverse=True)
blue_sort = sorted(blue)
count = 0
flag = [0]*n
for b in blue_sort:
fo... | n = int(eval(input()))
red = []
blue = []
for i in range(n):
a,b = list(map(int,input().split()))
red.append((a,b))
for i in range(n):
c,d = list(map(int,input().split()))
blue.append((c,d))
red_sorted = sorted(red,reverse=True)
blue_sorted = sorted(blue,key=lambda x: x[1])
count = ... | p03409 |
N = int(eval(input()))
X = []
Y = []
for i in range(N):
a, b = list(map(int, input().split()))
X.append((a, b))
for i in range(N):
c, d = list(map(int, input().split()))
Y.append((c, d))
X.sort(key=lambda x: -x[1])
Y.sort(key=lambda x: x[0])
B = []
result = 0
for x in range(N):
red... |
N = int(eval(input()))
RED = []
BLUE = []
for i in range(N):
a, b = list(map(int, input().split()))
RED.append((a, b))
for i in range(N):
a, b = list(map(int, input().split()))
BLUE.append((a, b))
BLUE.sort(key=lambda x: x[0])
RED.sort(key=lambda x: -x[1])
red_selected = set()
blue_s... | p03409 |
n = int(eval(input()))
red_li = [list(map(int, input().split())) for _ in range(n)]
blue_li = [list(map(int, input().split())) for _ in range(n)]
ans = 0
red_li.sort(reverse = True, key = lambda x : (x[0], x[1]))
blue_li.sort( key = lambda x : (x[0], x[1]))
def count(red, blue):
used_red = []
used_b... | n = int(eval(input()))
red_li = [list(map(int, input().split())) for _ in range(n)]
blue_li = [list(map(int, input().split())) for _ in range(n)]
ans = 0
red_li.sort(reverse = True, key = lambda x : (x[0], x[1]))
blue_li.sort( key = lambda x : (x[0], x[1]))
def count(red, blue):
used_red = []
used_b... | p03409 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03409 |
# coding:utf-8
import sys
import random
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
de... | # coding:utf-8
import sys
import random
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
de... | p03409 |
N = int(eval(input()))
AB = [list(map(int,input().split())) for i in range(N)]
CD = [list(map(int,input().split())) for i in range(N)]
AB.sort()
CD.sort()
#print(AB)
#print(CD)
ans = 0
for i in range(N-1,-1,-1):
ab = AB[i]
li = []
for cd in CD:
if ab[0] < cd[0] and ab[1] < cd[1]:... | N = int(eval(input()))
AB = [tuple(map(int,input().split())) for i in range(N)]
CD = [tuple(map(int,input().split())) for i in range(N)]
AB.sort(key=lambda x: x[0])
CD.sort(key=lambda x: x[0])
ans = 0
for c,d in CD:
idx = 10000
for i in range(N):
if AB[i] == -1:
continue
i... | p03409 |
N = int(eval(input()))
ps = [tuple(map(int,input().split())) for i in range(2*N)]
es = [[] for i in range(2*N)]
for ri,(rx,ry) in enumerate(ps[:N]):
for bi,(bx,by) in enumerate(ps[N:]):
bi += N
if rx < bx and ry < by:
es[ri].append(bi)
es[bi].append(ri)
used = [F... | N = int(eval(input()))
src = [tuple(map(int,input().split())) for i in range(2*N)]
es = [[] for i in range(2*N)]
for i,(x1,y1) in enumerate(src[:N]):
for j,(x2,y2) in enumerate(src[N:]):
if x1 < x2 and y1 < y2:
es[i].append(j+N)
es[j+N].append(i)
used = [False] * (2*N)
mat... | p03409 |
from operator import itemgetter
def main():
N = int(eval(input()))
ab = [tuple(int(j) for j in input().split()) for i in range(N)]
cd = [tuple(int(j) for j in input().split()) for i in range(N)]
# y 降順
ab.sort(key=itemgetter(1), reverse=True)
# x 昇順
cd.sort(key=itemgetter(0))
... | from operator import itemgetter
def main():
N = int(eval(input()))
ab = [tuple(int(j) for j in input().split()) for i in range(N)]
cd = [tuple(int(j) for j in input().split()) for i in range(N)]
# y 降順
ab.sort(key=itemgetter(1), reverse=True)
# x 昇順
cd.sort()
# ペアになった赤
... | p03409 |
def main():
N = int(eval(input()))
ab = [tuple(int(j) for j in input().split()) for i in range(N)]
cd = [tuple(int(j) for j in input().split()) for i in range(N)]
# y 降順
ab.sort(key=lambda x:x[1], reverse=True)
# x 昇順
cd.sort()
# ペアになった赤
done = [False] * N
for bx, by in... | def main():
N = int(eval(input()))
ab = [tuple(int(j) for j in input().split()) for i in range(N)]
cd = [tuple(int(j) for j in input().split()) for i in range(N)]
# y 降順
ab.sort(key=lambda x:x[1], reverse=True)
# x 昇順
cd.sort()
ans = 0
for bx, by in cd:
for rx, ry i... | p03409 |
from operator import itemgetter
def main():
N = int(eval(input()))
ab = [tuple(int(j) for j in input().split()) for i in range(N)]
cd = [tuple(int(j) for j in input().split()) for i in range(N)]
# y 降順
ab.sort(key=itemgetter(1), reverse=True)
# x 昇順
cd.sort()
ans = 0
fo... | def main():
N = int(eval(input()))
ab = [tuple(int(j) for j in input().split()) for i in range(N)]
cd = [tuple(int(j) for j in input().split()) for i in range(N)]
# x 降順
ab.sort(key=lambda x: x[0], reverse=True)
# y 昇順
cd.sort(key=lambda x: x[1])
ans = 0
for bx, by in cd:
... | p03409 |
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
b = [list(map(int, input().split())) for i in range(n)]
a.sort(reverse=True)
b.sort()
idxb = list()
for i in range(n):
idx = -1
maxy = -1
for j in range(n):
if not j in idxb:
if a[j][0] < b[i][0] ... | n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
b = [list(map(int, input().split())) for i in range(n)]
a.sort(reverse=True)
b.sort()
idxb = list()
for i in range(n):
idx = -1
miny = 1e+9
for j in range(n):
if not j in idxb:
if a[i][0] < b[j][0... | p03409 |
n = int(eval(input()))
reds = []
for i in range(n):
reds.append(tuple(map(int, input().split())))
reds = sorted(reds, key=lambda tup: tup[1], reverse=True)
#print(reds)
blues = []
for i in range(n):
blues.append(tuple(map(int, input().split())))
#print(blues)
blues = sorted(blues, key=lambda tup: tu... | n = int(eval(input()))
reds = []
for i in range(n):
reds.append(tuple(map(int, input().split())))
reds = sorted(reds, key=lambda tup: tup[1], reverse=True)
blues = []
for i in range(n):
blues.append(tuple(map(int, input().split())))
blues = sorted(blues, key=lambda tup: tup[0])
count = 0
for b in ... | p03409 |
aa=[]
a=int(eval(input()))
for i in range(0,a):
aa.append(input().split(" "))
bb=[]
for j in range(0,a):
bb.append(input().split(" "))
pattern=[]
zentai=[]
chouhuku=0
for m in range(0,a**a):
for n in range(0,a):
pattern.append(m//(a**n)%a)
for w in range(0,a):
if pattern.count(... | #解答確認後
n=int(eval(input()))
aa=[[int(i) for i in input().split()] for i in range(n)]
bb=[[int(i) for i in input().split()] for i in range(n)]
#print(aa)
#print(bb)
import operator
aa.sort(key=operator.itemgetter(1),reverse=True)
bb.sort()
#print(aa)
#print(bb)
answer=0
for b in bb:
xb,yb=b
f... | p03409 |
N = int(eval(input()))
Blue = []
Red = []
for i in range(N) :
a,b = list(map(int,input().split()))
Red.append([a,b])
for i in range(N) :
c,d = list(map(int,input().split()))
Blue.append([c,d])
Blue = sorted(Blue)
Red = list(reversed(sorted(Red,key=lambda x: x[1])))
ans = 0
for i in range... | N = int(eval(input()))
red = [list(map(int,input().split())) for i in range(N)]
blue = [list(map(int,input().split())) for i in range(N)]
red = sorted(red, key=lambda x: x[1], reverse=True)
blue = sorted(blue, key=lambda x: x[0], reverse=False)
flg = [0 for i in range(N)]
ans = 0
for i in range(N) :
... | p03409 |
N = int(eval(input()))
red = []
blue = []
for i in range(N):
in1, in2 = list(map(int,input().split()))
red.append([in1, in2])
for i in range(N):
in1, in2 = list(map(int,input().split()))
blue.append([in1, in2])
red = sorted(red, key=lambda x: x[0])[::-1]
ans = 0
INF = 10 ** 9 + 7
for i... | N = int(eval(input()))
red = sorted([list(map(int,input().split())) for i in range(N)], key=lambda x: x[0])[::-1]
blue = [list(map(int,input().split())) for i in range(N)]
ans = 0
for i in range(N):
min_ = 10 ** 9 + 7
ind = -1
for j in range(N):
if red[i][0] <= blue[j][0] and red[i][1] <= bl... | p03409 |
N = int(eval(input()))
red = sorted([list(map(int,input().split())) for _ in range(N)], key = lambda x:-x[1])
blue = sorted([list(map(int,input().split())) for _ in range(N)])
ans = 0
for b in blue:
for r in red:
if(r[0] < b[0] and r[1] < b[1]):
ans += 1
red.remove(r)
break
print(ans... | N = int(eval(input()))
AB = sorted([list(map(int,input().split())) for _ in range(N)], key = lambda x: -x[1])
CD = sorted([list(map(int,input().split())) for _ in range(N)])
cnt = 0
for c, d in CD:
for a, b in AB:
if(a < c and b < d):
cnt += 1
AB.remove([a,b])
break
print(cnt) | p03409 |
def ans():
N = int(eval(input()))
AB = sorted([list(map(int,input().split())) for _ in range(N)], key = lambda x: -x[1])
CD = sorted([list(map(int,input().split())) for _ in range(N)])
cnt = 0
for c, d in CD:
for a, b in AB:
if(a < c and b < d):
cnt += 1
AB.remove([a,b])
... | N = int(eval(input()))
AB = sorted([list(map(int,input().split())) for _ in range(N)], key = lambda x: -x[1])
CD = sorted([list(map(int,input().split())) for _ in range(N)])
cnt = 0
for c, d in CD:
for a, b in AB:
if(a < c and b < d):
cnt += 1
AB.remove([a, b])
break
print(cnt) | p03409 |
from operator import itemgetter
n=int(eval(input()))
A=[tuple(map(int,input().split())) for i in range(n)]
B=[tuple(map(int,input().split())) for j in range(n)]
A.sort()
B.sort()
count=0
for i in range(n):
box=[A[j] for j in range(len(A)) if (A[j][0]<B[i][0]) and (A[j][1]<B[i][1])]
#条件を満たす一番大きいものから消してい... | N=int(eval(input()))
AB=sorted([list(map(int,input().split())) for _ in range(N)])
CD=sorted([list(map(int,input().split())) for _ in range(N)], key=lambda x:x[1])
cnt=0
for a,b in AB[::-1]:
for i,j in enumerate(CD):
c,d=j
if a<c and b<d:
cnt +=1
del CD[i]
... | p03409 |
#https://abc010.contest.atcoder.jp/tasks/abc010_4
#http://kmjp.hatenablog.jp/entry/2014/06/08/0900
#よくわからない最大フロー用のdfs---------------------------------
num=201 #今回のnの最大値100*2+1
def dfs(cur):
global vis
global EE
vis[cur] = 1
if cur==num:
return 1
for i in range(num+1):
if vis[i]==0 and EE[c... | #https://abc010.contest.atcoder.jp/tasks/abc010_4
#http://kmjp.hatenablog.jp/entry/2014/06/08/0900
#よくわからない最大フロー用のdfs---------------------------------
num=201 #今回のnの最大値100*2+1
def dfs(cur):
global vis
global EE
vis[cur] = 1
if cur==num:
return 1
for i in range(num+1):
if vis[i]==0 and EE[c... | p03409 |
import itertools
n = int(eval(input()))
red = [tuple(map(int, input().split())) for _ in range(n)]
blue = [tuple(map(int, input().split())) for _ in range(n)]
agg = [list() for _ in range(n)]
for i in range(n):
c, d = blue[i]
for j in range(n):
a, b = red[j]
if c > a and d > b:
... | n = int(eval(input()))
red = sorted([tuple(map(int, input().split())) for _ in range(n)])
blue = sorted([tuple(map(int, input().split())) for _ in range(n)])
res = 0
for bx, by in blue:
tmp_max = -1
tmp_cnt = None
for i, (rx, ry) in enumerate(red):
if bx <= rx:
break
... | p03409 |
def c_2D_plane_2N_points(N, R, B):
red = sorted(R) # 赤い点の座標(x座標で昇順ソート)
blue = sorted(B) # 青い点の座標(x座標で昇順ソート)
ans = 0
for c, d in blue:
# 注目している青い点より"左下"にある赤い点の座標のリスト
r = [z for z in red if z[0] < c and z[1] < d]
if r: # 左下に赤い点があれば
r.sort(key=lambda x: x[1]) ... | def c_2d_plane_2n_points():
N = int(eval(input()))
R = [tuple([int(i) for i in input().split()]) for j in range(N)]
B = [tuple([int(i) for i in input().split()]) for j in range(N)]
red = sorted(R, key=lambda x: x[1], reverse=True) # 赤い点の座標 (y 座標で降順ソート)
blue = sorted(B) # 青い点の座標 (x 座標で昇順ソート)... | p03409 |
n = int(eval(input()))
ab = sorted([[int(i) for i in input().split()] for i in range(n)], reverse = True, key = lambda x: x[1])
cd = sorted([[int(i) for i in input().split()] for i in range(n)])
count = 0
for i in range(n):
for j in range(len(cd)):
if ab[i][0] < cd[j][0] and ab[i][1] < cd[j][1]:
... | n = int(eval(input()))
AB = sorted([[int(i) for i in input().split()] for i in range(n)], reverse = True)
CD = sorted([[int(i) for i in input().split()] for i in range(n)], key = lambda x: x[1])
cnt = 0
for a, b in AB:
for cd in CD:
if a < cd[0] and b < cd[1]:
cnt += 1
CD.r... | p03409 |
n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
q = int(eval(input()))
m = list(map(int, input().split()))
def f(A, s, res):
if res[0]:
return
if s == 0:
res[0] = True
return
for i, a in enumerate(A):
if a > s:
break
f(A[i+1:], s-a, res)
for mi in... | n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
sumA = sum(A)
q = int(eval(input()))
m = list(map(int, input().split()))
def f(A, s, res):
if res[0]:
return
if s == 0:
res[0] = True
return
for i, a in enumerate(A):
if a > s:
break
f(A[i+1:], s-a, re... | p02271 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
m = list(map(int,input().split()))
def solve(i, m_i):
if m_i == 0:
return True
if i >= n:
return False
res = solve(i + 1, m_i) or solve(i + 1, m_i - a[i])
return res
for m_tmp in m:
if so... | n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
m = list(map(int,input().split()))
def solve(i, m_i):
if m_i == 0:
return True
if i >= n:
return False
res = solve(i + 1, m_i) or solve(i + 1, m_i - a[i])
return res
for m_tmp in m:
if su... | p02271 |
# -*- coding: utf_8 -*-
from itertools import repeat
from itertools import combinations
def rec(s, i, total, m):
if total == m:
return 1
if len(s) == i or total > m:
return 0
return rec(s, i + 1, total, m) + rec(s, i + 1, total + s[i], m)
def loop(s, m):
for i in rang... | # -*- coding: utf_8 -*-
from itertools import repeat
from itertools import combinations
def rec(s, i, total, m):
if total == m:
return 1
if len(s) == i or total > m:
return 0
return rec(s, i + 1, total, m) + rec(s, i + 1, total + s[i], m)
def makeCache(s):
cache = {... | p02271 |
n = eval(input())
A = list(map( int , input().split() ))
q = eval(input())
mi = list(map( int , input().split() ))
def solve(i, m):
if m == 0:
return True
elif i >= n:
return False
else:
res = solve( i+1 , m ) | solve( i+1 , m-A[i] )
return res
for m in mi:
if solve( 0 , m ): pr... | n = eval(input())
A = list(map( int , input().split() ))
q = eval(input())
mi = list(map( int , input().split() ))
def solve(i, m):
if m == 0:
return True
elif i >= n or m > sum(A):
return False
res = solve( i+1 , m ) or solve( i+1 , m-A[i] )
return res
for m in mi:
if solve( 0 , m )... | p02271 |
# coding=utf-8
def solve_recursively(candidate_numbers, target_number):
"""classify if the target number is represented a summation of elements of candidate_numbers
Args:
candidate_numbers: candidate_numbers
target_number: target_number
Returns:
if target number is rep... | # -*- coding: utf-8 -*-
def check_solvable_recursively(number, is_solvable, candidate_numbers):
"""exhaustively search representable as summation of numbers in candidate_numbers
Args:
number: representable number
is_solvable: is solvable list
candidate_numbers: candidate numb... | p02271 |
# -*- coding: utf-8 -*-
def check_solvable_recursively(number, is_solvable, candidate_numbers):
"""exhaustively search representable as summation of numbers in candidate_numbers
Args:
number: representable number
is_solvable: is solvable list
candidate_numbers: candidate numb... | # -*- coding: utf-8 -*-
def check_solvable_recursively(number, is_solvable, candidate_numbers):
"""exhaustively search representable as summation of numbers in candidate_numbers
Args:
number: representable number
is_solvable: is solvable list
candidate_numbers: candidate numb... | p02271 |
def solve(p, t):
if p >= len(A): return False
if t == A[p]: return True
if t <= 0: return False
#print("({}, {})".format(p, t))
if solve(p + 1, t):
return True
else:
return solve(p + 1, t - A[p])
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = li... | memo = {}
def solve(p, t):
key = "{}:{}".format(p, t)
if key in memo: return memo[key]
if p >= len(A): return False
if t == A[p]: return True
if t <= 0: return False
#print("({}, {})".format(p, t))
if solve(p + 1, t):
memo["{}:{}".format(p + 1, t)] = True
return True
else:
memo... | p02271 |
def solve(i, m):
if m == 0:
return True
if i == n:
return False
return solve(i+1, m) or solve(i+1, m-A[i])
if __name__ == "__main__":
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = list(map(int, input().split()))
for m... | import itertools
def rev(x):
return sumA - x
if __name__ == "__main__":
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = list(map(int, input().split()))
sumA = sum(A)
all_sum = set()
for i in range((n+1)//2):
com = set(itert... | p02271 |
n1 = int(input())
A = list(map(int, input().split()))
n2 = int(input())
q = list(map(int, input().split()))
B = []
n = n1
ans = list("no" for i in range(n2))
for i in range(2 ** n):
C0 = []
B = list(map(int, format(i, "b").zfill(n)))[::-1]
C0 = [ x*y for x, y in zip(A, B)]
C = sum(C0)
... | n1 = int(input())
A = list(map(int, input().split()))
n2 = int(input())
q = list(map(int, input().split()))
B = []
C = []
n = n1
ans = list("no" for i in range(n2))
for i in range(2 ** n):
C0 = []
B = list(map(int, format(i, "b").zfill(n)))[::-1]
C0 = [ x*y for x, y in zip(A, B)]
C.appen... | p02271 |
n = int(eval(input()))
A = list(map(int, input().split() ))
q = int(eval(input()))
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
elif i >= n:
return False
else:
return solve(i+1, m) or solve(i+1, m - A[i])
for num in m:
print(('... | # used DP
n = int(eval(input()))
A = list(map(int, input().split() ))
q = int(eval(input()))
M = list(map(int, input().split()))
dp = [[None]*(max(M)+1) for i in range(n)]
# we refer to the list dp only when i = 0, 1, ... , n-1 and m >= 0.
def solve(i, m):
if i >= n:
return m == 0
... | p02271 |
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return 1
if i >= n:
return 0
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for j in range(0, q):
if solve(0, m[j]... | n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return 1
if i >= n or m > sum(A):
return 0
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for j in range(0, q):
if... | p02271 |
# -*- coding: utf-8 -*-
def func(i, m):
if m == 0:
return True
elif m < 0 or i >= len(A):
return False
else:
if func(i+1, m-A[i]):
return True
if func(i+1, m):
return True
return False
n = int(input())
A = list(map(int, input().spl... | # -*- coding: utf-8 -*-
n = int(input())
A = {0}
for c in input().split():
for i in A.copy():
A.add(i+int(c))
q = int(input())
M = list(map(int, input().split()))
for m in M:
if m in A:
print("yes")
else:
print("no") | p02271 |
class Tree:
class Node:
def __init__(self, n, left, right):
self.left = left
self.right = right
self.n = n
if left is not None:
lt = {t + n for t in left.totals}
else:
lt = set()
if right is not... | def create_sums(ns):
if len(ns) == 0:
return set()
s = create_sums(ns[1:])
return {e + ns[0] for e in s} | s | {ns[0]}
def run_set():
_ = int(eval(input())) # flake8: noqa
ns = [int(i) for i in input().split()]
sums = create_sums(ns)
_ = int(eval(input())) # flake8... | p02271 |
def solve(i, m):
if m == 0: return True
if i == n or m < 0:
return False
r1 = solve(i + 1, m)
r2 = solve(i + 1, m - A[i])
return r1 or r2
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for i in M:
print("y... | def solve(i, m):
if m == 0: return True
if i < n and min(A[i:]) <= m <= sum(A[i:]):
r1 = solve(i + 1, m-A[i])
if r1: return r1
r2 = solve(i + 1, m)
if r2: return r2
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().s... | p02271 |
import sys
import itertools
def can_be_composed(n, m, A):
for i in range(1, n + 1):
combination_list = list(itertools.combinations(A, i))
for l in combination_list:
if m == sum(l):
return True
return False
#fin = open("test.txt", "r")
fin = sys.stdin
n = int(fin.readline())
A = list(map... | import sys
import itertools
def can_be_composed(n, min_list, max_list, m, A):
for i in range(1, n + 1):
if m < min_list[i - 1]:
continue
if m > max_list[i - 1]:
continue
combination_list = list(itertools.combinations(A, i))
for l in combination_list:
if m == sum(l):
return True
... | p02271 |
n=int(eval(input()))
A=list(map(int,input().split()))
r=set()
def f(s,k):
if k>=0:
global r
r.add(s)
f(s+A[k-1],k-1)
f(s,k-1)
f(0,n)
eval(input())
for e in map(int,input().split()):print((['no','yes'][e in r]))
| eval(input())
s = {0}
for a in map(int,input().split()):
for b in list(s):
s.add(a+b)
eval(input())
for e in map(int,input().split()):
print(('yes' if e in s else 'no'))
| p02271 |
# -*- coding: utf-8 -*-
"""
全探索
・再帰で作る
"""
N = int(eval(input()))
aN = list(map(int, input().split()))
Q = int(eval(input()))
mQ = list(map(int, input().split()))
def dfs(cur, depth, ans):
# 終了条件
if cur == ans:
return True
# 全探索
for i in range(depth, N):
if dfs(cur+a... | # -*- coding: utf-8 -*-
"""
全探索
・再帰で作る
・2^20でTLEするからメモ化した
"""
N = int(eval(input()))
aN = list(map(int, input().split()))
Q = int(eval(input()))
mQ = list(map(int, input().split()))
def dfs(cur, depth, ans):
# 終了条件
if cur == ans:
return True
# memo[現在位置]に数値curがあれば、そこから先はやっても同じだから... | p02271 |
num_n = eval(input())
N = list(map(int, input().split()))
num_m = eval(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= num_n or m > sum(M):
return False
res = solve(i + 1, m) or solve(i + 1,m - N[i])
return res
for m in M:
if... | num_n = int(eval(input()))
n = list(map(int, input().split()))
num_m = int(eval(input()))
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= num_n or m > sum(n):
return False
res = solve(i + 1, m) or solve(i + 1,m - n[i])
return res
for k ... | p02271 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§?????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§?????... | p02271 |
# -*- coding: utf-8 -*-
"""
Created on Wed May 2 21:28:06 2018
ALDS1_5a
@author: maezawa
"""
import itertools as itr
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = list(map(int, input().split()))
sum_array = []
for r in range(1,n+1):
for comb in itr.combinati... | # -*- coding: utf-8 -*-
"""
Created on Wed May 2 21:28:06 2018
ALDS1_5a_r1
@author: maezawa
"""
import itertools as itr
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = list(map(int, input().split()))
sum_array = []
for r in range(1,n+1):
for comb in itr.comb... | p02271 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.