input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#coding:utf-8
import bisect
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = l... | #coding:utf-8
import bisect
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = l... | p02863 |
import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
a = []
for _ in range(N):
w, v = list(map(int, input().split()))
a.append((w, v))
a.sort()
dp = [[0] * (T + 1) for _ in range(N + 1)]
for i in range(N):
w, v = a[i]
for j in range(T):
if j + w >= T:
dp[i + 1][T] ... | import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
t = [tuple(map(int, input().split())) for _ in range(N)]
t.sort()
dp = [0] * (T + 1)
for a, b in t:
for i in range(T - 1, -1, -1):
if i + a < T: dp[i + a] = max(dp[i + a], dp[i] + b)
else: dp[-1] = max(dp[-1], dp[i] + b)
p... | p02863 |
# A Dynamic Programming based Python Program for 0-1 Knapsack problem
# Returns the maximum value that can be put in a knapsack of capacity W
# ty geekforgeeks
def knapSack(W, wt, val, n, avoid):
K = [[0 for x in range(W+1)] for x in range(n+1)]
# Build table K[][] in bottom up manner
for i in... | # A Dynamic Programming based Python Program for 0-1 Knapsack problem
# Returns the maximum value that can be put in a knapsack of capacity W
# ty geekforgeeks
def knapSack(W, wt, val, n):
K = [[0 for x in range(W+1)] for x in range(n+1)]
# Build table K[][] in bottom up manner
for i in range(... | p02863 |
N,T = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x:x[1])
dp1 = [[0]*T for i in range(N+1)]
for n in range(N):
for w in range(T):
if w-AB[n][0]>=0:
dp1[n+1][w] = max(dp1[n][w],dp1[n][w-AB[n][0]]+AB[n][1])
else:
... | N,T = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x:x[0])
dp = [[0]*T for i in range(N+1)]
ans = 0
for n in range(N):
for w in range(T):
ans = max(ans,dp[n][w]+AB[n][1])
if w-AB[n][0]>=0:
dp[n+1][w] = max(dp[n][w],d... | p02863 |
import sys
import math
MOD=10**9+7
N,T=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(N)]
l.sort(reverse=True)
dp1=[[-10**10 for i in range(T)] for i in range(N)]
dp2=[[0 for i in range(T)] for i in range(N)]
[a,b]=l[0]
dp1[0][0],dp2[0][0]=0,b
if a<T: dp1[0][a]=b
f... | ans=0
n,t=list(map(int,input().split()))
food=[]
for i in range(n):
f=list(map(int,input().split()))
food.append(f)
food=sorted(food)
dp=[0,0]+[-1]*(t-1)
for a,b in food:
tmp=[dp[i] for i in range(t)]
for i in range(t):
if dp[i]==-1: continue
j=i+a
if j<t: tmp[j]=m... | p02863 |
import sys
from operator import itemgetter
sys.setrecursionlimit(5000)
input = sys.stdin.readline
TIME = 0
VAL = 1
N, T = [int(a) for a in input().split()]
time_value = [None] * (N + 1)
time_value[0] = (-1, -1)
for i in range(1, N + 1):
time_value[i] = tuple(int(a) for a in input().split())
# S... | import sys
from operator import itemgetter
input = sys.stdin.readline
#################
# 定数
#################
TIME = 0
VAL = 1
##################
# 入力処理
##################
N, T = [int(a) for a in input().split()]
time_value = [(-1, -1)] + [None] * (N)
for i in range(1, N + 1):
time_value[i] = t... | p02863 |
n, t = list(map(int, input().split()))
dp1 = [[-float("inf") for i in range(t)] for i in range(n + 1)]
dp1[0][0] = 0
dp2 = [[-float("inf") for i in range(t)] for i in range(n + 1)]
dp2[n][0] = 0
ab = []
for i in range(n):
ab.append(list(map(int, input().split())))
for i in range(n):
a, b = ab[i]
f... | n, t = list(map(int, input().split()))
dp1 = [[-float("inf") for i in range(t)] for i in range(n + 1)]
dp1[0][0] = 0
dp2 = [[-float("inf") for i in range(t)] for i in range(n + 1)]
dp2[n][0] = 0
ab = []
for i in range(n):
ab.append(list(map(int, input().split())))
for i in range(n):
a, b = ab[i]
f... | p02863 |
# dp[i][t_sum]: i番目までの品物で時間がt_sumを超えないように選んだときの、満足度の総和の最大値
N, T = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for i in range(N)]
dp1 = [[0 for t_sum in range(T+1)] for i in range(N+2)]
dp2 = [[0 for t_sum in range(T+1)] for i in range(N+2)]
for i in range(N):
for t_sum in ran... | # dp[i][t_sum]: i番目までの品物で時間がt_sumを超えないように選んだときの、満足度の総和の最大値
N, T = list(map(int, input().split()))
items = sorted([tuple(map(int, input().split()))
for i in range(N)], key=lambda x: x[0])
dp1 = [[0 for t_sum in range(T+1)] for i in range(N+2)]
for i in range(N):
for t_sum in range(T+1):
... | p02863 |
n,t=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(n)]
ab.sort()
dp=[6007*[0]for _ in range(n)]
ans=0
for i in range(n):
a,b=ab[i]
for j in range(6007):
if i==0:
if j>=a and j<t:dp[i][j]=b
elif j>=a and j-a<t:dp[i][j]=max(dp[i-1][j-a]+b,dp[i-1][j])
else:... | n,t=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(n)]
ab.sort()
dp=[6007*[0]for _ in range(n)]
for i in range(n):
a,b=ab[i]
for j in range(6007):
if i==0:
if j>=a and j<t:dp[i][j]=b
elif j>=a and j-a<t:dp[i][j]=max(dp[i-1][j-a]+b,dp[i-1][j])
else:dp[i][j... | p02863 |
n,t=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(n)]
ab.sort()
dp=[(6007)*[0]for _ in range(n+1)]
dp[0][0]=0
ans=0
for i in range(n):
for j in range(6007):
dp[i+1][j]=max(dp[i+1][j],dp[i][j])
if j<t:dp[i+1][j+ab[i][0]]=max(dp[i][j]+ab[i][1],dp[i][j+ab[i][0]])
a... | n,t=list(map(int,input().split()))
dp=[[0]*(t+3001)for _ in range(n+1)]
ans=0
ab=[list(map(int,input().split()))for _ in range(n)]
ab.sort()
for i in range(1,n+1):
a,b=ab[i-1]
for j in range(t):
dp[i][j]=max(dp[i-1][j],dp[i][j])
dp[i][j+a]=dp[i-1][j]+b
ans=max(dp[i][j],dp[i][j+... | p02863 |
n,t = list(map(int,input().split()))
ab = [[int(i) for i in input().split()] for j in range(n)]
dp = [[0 for i in range(t)] for j in range(n+1)]
ans = 0
for h in range(n):
dp = [[0 for i in range(t)] for j in range(n+1)]
for i in range(n):
if h == 0 and i == 0:
continue
... | n,t = list(map(int,input().split()))
ab = [[int(i) for i in input().split()] for j in range(n)]
dp = [[0 for i in range(t)] for j in range(n+1)]
ab.sort()
ans = 0
for i in range(n):
for j in range(t):
#for k in range(2):
#dp[i+1][j] = max(dp[i][j],dp[i-1][j])
dp[i+1][j] = dp[i... | p02863 |
n,t = list(map(int,input().split()))
food = [[0,0] for i in range(n)]
for i in range(n):
a,b = list(map(int,input().split()))
food[i][0] = a
food[i][1] = b
dp = [[-10000000 for i in range((n+1)*3000)] for j in range(n+1)]
dp[0][0] = 0
for i in range(n):
a = food[i][0]
b = food[i][1]
for... | n,t = list(map(int,input().split()))
orders = []
for i in range(n):
a,b = list(map(int,input().split()))
orders.append([a,b])
orders.sort(key=lambda x:(x[0],-x[1]))
# print(orders)
dp = [[-1e10 for i in range(t+1)] for j in range(n+1)]
dp[0][0] = 0
for i,od in enumerate(orders):
for j in ran... | p02863 |
n, t = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
a = []
b = []
for ai, bi in ab:
a.append(ai)
b.append(bi)
dp = [[0 for j in range(t+1)] for i in range(n+1)]
prev = [[(0, 0) for j in range(t+1)] for i in range(n+1)]
for i in range(n):
... | n, t = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
a = []
b = []
for ai, bi in ab:
a.append(ai)
b.append(bi)
dp = [[0 for j in range(t+1)] for i in range(n+1)]
for i in range(n):
for j in range(t):
if j + a[i] <= t-1:
... | p02863 |
N, T = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for _ in range(N)]
items.sort()
ans = 0
dp = {0: 0}
for wi, vi in items:
for w, v in list(dp.items()):
if w < T:
v2 = v + vi
if v2 > ans:
ans = v2
for w, v in list(dp... | import sys
input = sys.stdin.readline
def solve():
N, T = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for _ in range(N)]
items.sort()
capW = T-1
dp = [0] * (capW+1)
ans = 0
for wi, vi in items:
ans = max(ans, dp[-1]+vi)
for w in ... | p02863 |
import heapq as hq
def resolve():
(N,T)=(int(i) for i in input().split())
dishes=[[int(i) for i in input().split()] for _ in range(N)]
dishes.sort()
dpt=[[-1 for i in range(T+1)] for _ in range(N+1)]
vflg=[[False for i in range(T+1)] for _ in range(N+1)]
dpt[0][0]=0
q=[]
... |
def resolve():
(N,T)=(int(i) for i in input().split())
dishes=[[int(i) for i in input().split()] for _ in range(N)]
dishes.sort()
dpt=[[-1 for i in range(T+1)] for _ in range(N+1)]
dpt[0][0]=0
for i in range(N):
for j in range(T):
dpt[i+1][j]=max(dpt[i+1][j],d... | p02863 |
def main():
N, T = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
AB.sort()
A = [a[0] for a in AB]
B = [b[1] for b in AB]
dp1 = [[0]*(T+1) for _ in range(N+1)]
for i in range(N):
for j in range(T):
dp1[i+1][j] = max... | def main():
N, T = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
AB.sort()
A = [a[0] for a in AB]
B = [b[1] for b in AB]
ans = 0
dp1 = [[0]*(T+1) for _ in range(N+1)]
for i in range(N):
for j in range(T):
t = ... | p02863 |
def main():
N, T = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
A = [a[0] for a in AB]
B = [b[1] for b in AB]
dp1 = [[0]*(T+1) for _ in range(N+1)]
for i in range(N):
for j in range(T):
t = j - A[i]
if 0 <... | def main():
N, T = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
AB.sort()
ans = 0
dp1 = [[0]*(T+1) for _ in range(N+1)]
for i in range(N):
for j in range(T):
t = j - AB[i][0]
if 0 <= t:
dp... | p02863 |
n, T = list(map(int, input().split()))
food = []
for _ in range(n):
a, b = list(map(int, input().split()))
food.append((a, b))
dp1 = [[0]*T for _ in range(1+n)]
dp2 = [[0]*T for _ in range(1+n)]
for i in range(n):
for j in range(T):
dp1[i+1][j] = dp1[i][j]
if j - food[i][0] >= ... | n, t = list(map(int, input().split()))
l = []
for i in range(n):
a, b = list(map(int, input().split()))
l.append((a, b))
l.sort()
ans = 0
dp = [[0]*t for _ in range(n+1)]
for i in range(n):
cur = dp[i][t-1] + l[i][1]
ans = max(ans, cur)
for j in range(t):
dp[i+1][j] = max(dp[i+1][j], ... | p02863 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().spli... | p02863 |
N, T = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
dp = [-1] * (T + 3000)
dp[0] = 0
c = 0
for a, b in sorted(AB):
for j in range(c, -1, -1):
if dp[j] == -1:
continue
t = dp[j] + b
if dp[j + a] < t:
dp[j + a] = ... | def main():
N, T = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
dp = [-1] * (T + 3000)
dp[0] = 0
c = 0
for a, b in sorted(AB):
for j in range(c, -1, -1):
if dp[j] == -1:
continue
t = dp[j] + b... | p02863 |
import sys
input=sys.stdin.readline #input高速化 １文字の時の改行文字に注意+
d={i:0 for i in range(3001)}
db={i:0 for i in range(3001)}
n,t=list(map(int,input().split()))
x=[tuple(map(int,input().split()))for i in range(n)]
dp=[]
dp2=[]
for time,value in x:
for k,v in list(d.copy().items()):
if k+time<t... | import sys
input=sys.stdin.readline #input高速化 １文字の時の改行文字に注意+
d={i:0 for i in range(3001)}
db={i:0 for i in range(3001)}
n,t=list(map(int,input().split()))
x=sorted([tuple(map(int,input().split()))for i in range(n)],key=lambda xxx:xxx[0])
dp=[]
dp2=[]
for time,value in x:
for k,v in list(d.copy().it... | p02863 |
N,T = list(map(int,input().split()))
item=[list(map(int,input().split())) for _ in range(N)]
item = sorted(item,key=lambda x:x[0])
dp=[[0]*(T+3000) for _ in range(N+1)]
for i,(a,b) in enumerate(item,1):
for t in reversed(list(range(T))):
dist=t+a
dp[i][dist] = max(dp[i-1][t]+b,dp[i][di... | N,T = list(map(int,input().split()))
item=[list(map(int,input().split())) for _ in range(N)]
item = sorted(item,key=lambda x:x[0])
dp=[[0]*(T+1) for _ in range(N+1)]
for i,(a,b) in enumerate(item,1):
for t in reversed(list(range(T))):
dist=min(T,t+a)
dp[i][dist] = max(dp[i-1][t]+b,dp[i... | p02863 |
#"""
import sys
input = sys.stdin.readline
#"""
N,T = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in [0]*N]
dp = [[[0,[]] for _ in [0]*T] for _ in [0]*(N+1)]
for i in range(N):
a,b = AB[i]
for t in range(T):
dp[i+1][t][0] = dp[i][t][0]
dp[i+1][t][1]... | #"""
import sys
input = sys.stdin.readline
#"""
N,T = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in [0]*N]
dp = [[0 for _ in [0]*T] for _ in [0]*(N+1)]
for i in range(N):
a,b = AB[i]
for t in range(T):
dp[i+1][t] = dp[i][t]
if t-a>=0:
... | p02863 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,T=list(map(int,input().split()))
AB=[tuple(map(int,input().split())) for _ in range(n)]
AB.sort()
dp=[0]*T
ans=-INF
for i in range(n):
a,b=... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,T=list(map(int,input().split()))
AB=[tuple(map(int,input().split())) for _ in range(n)]
AB.sort()
dp=[0]*T
ans=-INF
for i in range(n):
a,b=... | p02863 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,T=list(map(int,input().split()))
AB=[tuple(map(int,input().split())) for _ in range(n)]
AB.sort()
dp=[0]*T
ans=-INF
for i in range(n):
a,b=... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,t=list(map(int,input().split()))
AB=[tuple(map(int,input().split())) for _ in range(n)]
AB.sort()
ans=0
dp=[0]*t
for a,b in AB:
ans=max(ans,... | p02863 |
import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
DP = [[[0] * 2 for _ in range(T)] for _ in range(N)]
a, b = AB[0]
if a < T:
DP[0][a][0] = b
DP[0][0][1] = b
for i in range(1, N):
a, b = AB[i]
if a < T:
DP[... | import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
DP = [[[0] * 2 for _ in range(T)] for _ in range(2)]
a, b = AB[0]
if a < T:
DP[0][a][0] = b
DP[0][0][1] = b
t = 1
for i in range(1, N):
a, b = AB[i]
if a < T:
... | p02863 |
from collections import defaultdict
from heapq import heappush, heappop
N, T = list(map(int, input().split()))
dic = defaultdict(list)
ls = []
pre = []
log = [[1]*N]*T
dp = [0]*(T)
for i in range(N):
a, b = list(map(int, input().split()))
ls += [(a,b)]
if a<T:
for j in range(T-1,a-1,-1):
if... | N, T = list(map(int, input().split()))
dp = [[0]*T for i in range(N+1)]
ls = []
for i in range(N):
a, b = list(map(int, input().split()))
ls += [(a,b)]
ls.sort(key=lambda x:x[0])
for i in range(N):
a, b = ls[i]
for j in range(T-1, a-1, -1):
dp[i+1][j] = max(dp[i][j], dp[i][j-a]+b)
pre =... | p02863 |
N, T = list(map(int, input().split()))
ls = []
for i in range(N):
a, b = list(map(int, input().split()))
ls += [(a,b)]
ls.sort(key=lambda x:x[0])
dp = [[0]*(T) for i in range(N+1)]
for i in range(N):
a,b = ls[i]
for j in range(T-1, a-1, -1):
dp[i+1][j] = max(dp[i][j], dp[i][j-a]+b)
last = [... | N, T = list(map(int, input().split()))
ls = []
for i in range(N):
a, b = list(map(int, input().split()))
ls += [(a,b)]
ls.sort(key=lambda x:x[0])
t = [[0]*T for i in range(N+1)]
for i in range(1,N+1):
a, b = ls[i-1]
for j in range(T):
if j-a>=0:
t[i][j] = max(t[i-1][j-a]+b,t[i-1][j])
last ... | p02863 |
N,T = list(map(int,input().split()))
A = [0]*N
B = [0]*N
for i in range(N):
A[i],B[i] = list(map(int,input().split()))
# T-1分以内に完食を目指す，特定の料理のみ使わないで計算したい．
#DP1[i][t]はi番目の料理まででt分後までに完食で得られる幸福度の最大(商品番号は1から振る)
#DP2[i][t]はiからN番目の料理でt分後までに完食で得られる幸福度の最大
dp1 =[[0]*T for _ in range(N+1)]
dp2 =[[0]*T for _ in ra... | #Aをソートしておく，時間ギリギリにi番目の料理を頼むことで固定．
N,T = list(map(int,input().split()))
AB = [[0,0] for _ in range(N)]
for i in range(N):
AB[i][0],AB[i][1] = list(map(int,input().split()))
AB.sort()
#ソートした時のbの情報を維持しないと
# T-1分以内にi番目以外の料理をできるだけ完食する
#DP1[i][t]はi番目の料理まででt分後までに完食で得られる幸福度の最大(商品番号は1から振る)
dp1 =[[0]*T for... | p02863 |
N,T = list(map(int, input().split()))
AB = [[int(i) for i in input().split()] for _ in range(N)]
AB.sort()
# dp[i][j]: 満足度の最大値
# i: i品目まで
# j: 制限時間(< T)
dp = [[0] * 3100 for _ in range(3100)]
dp[0][0] = 0
# 貰うDP
ans = 0
for i in range(1, N + 1):
for j in range(T):
dp[i][j] = dp[i - 1][j]... | def main():
N,T = list(map(int, input().split()))
AB = [[int(i) for i in input().split()] for _ in range(N)]
AB.sort()
# dp[i][j]: 満足度の最大値
# i: i品目まで
# j: 制限時間(< T)
dp = [[0] * 3100 for _ in range(3100)]
dp[0][0] = 0
# 貰うDP
ans = 0
for i in range(1, N + 1):... | p02863 |
def solve():
from collections import namedtuple
import sys
input = sys.stdin.readline
Dish = namedtuple('Dish', 'idx cost pt')
n, t = list(map(int, input().split()))
dishes = []
for idx in range(1, n + 1):
cost, pt = list(map(int, input().split()))
dishes.append(... | def solve():
from collections import namedtuple
import sys
input = sys.stdin.readline
Dish = namedtuple('Dish', 'idx cost pt')
n, t = list(map(int, input().split()))
dishes = []
for idx in range(1, n + 1):
cost, pt = list(map(int, input().split()))
dishes.append(... | p02863 |
def solve():
from collections import namedtuple
import sys
input = sys.stdin.readline
Dish = namedtuple('Dish', 'idx cost pt')
n, t = list(map(int, input().split()))
dishes = []
for idx in range(1, n + 1):
cost, pt = list(map(int, input().split()))
dishes.append(... | def solve():
from collections import namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Dish = namedtuple('Dish', 'idx cost pt')
n, t = list(map(int, input().split()))
dishes = []
for idx in range(1, n + 1):
cost, pt = list(map(int, inpu... | p02863 |
N, T, *AB = list(map(int, open(0).read().split()))
dp = [0] * (T + max(AB[::2]))
for w, v in sorted(zip(*[iter(AB)] * 2)):
for i in reversed(list(range(T))):
dp[i + w] = max(dp[i + w], dp[i] + v)
print((max(dp)))
| def main():
N, T, *AB = list(map(int, open(0).read().split()))
dp = [0] * (T + max(AB[::2]))
for w, v in sorted(zip(*[iter(AB)] * 2)):
for i in reversed(list(range(T))):
dp[i + w] = max(dp[i + w], dp[i] + v)
print((max(dp)))
main() | p02863 |
def main():
N, T, *AB = list(map(int, open(0).read().split()))
dp = [0] * (T + max(AB[::2]))
for w, v in sorted(zip(*[iter(AB)] * 2)):
for i in reversed(list(range(T))):
dp[i + w] = max(dp[i + w], dp[i] + v)
print((max(dp)))
main() | def main():
N, T, *AB = list(map(int, open(0).read().split()))
dp = [0] * (T + max(AB[::2]))
for w, v in sorted(zip(*[iter(AB)] * 2)):
for i in reversed(list(range(T))):
if dp[i + w] < dp[i] + v:
dp[i + w] = dp[i] + v
print((max(dp)))
main()
| p02863 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p02863 |
import sys
from operator import itemgetter
from heapq import heapify, heappop, heappush
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): re... | import sys
from collections import deque
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
N,T = IL()
ab = [IL() for... | p02863 |
N, T = list(map(int, input().split()))
table = [[0] * (N + 1) for _ in range(T + 1)]
dish = sorted((tuple(map(int, input().split())) for _ in range(N)), key=lambda t: t[0])
for t in range(T + 1):
for n in range(N):
minutes_to_take, deliciousness = dish[n]
now = table[t][n]
if t < T:
... | N, T = list(map(int, input().split()))
table = [[0] * (N + 1) for _ in range(T + 1)]
dish = sorted((tuple(map(int, input().split())) for _ in range(N)), key=lambda t: t[0])
for t in range(T + 1):
for n in range(N):
minutes_to_take, deliciousness = dish[n]
now = table[t][n]
if t < T:
... | p02863 |
def examE():
N, T = LI()
A, B = [0] * N, [0] * N
for i in range(N):
A[i], B[i] = LI()
dp = [[[0,0] for _ in range(T+ 1)] for _ in range(N + 1)]
for i in range(N):
for j in range(A[i],T+1):
dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j - A[i]][0] + B[i])
... | def examE():
N, T = LI()
A, B = [0] * N, [0] * N
for i in range(N):
A[i], B[i] = LI()
dp = [[0 for _ in range(T+ 1)] for _ in range(N + 1)]
dp2 = [[0 for _ in range(T+ 1)] for _ in range(N + 1)]
for i in range(N):
for j in range(A[i],T+1):
dp[i + 1][j] = max(... | p02863 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p02863 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p02863 |
n, t = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a_, b_ = list(map(int, input().split()))
a.append(a_)
b.append(b_)
dp1 = [[0] * t for _ in range(n+2)]
dp2 = [[0] * t for _ in range(n+2)]
for i in range(n):
for j in range(t):
if a[i+1] > j:
dp... | N, T = list(map(int, input().split()))
AB = sorted([list(map(int, input().split())) for _ in range(N)])
dp = [[0] * N for _ in range(T)]
for i in range(1, T):
for j in range(N-1):
if AB[j][0] <= i:
dp[i][j] = max(dp[i][j-1], dp[i-AB[j][0]][j-1] + AB[j][1])
else:
d... | p02863 |
n,t = list(map(int,input().split()))
time = [-1 for i in range(6030)]
time[0] = 0
now = 0
lis = [list(map(int,input().split())) for i in range(n)]
lis.sort(key = lambda x:x[0])
for i in range(n):
for j in range(t-1,-1,-1):
if time[j] != -1:
time[j+lis[i][0]] = max(time[j+lis[i][0]],time... | n,t = list(map(int,input().split()))
time = [0 for i in range(3000)]
now = 0
ans = 0
lis = [list(map(int,input().split())) for i in range(n)]
lis.sort(key=lambda x:x[0])
for i in range(n):
for j in range(t-1,-1,-1):
if lis[i][0] + j >= t:
ans = max(ans,time[j]+lis[i][1])
else:
... | p02863 |
def main():
_, t, *L = list(map(int, open(0).read().split()))
d = [0] * (t + max(L[::2]))
for w, v in sorted((x, y) for x, y in zip(*[iter(L)] * 2)):
for i in range(t + w - 1, w - 1, -1):
if d[i - w] + v > d[i]:
d[i] = d[i - w] + v
print((max(d)))
if __name__=="__main__":
main()
#vs after co... | def main():
_, t, *L = list(map(int, open(0).read().split()))
d = [0] * t
cand = 0
for w, v in sorted((x, y) for x, y in zip(*[iter(L)] * 2)):
if cand < d[-1] + v:
cand = d[-1] + v
for i in range(t - 1, w - 1, -1):
if d[i - w] + v > d[i]:
d[i] = d[i - w] + v
print((max(cand, max(d))))
if... | p02863 |
def main():
n, t = list(map(int, input().split()))
f = [list(map(int, input().split())) for _ in range(n)]
dp = [[0 for i in range(t)] for j in range(n + 1)]
ls = [[[] for i in range(t)] for j in range(n + 1)]
for i in range(n):
for j in range(t):
if j - f[i][0] >= 0 and d... | def main():
n, t = list(map(int, input().split()))
f = [list(map(int, input().split())) for _ in range(n)]
dp = [0 for i in range(t)]
ls = [[] for i in range(t)]
for i in range(n):
for j in range(t - 1, -1, -1):
if j - f[i][0] >= 0 and dp[j - f[i][0]] + f[i][1] > dp[j]:
... | p02863 |
import copy
def main():
n, t = list(map(int, input().split()))
f = [list(map(int, input().split())) for _ in range(n)]
dp = [0 for i in range(t)]
ls = [[] for i in range(t)]
for i in range(n):
for j in range(t - 1, -1, -1):
if j - f[i][0] >= 0 and dp[j - f[i][0]] + f[... |
def main():
n, t = list(map(int, input().split()))
f = [list(map(int, input().split())) for _ in range(n)]
dp1 = [[0 for i in range(t)]for j in range(n+1)]
dp2 = [[0 for i in range(t)]for j in range(n+1)]
for i in range(n):
for j in range(t - 1, -1, -1):
if j - f[i][0]... | p02863 |
def solve():
ans = 0
N, T = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
dp = [[0]*(T+A[-1][0]) for _ in range(N+1)]
for i in range(1,N+1):
for t in range(1,T+A[-1][0]):
if t<A[i-1][0] or t>=T+A[i-1][0]:
dp[i][t] = max(dp[i-1][t]... | def solve():
N, T = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
dp = [[0]*(T+1) for _ in range(N+1)]
for i in range(N):
for j in range(0,T+1):
dp[i+1][j] = max(dp[i+1][j],dp[i][j])
if j<T:
t = min(T,j+A[i][0])
dp[i... | p02863 |
import sys
input = sys.stdin.readline
N,T=list(map(int,input().split()))
D=[tuple(map(int,input().split())) for i in range(N)]
D.sort(key=lambda x:x[1],reverse=True)
DP=[[0,0] for i in range(T+1)]
for ind,(x,y) in enumerate(D):
for time in range(T,x-1,-1):
if DP[time][0]<DP[time-x][0]+y:
... | import sys
input = sys.stdin.readline
N,T=list(map(int,input().split()))
D=[tuple(map(int,input().split())) for i in range(N)]
D.sort()
DP=[0]*(T+1)
ANS=0
for i in range(N):
a,b=D[i]
for j in range(T,a-1,-1):
DP[j]=max(DP[j-a]+b,DP[j])
for j in range(i+1,N):
ANS=max(ANS... | p02863 |
import sys
def input(): return sys.stdin.readline().strip()
def main():
N, T = list(map(int, input().split()))
cv = [tuple(map(int, input().split())) for _ in range(N)]
cv = sorted(cv, key=lambda x : x[0])
dp = [[0]*(T+1) for _ in range(N+1)]
dp_ext = [[0]*(T+1) for _ in range(N+1)]
... | import sys
def input(): return sys.stdin.readline().strip()
def main():
N, T = list(map(int, input().split()))
cv = [tuple(map(int, input().split())) for _ in range(N)]
cv = sorted(cv, key=lambda x : x[0])
dp = [[0]*(T+1) for _ in range(N+1)]
# 貰うdp
ans = 0
for i in range(N):
... | p02863 |
def knapsack(n, w, info):
dp = [[0]*(w + 1) for i in range(n + 1)]
for i in range(n):
for j in range(w + 1):
weight, value = info[i]
if j < weight:
dp[i + 1][j] = dp[i][j]
else:
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight] + value)
return dp
N,T = list(map(int... | N,T = list(map(int,input().split()))
foods = []
for _ in range(N):
a,b = list(map(int,input().split()))
foods.append([a,b])
foods.sort(key=lambda x: x[0])
# dp[i][j] = 1～i 番目の料理で j 分以内に完食できる美味しさの合計の最大値
dp = [ [0]*(T+1) for _ in range(N+1) ]
for i in range(N):
a,b = foods[i]
for j in range(T+1):
... | p02863 |
import sys
N, T = list(map(int, input().split()))
S = sys.stdin.readlines()
A = []
B = []
for s in S:
a, b = list(map(int, s.split()))
A.append(a)
B.append(b)
dp1 = [[0] * T for _ in range(N + 1)]
for i in range(N):
for j in range(T):
here = dp1[i][j]
if j < A[i]:
... | N, T = list(map(int, input().split()))
D = [tuple(map(int, input().split())) for _ in range(N)]
D.sort()
dp = [[0] * T for _ in range(N + 1)]
for i in range(N):
A, B = D[i]
for j in range(T):
here = dp[i][j]
if j < A:
dp[i + 1][j] = here
else:
dp[i + ... | p02863 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, t = list(map(int, input().rstrip('\n').split()))
ab = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
ab.sort()
dp = [0] * t
mt = 0
for a, b in ab:
mt = max(mt, dp[-1] + b)
... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, t = list(map(int, readline().split()))
ab = [list(map(int, readline().split())) for _ in range(n)]
ab.sort()
dp = [0] * t
mt = 0
for a, b in ab:
mt = max(mt, dp[-1] + b)
for i... | p02863 |
N,T = list(map(int,input().split()))
AB = [tuple(map(int,input().split())) for i in range(N)]
dp0 = [{0:0} for i in range(N+1)]
dp1 = [{0:0} for i in range(N+1)]
for i,(a,b) in enumerate(AB):
for k0,v0 in list(dp0[i].items()):
if k0 in dp0[i+1]:
dp0[i+1][k0] = max(dp0[i+1][k0], v0)
... | N,T = list(map(int,input().split()))
AB = [tuple(map(int,input().split())) for i in range(N)]
dp0 = {0:0}
dp1 = {0:0}
for i,(a,b) in enumerate(AB):
_dp0 = {0:0}
_dp1 = {0:0}
for k0,v0 in list(dp0.items()):
if k0 in _dp0:
_dp0[k0] = max(_dp0[k0], v0)
else:
... | p02863 |
n, t = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
a = []
b = []
for ai, bi in ab:
a.append(ai)
b.append(bi)
dp = [[0 for _ in range(t)] for _ in range(n+1)]
for i in range(n):
for j in range(t):
if j + a[i] <= t-1:
... | #ABC145 E
n,t = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(n)]
ab.sort()
a = []
b = []
for ai, bi in ab:
a.append(ai)
b.append(bi)
dp = [[0 for j in range(t)] for _ in range(n+1)]
# i番目より前まで注文してT分以内(max T-1)で完食する
for i in range(n):
for j in r... | p02863 |
#ABC145 E
n,t = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(n)]
ab.sort()
a = []
b = []
for ai, bi in ab:
a.append(ai)
b.append(bi)
dp = [[0 for j in range(t)] for _ in range(n+1)]
# i番目より前まで注文してT分以内(max T-1)で完食する
for i in range(n):
for j in r... | #ABC145 E
N,T = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(N)]
ab.sort()
dp = [[0]*T for _ in range(N+1)]
# i番目より前まで注文してT分以内(max T-1)で完食する
def chmax(a,b):
if a < b:
return b
else:
return a
for i in range(N):
for t in range(T): #T-1... | p02863 |
N,T = list(map(int,input().split()))
A =[list(map(int,input().split())) for i in range(N)]
A.sort(key = lambda x:x[0])
INF = float("inf")
DP = [[-INF]*(T+3001) for i in range(N+1)]
DP[0][0] = 0
for i in range(N):
for j in range(T):
DP[i+1][j] = max(DP[i+1][j],DP[i][j])
DP[i+1][j... | N,T = list(map(int,input().split()))
A =[list(map(int,input().split())) for i in range(N)]
A.sort(key = lambda x:x[0])
INF = float("inf")
DP = [[-INF]*(T+3001) for i in range(N+1)]
DP[0][0] = 0
for i in range(N):
for j in range(T):
DP[i+1][j] = max(DP[i+1][j],DP[i][j])
DP[i+1][j... | p02863 |
n, W = list(map(int, input().split()))
ab = [tuple(map(int, input().split()))for _ in range(n)]
ab.sort(reverse=True)
dp = [0]*W
for w, v in ab:
for j in reversed(list(range(W))):
if j-w < 0:
break
if dp[j] < dp[j-w]+v:
dp[j] = dp[j-w]+v
if dp[0] < v:
... | n, W = list(map(int, input().split()))
ab = [tuple(map(int, input().split()))for _ in range(n)]
ab.sort()
dp = [[0]*W for _ in range(n+1)]
for i in range(1, n+1):
w, v = ab[i-1]
for j in range(W):
if dp[i][j] < dp[i-1][j]:
dp[i][j] = dp[i-1][j]
if 0 <= j-w and dp[i][j] <... | p02863 |
n, t = list(map(int, input().split()))
dish = [list(map(int, input().split())) for _ in range(n)]
dish.sort(key=lambda x: x[0])
dp = [[0 for _ in range(3000)] for _ in range(3000)]
ans = 0
for i in range(n):
for j in range(t):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
nj = j + dish[i][0]
... | n, t = list(map(int, input().split()))
dish = [list(map(int, input().split())) for _ in range(n)]
dish.sort(key=lambda x: x[0])
dp = [[0 for _ in range(3005)] for _ in range(3005)]
ans = 0
for i in range(n):
for j in range(t):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
nj = j + dish[i][0]
... | p02863 |
def main():
import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
ab.sort(key=lambda x: (x[0], x[1]))
dp = [-1 for i in range(T*2 + 1)]
dp[0] = 0
for a, b in ab:
for i in range(T*2, 0, -1):
... | def main():
import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
ab.sort(key=lambda x: x[0])
t = ab[-1][0]
dp = [-1 for i in range(T+t + 1)]
dp[0] = 0
for a, b in ab:
for i in range(T+t... | p02863 |
from sys import stdin
def input():
return stdin.readline()[:-1]
def intput():
return int(eval(input()))
def sinput():
return input().split()
def intsput():
return list(map(int, sinput()))
dishes = []
n, t = intsput()
for _ in range(n):
dishes.append(list(intsput()))
... | from sys import stdin
def input():
return stdin.readline()[:-1]
def intput():
return int(eval(input()))
def sinput():
return input().split()
def intsput():
return list(map(int, sinput()))
dishes = []
n, t = intsput()
for _ in range(n):
dishes.append(list(intsput()))
... | p02863 |
I = [int(_) for _ in open(0).read().split()]
N, T = I[:2]
A, B = I[2::2], I[3::2]
dp = [-1] * 6001
dp[0] = 0
for a, b in sorted(zip(A, B)):
dp_new = dp[:]
for k in range(T):
if dp[k] == -1:
continue
dp_new[k + a] = max(dp[k + a], dp[k] + b)
dp = dp_new
print((max(dp))... | I = [int(_) for _ in open(0).read().split()]
N, T = I[:2]
A, B = I[2::2], I[3::2]
dp = [-1] * 6001
dp[0] = 0
for a, b in sorted(zip(A, B)):
for k in range(T - 1, -1, -1):
if dp[k] == -1:
continue
dp[k + a] = max(dp[k + a], dp[k] + b)
print((max(dp)))
| p02863 |
from operator import itemgetter
N, T = [int(i) for i in input().split()]
data = []
for i in range(N):
data.append([int(i) for i in input().split()])
data.sort(key=itemgetter(0))
dp = [dict() for _ in range(N)]
for i in range(T):
dp[0][i] = 0
dp[0][T] = data[0][1]
for i in range(1, N):
t... | from operator import itemgetter
N, T = [int(i) for i in input().split()]
data = []
for i in range(N):
data.append([int(i) for i in input().split()])
data.sort(key=itemgetter(0))
dp = [[0]*(T) for i in range(N)]
ans = data[0][1]
for i in range(1, N):
for j in range(T):
if j >= data[i-1][0... | p02863 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | p02863 |
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)... | # Python3 TLE, PyPy3 AC
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda ... | p02863 |
import sys
sys.setrecursionlimit(10**9)
input = lambda: sys.stdin.readline().rstrip()
inpl = lambda: list(map(int,input().split()))
N, T = inpl()
A = [None]*N
B = [None]*N
for i in range(N):
A[i], B[i] = inpl()
dp_intime = [[0]*T for _ in range(N+1)]
dp_total = [[0]*T for _ in range(N+1)]
for n in rang... | import sys
input = lambda: sys.stdin.readline().rstrip()
inpl = lambda: list(map(int,input().split()))
N, T = inpl()
A = [None]*N
B = [None]*N
for i in range(N):
A[i], B[i] = inpl()
dp_intime = [0]*T
dp_total = [0]*T
for n in range(N):
dp_intime_prev, dp_intime = dp_intime, [0]*T
dp_total_prev... | p02863 |
import sys
input = lambda: sys.stdin.readline().rstrip()
inpl = lambda: list(map(int,input().split()))
N, T = inpl()
A = [None]*N
B = [None]*N
for i in range(N):
A[i], B[i] = inpl()
dp_intime = [0]*T
dp_total = [0]*T
for n in range(N):
dp_intime_prev, dp_intime = dp_intime, [0]*T
dp_total_prev... | inpl = lambda: list(map(int,input().split()))
N, T = inpl()
AB = sorted([inpl() for _ in range(N)])
ans = 0
dp_intime = [0]*T
for n in range(N):
dp_intime_prev = dp_intime
dp_intime = [0]*T
a, b = AB[n]
for t in range(T):
if t < a:
dp_intime[t] = dp_intime_prev[t]
... | p02863 |
N,T = list(map(int,input().split()))
data = [list(map(int,input().split())) for _ in range(N)]
dp1 = [[0 for n in range(N+1)] for t in range(T+1)] #dp1[t][n] := (data[:n]の中からtまでに食べ切る範囲で美味しく）
dp2 = [[0 for n in range(N+1)] for t in range(T+1)] #dp1[t][n] := (data[:n]の中からt-1までに注文する範囲で美味しく)
for t in range(1,T+1)... | import sys
input = sys.stdin.readline
N,T = list(map(int,input().split()))
data = [list(map(int,input().split())) for _ in range(N)]
dp1 = [[0]*(N+1) for t in range(T+1)] #dp1[t][n] := (data[:n]の中からtまでに食べ切る範囲で美味しく）
dp2 = [[0]*(N+1) for t in range(T+1)] #dp1[t][n] := (data[:n]の中からt-1までに注文する範囲で美味しく)
for t in ... | p02863 |
import sys
input = sys.stdin.readline
n,t = list(map(int,input().split()))
data = [list(map(int,input().split())) for _ in range(n)]
dp1 = [[0 for i in range(n+1)] for j in range(t+1)]
dp2 = [[0 for i in range(n+1)] for j in range(t+1)]
q = 0
for i in range(1,n+1):
q = max(q,data[i-1][0])
dp2[1][i]... | N,T = list(map(int, input().split()))
data = [list(map(int, input().split())) for i in range(N)]
dp1 = [[0]*(N+1) for _ in range(T+1)]
dp2 = [[0]*(N+1) for _ in range(T+1)]
for t in range(T):
for n in range(N):
if t+1-data[n][0]>=0:
dp1[t+1][n+1] = max(dp1[t+1][n],dp1[t+1-data[n][0]][n]... | p02863 |
N,T=list(map(int,input().split()))
A,B=[],[]
for i in range(N):
a,b=list(map(int,input().split()))
A.append(a);B.append(b)
dp=[[[0,0] for i in range(T)] for i in range(N+1)]
for i in range(N):
for j in range(T):
if j-A[i]>=0:
dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j-A[i]][0]+B[... | N,T=list(map(int,input().split()))
A,B=[],[]
for i in range(N):
a,b=list(map(int,input().split()))
A.append(a);B.append(b)
dp=[[0,0] for i in range(T)]
for i in range(N):
for j in reversed(list(range(T))):
dp[j][1]=max(dp[j][1],dp[j][0]+B[i])
if j-A[i]>=0:
dp[j][0]=ma... | p02863 |
"""
食べるのにかかる時間順にソートしてナップサックするのがよい。
dp[i][j]
"""
N,T = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[0])
dp = [[0]*(T) for _ in range(N+1)]
for i in range(1,N+1):
a,b = AB[i-1]
for j in range(1,T):
if j-a >= 0:
dp[i]... | N,T = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
AB.sort()
dp = [0]*(T)
ans = 0
for i in range(N):
a,b = AB[i]
ans = max(ans,dp[-1]+b)
for j in range(T-1,-1,-1):
if j - a >= 0:
dp[j] = max(dp[j],dp[j-a]+b)
print(ans) | p02863 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, T, *AB = list(map(int, read().split()))
A = AB[::2]
B = AB[1::2]
dp1 = [[0] * T for _ in range(N + 1)]
for i... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, T, *AB = list(map(int, read().split()))
D = [(a, b) for a, b in zip(*[iter(AB)] * 2)]
D.sort()
A, B = list(zip(*D... | p02863 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, T, *AB = list(map(int, read().split()))
D = [(a, b) for a, b in zip(*[iter(AB)] * 2)]
D.sort()
A, B = list(zip(*D... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, T, *AB = list(map(int, read().split()))
D = [(a, b) for a, b in zip(*[iter(AB)] * 2)]
D.sort()
A, B = list(zip(*D... | p02863 |
import sys
read = sys.stdin.buffer.read
def main():
N, T, *AB = list(map(int, read().split()))
D = [(a, b) for a, b in zip(*[iter(AB)] * 2)]
D.sort()
dp = [0] * T
max_sum = [0] * N
for i, (a, b) in enumerate(D):
for t in range(T - 1, -1, -1):
if t >= a and... | import sys
read = sys.stdin.buffer.read
def main():
N, T, *AB = list(map(int, read().split()))
D = [(a, b) for a, b in zip(*[iter(AB)] * 2)]
D.sort()
dp = [0] * T
ans = 0
for i, (a, b) in enumerate(D[:-1]):
for t in range(T - 1, -1, -1):
if t >= a and dp[t... | p02863 |
n,t=list(map(int,input().split()))
F=[list(map(int,input().split())) for i in range(n)]
dp1=[[0]*(t+1) for i in range(n)]
for i in range(1,n):
for j in range(1,t+1):
if j-F[i-1][0]>=0:
dp1[i][j]=max(dp1[i-1][j],dp1[i][j-1],dp1[i-1][j-F[i-1][0]]+F[i-1][1])
else:
dp1[i][j]=max(dp1[i-1][j],dp... | n,t=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(n)]
l.sort()
dp=[0]*(t+max(l)[0])
for a,b in l:
for i in range(0,t+a)[::-1]:
if i-a>=0:
dp[i]=max(dp[i],dp[i-a]+b)
print((max(dp[t:]))) | p02863 |
import sys
input=sys.stdin.readline
n,t=list(map(int,input().split()))
AB=[]
for i in range(n):
a,b=list(map(int,input().split()))
AB.append((a,b))
def f(m):
dp=[[0]*(t) for _ in range(n+1)]
for i in range(n):
if i==m:
a,b=AB[i]
add=b
for j in range(t):
dp[i+1][j]=d... | import sys
input=sys.stdin.readline
n,t=list(map(int,input().split()))
AB=[]
for i in range(n):
a,b=list(map(int,input().split()))
AB.append((a,b))
AB.sort(key=lambda x:x[0])
ans=0
dp=[[0]*(t) for _ in range(n+1)]
for i in range(n-1):
a,b=AB[i]
for j in range(t):
if j>=a:
dp[i+1][j]=max(... | p02863 |
from copy import deepcopy
# 多次元配列を作成する
def make_multi_list(initial, degree):
ans = [initial for _ in range(degree[-1])]
for d in reversed(degree[:-1]):
ans = [deepcopy(ans) for _ in range(d)]
return ans
N, T = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list... | from copy import deepcopy
# 多次元配列を作成する
def make_multi_list(initial, degree):
ans = [initial for _ in range(degree[-1])]
for d in reversed(degree[:-1]):
ans = [deepcopy(ans) for _ in range(d)]
return ans
N, T = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list... | p02863 |
from copy import deepcopy
# 多次元配列を作成する
def make_multi_list(initial, degree):
ans = [initial for _ in range(degree[-1])]
for d in reversed(degree[:-1]):
ans = [deepcopy(ans) for _ in range(d)]
return ans
N, T = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list... | N, T = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append((a, b))
AB.sort()
ans = 0
dp = dp = [[0 for _ in range(3005)] for _ in range(3005)]
for i in range(N):
a, b = AB[i]
for j in range(T):
# iを使わないパターン
dp[i + 1][j... | p02863 |
N, T = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append((a, b))
AB.sort()
ans = 0
dp = dp = [[0 for _ in range(3005)] for _ in range(3005)]
for i in range(N):
a, b = AB[i]
for j in range(T):
# iを使わないパターン
dp[i + 1][j... | N, T = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append((a, b))
AB.sort()
ans = 0
dp = [[0 for _ in range(3005)] for _ in range(3005)]
for i in range(N):
a, b = AB[i]
for j in range(T):
# iを使わないパターン
dp[i + 1][j] = m... | p02863 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
def penalty(day, last, c):
val = 0
for i in range(26):
val += c[i] * (day - last[i])
return val
def calcScore(t, s, c):
val = 0
for i in range(26):
last = 0
for j in range(len(t)):
... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
def calcScore(t, s, c):
scores = [0]*26
lasts = [0]*26
for i in range(1, len(t)):
scores[t[i]] += s[i][t[i]]
dif = i - lasts[t[i]]
scores[t[i]] -= c[t[i]] * dif * (dif-1) // 2
lasts[t[i]] = i
... | p02620 |
from random import randint
import sys
input = sys.stdin.readline
def calc_score(D, C, S, T):
"""
開催日程Tを受け取ってそこまでのスコアを返す
"""
contest_last_opened = [0]*26 # コンテストiを前回開催した日
score = 0
for d, t in enumerate(T, start=1):
get_score = S[d-1][t-1]
score += get_score
... | from random import randint
import sys
input = sys.stdin.readline
def calc_score(D, C, S, T):
"""
開催日程Tを受け取ってそこまでのスコアを返す
"""
contest_last_opened = [0]*26 # コンテストiを前回開催した日
score = 0
for d, t in enumerate(T, start=1):
get_score = S[d-1][t-1]
score += get_score
... | p02620 |
import sys
sys.setrecursionlimit(300000)
from collections import defaultdict
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def MI0(): return [int(s) - 1 for s in sys.stdin.readline().split()]
def LMI(): return list(map(int, sys.stdin.readline().split()))... | import sys
sys.setrecursionlimit(300000)
from collections import defaultdict
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def MI0(): return [int(s) - 1 for s in sys.stdin.readline().split()]
def LMI(): return list(map(int, sys.stdin.readline().split()))... | p02620 |
def scoring():
score = 0
last = [0] * 26
for d in range(len(out)):
last[out[d]] = d + 1
score += S[d][out[d]]
score -= sum((d + 1 - l) * c for l, c in zip(last, C))
return score
def local_search(d, q, score):
# old = out[d]
out[d] = q
tmp = scoring()
... | import sys
input = sys.stdin.readline
def scoring(sc):
last = [0] * 26
res = 0
penalty = 0
for i in range(D):
t = out[i]
res += S[i][t]
penalty += sc - (i + 1 - last[t]) * C[t]
res -= penalty
last[t] = i + 1
return res
D = int(eval(input()))
... | p02620 |
from _collections import deque
def main():
D = int(eval(input()))
C = list(map(int,input().split()))
S = deque([])
for _ in range(D):
S.append(list(map(int,input().split())))
SELECT = deque([])
for i in range(D):
SELECT.append(int(eval(input()))-1)
def score(sel... | D = int(eval(input()))
C = list(map(int,input().split()))
S = [list(map(int,input().split()))for _ in range(D)]
SELECT = []
for i in range(D):
SELECT.append(int(eval(input()))-1)
M = int(eval(input()))
d = []
q = []
for _ in range(M):
td, tq = list(map(int,input().split()))
d.append(td-1)
... | p02620 |
D = int(eval(input()))
C = list(map(int,input().split()))
S = [list(map(int,input().split()))for _ in range(D)]
SELECT = []
for i in range(D):
SELECT.append(int(eval(input()))-1)
M = int(eval(input()))
d = []
q = []
for _ in range(M):
td, tq = list(map(int,input().split()))
d.append(td-1)
... | def main():
D = int(eval(input()))
C = list(map(int,input().split()))
S = [list(map(int,input().split()))for _ in range(D)]
SELECT = []
for i in range(D):
SELECT.append(int(eval(input()))-1)
M = int(eval(input()))
d = []
q = []
for _ in range(M):
td, tq... | p02620 |
D=int(eval(input()))
c = list(map(int,input().split()))
s=[None]*D
for i in range(D):
s[i] = list(map(int,input().split()))
t=[0]*D
for i in range(D):
t[i]=int(eval(input()))
m=int(eval(input()))
d=[None]*m
q=[None]*m
for i in range(m):
d[i],q[i] = list(map(int,input().split()))
def c... | D=int(eval(input()))
c = list(map(int,input().split()))
s=[None]*D
for i in range(D):
s[i] = list(map(int,input().split()))
t=[0]*D
for i in range(D):
t[i]=int(eval(input()))
m=int(eval(input()))
d=[None]*m
q=[None]*m
for i in range(m):
d[i],q[i] = list(map(int,input().split()))
sumc=su... | p02620 |
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1)... | import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1)... | p02620 |
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
import itertools
sys.setrecursionlimit(10 ** 8)
M = 10 ** 9 + 7
INF = 10 ** 17
def main()... | from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
import itertools
sys.setrecursionlimit(10 ** 8)
M = 10 ** 9 + 7
INF = 10 ** 17
def main()... | p02620 |
D = int(eval(input()))
c = [int(i) for i in input().split()]
s = [[int(i) for i in input().split()] for _ in range(D)]
t = [int(eval(input()))-1 for _ in range(D)]
llst = [0]*26
def scoreing():
res = 0
for i in range(26): llst[i] = 0
for day,i in enumerate(list(range(D)),1):
llst[t[i]] = ... | D = int(eval(input()))
c = [int(i) for i in input().split()]
s = [[int(i) for i in input().split()] for _ in range(D)]
t = [int(eval(input()))-1 for _ in range(D)]
def scoreing(x):
res = 0
last = 0
for day,i in enumerate(list(range(D)),1):
if t[i] == x:
last = day
... | p02620 |
import sys
from bisect import bisect_right, bisect_left
def checkScore(p):
global D, last, S
rst = 0
_last = last[p]
for d in range(1, D + 1):
down = C[p] * (d - _last[d])
up = S[d][p] if _last[d] == d else 0
rst += up - down
return rst
Z = 26
D = int(eval... | import sys
from bisect import bisect_right, bisect_left
def calculate_score(c):
global D, last, S
rst = 0
_last = last[c]
for d in range(1, D + 1):
down = C[c] * (d - _last[d])
up = S[d][c] if _last[d] == d else 0
rst += up - down
return rst
Z = 26
D = int... | p02620 |
def P(s):
R,P,*L=[0]*28
for i in range(D):t=I[i+D][0]-1;P+=s-(i+1-L[t])*C[t];R+=I[i][t]-P;L[t]=i+1
return R
(D,),C,*I=[[*list(map(int,t.split()))]for t in open(0)]
for d,q in I[D-~D:]:I[d-1+D][0]=q;print((P(sum(C)))) | def P(s):
i,R,P,*L=[0]*29
while i<D:t=I[i+D][0]-1;P+=s-(i+1-L[t])*C[t];R+=I[i][t]-P;i+=1;L[t]=i
return R
(D,),C,*I=[[*list(map(int,t.split()))]for t in open(0)]
for d,q in I[D-~D:]:I[d-1+D][0]=q;print((P(sum(C)))) | p02620 |
def P(s):
i,R,P,*L=[0]*29
while i<D:t=I[i+D][0]-1;P+=s-(i+1-L[t])*C[t];R+=I[i][t]-P;i+=1;L[t]=i
return R
(D,),C,*I=[[*list(map(int,t.split()))]for t in open(0)]
for d,q in I[D-~D:]:I[d-1+D][0]=q;print((P(sum(C)))) | def P(s):
i,R,P,*L=[0]*29
while i<D:t=I[i+D][0]-1;P+=s+(~i+L[t])*C[t];R+=I[i][t]-P;i+=1;L[t]=i
return R
(D,),C,*I=[[*list(map(int,t.split()))]for t in open(0)]
for d,q in I[D-~D:]:I[d-1+D][0]=q;print((P(sum(C)))) | p02620 |
def f(a,d,T):
try:
return T[d:].index(a)+d
except ValueError:
return len(T)
from random import randint
A=26
D=int(eval(input()))
C=[0]+list(map(int,input().split())) #減る満足度のベース
S=[0]*(D+1) #S[d][i] :(d+1)日目にコンテストiを開催した時の満足度
for i in range(1,D+1):
S[i]=[0]+list(map(int,inpu... | def f(a,d,T):
try:
return T[d:].index(a)+d
except ValueError:
return len(T)
from random import randint
A=26
D=int(eval(input()))
C=[0]+list(map(int,input().split())) #減る満足度のベース
S=[0]*(D+1) #S[d][i] :(d+1)日目にコンテストiを開催した時の満足度
for i in range(1,D+1):
S[i]=[0]+list(map(int,inpu... | p02620 |
def f(a,d,T):
try:
return T[d:].index(a)+d
except ValueError:
return len(T)
from random import randint
A=26
D=int(eval(input()))
C=[0]+list(map(int,input().split())) #減る満足度のベース
S=[0]*(D+1) #S[d][i] :(d+1)日目にコンテストiを開催した時の満足度
for i in range(1,D+1):
S[i]=[0]+list(map(int,inpu... | def f(a,d,T):
try:
return T[d+1:].index(a)+(d+1)
except ValueError:
return len(T)
def g(a,d,T):
try:
return T[:d].index(a)
except ValueError:
return 0
A=26
D=int(eval(input()))
C=[0]+list(map(int,input().split())) #減る満足度のベース
S=[0]*(D+1) #S[d][i] :(d+1... | p02620 |
D=int(eval(input()))
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for i in range(D)]
T=[int(eval(input()))-1 for i in range(D)]
X=[0]*26
Y=[0]*26
M=int(eval(input()))
d,q=0,0
P=0
for i in range(D):
P+=S[i][T[i]]
for j in range(26):
X[j]+=C[j]
X[T[i]]=0
for j in range(26):... | D=int(eval(input()))
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for i in range(D)]
T=[int(eval(input()))-1 for i in range(D)]
X=[0]*26
Y=[0]*26
M=int(eval(input()))
d,q=0,0
P=0
for i in range(D):
P+=S[i][T[i]]
for j in range(26):
X[j]+=C[j]
X[T[i]]=0
for j in range(26):... | p02620 |
import sys
input = sys.stdin.readline
d = int(eval(input()))
*C, = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(d)]
T = [int(eval(input())) - 1 for i in range(d)]
L = [[-1]]
def score(T):
L = [-1 for j in range(26)]
tmp = 0
for i in range(d):
t... | d = int(eval(input()))
dd = d * (d + 1) // 2
*C, = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(d)]
T = [int(eval(input())) - 1 for i in range(d)]
m = int(eval(input()))
PQ = [tuple(map(int, input().split())) for k in range(m)]
PQ = [(p - 1, q - 1) for p, q in PQ]
for p,... | p02620 |
d = int(eval(input()))
dd = d * (d + 1) // 2
*C, = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(d)]
T = [int(eval(input())) - 1 for i in range(d)]
m = int(eval(input()))
PQ = [tuple(map(int, input().split())) for k in range(m)]
PQ = [(p - 1, q - 1) for p, q in PQ]
for p,... | d = int(eval(input()))
dd = d * (d + 1) // 2
*C, = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(d)]
def calc_score(T):
L = [-1 for j in range(26)]
X = [0 for j in range(26)]
score = 0
for i in range(d):
score += S[i][T[i]]
X[T[i]] += (... | p02620 |
def solve():
from bisect import bisect_left
N, W = list(map(int, input().split()))
n1 = N//2
n2 = N-n1
a = [[tuple(map(int, input().split())) for _ in [0]*n1], [tuple(map(int, input().split())) for _ in [0]*n2]]
dp = [[(0, 0) for _ in [0]*(2**n1)], [(0, 0) for _ in [0]*(2**n2)]]
for... | def solve():
from bisect import bisect_left
N, W = list(map(int, input().split()))
n1 = N//2
n2 = N-n1
a = [[tuple(map(int, input().split())) for _ in [0]*n1], [tuple(map(int, input().split())) for _ in [0]*n2]]
dp = [[(0, 0) for _ in [0]*(2**n1)], [(0, 0) for _ in [0]*(2**n2)]]
for... | p02321 |
def solve():
from bisect import bisect_left
N, W = list(map(int, input().split()))
n1 = N//2
n2 = N-n1
a = [[tuple(map(int, input().split())) for _ in [0]*n1], [tuple(map(int, input().split())) for _ in [0]*n2]]
dp = [[(0, 0) for _ in [0]*(2**n1)], [(0, 0) for _ in [0]*(2**n2)]]
for... | def solve():
from bisect import bisect_right
N, W = list(map(int, input().split()))
a = [tuple(map(int, input().split())) for _ in [0]*N]
def bitdp(items):
n = len(items)
dp = [(0, 0) for _ in [0]*(2**n)]
for bitset in range(1, 2**n):
for item_num, (item_v, ... | p02321 |
def solve():
from bisect import bisect_right
N, W = list(map(int, input().split()))
a = [tuple(map(int, input().split())) for _ in [0]*N]
def bitdp(items):
n = len(items)
dp = [(0, 0) for _ in [0]*(2**n)]
for bitset in range(1, 2**n):
for item_num, (item_v, ... | import sys
from bisect import bisect_right
def meet_in_the_middle(a: list, limit: int) -> tuple:
first_v, first_w, second_v, second_w = [], [], [], []
for items, v_append, w_append in (
(a[:len(a)//2], first_v.append, first_w.append),
(a[len(a)//2:], second_v.append, second_w.a... | p02321 |
a=int(eval(input()))
b=int(eval(input()))
h=int(eval(input()))
print((int((a+b)*h/2))) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a + b) * h // 2))
| p03997 |
a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print((int((a + b) * h / 2))) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print(((a + b) * h // 2)) | p03997 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.