Submission #2525990
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <vector> #include <utility> #include <cmath> #include <iomanip> #include <queue> #include <map> #include <set> #include <random> #include <sstream> #include <stack> #include <deque> using namespace std; #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vl; int N, P; int a[5100], b[5100]; int dp[5500][5500] = {}; int main() { cin >> N >> P; rep(i,N) cin >> a[i] >> b[i]; rep(i,5500) dp[0][i] = b[0]; REP(i,1,N) { rep(j,5500) { if (j <= P+a[i] && j >= a[i]) { dp[i][j] = max({dp[i-1][j], dp[i-1][j-a[i]] + b[i]}); } else { dp[i][j] = max(dp[i-1][j], dp[i][j-1]); } } } cout << dp[N-1][P] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - おやつ |
User | bluenote |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 948 Byte |
Status | WA |
Exec Time | 91 ms |
Memory | 108800 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 50 | 0 / 50 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt |
Subtask2 | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_00.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
sample_03.txt | AC | 1 ms | 512 KB |
subtask1_00.txt | WA | 2 ms | 1152 KB |
subtask1_01.txt | WA | 2 ms | 1280 KB |
subtask1_02.txt | WA | 3 ms | 1408 KB |
subtask1_03.txt | WA | 2 ms | 1024 KB |
subtask1_04.txt | WA | 2 ms | 896 KB |
subtask1_05.txt | WA | 3 ms | 2048 KB |
subtask1_06.txt | WA | 2 ms | 1408 KB |
subtask1_07.txt | WA | 3 ms | 1408 KB |
subtask1_08.txt | WA | 2 ms | 1152 KB |
subtask1_09.txt | WA | 4 ms | 4352 KB |
subtask1_10.txt | WA | 4 ms | 4352 KB |
subtask1_11.txt | WA | 4 ms | 4352 KB |
subtask1_12.txt | WA | 4 ms | 4352 KB |
subtask1_13.txt | WA | 4 ms | 4352 KB |
subtask1_14.txt | WA | 4 ms | 4352 KB |
subtask2_00.txt | WA | 17 ms | 20736 KB |
subtask2_01.txt | WA | 16 ms | 20736 KB |
subtask2_02.txt | WA | 59 ms | 84224 KB |
subtask2_03.txt | WA | 22 ms | 24832 KB |
subtask2_04.txt | WA | 91 ms | 100608 KB |
subtask2_05.txt | WA | 43 ms | 61696 KB |
subtask2_06.txt | WA | 12 ms | 12544 KB |
subtask2_07.txt | WA | 10 ms | 12544 KB |
subtask2_08.txt | WA | 12 ms | 12544 KB |
subtask2_09.txt | WA | 28 ms | 35072 KB |
subtask2_10.txt | WA | 73 ms | 108800 KB |
subtask2_11.txt | WA | 73 ms | 108800 KB |
subtask2_12.txt | WA | 73 ms | 108800 KB |
subtask2_13.txt | WA | 73 ms | 108800 KB |
subtask2_14.txt | WA | 73 ms | 108800 KB |
subtask2_15.txt | WA | 73 ms | 108800 KB |
subtask2_16.txt | WA | 73 ms | 108800 KB |
subtask2_17.txt | WA | 76 ms | 108800 KB |
subtask2_18.txt | WA | 73 ms | 108800 KB |
subtask2_19.txt | WA | 73 ms | 108800 KB |