Submission #1494209
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <cstring> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <list> #include <algorithm> #include <functional> #include <sstream> #include <complex> #include <stack> #include <queue> #include <unordered_set> #include <unordered_map> #include <array> #include <cassert> #include <bitset> using namespace std; using LL = long long; int X, Y; int N; vector<int>t, h; LL memo[364][893][364]; LL dp(int x, int y, int z) { if (x < 0 || y < 0) { return -1145148101919; } if (memo[x][y][z] != -1)return memo[x][y][z]; LL res = 0; if (z != 0) { res = dp(x, y, z - 1); res = max(res, dp(x - 1, y - t[z - 1], z - 1) + h[z - 1]); } return memo[x][y][z] = res; } int main(void) { cin >> X >> Y; cin >> N; for (int i = 0; i < N; ++i) { int tt, hh; cin >> tt >> hh; t.push_back(tt); h.push_back(hh); } memset(memo, 0xff, sizeof(memo)); LL ans = dp(X, X + Y, N); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 最高のトッピングにしような |
User | platypus |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1158 Byte |
Status | MLE |
Exec Time | 374 ms |
Memory | 924672 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 | MLE | 351 ms | 924544 KB |
subtask0-sample02.txt | MLE | 374 ms | 924668 KB |
subtask0-sample03.txt | MLE | 242 ms | 924672 KB |
subtask0-sample04.txt | MLE | 260 ms | 924544 KB |
subtask1-01.txt | MLE | 240 ms | 924544 KB |
subtask1-02.txt | MLE | 243 ms | 924672 KB |
subtask1-03.txt | MLE | 244 ms | 924544 KB |
subtask1-04.txt | MLE | 261 ms | 924544 KB |
subtask1-05.txt | MLE | 240 ms | 924672 KB |
subtask1-06.txt | MLE | 259 ms | 924544 KB |
subtask1-07.txt | MLE | 239 ms | 924544 KB |
subtask1-08.txt | MLE | 237 ms | 924672 KB |
subtask1-09.txt | MLE | 248 ms | 924672 KB |
subtask1-10.txt | MLE | 265 ms | 924672 KB |
subtask1-11.txt | MLE | 238 ms | 924672 KB |
subtask1-12.txt | MLE | 249 ms | 924672 KB |
subtask1-13.txt | MLE | 238 ms | 924672 KB |
subtask1-14.txt | MLE | 238 ms | 924544 KB |
subtask1-15.txt | MLE | 274 ms | 924672 KB |
subtask1-16.txt | MLE | 241 ms | 924672 KB |
subtask1-17.txt | MLE | 238 ms | 924672 KB |
subtask1-18.txt | MLE | 237 ms | 924672 KB |
subtask1-19.txt | MLE | 242 ms | 924672 KB |
subtask1-20.txt | MLE | 237 ms | 924672 KB |
subtask1-21.txt | MLE | 239 ms | 924672 KB |
subtask1-22.txt | MLE | 237 ms | 924672 KB |
subtask1-23.txt | MLE | 239 ms | 924672 KB |
subtask1-24.txt | MLE | 248 ms | 924672 KB |
subtask1-25.txt | MLE | 237 ms | 924672 KB |
subtask2-01.txt | MLE | 244 ms | 924672 KB |
subtask2-02.txt | MLE | 238 ms | 924672 KB |
subtask2-03.txt | MLE | 241 ms | 924672 KB |
subtask2-04.txt | MLE | 253 ms | 924672 KB |
subtask2-05.txt | MLE | 245 ms | 924672 KB |
subtask2-06.txt | MLE | 256 ms | 924672 KB |
subtask2-07.txt | MLE | 239 ms | 924672 KB |
subtask2-08.txt | MLE | 264 ms | 924672 KB |
subtask2-09.txt | MLE | 240 ms | 924672 KB |
subtask2-10.txt | MLE | 253 ms | 924672 KB |
subtask2-11.txt | MLE | 265 ms | 924672 KB |
subtask2-12.txt | MLE | 257 ms | 924672 KB |
subtask2-13.txt | MLE | 256 ms | 924672 KB |
subtask2-14.txt | MLE | 286 ms | 924672 KB |
subtask2-15.txt | MLE | 256 ms | 924672 KB |
subtask2-16.txt | MLE | 279 ms | 924672 KB |
subtask2-17.txt | MLE | 254 ms | 924672 KB |
subtask2-18.txt | MLE | 238 ms | 924672 KB |
subtask2-19.txt | MLE | 241 ms | 924672 KB |
subtask2-20.txt | MLE | 262 ms | 924672 KB |
subtask2-21.txt | MLE | 354 ms | 924672 KB |
subtask2-22.txt | MLE | 294 ms | 924672 KB |
subtask2-23.txt | MLE | 257 ms | 924672 KB |
subtask2-24.txt | MLE | 280 ms | 924672 KB |
subtask2-25.txt | MLE | 268 ms | 924672 KB |