oj.uz

답안 #983681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983681 2024-05-15T23:02:11 Z Sofiatpc Jelly Flavours (IOI20_jelly) C++14
0 / 100
 40 ms 77160 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] = 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 348 KB 1st lines differ - on the 1st token, expected: '8', found: '6'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 73304 KB Output is correct
2 Correct 15 ms 72540 KB Output is correct
3 Incorrect 10 ms 74584 KB 1st lines differ - on the 1st token, expected: '684', found: '685'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 32.0

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