oj.uz

답안 #983682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983682 2024-05-15T23:04:26 Z Sofiatpc Jelly Flavours (IOI20_jelly) C++14
9 / 100
 37 ms 78164 KB 
#include "jelly.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2005, MAX = 1e4+5;
int dp[MAXN][MAX];

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();

	for(int i = n; i >= 1; i--)
		for(int j = 0; j <= x; j++){
			if(b[i-1] == 0)dp[i][j] = dp[i+1][j]+1;
			else{
				dp[i][j] = dp[i+1][j];
				if(j >= a[i-1])dp[i][j] = max(dp[i+1][j], dp[i+1][j-a[i-1]]+1);
			}
		}
	return dp[1][x];
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '8', found: '5'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '8', found: '5'
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 76416 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 10 ms 76380 KB Output is correct
4 Correct 11 ms 74588 KB Output is correct
5 Correct 34 ms 75360 KB Output is correct
6 Correct 24 ms 77408 KB Output is correct
7 Correct 25 ms 76884 KB Output is correct
8 Correct 12 ms 74588 KB Output is correct
9 Correct 36 ms 77908 KB Output is correct
10 Correct 18 ms 76636 KB Output is correct
11 Correct 24 ms 77936 KB Output is correct
12 Correct 26 ms 76616 KB Output is correct
13 Correct 21 ms 75612 KB Output is correct
14 Correct 14 ms 74584 KB Output is correct
15 Correct 27 ms 76892 KB Output is correct
16 Correct 21 ms 76728 KB Output is correct
17 Correct 22 ms 76412 KB Output is correct
18 Correct 24 ms 75612 KB Output is correct
19 Correct 23 ms 76492 KB Output is correct
20 Correct 13 ms 74808 KB Output is correct
21 Correct 12 ms 76380 KB Output is correct
22 Correct 14 ms 76636 KB Output is correct
23 Correct 12 ms 76380 KB Output is correct
24 Correct 11 ms 74588 KB Output is correct
25 Correct 28 ms 75356 KB Output is correct
26 Correct 26 ms 77396 KB Output is correct
27 Correct 27 ms 76884 KB Output is correct
28 Correct 12 ms 74588 KB Output is correct
29 Correct 34 ms 77908 KB Output is correct
30 Correct 20 ms 76636 KB Output is correct
31 Correct 26 ms 78160 KB Output is correct
32 Correct 20 ms 76636 KB Output is correct
33 Correct 21 ms 75600 KB Output is correct
34 Correct 13 ms 74660 KB Output is correct
35 Correct 33 ms 76676 KB Output is correct
36 Correct 20 ms 76892 KB Output is correct
37 Correct 22 ms 76380 KB Output is correct
38 Correct 25 ms 75644 KB Output is correct
39 Correct 33 ms 76372 KB Output is correct
40 Correct 13 ms 74888 KB Output is correct
41 Correct 12 ms 76380 KB Output is correct
42 Correct 15 ms 76632 KB Output is correct
43 Correct 10 ms 76380 KB Output is correct
44 Correct 11 ms 74428 KB Output is correct
45 Correct 29 ms 75348 KB Output is correct
46 Correct 27 ms 77444 KB Output is correct
47 Correct 27 ms 76960 KB Output is correct
48 Correct 12 ms 74736 KB Output is correct
49 Correct 36 ms 77904 KB Output is correct
50 Correct 18 ms 76636 KB Output is correct
51 Correct 28 ms 78160 KB Output is correct
52 Correct 20 ms 76620 KB Output is correct
53 Correct 21 ms 75608 KB Output is correct
54 Correct 14 ms 74588 KB Output is correct
55 Correct 25 ms 76892 KB Output is correct
56 Correct 23 ms 76892 KB Output is correct
57 Correct 19 ms 76376 KB Output is correct
58 Correct 24 ms 75600 KB Output is correct
59 Correct 24 ms 76484 KB Output is correct
60 Correct 13 ms 74844 KB Output is correct
61 Correct 12 ms 76360 KB Output is correct
62 Correct 15 ms 76584 KB Output is correct
63 Correct 10 ms 76380 KB Output is correct
64 Correct 11 ms 74564 KB Output is correct
65 Correct 30 ms 75312 KB Output is correct
66 Correct 24 ms 77392 KB Output is correct
67 Correct 26 ms 76748 KB Output is correct
68 Correct 12 ms 74588 KB Output is correct
69 Correct 37 ms 77748 KB Output is correct
70 Correct 18 ms 76884 KB Output is correct
71 Correct 24 ms 77952 KB Output is correct
72 Correct 20 ms 76876 KB Output is correct
73 Correct 21 ms 75652 KB Output is correct
74 Correct 13 ms 74664 KB Output is correct
75 Correct 25 ms 76744 KB Output is correct
76 Correct 22 ms 76724 KB Output is correct
77 Correct 26 ms 76388 KB Output is correct
78 Correct 24 ms 75612 KB Output is correct
79 Correct 22 ms 76368 KB Output is correct
80 Correct 14 ms 74844 KB Output is correct
81 Correct 13 ms 76376 KB Output is correct
82 Correct 14 ms 76636 KB Output is correct
83 Correct 10 ms 76380 KB Output is correct
84 Correct 11 ms 74588 KB Output is correct
85 Correct 27 ms 75360 KB Output is correct
86 Correct 24 ms 77404 KB Output is correct
87 Correct 26 ms 76784 KB Output is correct
88 Correct 11 ms 74748 KB Output is correct
89 Correct 33 ms 77908 KB Output is correct
90 Correct 18 ms 76644 KB Output is correct
91 Correct 30 ms 78164 KB Output is correct
92 Correct 24 ms 76632 KB Output is correct
93 Correct 21 ms 75612 KB Output is correct
94 Correct 13 ms 74588 KB Output is correct
95 Correct 25 ms 76880 KB Output is correct
96 Correct 21 ms 76892 KB Output is correct
97 Correct 20 ms 76380 KB Output is correct
98 Correct 23 ms 75616 KB Output is correct
99 Correct 23 ms 76488 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 76112 KB 1st lines differ - on the 1st token, expected: '62', found: '60'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 77140 KB 1st lines differ - on the 1st token, expected: '154', found: '146'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '8', found: '5'
2 Halted 0 ms 0 KB -