oj.uz

답안 #983686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983686 2024-05-15T23:09:37 Z mmk Jelly Flavours (IOI20_jelly) C++14
0 / 100
 23 ms 7004 KB 
#include "jelly.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 10;
const int MAXM = 1e4 + 10;

int dp[MAXN][MAXM];

int calc(int i, int x, int y, int N, vector<int> &a, vector<int> &b)
{
	if(x < 0 || y < 0) return -1;
	if(dp[i][x] != 0) return dp[i][x];
	if(i > N) return 0;

	int op1 = calc(i + 1, x - a[i - 1], y, N, a, b) + 1;
	int op2 = calc(i + 1, x, y - b[i - 1], N , a, b) + 1;

	dp[i][x] = max(op1,op2);
	return dp[i][x];
}


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

	sort(a.begin(),a.end());
	sort(b.begin(),b.end());

	return calc(1,x,y,N,a,b);

}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Runtime error 2 ms 860 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1628 KB Output is correct
2 Correct 5 ms 2140 KB Output is correct
3 Correct 4 ms 1880 KB Output is correct
4 Runtime error 3 ms 860 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

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