# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
789225 | 2023-07-21T08:19:14 Z | LIF | Jelly Flavours (IOI20_jelly) | C++14 | 6 ms | 1236 KB |
#include "jelly.h" #include <vector> #include<bits/stdc++.h> using namespace std; int pricea[300005]; int priceb[300005]; int dp[505][505]; int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) { for(int i=0;i<a.size();i++)pricea[i+1] = a[i]; for(int i=0;i<b.size();i++)priceb[i+1] = b[i]; dp[0][0] = 0; int n = a.size(); for(int i=1;i<=n;i++) { for(int j=x;j>=1;j--) { for(int k=y;k>=1;k--) { if(j >= pricea[i])dp[j][k] = max(dp[j-pricea[i]][k] + 1, dp[j][k]); if(k >= priceb[i])dp[j][k] = max(dp[j][k-priceb[i]]+1,dp[j][k]); } } } int maxx = -1; for(int j=1;j<=x;j++) { for(int k=1;k<=y;k++) { maxx = max(maxx,dp[j][k]); } } return maxx; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1236 KB | Output is correct |
2 | Correct | 4 ms | 1108 KB | Output is correct |
3 | Correct | 4 ms | 1200 KB | Output is correct |
4 | Correct | 5 ms | 1108 KB | Output is correct |
5 | Correct | 4 ms | 1236 KB | Output is correct |
6 | Correct | 3 ms | 1108 KB | Output is correct |
7 | Correct | 4 ms | 1204 KB | Output is correct |
8 | Correct | 3 ms | 1108 KB | Output is correct |
9 | Correct | 5 ms | 1108 KB | Output is correct |
10 | Correct | 6 ms | 1072 KB | Output is correct |
11 | Correct | 1 ms | 1236 KB | Output is correct |
12 | Correct | 2 ms | 1208 KB | Output is correct |
13 | Correct | 4 ms | 1108 KB | Output is correct |
14 | Correct | 4 ms | 1108 KB | Output is correct |
15 | Correct | 5 ms | 1108 KB | Output is correct |
16 | Correct | 4 ms | 1236 KB | Output is correct |
17 | Correct | 3 ms | 1108 KB | Output is correct |
18 | Correct | 4 ms | 1108 KB | Output is correct |
19 | Correct | 4 ms | 1208 KB | Output is correct |
20 | Correct | 4 ms | 1208 KB | Output is correct |
21 | Correct | 2 ms | 436 KB | Output is correct |
22 | Correct | 5 ms | 1108 KB | Output is correct |
23 | Correct | 2 ms | 468 KB | Output is correct |
24 | Incorrect | 1 ms | 212 KB | 1st lines differ - on the 1st token, expected: '0', found: '-1' |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1236 KB | Output is correct |
2 | Correct | 4 ms | 1108 KB | Output is correct |
3 | Correct | 4 ms | 1200 KB | Output is correct |
4 | Correct | 5 ms | 1108 KB | Output is correct |
5 | Correct | 4 ms | 1236 KB | Output is correct |
6 | Correct | 3 ms | 1108 KB | Output is correct |
7 | Correct | 4 ms | 1204 KB | Output is correct |
8 | Correct | 3 ms | 1108 KB | Output is correct |
9 | Correct | 5 ms | 1108 KB | Output is correct |
10 | Correct | 6 ms | 1072 KB | Output is correct |
11 | Correct | 1 ms | 1236 KB | Output is correct |
12 | Correct | 2 ms | 1208 KB | Output is correct |
13 | Correct | 4 ms | 1108 KB | Output is correct |
14 | Correct | 4 ms | 1108 KB | Output is correct |
15 | Correct | 5 ms | 1108 KB | Output is correct |
16 | Correct | 4 ms | 1236 KB | Output is correct |
17 | Correct | 3 ms | 1108 KB | Output is correct |
18 | Correct | 4 ms | 1108 KB | Output is correct |
19 | Correct | 4 ms | 1208 KB | Output is correct |
20 | Correct | 4 ms | 1208 KB | Output is correct |
21 | Correct | 2 ms | 436 KB | Output is correct |
22 | Correct | 5 ms | 1108 KB | Output is correct |
23 | Correct | 2 ms | 468 KB | Output is correct |
24 | Incorrect | 1 ms | 212 KB | 1st lines differ - on the 1st token, expected: '0', found: '-1' |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 320 KB | 1st lines differ - on the 1st token, expected: '689', found: '-1' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1236 KB | Output is correct |
2 | Correct | 4 ms | 1108 KB | Output is correct |
3 | Correct | 4 ms | 1200 KB | Output is correct |
4 | Correct | 5 ms | 1108 KB | Output is correct |
5 | Correct | 4 ms | 1236 KB | Output is correct |
6 | Correct | 3 ms | 1108 KB | Output is correct |
7 | Correct | 4 ms | 1204 KB | Output is correct |
8 | Correct | 3 ms | 1108 KB | Output is correct |
9 | Correct | 5 ms | 1108 KB | Output is correct |
10 | Correct | 6 ms | 1072 KB | Output is correct |
11 | Correct | 1 ms | 1236 KB | Output is correct |
12 | Correct | 2 ms | 1208 KB | Output is correct |
13 | Correct | 4 ms | 1108 KB | Output is correct |
14 | Correct | 4 ms | 1108 KB | Output is correct |
15 | Correct | 5 ms | 1108 KB | Output is correct |
16 | Correct | 4 ms | 1236 KB | Output is correct |
17 | Correct | 3 ms | 1108 KB | Output is correct |
18 | Correct | 4 ms | 1108 KB | Output is correct |
19 | Correct | 4 ms | 1208 KB | Output is correct |
20 | Correct | 4 ms | 1208 KB | Output is correct |
21 | Correct | 2 ms | 436 KB | Output is correct |
22 | Correct | 5 ms | 1108 KB | Output is correct |
23 | Correct | 2 ms | 468 KB | Output is correct |
24 | Incorrect | 1 ms | 212 KB | 1st lines differ - on the 1st token, expected: '0', found: '-1' |
25 | Halted | 0 ms | 0 KB | - |