# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316275 | 2020-10-25T18:55:29 Z | lauran | Jelly Flavours (IOI20_jelly) | C++14 | 109 ms | 131344 KB |
#include <bits/stdc++.h> #include "jelly.h" using namespace std; int find_maximum_unique(int x, int y, vector <int> a, vector <int> b) { int n = a.size(); if (x <= 500 && y <= 500 && n <= 200) { // subtask 1, 2 int dp[n + 10][x + 10][y + 10] = {0}; for (int i = 1; i <= n; i++) { for (int xx = 0; xx <= x; xx++) for (int yy = 0; yy <= y; yy++) { dp[i][xx][yy] = dp[i - 1][xx][yy]; if (xx >= a[i]) dp[i][xx][yy] = max(dp[i][xx][yy], dp[i - 1][xx - a[i - 1]][yy] + 1); if (yy >= b[i]) dp[i][xx][yy] = max(dp[i][xx][yy], dp[i - 1][xx][yy - b[i - 1]] + 1); } } int ans = dp[n][0][0]; for (int xx = 0; xx <= x; xx++) for (int yy = 0; yy <= y; yy++) ans = max(ans, dp[n][xx][yy]); return ans; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3328 KB | Output is correct |
2 | Incorrect | 15 ms | 13696 KB | 1st lines differ - on the 1st token, expected: '7', found: '9' |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3328 KB | Output is correct |
2 | Incorrect | 15 ms | 13696 KB | 1st lines differ - on the 1st token, expected: '7', found: '9' |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 109 ms | 131344 KB | 1st lines differ - on the 1st token, expected: '689', found: '1107' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3328 KB | Output is correct |
2 | Incorrect | 15 ms | 13696 KB | 1st lines differ - on the 1st token, expected: '7', found: '9' |
3 | Halted | 0 ms | 0 KB | - |