Submission #1381196
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; const ull mod = 1e9 + 7; #define REP(i,n) for(int i=0;i<(int)n;++i) ll dp[305][605][305] = {}; int main(){ int X, Y, N; cin >> X >> Y >> N; ll t[N], h[N]; REP(i, N) cin >> t[i] >> h[i]; ll res = 0; for(int i=1;i<N+1;i++){ for(int j=t[i-1];j<X+Y+1;j++){ for(int k=1;k<X+1;k++){ dp[i][j][k] = max(dp[i-1][j-t[i-1]][k-1]+h[i-1], dp[i-1][j][k]); res = max(dp[i][j][k], res); } } } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 最高のトッピングにしような |
User | theory_and_me |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 737 Byte |
Status | WA |
Exec Time | 169 ms |
Memory | 432896 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.txt |
Subtask1 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.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, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt |
Subtask2 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.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, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.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, subtask2-20.txt, subtask2-21.txt, subtask2-22.txt, subtask2-23.txt, subtask2-24.txt, subtask2-25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 3 ms | 4480 KB |
subtask0-sample02.txt | AC | 2 ms | 4352 KB |
subtask0-sample03.txt | AC | 2 ms | 4352 KB |
subtask0-sample04.txt | AC | 2 ms | 4352 KB |
subtask1-01.txt | AC | 5 ms | 20736 KB |
subtask1-02.txt | AC | 7 ms | 28928 KB |
subtask1-03.txt | AC | 7 ms | 28928 KB |
subtask1-04.txt | WA | 6 ms | 28928 KB |
subtask1-05.txt | AC | 7 ms | 28928 KB |
subtask1-06.txt | WA | 10 ms | 43264 KB |
subtask1-07.txt | AC | 10 ms | 43264 KB |
subtask1-08.txt | AC | 10 ms | 43264 KB |
subtask1-09.txt | WA | 12 ms | 57600 KB |
subtask1-10.txt | WA | 12 ms | 57600 KB |
subtask1-11.txt | WA | 15 ms | 71936 KB |
subtask1-12.txt | WA | 15 ms | 72064 KB |
subtask1-13.txt | WA | 15 ms | 72064 KB |
subtask1-14.txt | AC | 1 ms | 384 KB |
subtask1-15.txt | AC | 15 ms | 71936 KB |
subtask1-16.txt | AC | 15 ms | 72064 KB |
subtask1-17.txt | WA | 10 ms | 45312 KB |
subtask1-18.txt | AC | 15 ms | 72064 KB |
subtask1-19.txt | WA | 10 ms | 45312 KB |
subtask1-20.txt | WA | 15 ms | 72064 KB |
subtask1-21.txt | WA | 15 ms | 72064 KB |
subtask1-22.txt | WA | 15 ms | 71936 KB |
subtask1-23.txt | WA | 15 ms | 72064 KB |
subtask1-24.txt | WA | 15 ms | 72064 KB |
subtask1-25.txt | WA | 15 ms | 72064 KB |
subtask2-01.txt | WA | 18 ms | 86272 KB |
subtask2-02.txt | WA | 23 ms | 114944 KB |
subtask2-03.txt | WA | 29 ms | 143744 KB |
subtask2-04.txt | MLE | 75 ms | 361088 KB |
subtask2-05.txt | MLE | 85 ms | 432512 KB |
subtask2-06.txt | WA | 47 ms | 215680 KB |
subtask2-07.txt | WA | 32 ms | 155904 KB |
subtask2-08.txt | MLE | 76 ms | 352512 KB |
subtask2-09.txt | WA | 37 ms | 180480 KB |
subtask2-10.txt | MLE | 90 ms | 432640 KB |
subtask2-11.txt | MLE | 87 ms | 432896 KB |
subtask2-12.txt | MLE | 88 ms | 432640 KB |
subtask2-13.txt | MLE | 110 ms | 432384 KB |
subtask2-14.txt | MLE | 151 ms | 432896 KB |
subtask2-15.txt | MLE | 69 ms | 291072 KB |
subtask2-16.txt | MLE | 125 ms | 432896 KB |
subtask2-17.txt | MLE | 63 ms | 270592 KB |
subtask2-18.txt | MLE | 61 ms | 309504 KB |
subtask2-19.txt | MLE | 84 ms | 432640 KB |
subtask2-20.txt | MLE | 130 ms | 432896 KB |
subtask2-21.txt | MLE | 169 ms | 432896 KB |
subtask2-22.txt | MLE | 125 ms | 432896 KB |
subtask2-23.txt | MLE | 90 ms | 356608 KB |
subtask2-24.txt | MLE | 129 ms | 432512 KB |
subtask2-25.txt | MLE | 127 ms | 432384 KB |