#include "jelly.h"
#include <cstdio>
#include <cassert>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int find_maximum_unique(int x, int y, std::vector<int> arr, std::vector<int> brr) {
int n = arr.size();
int dp [n+1][x+1][y+1];
memset(dp,0,sizeof dp);
for (int i =1;i<=n;++i){
for (int j =0;j<=x;++j){
if (j-arr[i-1]==0)continue;
for (int k =0;k<=y;++k){
dp[i][j][k] = max({(j-arr[i-1]>=0)?dp[i-1][j-arr[i-1]][k]+1:0,(k-brr[i-1]>=0)?dp[i-1][j][k-brr[i-1]]+1:0,dp[i-1][j][k],dp[i][j][k]});
}
}
}
return dp[n][x][y];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1740 KB |
Output is correct |
2 |
Correct |
9 ms |
7628 KB |
Output is correct |
3 |
Correct |
10 ms |
7884 KB |
Output is correct |
4 |
Correct |
16 ms |
10956 KB |
Output is correct |
5 |
Correct |
11 ms |
8524 KB |
Output is correct |
6 |
Correct |
8 ms |
6860 KB |
Output is correct |
7 |
Correct |
11 ms |
9692 KB |
Output is correct |
8 |
Correct |
8 ms |
6732 KB |
Output is correct |
9 |
Correct |
11 ms |
9036 KB |
Output is correct |
10 |
Correct |
14 ms |
10700 KB |
Output is correct |
11 |
Correct |
2 ms |
1100 KB |
Output is correct |
12 |
Correct |
2 ms |
1740 KB |
Output is correct |
13 |
Correct |
9 ms |
7716 KB |
Output is correct |
14 |
Correct |
9 ms |
7892 KB |
Output is correct |
15 |
Correct |
13 ms |
11036 KB |
Output is correct |
16 |
Correct |
10 ms |
8524 KB |
Output is correct |
17 |
Correct |
8 ms |
6860 KB |
Output is correct |
18 |
Correct |
12 ms |
9688 KB |
Output is correct |
19 |
Correct |
8 ms |
6732 KB |
Output is correct |
20 |
Correct |
13 ms |
8948 KB |
Output is correct |
21 |
Correct |
2 ms |
1996 KB |
Output is correct |
22 |
Correct |
13 ms |
10700 KB |
Output is correct |
23 |
Correct |
2 ms |
1996 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Incorrect |
2 ms |
1484 KB |
1st lines differ - on the 1st token, expected: '8', found: '7' |
26 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1740 KB |
Output is correct |
2 |
Correct |
9 ms |
7628 KB |
Output is correct |
3 |
Correct |
10 ms |
7884 KB |
Output is correct |
4 |
Correct |
16 ms |
10956 KB |
Output is correct |
5 |
Correct |
11 ms |
8524 KB |
Output is correct |
6 |
Correct |
8 ms |
6860 KB |
Output is correct |
7 |
Correct |
11 ms |
9692 KB |
Output is correct |
8 |
Correct |
8 ms |
6732 KB |
Output is correct |
9 |
Correct |
11 ms |
9036 KB |
Output is correct |
10 |
Correct |
14 ms |
10700 KB |
Output is correct |
11 |
Correct |
2 ms |
1100 KB |
Output is correct |
12 |
Correct |
2 ms |
1740 KB |
Output is correct |
13 |
Correct |
9 ms |
7716 KB |
Output is correct |
14 |
Correct |
9 ms |
7892 KB |
Output is correct |
15 |
Correct |
13 ms |
11036 KB |
Output is correct |
16 |
Correct |
10 ms |
8524 KB |
Output is correct |
17 |
Correct |
8 ms |
6860 KB |
Output is correct |
18 |
Correct |
12 ms |
9688 KB |
Output is correct |
19 |
Correct |
8 ms |
6732 KB |
Output is correct |
20 |
Correct |
13 ms |
8948 KB |
Output is correct |
21 |
Correct |
2 ms |
1996 KB |
Output is correct |
22 |
Correct |
13 ms |
10700 KB |
Output is correct |
23 |
Correct |
2 ms |
1996 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Incorrect |
2 ms |
1484 KB |
1st lines differ - on the 1st token, expected: '8', found: '7' |
26 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
24 ms |
13296 KB |
1st lines differ - on the 1st token, expected: '689', found: '688' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2177 ms |
1938768 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1522 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1740 KB |
Output is correct |
2 |
Correct |
9 ms |
7628 KB |
Output is correct |
3 |
Correct |
10 ms |
7884 KB |
Output is correct |
4 |
Correct |
16 ms |
10956 KB |
Output is correct |
5 |
Correct |
11 ms |
8524 KB |
Output is correct |
6 |
Correct |
8 ms |
6860 KB |
Output is correct |
7 |
Correct |
11 ms |
9692 KB |
Output is correct |
8 |
Correct |
8 ms |
6732 KB |
Output is correct |
9 |
Correct |
11 ms |
9036 KB |
Output is correct |
10 |
Correct |
14 ms |
10700 KB |
Output is correct |
11 |
Correct |
2 ms |
1100 KB |
Output is correct |
12 |
Correct |
2 ms |
1740 KB |
Output is correct |
13 |
Correct |
9 ms |
7716 KB |
Output is correct |
14 |
Correct |
9 ms |
7892 KB |
Output is correct |
15 |
Correct |
13 ms |
11036 KB |
Output is correct |
16 |
Correct |
10 ms |
8524 KB |
Output is correct |
17 |
Correct |
8 ms |
6860 KB |
Output is correct |
18 |
Correct |
12 ms |
9688 KB |
Output is correct |
19 |
Correct |
8 ms |
6732 KB |
Output is correct |
20 |
Correct |
13 ms |
8948 KB |
Output is correct |
21 |
Correct |
2 ms |
1996 KB |
Output is correct |
22 |
Correct |
13 ms |
10700 KB |
Output is correct |
23 |
Correct |
2 ms |
1996 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Incorrect |
2 ms |
1484 KB |
1st lines differ - on the 1st token, expected: '8', found: '7' |
26 |
Halted |
0 ms |
0 KB |
- |