# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
672909 |
2022-12-19T01:39:50 Z |
mmk |
Jelly Flavours (IOI20_jelly) |
C++14 |
|
623 ms |
1046660 KB |
#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 510;
const int INF = 0x3f3f3f3f;
int dp[MAXN][MAXN][MAXN];
int n, a[MAXN], b[MAXN];
int calc(int i, int x, int y)
{
if(i == 0) return 0;
if(dp[i][x][y] != -1) return dp[i][x][y];
int uga, buga, duga;
uga = 0;
buga = 0;
if(x >= a[i]) uga = calc(i-1,x-a[i],y);
if (y >= b[i]) buga = calc(i-1, x, y - b[i]);
duga = calc(i-1,x,y);
return dp[i][x][y] = max(uga,max(buga,duga));
}
int find_maximum_unique(int _x, int _y, vector<int> _a, vector<int> _b)
{
n = _a.size();
for(int i = 1; i <= n; i++){
a[i] = _a[i - 1];
b[i] = _b[i - 1];
}
memset(dp, -1, sizeof(dp));
return calc(n, _x, _y);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
180 ms |
519444 KB |
1st lines differ - on the 1st token, expected: '8', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
180 ms |
519444 KB |
1st lines differ - on the 1st token, expected: '8', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
623 ms |
1046592 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
578 ms |
1046660 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
576 ms |
1046540 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
180 ms |
519444 KB |
1st lines differ - on the 1st token, expected: '8', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |