input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
import itertools
n = int(eval(input()))
seq = (100,101,102,103,104,105)
exists = False
for l in list(itertools.combinations_with_replacement(seq,n//100)):
if sum(l) == n:
print('1')
exists =True
break
if not exists:
print('0')
|
n = int(eval(input()))
#n = 417
x=n//100
y=n%100
#print(x)
#print(y)
seq = (1,2,3,4,5)
exists = False
for i in seq:
sum = 0
z = y%i
#print( 'z = ' + str(z))
if z == 0:
sum = y//i
#print(sum)
#print('a')
else:
sum = (y//i) + 1
#print(sum)
if sum <= x:
print('1')
exists =True
break
if not exists:
print('0')
|
p02843
|
import sys
sys.setrecursionlimit(10 ** 6)
p=[100,101,102,103,104,105]
x=int(eval(input()))
def dfs(sum):
ans=False
if sum>=x:
return sum==x
for i in p:
ans|=dfs(sum+i)
return ans
if x>=2000:
print((1))
elif dfs(0):
print((1))
else:
print((0))
|
x=int(eval(input()))
p=[100,101,102,103,104,105]
ans=[False]*2001
ans[0]=True
for i in range(2000):
if ans[i]:
for j in p:
if i+j>2000:
continue
else:
ans[i+j]=True
if x>2000:
print((1))
elif ans[x]:
print((1))
else:
print((0))
|
p02843
|
amount = 10 ** 6
x = int(eval(input()))
cnt = 0
can_buy = 0
xx = x % 100
if x >= 100:
for i in range(xx + 1):
for j in range(xx//2 + 1):
for k in range(xx // 3 + 1):
for l in range(xx // 4 + 1):
for m in range(xx // 5 + 1):
if i + 2 * j + 3 * k + 4 * l + 5 * m == xx:
rest = x - 101 * i - 102 * j - 103 * k - 104 * l - 105 * m
cnt = rest // 100
if rest >= 0 and cnt <= amount:
can_buy = 1
break
print(can_buy)
|
x = int(eval(input()))
n = x // 100
can_buy = 0
while n > 0:
if 100 * n <= x <= 105 * n:
can_buy = 1
break
else:
n -= 1
print(can_buy)
|
p02843
|
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
x = int(readline())
c = x // 100
x %= 100
print((1 if 0 <= x <= 5 * c else 0))
if __name__ == '__main__':
solve()
|
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
x = int(input().rstrip('\n'))
d, m = divmod(x, 100)
print((1 if 0 <= m <= d * 5 else 0))
if __name__ == '__main__':
solve()
|
p02843
|
X = int(eval(input()))
for a in range(X//100+1):
for b in range(X//101+1):
for c in range(X//102+1):
for d in range(X//103+1):
for e in range(X//104+1):
for f in range(X//105+1):
if 100*a + 101*b +102*c + 103*d + 104*e + 105*f == X:
print((1))
exit()
print((0))
|
X = int(eval(input()))
# とりあえず 100 で構成しようとして、余剰分を 100 を置換することで構成できないか調べる
q, r = X//100, X%100
if r <= 5 * q:
print((1))
else:
print((0))
|
p02843
|
import itertools
x = int(eval(input()))
l = [0,1,2,3,4,5]
k = x%100
n = x//100
ans = '0'
if n*5>=k:
c = list(itertools.combinations_with_replacement(l,n))
for i in c:
if sum(i)==k:
ans = '1'
break
print(ans)
|
import itertools
x = int(eval(input()))
k = x%100
n = x//100
ans = 0
if n*5>=k and n!=0:
ans = 1
print(ans)
|
p02843
|
def solve():
X = int(eval(input()))
if X < 100:
return 0
upper1 = X // 100
for p1 in range(0, 100 * upper1 + 1, 100):
rest1 = X - p1
if rest1 == 0:
return 1
upper2 = rest1 // 101
for p2 in range(0, 101 * upper2 + 1, 101):
rest2 = rest1 - p2
if rest2 == 0:
return 1
upper3 = rest2 // 102
for p3 in range(0, 102 * upper3 + 1, 102):
rest3 = rest2 - p3
if rest3 == 0:
return 1
upper4 = rest3 // 103
for p4 in range(0, 103 * upper4 + 1, 103):
rest4 = rest3 - p4
if rest4 == 0:
return 1
upper5 = rest4 // 104
for p5 in range(0, 104 * upper5 + 1, 104):
rest5 = rest4 - p5
if rest5 == 0:
return 1
upper6 = rest5 // 105
for p6 in range(0, 105 * upper6 + 1, 105):
rest6 = rest5 - p6
if rest6 == 0:
return 1
else:
return 0
print((solve()))
|
X = int(eval(input()))
if X >= 2000:
print((1))
else:
for n in range(1, 20):
if 100 * n <= X <= 105 * n:
print((1))
break
else:
print((0))
|
p02843
|
import itertools
X=int(eval(input()))
ans=0
if (X%100==0)or(X%101==0)or(X%102==0)or(X%103==0)or(X%104==0)or(X%105==0):
print((str(1)))
else:
for i0,i1,i2,i3,i4,i5 in itertools.product(
list(range(int(X//100))),
list(range(int(X//101))),
list(range(int(X//102))),
list(range(int(X//103))),
list(range(int(X//104))),
list(range(int(X//105)))):
if (i0*100+i1*101+i2*102+i3*103+i4*104+i5*105)==X:
ans=1
break
if ans==1:
print((str(1)))
else:
print((str(0)))
|
import sys
X=int(eval(input()))
for c in range(X):
if (100*c<=X) and (105*c>=X):
print((1))
sys.exit()
print((0))
|
p02843
|
X = int(eval(input()))
N = X//100
def get_change(pay, N):
if N >= 0:
for n in range(6):
if pay%(100+n) == 0:
print((1))
exit(0)
if pay > 100+n:
get_change(pay-100-n, N-1)
return 2
res = get_change(X, N)
if res == 2:
print((0))
|
X = int(eval(input()))
N = X//100
pay = X-N*100
if pay/5 > N:
print((0))
else:
print((1))
|
p02843
|
X = [0] * 101010
X[0] = 1
for i in range(100, 101010):
for j in range(100, 106):
if X[i-j]:
X[i] = 1
print((X[int(eval(input()))]))
|
A = 7175816845464090776455207507270117755723765735430536804658747273399161802972634276448409301356909248005606116656073561929444931323143190717332175076262060295351620527202705615498306139275508555689509950694997345595674093104433020700546656778950085095645658807229584194806623377338842753774743833376783450229118372573460572454731223569400078753907185233376010906274531347459925723690095854183385568140762360863180004465626012327328449425540345922055914421850333689171725134946657507151835356233535112180627200151906292121106447641907908790376379132422532166122413876168625333717615295123397246508335105
N = int(eval(input()))
print((1 if N >= 2000 else A>>N & 1))
|
p02843
|
import itertools as it
N=int(eval(input()))
S=[0,1,2,3,4,5]
for k in range(N//100):
for i in it.product(S,repeat=N//100):
if sum(i)==N%100:
print("1")
exit()
print("0")
|
import itertools as it
N=int(eval(input()))
S=[0,1,2,3,4,5]
for k in range(N//100):
for i in it.combinations_with_replacement(S,N//100):
if sum(i)==N%100:
print("1")
exit()
print("0")
|
p02843
|
X = int(eval(input()))
if X < 100:
print((0))
else:
item = [100, 101, 102, 103, 104, 105]
dp = [[False for _ in range(X//100+10)] for _ in range(X+10)]
dp[0][0] = True
dp[100][1] = True
dp[101][1] = True
dp[103][1] = True
dp[102][1] = True
dp[105][1] = True
for x in range(200, X+1):
for n in range(2, x//100+1):
for i in item:
if dp[x-i][n-1]:
dp[x][n] = True
if x == X:
break
if True in dp[X]:
print((1))
else:
print((0))
|
X = int(eval(input()))
dp = [False for _ in range(X+1)]
dp[0] = True
for x in range(X+1):
if x > 99:
item = [100, 101, 102, 103, 104, 105]
for i in item:
if dp[x-i]:
dp[x] = True
if dp[X]:
print((1))
else:
print((0))
|
p02843
|
s=str(eval(input()))
if int(s) < 100:
print((0))
else:
x = int(s[-2:])
a,b = divmod(x,5)
k = a + (1 if b else 0)
if k * 100 <= int(s) - x:
print((1))
else:
print((0))
|
s=int(eval(input()))
print((int((s%100+4)//5*100<=s)))
|
p02843
|
X = int(eval(input()))
C = 1000000
output = []
for c in range(C):
if (c*100) <= X <= (c*105):
output.append(1)
else:
output.append(0)
if max(output):
print("1")
else:
print("0")
|
def one_int():
return int(eval(input()))
N=one_int()
num=int(N/100)
amari = N % 100
if num*5 < amari:
print((0))
else:
print((1))
|
p02843
|
X = int(eval(input()))
if X < 100:
print((0))
exit()
def dfs(zan):
if zan <= 0:
if zan == 0:
print((1))
exit()
else:
return
dfs(zan - 100)
dfs(zan - 101)
dfs(zan - 102)
dfs(zan - 103)
dfs(zan - 104)
dfs(zan - 105)
dfs(X)
print((0))
|
X = int(eval(input()))
if X < 100:
print((0))
exit()
if X % 100 == 0:
print((1))
exit()
cnt = X // 100
zan = X % 100
if zan > cnt * 5:
print((0))
else:
print((1))
|
p02843
|
x = int(eval(input()))
dp = [0]*(x+105+1)
dp[100] = 1
dp[101] = 1
dp[102] = 1
dp[103] = 1
dp[104] = 1
dp[105] = 1
for i in range(100,x+1):
for j in range(100,106):
dp[i+j] = max(dp[i] , dp[i+j])
print((dp[x]))
|
x = int(eval(input()))
dp = [0]*(x + 105 + 1)
dp[100] = 1
dp[101] = 1
dp[102] = 1
dp[103] = 1
dp[104] = 1
dp[105] = 1
for i in range(100,x-105+100):
for j in range(100,106):
dp[i+j] = max(dp[i] , dp[i+j])
print((dp[x]))
|
p02843
|
from sys import stdin
from itertools import combinations_with_replacement
x = int(stdin.readline().rstrip())
li = [0,1,2,3,4,5]
kosuu = x//100
amari = x%100
lin = list(combinations_with_replacement(li, kosuu))
for i in lin:
if sum(i) == amari:
print((1))
exit()
print((0))
|
from sys import stdin
from itertools import combinations_with_replacement
x = int(stdin.readline().rstrip())
li = [0,1,2,3,4,5]
kosuu = x//100
amari = x%100
if amari > kosuu*5:
print((0))
else:
print((1))
|
p02843
|
X= int(eval(input()))
x=int(X/100)+1
for a in range(x):
cost0 = 0
cost0 += 100 * a
if cost0 > X:
break
if cost0 == X:
print((1))
exit()
for b in range(x):
cost1 = cost0 + 101 * b
if cost1 > X:
break
if cost1 == X:
print((1))
exit()
for c in range(x):
cost2 = cost1 + 102 * c
if cost2 > X:
break
if cost2 == X:
print((1))
exit()
for d in range(x):
cost3 = cost2 + 103 * d
if cost3 > X:
break
if cost3 == X:
print((1))
exit()
for e in range(x):
cost4 = cost3 + 104 * e
if cost4 > X:
break
if cost4 == X:
print((1))
exit()
for f in range(x):
cost5 = cost4 + 105 * f
if cost5 > X:
break
if cost5 == X:
print((1))
exit()
print((0))
|
X=int(eval(input()))
n=X//100
s=X-n*100
if s > 5*n:
print((0))
else:
print((1))
|
p02843
|
#!/usr/bin/env python3
x = int(eval(input()))
ok = False
def dfs(n, flg):
global ok
if flg:
return
if n == x:
ok = True
return
if n > x:
ok = False
return
dfs(n+100, ok)
dfs(n+101, ok)
dfs(n+102, ok)
dfs(n+103, ok)
dfs(n+104, ok)
dfs(n+105, ok)
dfs(0, False)
if ok: print((1))
else: print((0))
|
#!/usr/bin/env python
x = int(eval(input()))
n = x//100
for i in range(n+1):
tmp = x
tmp -= i*100
if 5*i >= tmp:
print((1))
exit()
print((0))
|
p02843
|
import math
x = y = 0
theta = 90
while True:
d, a = list(map(int, input().split(',')))
if d==a==0:
break
x += d * math.cos(theta * math.pi / 180)
y += d * math.sin(theta * math.pi / 180)
theta -= a
print((int(x)))
print((int(y)))
|
import math
x = y = 0
ang = 90
while True:
d, a = list(map(int, input().split(',')))
if d == a == 0:
break
rad = ang * math.pi / 180
x += d * math.cos(rad)
y += d * math.sin(rad)
ang -= a
print((int(x)))
print((int(y)))
|
p00016
|
import math
pi=3.14159265358979
def radians(x):
return 1.0*x/180*pi
x = 0
y = 0
theta = radians(90)
while True:
a, b = list(map(float, input().split(',')))
if a==0 and b==0: break
x += a * math.cos(theta)
y += a * math.sin(theta)
theta += radians(-b)
print(int(x))
print(int(y))
|
import math
pi=3.14159265358979
x = 0
y = 0
theta = math.radians(90)
while True:
a, b = list(map(float, input().split(',')))
if a==0 and b==0: break
x += a * math.cos(theta)
y += a * math.sin(theta)
theta += math.radians(-b)
print(int(x))
print(int(y))
|
p00016
|
while True:
N,M = list(map(int,input().strip().split(" ")))
if [N,M] == [0,0]:
break
D = 0 #目的地までの総距離
L = []
for i in range(N):
d,p = list(map(int,input().strip().split(" ")))
for j in range(d):
L.append(p)
D = D + d
L.sort()
S = 0 #Sが襲われる回数の期待値
for k in range(D-M):
S = S + L[k]
print(S)
|
while True:
N,M = list(map(int,input().strip().split(" ")))
if [N,M] == [0,0]:
break
L = []
S = 0
for i in range(N):
l = list(map(int,input().strip().split(" ")))
l.reverse()
L.append(l)
S = S + l[0]*l[1]
L.sort()
for j in range(0,N):
t = N-j-1
if M >= L[t][1]:
S = S - L[t][0]*L[t][1]
M = M - L[t][1]
elif 0 < M:
S = S - L[t][0]*M
M = M - L[t][1]
print(S)
|
p01144
|
x,y,z = list(map(int, input().split()))
a = []
a.append(x)
a.append(y)
a.append(z)
a.sort()
print((a[0]+a[1]))
|
x = list(map(int,input().split()))
x.sort()
print((x[0]+x[1]))
|
p03671
|
import math
a, b, c = list(map(int, input().split()))
print((min(a + b, b + c, c + a)))
|
import math
a = [int(i) for i in input().split()]
print((sum(a) - max(a)))
|
p03671
|
a = list(map(int,input().split()))
print((sum(a) - max(a)))
|
#!/usr/bin/env python3
a = list(map(int,input().split()))
print((sum(a)-max(a)))
|
p03671
|
a, b, c = sorted(map(int, input().split()))
print((a+b))
|
a,b,c=list(map(int,input().split()))
print((min(a+b,a+c,b+c)))
|
p03671
|
a,b,c=sorted(map(int,input().split()))
print((a+b))
|
l=list(map(int,input().split()))
print((sum(sorted(l)[:2])))
|
p03671
|
a, b, c = list(map(int, input().split()))
print((min(a+b, b+c, c+a)))
|
abc = list(map(int, input().split()))
print((sum(sorted(abc)[:2])))
|
p03671
|
i = sorted(list(map(int, input().split())))
print((i[0] + i[1]))
|
print((sum(sorted(list(map(int, input().split())))[:2])))
|
p03671
|
a, b, c = list(map(int, input().split(" ")))
print(("%d"%(a+b+c - max(max(a, b), c))))
|
a, b, c = list(map(int, input().split(" ")))
print((min(a+b, b+c, c+a)))
|
p03671
|
a, b, c = list(map(int,input().split()))
x = a + b
y = a + c
z = b + c
print((min(x,y,z)))
|
A, B, C = list(map(int,input().split()))
print((min(A+B, A+C, B+C)))
|
p03671
|
cart = [4,1,4,1,2,1,2,1]
while True:
try:
que = list(map(int, input().split()))
mx,mxcart = 0, "99999999"
for sp in range(8):
sm = 0
for num in range(8):
if cart[(sp+num)%8] <= que[num]:
sm += cart[(sp+num)%8]
else:
sm += que[num]
if sm > mx:
mx = sm
mxcart = "".join(map(str, cart[sp:]+cart[:sp]))
elif sm == mx:
acart = "".join(map(str, cart[sp:]+cart[:sp]))
if int(mxcart) > int(acart):
mxcart = acart
print(" ".join(map(str, mxcart)))
except:
break
|
c = [4,1,4,1,2,1,2,1]
while True:
try:
que = list(map(int, input().split()))
mx,mxc = 0, "99999999"
for sp in range(8):
sm = 0
for num in range(8):
sm += c[(sp+num)%8] if c[(sp+num)%8] <= que[num] else que[num]
if sm > mx:
mx = sm
mxc = "".join(map(str, c[sp:]+c[:sp]))
elif sm == mx:
ac = "".join(map(str, c[sp:]+c[:sp]))
if int(mxc) > int(ac):
mxc = ac
print(" ".join(map(str, mxc)))
except:
break
|
p00082
|
import sys
from collections import Counter
N = int(sys.stdin.readline())
D = list(map(int, sys.stdin.readline().split()))
M = int(sys.stdin.readline())
T = list(map(int, sys.stdin.readline().split()))
diffs = Counter(D)
problems = Counter(T)
for diff, count in list(problems.items()):
if diff not in diffs:
break
if diffs[diff] < count:
break
else:
print("YES")
sys.exit()
print("NO")
|
import sys
from collections import Counter
input = sys.stdin.readline
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
counter = Counter(D)
for t_i in T:
if t_i in counter and 0 < counter[t_i]:
counter[t_i] -= 1
else:
print("NO")
sys.exit()
print("YES")
|
p03578
|
import collections
n = int(eval(input()))
ln = list(map(int, input().split()))
m = int(eval(input()))
lm = list(map(int, input().split()))
c = collections.Counter(lm)
for i in list(c.keys()):
if ln.count(i) < c[i]:
print("NO")
exit()
print("YES")
|
import sys
from collections import Counter
N = int(eval(input()))
s1 = list(map(int,input().split()))
M = int(eval(input()))
s2 = list(map(int,input().split()))
c1 = Counter(s1)
c2 = Counter(s2)
for k,v in list(c2.items()):
if k in c1:
if v > c1[k]:
print('NO')
sys.exit()
else:
print('NO')
sys.exit()
print('YES')
|
p03578
|
import sys
from collections import Counter
N = int(eval(input()))
s1 = list(map(int,input().split()))
M = int(eval(input()))
s2 = list(map(int,input().split()))
c1 = Counter(s1)
c2 = Counter(s2)
for k,v in list(c2.items()):
if k in c1:
if v > c1[k]:
print('NO')
sys.exit()
else:
print('NO')
sys.exit()
print('YES')
|
import collections
n = int(eval(input()))
ln = list(map(int, input().split()))
m = int(eval(input()))
lm = list(map(int, input().split()))
c1 = collections.Counter(lm)
c2 = collections.Counter(ln)
for i in list(c1.keys()):
if c2[i] < c1[i]:
print("NO")
exit()
print("YES")
|
p03578
|
def resolve():
def main():
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
from collections import Counter
dd=Counter(d)
tt=Counter(t)
ddkey=list(dd.keys())
ddvalue=list(dd.values())
for x,y in list(tt.items()):
flag=True
if x in ddkey and ddvalue[ddkey.index(x)]>=y:
continue
else:
return 'NO'
return 'YES'
print((main()))
resolve()
|
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
from collections import Counter
dd=Counter(d)
tt=Counter(t)
for key,value in list(tt.items()):
if dd[key]<value:
return 'NO'
return 'YES'
print((main()))
resolve()
|
p03578
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
a=True
for i in t:
if i in d:
j=d.index(i)
d=d[:j]+d[j+1:]
else:
a=False
break
print(('YES' if a else 'NO'))
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
dd=dict()
td=dict()
for i in d:
if i in dd:
dd[i]+=1
else:
dd[i]=1
for i in t:
if i in td:
td[i]+=1
else:
td[i]=1
for i,j in list(td.items()):
if i not in dd:
print('NO')
exit()
elif dd[i]<j:
print('NO')
exit()
print('YES')
|
p03578
|
import math
import collections
import fractions
import itertools
def solve():
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
t = collections.Counter(t)
for i in t:
if t[i] > d.count(i):
print("NO")
break
else:
print("YES")
return 0
if __name__ == "__main__":
solve()
|
import math
import collections
import fractions
import itertools
def solve():
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
t = collections.Counter(t)
d = collections.Counter(d)
for i in t:
if t[i] > d[i]:
print("NO")
break
else:
print("YES")
return 0
if __name__ == "__main__":
solve()
|
p03578
|
from collections import Counter
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
d_c=Counter(d)
t_c=Counter(t)
for i in list(t_c.keys()):
if t_c[i]>d_c[i]:
print('NO')
exit()
print('YES')
|
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from collections import Counter
n=int(eval(input()))
d=lnii()
m=int(eval(input()))
t=lnii()
c=Counter(d)
for i in t:
if c[i]==0:
print('NO')
exit()
else:
c[i]-=1
print('YES')
|
p03578
|
def binarySearch(list_a, key):
left = 0
right = len(list_a)
while left < right:
mid = (left + right) // 2
if list_a[mid] == key:
return mid
break
elif key < list_a[mid]:
right = mid
else:
left = mid+1
else:
return "NOT_FOUND"
n = int(eval(input()))
list_d = list((list(map(int, input().split()))))
m = int(eval(input()))
list_t = list((list(map(int, input().split()))))
list_d.sort()
for number in list_t:
ind = binarySearch(list_d, number)
if ind != "NOT_FOUND":
del list_d[ind]
else:
print("NO")
break
else:
print("YES")
|
n = int(eval(input()))
list_d = list((list(map(int, input().split()))))
m = int(eval(input()))
list_t = list((list(map(int, input().split()))))
dict_d = {}
dict_t = {}
for number in set(list_d):
dict_d[number] = 0
for number in set(list_t):
dict_d[number] = 0
for number in list_d:
dict_d[number] += 1
for number in set(list_t):
dict_t[number] = 0
for number in list_t:
dict_t[number] += 1
for number,value in list(dict_t.items()):
if dict_d[number] < value:
print("NO")
break
else:
pass
else:
print("YES")
|
p03578
|
N=int(eval(input()))
D=list(map(int,input().split()))
M=int(eval(input()))
T=list(map(int,input().split()))
D.sort()
T.sort()
from collections import Counter
D=Counter(D)
dic_D={}
for i in D.most_common():
dic_D[i[0]]=i[1]
T=Counter(T)
ret = 'YES'
for i in T.most_common():
if i[0] in dic_D:
if dic_D[i[0]]<i[1]:
ret = 'NO'
break
else:
ret = 'NO'
break
print(ret)
|
N=int(eval(input()))
D=list(map(int,input().split()))
M=int(eval(input()))
T=list(map(int,input().split()))
from collections import Counter
D=Counter(D)
dic_D={}
for i in D.most_common():
dic_D[i[0]]=i[1]
T=Counter(T)
ret = 'YES'
for i in T.most_common():
if i[0] in dic_D:
if dic_D[i[0]]<i[1]:
ret = 'NO'
break
else:
ret = 'NO'
break
print(ret)
|
p03578
|
n = int(eval(input()))
d = input().split()
m = int(eval(input()))
t = input().split()
for x in t:
if x in d:
d.remove(x)
else:
print('NO')
exit()
print('YES')
|
n = int(eval(input()))
d = input().split()
m = int(eval(input()))
t = input().split()
d.sort()
t.sort()
a = 0
for x in t:
for i in range(a, n):
if d[i] > x:
print('NO')
exit()
if x == d[i]:
a = i+1
break
print('YES')
|
p03578
|
from collections import Counter
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
dc, tc = Counter(d), Counter(t)
ans = "YES"
for p in list(tc.keys()):
if tc[p] > dc[p]:
ans = "NO"
print(ans)
|
from collections import Counter
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
d = Counter(D)
t = Counter(T)
f = True
for df in list(t.keys()):
f &= (d[df] >= t[df])
print((["NO", "YES"][f]))
|
p03578
|
n = eval(input())
d = list(map(int, input().split()))
m = eval(input())
t = list(map(int, input().split()))
dic = {}
for i in d:
if i in list(dic.keys()):
dic[i] += 1
else:
dic[i] = 1
for i in t:
if i in list(dic.keys()):
dic[i] -= 1
if dic[i] == 0:
del(dic[i])
else:
print('NO')
exit()
print('YES')
|
def main():
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
d.sort()
t.sort()
x = -1
y = -1
while x < n and y < m-1:
x += 1
y += 1
while x < n and d[x] != t[y]:
x += 1
if x < n:
print("YES")
else:
print("NO")
if __name__ == "__main__":
main()
|
p03578
|
from collections import Counter
n,d,m,t,ans=int(eval(input())),Counter(list(map(int,input().split()))),int(eval(input())),Counter(list(map(int,input().split()))),"YES"
for i in list(t.keys()):
if i in list(d.keys()):
if d[i]<t[i]:ans="NO"
else:ans="NO"
print(ans)
|
n=int(eval(input()))
a=list(map(int,input().split()))
from collections import Counter
d=Counter(a)
m=int(eval(input()))
b=list(map(int,input().split()))
dd=Counter(b)
for i in dd:
if i not in d:
print("NO")
exit()
if d[i]<dd[i]:
print("NO")
exit()
print("YES")
|
p03578
|
import collections
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
d_c = collections.Counter(d)
t_c = collections.Counter(t)
ans = 'YES'
for e in list(t_c.items()):
diff, cnt = e[0], e[1]
if d_c[diff]:
if d_c[diff] < cnt:
ans = 'NO'
break
else:
ans = 'NO'
break
print(ans)
|
import collections
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
d_c = collections.Counter(d)
t_c = collections.Counter(t)
ans = 'YES'
for e in list(t_c.items()):
if d_c[e[0]]:
if d_c[e[0]] < e[1]:
ans = 'NO'
break
else:
ans = 'NO'
break
print(ans)
|
p03578
|
from collections import Counter
import sys
N = int(eval(input()))
D = list(input().split())
M = int(eval(input()))
T = list(input().split())
D_count = Counter(D)
T_count = Counter(T)
for k in T_count:
if D_count[k] < T_count[k]:
print('NO')
sys.exit()
print('YES')
|
from collections import Counter
import sys
N = int(eval(input()))
D = list(input().split())
M = int(eval(input()))
T = list(input().split())
D_count = Counter(D)
T_count = Counter(T)
for k, v in list(T_count.items()):
if D_count[k] < v:
print('NO')
sys.exit()
print('YES')
|
p03578
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
for i in t:
if i in d:
del d[d.index(i)]
else:
print("NO")
exit()
print("YES")
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
d.sort()
t.sort()
i,j=0,0
while i<m:
if t[i]<d[j]:
print("NO")
exit()
elif t[i]==d[j]:
i+=1
j+=1
else:
j+=1
if j==n and i<m:
print("NO")
exit()
print("YES")
|
p03578
|
import collections
n = int(eval(input()))
dd = list(map(int, input().split()))
m = int(eval(input()))
tt = list(map(int, input().split()))
cd = collections.Counter(dd)
ct = collections.Counter(tt)
if m > n:
print('NO')
exit()
for t in tt:
if t in dd and ct[t] <= cd[t]:
continue
else:
print('NO')
exit()
print('YES')
|
import collections
n = int(eval(input()))
d_list = list(map(int, input().split()))
m = int(eval(input()))
t_list = list(map(int, input().split()))
if m > n:
print("NO")
exit()
d_c = collections.Counter(d_list)
t_c = collections.Counter(t_list)
for i in t_c:
if t_c[i] <= d_c[i]:
continue
else:
print("NO")
exit()
print("YES")
|
p03578
|
n = int(eval(input()))
d = list(map(int,input().split()))
m = int(eval(input()))
t = list(map(int,input().split()))
for i in range(m):
try:
z = d.index(t[i])
except ValueError:
print('NO')
exit(0)
else:
d.pop(z)
print('YES')
|
n = int(eval(input()))
d = list(map(int,input().split()))
m = int(eval(input()))
t = list(map(int,input().split()))
d.sort()
t.sort()
j = 0
for i in range(n):
if d[i] == t[j]:
j += 1
if j == m:
break
if j == m:
print('YES')
else:
print('NO')
|
p03578
|
from collections import Counter
N=int(eval(input()))
C = Counter(list(map(int,input().split())))
O=int(eval(input()))
M = Counter(list(map(int,input().split())))
for key in list(M.keys()):
if C[key]<M[key]:
print("NO")
break
else:
print("YES")
|
from collections import Counter
N = int(eval(input()))
D=list(map(int,input().split()))
M = int(eval(input()))
T=list(map(int,input().split()))
C=Counter(D)
for t in T:
if C[t]<=0:
print("NO")
exit()
else:
C[t]-=1
print("YES")
|
p03578
|
from collections import Counter
n = eval(input())
d = Counter(list(map(int, input().split())))
m = eval(input())
t = Counter(list(map(int, input().split())))
d.subtract(t)
print(("NO" if -d else "YES"))
|
from collections import Counter
eval(input())
d = Counter(list(map(int, input().split())))
eval(input())
t = Counter(list(map(int, input().split())))
d.subtract(t)
print(("NO" if -d else "YES"))
|
p03578
|
N = int(eval(input()))
D = [int(_) for _ in input().split()]
M = int(eval(input()))
T = [int(_) for _ in input().split()]
D = sorted(D)
T = sorted(T)
Dstart = 0
flag = True
for i in T:
for j in D[Dstart:]:
Dstart += 1
if i == j:
break
elif i < j:
flag = False
break
if Dstart == N:
flag = False
if not flag:
break
print(("YES" if flag else "NO"))
|
N = int(eval(input()))
D = [int(_) for _ in input().split()]
M = int(eval(input()))
T = [int(_) for _ in input().split()]
D = sorted(D)
T = sorted(T)
Tindex = 0
flag = False
for i in D:
if i == T[Tindex]:
Tindex += 1
if Tindex == M:
flag = True
break
print(("YES" if flag else "NO"))
|
p03578
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000)
INF = 1<<32
YES = "YES" # type: str
NO = "NO" # type: str
def solve(N: int, D: "List[int]", M: int, T: "List[int]"):
D.sort()
T.sort()
from bisect import bisect_left, bisect_right
if M > N:
print(NO)
exit()
for i in range(M):
lf = bisect_left(D, T[i])
ri = bisect_right(D, T[i])
if lf != ri:
D.pop(lf)
else:
print(NO)
exit()
print(YES)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
M = int(next(tokens)) # type: int
T = [int(next(tokens)) for _ in range(M)] # type: "List[int]"
solve(N, D, M, T)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000)
INF = 1<<32
YES = "YES" # type: str
NO = "NO" # type: str
def solve(N: int, D: "List[int]", M: int, T: "List[int]"):
D.sort()
T.sort()
from bisect import bisect_left, bisect_right
if M > N:
print(NO)
exit()
for i in range(M):
lf = bisect_left(D, T[i])
ri = bisect_right(D, T[i])
if lf != ri:
D[lf] = 0
else:
print(NO)
exit()
print(YES)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
M = int(next(tokens)) # type: int
T = [int(next(tokens)) for _ in range(M)] # type: "List[int]"
solve(N, D, M, T)
if __name__ == '__main__':
main()
|
p03578
|
from collections import Counter
def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
C = Counter(D)
for t in T:
if t not in C or C[t] == 0:
print('NO')
return
else:
C[t] -= 1
print('YES')
main()
|
def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
if dic.get(d):
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print('NO')
return
else:
dic[t] -= 1
print('YES')
main()
|
p03578
|
def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
if dic.get(d):
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print('NO')
return
else:
dic[t] -= 1
print('YES')
main()
|
def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
if d in dic:
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print('NO')
return
else:
dic[t] -= 1
print('YES')
main()
|
p03578
|
def main():
# D, Tは文字数カウントするだけだからint型にする必要なし.
n = int(eval(input()))
D = input().split()
m = int(eval(input()))
T = input().split()
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
# dic.get(d)と比べると, if in の方が速い.
if d in dic:
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print('NO')
return
else:
dic[t] -= 1
print('YES')
main()
|
import sys
input = sys.stdin.readline
def main():
# D, Tは文字数カウントするだけだからint型にする必要なし.
n = int(eval(input()))
D = input().split()
m = int(eval(input()))
T = input().split()
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
# dic.get(d)と比べると, if in の方が速い.
if d in dic:
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print('NO')
return
else:
dic[t] -= 1
print('YES')
main()
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = [int(i) for i in input().split()]
M = int(eval(input()))
T = [int(i) for i in input().split()]
d = Counter(D)
t = Counter(T)
d_key = list(d.keys())
t_key = list(t.keys())
for i in t_key:
if i not in d_key or t[i] > d[i]:
print('NO')
exit()
print('YES')
|
from collections import Counter
N = int(eval(input()))
D = [int(i) for i in input().split()]
M = int(eval(input()))
T = [int(i) for i in input().split()]
d = Counter(D)
t = Counter(T)
d_key = list(d.keys())
t_key = list(t.keys())
p = len(d_key)
d_key += t_key
q = set(d_key)
if p != len(q):
print('NO')
exit()
for i in t_key:
if t[i] > d[i]:
print('NO')
exit()
print('YES')
|
p03578
|
# B - Problem Set
def is_create(dic_d, t):
for ti in t:
if not ti in list(dic_d.keys()):
return False
elif dic[ti] == 0:
return False
else:
dic[ti] -= 1
return True
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
dic = dict()
for di in d:
if di in list(dic.keys()):
dic[di] += 1
else:
dic[di] = 1
if is_create(dic, t):
print('YES')
else:
print('NO')
|
# B - Problem Set
def is_create(dic_d, t):
for ti in t:
if not ti in list(dic_d.keys()):
return False
elif dic[ti] == 0:
return False
else:
dic[ti] -= 1
return True
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
dic = dict()
for di in d:
dic.setdefault(di, 0)
dic[di] += 1
'''if di in dic.keys():
dic[di] += 1
else:
dic[di] = 1'''
if is_create(dic, t):
print('YES')
else:
print('NO')
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = list(input().split())
M = int(eval(input()))
T = list(input().split())
D_count = Counter(D)
T_count = Counter(T)
for k, v in list(T_count.items()):
if D_count[k] < v:
print('NO')
exit()
print('YES')
|
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
memo = {}
for d in D:
if d in memo:
memo[d] += 1
else:
memo[d] = 1
for t in T:
if t in memo and 0 < memo[t]:
memo[t] -= 1
else:
print('NO')
exit()
print('YES')
|
p03578
|
from collections import Counter
n = int(eval(input()))
D = list(map(int,input().split()))
m = int(eval(input()))
T = list(map(int,input().split()))
cntd = Counter(D)
cntt = Counter(T)
ok = True
for t in T:
if t not in D:
ok = False
elif cntt[t] > cntd[t]:
ok = False
if ok:
print('YES')
else:
print('NO')
|
from collections import Counter
n = int(eval(input()))
D = list(map(int,input().split()))
m = int(eval(input()))
T = list(map(int,input().split()))
sd = set(D)
st = set(T)
cntd = Counter(D)
cntt = Counter(T)
ok = True
for t in T:
if t not in sd:
ok = False
elif cntt[t] > cntd[t]:
ok = False
if ok:
print('YES')
else:
print('NO')
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
CT = Counter(T)
D.sort()
T.sort()
ans = 'YES'
for i,j in list(CT.items()):
if D.count(i) < j:
ans = 'NO'
break
print(ans)
|
from collections import Counter
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
CD = Counter(D)
CT = Counter(T)
ans = CT - CD
if ans:
print('NO')
else:
print('YES')
|
p03578
|
import bisect
n = int(eval(input()))
d = sorted(list(map(int,input().split())))
m = int(eval(input()))
t = sorted(list(map(int,input().split())))
flg = True
for i in range(m):
if t[-1]>d[-1]:
flg = False
break
else:
index = bisect.bisect_left(d,t[i])
if t[i] == d[index]:
del d[index]
else:
flg = False
break
print(('YES' if flg else 'NO'))
|
import bisect
n = int(eval(input()))
d = sorted(list(map(int,input().split())))
m = int(eval(input()))
t = list(map(int,input().split()))
d.append(10**9+1)
flg = True
for i in range(m):
index = bisect.bisect_left(d,t[i])
if t[i] == d[index]:
del d[index]
else:
flg = False
break
print(('YES' if flg else 'NO'))
|
p03578
|
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
for i in T:
if i in D:
D.pop(D.index(i))
else:
print("NO")
exit()
print("YES")
|
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
D.sort();T.sort()
di = 0
ti = 0
while True:
d = D[di];t=T[ti]
if d==t:
di+=1;ti+=1
elif d>t:
print("NO")
exit()
elif t>d:
di+=1
if ti >= len(T):
print("YES")
exit()
if di >= len(D):
print(di)
print("NO")
exit()
|
p03578
|
import collections
import sys
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
c=collections.Counter(t)
cc=list(c.items())
#print(cc)
if n < m:
print('NO')
else:
for i in range(len(cc)):
if d.count(cc[i][0])<cc[i][1]:
print('NO')
sys.exit()
print('YES')
|
import collections
import sys
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
ct=collections.Counter(t)
cd=collections.Counter(d)
cct=list(ct.items())
#print(cc)
if n < m:
print('NO')
else:
for i in range(len(cct)):
if cd[cct[i][0]]<cct[i][1]:
print('NO')
sys.exit()
print('YES')
|
p03578
|
N = int(eval(input()))
a = [int(i) for i in input().split()]
M = int(eval(input()))
b = [int(i) for i in input().split()]
a.sort()
b.sort()
p=0
for i in range (len(b)):
for j in range(len(a)):
if b[i] == a[j]:
a = a[j+1:N]
break
else:
if j ==len(a)-1:
print("NO")
p =1
break
if p ==1:
break
if i == len(b)-1:
print("YES")
|
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
d_dict = {}
for d in D:
if d not in d_dict:
d_dict[d] = 0
d_dict[d] += 1
count = 0
for t in T:
if t in d_dict and d_dict[t] > 0:
d_dict[t] -= 1
count += 1
if count == M:
print("YES")
else:
print("NO")
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
Tcount = Counter(T)
flag = 'YES'
for n,c in list(Tcount.items()):
if c > D.count(n):
flag = 'NO'
break
print(flag)
|
from collections import Counter
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
Tcount = Counter(T)
flag = 'YES'
Dcount = Counter(D)
for n,c in list(Tcount.items()):
if n not in Dcount:
flag = 'NO'
break
if c > Dcount[n]:
flag = 'NO'
break
print(flag)
|
p03578
|
import bisect
def index(a, x):
'Locate the leftmost value exactly equal to x'
i = bisect.bisect_left(a, x)
if i != len(a) and a[i] == x:
return [1,i]
return [0,0]
N=int(input())
D=sorted(map(int, input().split()))
M=int(input())
T=sorted(map(int, input().split()))
ans=["NO","YES"]
a=1
for t in T:
[a,i]=index(D,t)
if a==0: break
D.pop(i)
print(ans[a])
|
#import bisect
#def index(a, x):
# 'Locate the leftmost value exactly equal to x'
# i = bisect.bisect_left(a, x)
# if i != len(a) and a[i] == x:
# return [1,i]
# return [0,0]
N=int(input())
D=sorted(map(int, input().split()))
M=int(input())
T=sorted(map(int, input().split()))
DD={}
for d in D:
if d not in DD:
DD[d] = 1
else:
DD[d]+=1
ans=["NO","YES"]
a=1
for t in T:
try:
if DD[t]>0:
DD[t]-=1
else:
a=0
break
except:
a=0
break
print(ans[a])
|
p03578
|
# -*- coding: utf-8 -*-
n = int(eval(input()))
d = list(map(int,input().split()))
m = int(eval(input()))
t = list(map(int,input().split()))
d.sort()
t.sort()
def array_count(arr):
arr_target = [[]]
cnt = 1
for i in range(1,len(arr)):
if arr[i] == arr[i-1]:
cnt += 1
else:
arr_target.append([arr[i-1],cnt])
cnt = 1
arr_target.append([arr[len(arr)-1],cnt])
del arr_target[0]
return arr_target
d = array_count(d)
t = array_count(t)
flag = True
for i in range(len(t)):
temp = -1
for j in range(len(d)):
if d[j][0] == t[i][0]:
temp = j
if temp == -1:
flag = False
break
if d[temp][1] >= t[i][1]:
pass
else:
flag = False
break
if flag:
print("YES")
else:
print("NO")
|
# -*- coding: utf-8 -*-
n = int(eval(input()))
d = list(map(int,input().split()))
m = int(eval(input()))
t = list(map(int,input().split()))
def array_count(arr):
arr_target = [[]]
cnt = 1
for i in range(1,len(arr)):
if arr[i] == arr[i-1]:
cnt += 1
else:
arr_target.append([arr[i-1],cnt])
cnt = 1
arr_target.append([arr[len(arr)-1],cnt])
del arr_target[0]
return arr_target
d.sort()
t.sort()
d = array_count(d)
t = array_count(t)
for i in range(len(t)):
t[i][1] = -1 * t[i][1]
d.append(t[i])
d.sort()
for i in range(1,len(d)):
if d[i-1][0] == d[i][0]:
d[i-1][1] = d[i-1][1] + d[i][1]
d[i][1] = 0
flag = True
for i in range(len(d)):
if d[i][1] < 0:
flag = False
break
if flag:
print("YES")
else:
print("NO")
|
p03578
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
d.sort()
t.sort()
D=set(d)
T=set(t)
for i in T:
if i not in D:
print('NO')
exit()
else:
if t.count(i)>d.count(i):
print('NO')
exit()
print('YES')
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
if n<m:
print('NO')
exit()
d.sort()
t.sort()
i=0
j=0
while i<n and j<m:
if d[i]==t[j]:
i+=1
j+=1
else:
i+=1
if j==m:
print('YES')
else:
print('NO')
|
p03578
|
n = int(eval(input()))
D = list(map(int,input().split()))
m = int(eval(input()))
T = list(map(int,input().split()))
p = {}
for d in D:
if d not in p:
p[d] = 1
else:
p[d] += 1
for t in T:
if t not in p:
print('NO')
exit()
if p[t] == 0:
print('NO')
exit()
p[t] -= 1
print('YES')
|
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int,input().split()))
p = {}
for j in d:
if j not in p:
p[j] = 1
else:
p[j] += 1
for i in t:
if i not in p or p[i] == 0:
print("NO")
exit()
p[i] -= 1
print("YES")
|
p03578
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
import collections
#d=collections.Counter(d)
t=collections.Counter(t)
for i in list(t.items()):
if i[0] not in d:
print("NO")
break
if i[0] in d and i[1]>d.count(i[0]):
print("NO")
break
else:
print("YES")
|
n=int(eval(input()))
d=list(map(int,input().split()))
m=int(eval(input()))
t=list(map(int,input().split()))
import collections
d=collections.Counter(d)
t=collections.Counter(t)
for i in list(t.items()):
if i[0] not in d:
print("NO")
break
elif i[0] in d and i[1]>d[i[0]]:
print("NO")
break
else:
print("YES")
|
p03578
|
#!usr/bim/python
#! -*- coding: utf-8 -*-
n = input()
n = int(n)
dl = input()
dl = dl.split()
dl = list(map(int,dl))
m = input()
m = int(m)
tl = input()
tl = tl.split()
tl = list(map(int,tl))
status = 0
for t in tl:
if t in dl:
dl.remove(t)
else:
status = 1
break
if status == 0:
print("YES")
else:
print("NO")
|
#!usr/bim/python
#! -*- coding: utf-8 -*-
n = input()
n = int(n)
dl = input()
dl = dl.split()
dl = list(map(int,dl))
dl.sort()
m = input()
m = int(m)
tl = input()
tl = tl.split()
tl = list(map(int,tl))
tl.sort()
status = 0
i = 0
j = 0
while j < m:
d = dl[i]
t = tl[j]
#print d,t
if d > t:
status = 1
break
elif d == t:
i += 1
j += 1
else:
i += 1
if status == 0:
print("YES")
else:
print("NO")
|
p03578
|
N = int(eval(input()))
D = sorted(list(map(int,input().split())))
M = int(eval(input()))
T = sorted(list(map(int,input().split())))
cur = 0
flag = 0
for i in range(N):
if cur<M and D[i]==T[cur]:
cur += 1
elif cur<M and D[i]<T[cur]:
continue
elif cur==M:
break
else:
flag = 1
break
if flag==0:
print("YES")
else:
print("NO")
|
N = int(eval(input()))
D = list(map(int,input().split()))
CD = {}
for i in range(N):
d = D[i]
if d not in CD:
CD[d] = 0
CD[d] += 1
M = int(eval(input()))
T = list(map(int,input().split()))
CT = {}
for j in range(M):
t = T[j]
if t not in CT:
CT[t] = 0
CT[t] += 1
flag = 0
for t in CT:
if t not in CD:
flag = 1
break
else:
if CT[t]>CD[t]:
flag = 1
break
if flag==0:
print("YES")
else:
print("NO")
|
p03578
|
N = int(eval(input()))
D = list(map(int,input().split()))
CD = {}
for i in range(N):
d = D[i]
if d not in CD:
CD[d] = 0
CD[d] += 1
M = int(eval(input()))
T = list(map(int,input().split()))
CT = {}
for j in range(M):
t = T[j]
if t not in CT:
CT[t] = 0
CT[t] += 1
flag = 0
for t in CT:
if t not in CD:
flag = 1
break
else:
if CT[t]>CD[t]:
flag = 1
break
if flag==0:
print("YES")
else:
print("NO")
|
N = int(eval(input()))
D = list(map(int,input().split()))
CD = {}
for i in range(N):
if D[i] not in CD:
CD[D[i]] = 0
CD[D[i]] += 1
M = int(eval(input()))
T = list(map(int,input().split()))
CT = {}
for i in range(M):
if T[i] not in CT:
CT[T[i]] = 0
CT[T[i]] += 1
flag = 0
for t in CT:
if t not in CD:
flag = 1
break
if CT[t]>CD[t]:
flag = 1
break
if flag==1:
print("NO")
else:
print("YES")
|
p03578
|
n = int(eval(input()))
D = list(map(int,input().split()))
m = int(eval(input()))
T = list(map(int,input().split()))
cnt = 0
for t in T:
if t in D:
cnt += 1
D.remove(t)
if cnt == m:
print('YES')
else:
print('NO')
|
N=int(eval(input()))
D=list(map(int, input().split()))
M=int(eval(input()))
T=list(map(int, input().split()))
if N<M:
print('NO')
exit()
A={}
B={}
for i in D:
if i not in A:
A[i]=0
A[i]+=1
for i in T:
if i not in B:
B[i]=0
B[i]+=1
for i in list(B.keys()):
if not i in A:
print('NO')
exit()
if A[i]<B[i]:
print('NO')
exit()
print('YES')
|
p03578
|
import re
n = int(eval(input()))
d = input().split()
m = int(eval(input()))
t = input().split()
if len(d) < len(t):
print("NO")
exit()
t_size = len(t)
t_sorted = sorted(t)
reg = []
for i in range(0, t_size-2):
if t_sorted[i] == t_sorted[i+1]:
reg.append(t_sorted[i])
else:
reg.append(t_sorted[i]+".*")
reg.append(t_sorted[t_size-1])
reg_pattern = re.compile("".join(reg));
match = re.search(reg_pattern,"".join(sorted(d)))
if match:
print("YES")
else:
print("NO")
|
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
summary_d = {}
summary_t = {}
for i in range(0, len(d)):
summary_d[d[i]] = summary_d.get(d[i],0) + 1
for i in range(0, len(t)):
summary_t[t[i]] = summary_t.get(t[i],0) + 1
result = {}
for k,v in list(summary_t.items()):
result[k] = summary_d.get(k,0) - v
if min(result.values()) >= 0:
print("YES")
else:
print("NO")
|
p03578
|
import collections
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
d = collections.Counter(D)
t = collections.Counter(T)
ans = 'YES'
for i in range(len(t)):
if list(t.values())[i] > d[list(t.keys())[i]]:
ans = 'NO'
print(ans)
|
import collections
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
d = collections.Counter(D)
t = collections.Counter(T)
ans = 'YES'
t_v = list(t.values())
t_k = list(t.keys())
for i in range(len(t)):
if t_v[i] > d[t_k[i]]:
ans = 'NO'
print(ans)
|
p03578
|
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
i = 0
for t in set(T):
if D.count(t) < T.count(t):
print('NO')
exit()
print('YES')
|
N = int(eval(input()))
D = sorted(map(int, input().split()))
M = int(eval(input()))
T = sorted(map(int, input().split()))
i = 0
for t in T:
while D[i] < t:
i += 1
if D[i] == t:
i += 1
else:
print('NO')
exit()
print('YES')
|
p03578
|
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
dicD = {}
dicT = {}
for d in D:
if d not in dicD:
dicD[d] = 0
dicD[d] += 1
for t in T:
if t not in dicT:
dicT[t] = 0
dicT[t] += 1
for t in dicT:
if t not in dicD:
print("NO")
break
elif dicT[t] > dicD[t]:
print("NO")
break
else:
print("YES")
|
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
dicD = {}
dicT = {}
for d in D:
if d not in dicD:
dicD[d] = 0
dicD[d] += 1
for t in T:
if t not in dicT:
dicT[t] = 0
dicT[t] += 1
for t in dicT:
if (t not in dicD) or (dicT[t] > dicD[t]):
print("NO")
break
else:
print("YES")
|
p03578
|
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
from functools import reduce
def s(): return eval(input())
def k(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
N = k()
D = l()
M = k()
T = l()
for i in T:
if i in D:
D.remove(i)
else:
print("NO")
sys.exit()
print("YES")
|
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
from functools import reduce
def s(): return eval(input())
def k(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
N = k()
D = l()
M = k()
T = l()
d = Counter(D)
t = Counter(T)
for i in t:
if t[i] > d[i]:
print("NO")
sys.exit()
print("YES")
|
p03578
|
import sys
from collections import Counter
N = int(eval(input()))
s1 = list(map(int,input().split()))
M = int(eval(input()))
s2 = list(map(int,input().split()))
c1 = Counter(s1)
c2 = Counter(s2)
for k,v in list(c2.items()):
if k in c1:
if v > c1[k]:
print('NO')
sys.exit()
else:
print('NO')
sys.exit()
print('YES')
|
from collections import Counter
N = int(eval(input()))
D = list(map(int,input().split()))
M = int(eval(input()))
T = list(map(int,input().split()))
c1 = Counter(D)
c2 = Counter(T)
for k,v in list(c2.items()):
if c1[k] < v:
print('NO')
exit()
print('YES')
|
p03578
|
n = int(eval(input()))
d = sorted(list(map(int, input().split())))
m = int(eval(input()))
t = sorted(list(map(int, input().split())))
for i in t:
if i in d:
d.remove(i)
else:
print("NO")
exit()
print("YES")
|
n = int(eval(input()))
ht = {}
for i in input().split():
ht[i] = ht.get(i, 0) + 1
m = int(eval(input()))
for i in input().split():
if i not in ht or ht[i] == 0:
print("NO")
exit()
else:
ht[i] -= 1
print("YES")
|
p03578
|
n = int(eval(input()))
x = dict()
for i in input().split():
x[i] = x.get(i, 0) + 1
m = int(eval(input()))
y = dict()
for i in input().split():
y[i] = y.get(i, 0) + 1
for i, j in list(y.items()):
if x.get(i, 0) < j:
print("NO")
exit()
print("YES")
|
n = int(eval(input()))
x = dict()
for i in input().split():
x[i] = x.get(i, 0) + 1
m = int(eval(input()))
for i in input().split():
if i not in x or x[i] == 0:
print("NO")
exit()
else:
x[i] -= 1
print("YES")
|
p03578
|
from collections import Counter
n = int(eval(input()))
D = Counter(input().split())
m = int(eval(input()))
for i, j in list(Counter(input().split()).items()):
if i not in D or D[i] < j:
print("NO")
exit()
print("YES")
|
from collections import Counter
eval(input())
d = Counter(input().split())
eval(input())
t = Counter(input().split())
if all(ti in d and d[ti] >= tc for ti, tc in list(t.items())):
print("YES")
else:
print("NO")
|
p03578
|
import collections
N=int(eval(input()))
D=list(map(int,input().split()))
M=int(eval(input()))
T=list(map(int,input().split()))
TS=collections.Counter(T)
for i,k in list(TS.items()):
if k > D.count(i):
print('NO')
exit()
print('YES')
|
import collections
N=int(eval(input()))
D=list(map(int,input().split()))
M=int(eval(input()))
T=list(map(int,input().split()))
DS=collections.Counter(D)
TS=collections.Counter(T)
for i,k in list(TS.items()):
if k > DS[i]:
print('NO')
exit()
print('YES')
|
p03578
|
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
d.sort()
t.sort()
a = 0
cnt = 0
last = t[-1]
for i in range(n):
for j in range(a, m):
if d[i] == t[j]:
cnt += 1
a = j+1
break
elif d[i] > last:
break
if cnt == m:
print("YES")
else:
print("NO")
|
n = int(eval(input()))
d = list(map(int, input().split()))
m = int(eval(input()))
t = list(map(int, input().split()))
d.sort()
t.sort()
a = 0
b = 0
cnt = 0
last = t[-1]
for i in range(a, n):
for j in range(b, m):
if d[i] == t[j]:
cnt += 1
b = j+1
break
elif d[i] < t[j]:
break
if cnt == m:
print("YES")
else:
print("NO")
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
count_T = Counter(T)
for num, cnt in count_T.most_common():
if D.count(num) < cnt:
print("NO")
break
else:
print("YES")
|
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
D = sorted(D)
T = sorted(T)
i = len(D)-1
j = len(T)-1
flag = True
while(0<=i and 0<=j):
if D[i] > T[j]:
i -= 1
elif D[i] == T[j]:
i -= 1
j -= 1
else:
flag = False
break
if flag == False or (i<=-1 and j>-1):
print("NO")
else:
print("YES")
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = Counter(list(map(int, input().split())))
M = int(eval(input()))
T = Counter(list(map(int, input().split())))
# print('D, T', D, T)
for key, value in list(T.items()):
if D.get(key) is None:
print('NO')
exit()
if D.get(key) < value:
print('NO')
exit()
print('YES')
|
import sys
from collections import Counter
input = sys.stdin.buffer.readline
N = int(eval(input()))
D = list(map(int, input().split()))
D = Counter(D)
M = int(eval(input()))
T = list(map(int, input().split()))
T = Counter(T)
# print('D, T', D, T)
for key, value in zip(list(T.keys()), list(T.values())):
if D.get(key, 0) < value:
print('NO')
exit()
print('YES')
|
p03578
|
from collections import Counter
n = int(eval(input()))
D = list(map(int,input().split()))
D = Counter(D)
m = int(eval(input()))
T = list(map(int,input().split()))
T = Counter(T)
#print(D)
#print(T)
for key in T:
if D[key] < T[key]:
print('NO')
exit()
print('YES')
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
m = int(eval(input()))
t = list(map(int,input().split()))
t.sort()
now = 0
for x in t:
if now == n:
print("NO")
exit()
while d[now] != x:
now += 1
if now == n:
print("NO")
exit()
now += 1
print("YES")
|
p03578
|
n = int(eval(input()))
d = list(map(int,input().split()))
cnt = {}
for i in d:
if i not in cnt:
cnt[i] = d.count(i)
m = int(eval(input()))
t = list(map(int,input().split()))
flag = True
for i in t:
if i in cnt:
if cnt[i]>0:
cnt[i] -= 1
else:
flag = False
break
else:
flag = False
break
if flag:
print("YES")
else:
print("NO")
|
n = int(eval(input()))
d = list(map(int,input().split()))
cnt = {}
for i in d:
if i not in cnt:
cnt[i] = 1
else:
cnt[i] += 1
m = int(eval(input()))
t = list(map(int,input().split()))
flag = True
for i in t:
if i in cnt:
if cnt[i]>0:
cnt[i] -= 1
else:
flag = False
break
else:
flag = False
break
if flag:
print("YES")
else:
print("NO")
|
p03578
|
from collections import Counter
N = int(eval(input()))
D = list(map(int, input().split()))
M = int(eval(input()))
T = list(map(int, input().split()))
d = Counter(D)
t = Counter(T)
for key, value in list(t.items()):
if d.get(key, 0) < value:
print('NO')
exit()
else:
print('YES')
|
from collections import Counter
def main():
N = int(eval(input()))
D = input().split()
M = int(eval(input()))
T = input().split()
d = Counter(D)
t = Counter(T)
for key, value in list(t.items()):
if d.get(key, 0) < value:
print('NO')
exit()
else:
print('YES')
if __name__ == '__main__':
main()
|
p03578
|
from collections import Counter
N=int(eval(input()))
D=Counter((list(map(int,input().split()))))
M=int(eval(input()))
T=Counter((list(map(int,input().split()))))
for i in range(len(D)):
x=sorted([i for i in list(D.items())])
for j in range(len(T)):
y=sorted([j for j in list(T.items())])
if N<M or len(x)<len(y):
print("NO")
else:
cnt=0
for i in range(len(x)):
for j in range(len(y)):
if x[i][0]==y[j][0] and x[i][1]>=y[j][1]:
cnt+=1
print(("YES" if cnt==len(y) else "NO"))
|
from collections import Counter
N=int(eval(input()))
D=Counter((list(map(int,input().split()))))
M=int(eval(input()))
T=Counter((list(map(int,input().split()))))
for difficult,count in list(T.items()):
if difficult in D and D[difficult]>=count:
pass
else:
print("NO")
exit()
print("YES")
|
p03578
|
from collections import Counter
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
Count = Counter(D)
for t in T:
if not Count[t]:
print("NO")
exit()
else:
Count[t] -= 1
print("YES")
|
from collections import Counter
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
C = Counter(D)
for t in T:
if C[t]:
C[t] -= 1
else:
print("NO")
exit()
print("YES")
|
p03578
|
import bisect
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
M = int(eval(input()))
T = list(map(int, input().split()))
for i in range(M):
t = T[i]
for j in range(N):
idx = min(bisect.bisect_left(D, t), len(D) - 1)
d = D[idx]
if t == d:
D.pop(idx)
break
else:
print('NO')
exit()
print('YES')
|
import bisect
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
M = int(eval(input()))
T = list(map(int, input().split()))
for i in range(M):
t = T[i]
idx = min(bisect.bisect_left(D, t), len(D) - 1)
d = D[idx]
if t == d:
D.pop(idx)
else:
print('NO')
exit()
print('YES')
|
p03578
|
from sys import stdin
from itertools import groupby
n = int(stdin.readline().rstrip())
d = list(map(int,stdin.readline().rstrip().split()))
m = int(stdin.readline().rstrip())
t = list(map(int,stdin.readline().rstrip().split()))
d.sort()
t.sort()
li = []
for key, value in groupby(t):
li.append((key,len(list(value))))
for i in li:
if d.count(i[0]) < i[1]:
print("NO")
exit()
print("YES")
|
from sys import stdin
from itertools import groupby
n = int(stdin.readline().rstrip())
d = list(map(int,stdin.readline().rstrip().split()))
m = int(stdin.readline().rstrip())
t = list(map(int,stdin.readline().rstrip().split()))
d.sort()
t.sort()
now = 0
for i in d:
if i == t[now]:
now += 1
if now == m:
print("YES")
exit()
else:
print("NO")
|
p03578
|
N=int(eval(input()))
D=[int(i) for i in input().split()]
M=int(eval(input()))
T=[int(i) for i in input().split()]
x=0
for i in range(M):
if T[i] in D:
D.remove(T[i])
else:
x+=1
if x==0:
print("YES")
else:
print("NO")
|
n = int(eval(input()))
*D, = list(map(int, input().split()))
m = int(eval(input()))
*T, = list(map(int, input().split()))
D.sort()
T.sort()
j = 0
for i in range(n):
if j == m:
break
if D[i] == T[j]:
j += 1
if j == m:
print('YES')
else:
print('NO')
|
p03578
|
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp1 = [[0]*K for _ in range(N+1)]
dp1[0][0] = 1
for i in range(N):
for j in range(K):
dp1[i+1][j] += dp1[i][j]
if j+a[i]<K:
dp1[i+1][j+a[i]] += dp1[i][j]
dp2 = [[0]*K for _ in range(N+1)]
dp2[0][0] = 1
for i in range(N):
for j in range(K):
dp2[i+1][j] += dp2[i][j]
if j+a[N-i-1]<K:
dp2[i+1][j+a[N-i-1]] += dp2[i][j]
for i in range(N):
for j in range(1, K):
dp2[i][j] += dp2[i][j-1]
ans = N
for i in range(N):
for j in range(K):
if dp1[i][j]>0:
l = max(0, K-a[i]-j)
h = K-1-j
if l==0:
if dp2[N-i-1][h]>0:
ans -= 1
break
else:
if dp2[N-i-1][h]-dp2[N-i-1][l-1]>0:
ans -= 1
break
print(ans)
|
import sys
input = sys.stdin.readline
def judge(x):
dp = [[False]*K for _ in range(N)]
dp[0][0] = True
for i in range(N-1):
for j in range(K):
dp[i+1][j] |= dp[i][j]
if j+a[i+(1 if i>=x else 0)]<K:
dp[i+1][j+a[i+(1 if i>=x else 0)]] |= dp[i][j]
for i in range(max(K-a[x], 0), K):
if dp[N-1][i]:
return False
return True
def binary_search():
l, r = 0, N-1
while l<=r:
m = (l+r)//2
if judge(m):
l = m+1
else:
r = m-1
return r
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
print((binary_search()+1))
|
p03780
|
n, k = [int(item) for item in input().split()]
a = sorted([int(item) for item in input().split()], reverse=True)
max_k = min(sum(a), 5000)
def check_needed(index):
memo = [[0] * (max_k + 1) for _ in range(n+1)]
memo[0][0] = 1
for i in range(n):
for j in range(max_k + 1):
if memo[i][j] == 1:
memo[i+1][j] = 1
if i != index and j+a[i] <= max_k:
memo[i+1][j+a[i]] = 1
return (1 in memo[n][max(k-a[index], 0):k])
l = -1
r = n
while r-l > 1:
mid = (l+r) // 2
if not check_needed(mid):
r = mid
else:
l = mid
if sum(a) < k:
print(n)
else:
print((n - r))
|
n, k = [int(item) for item in input().split()]
a = sorted([int(item) for item in input().split()], reverse=True)
count = 0
asum = 0
for item in a:
if asum + item < k:
asum += item
count += 1
else:
count = 0
print(count)
|
p03780
|
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# K以上の数はすべて必要なのでA未満の数だけを考える
A = sorted([a for a in A if a < K], reverse=True)
N = len(A)
# dp1[i][k] := 1 ~ iまでのカードを使って数kが作れるか
dp1 = [[0] * (K + 1) for i in range(N + 1)]
dp1[0][0] = 1
# dp2[i][k] := N ~ iまでのカードを使って数kが作れるか
dp2 = [[0] * (K + 1) for i in range(N + 1)]
dp2[0][0] = 1
# dpテーブルを計算
for i in range(1, N + 1):
for k in range(K + 1):
dp1[i][k] = max(dp1[i][k], dp1[i - 1][k])
if A[i - 1] <= k:
dp1[i][k] = max(dp1[i][k], dp1[i - 1][k - A[i - 1]])
dp2[i][k] = max(dp2[i][k], dp2[i - 1][k])
if A[N - i] <= k:
dp2[i][k] = max(dp2[i][k], dp2[i - 1][k - A[N - i]])
# 累積和を取っておく
for i in range(N + 1):
dp2[i] = list(accumulate(dp2[i]))
# ansを計算
need = 0
for i in range(1, N + 1):
for k in range(K + 1):
# 1 ~ i番目まででkが作れない
if not dp1[i - 1][k]:
continue
# 1 ~ i番目までだけで必要な条件が作れる
if K - A[i - 1] <= k < K:
need += 1
break
# 範囲外参照
if K - A[i - 1] - k - 1 < 0:
continue
if dp2[N - i][K - k] - dp2[N - i][K - A[i - 1] - k - 1] > 0:
need += 1
break
print((N - need))
|
def main():
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# K以上の数はすべて必要なのでA未満の数だけを考える
A = sorted([a for a in A if a < K], reverse=True)
N = len(A)
# dp1[i][k] := 1 ~ iまでのカードを使って数kが作れるか
dp1 = [[0] * (K + 1) for i in range(N + 1)]
dp1[0][0] = 1
# dp2[i][k] := N ~ iまでのカードを使って数kが作れるか
dp2 = [[0] * (K + 1) for i in range(N + 1)]
dp2[0][0] = 1
# dpテーブルを計算
for i in range(1, N + 1):
for k in range(K + 1):
dp1[i][k] = max(dp1[i][k], dp1[i - 1][k])
if A[i - 1] <= k:
dp1[i][k] = max(dp1[i][k], dp1[i - 1][k - A[i - 1]])
dp2[i][k] = max(dp2[i][k], dp2[i - 1][k])
if A[N - i] <= k:
dp2[i][k] = max(dp2[i][k], dp2[i - 1][k - A[N - i]])
# 累積和を取っておく
for i in range(N + 1):
dp2[i] = list(accumulate(dp2[i]))
# ansを計算
need = 0
for i in range(1, N + 1):
for k in range(K + 1):
# 1 ~ i番目まででkが作れない
if not dp1[i - 1][k]:
continue
# 1 ~ i番目までだけで必要な条件が作れる
if K - A[i - 1] <= k < K:
need += 1
break
# 範囲外参照
if K - A[i - 1] - k - 1 < 0:
continue
if dp2[N - i][K - k] - dp2[N - i][K - A[i - 1] - k - 1] > 0:
need += 1
break
print((N - need))
main()
|
p03780
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.