oj.uz

Submission #370731

# Submission time Handle Problem Language Result Execution time Memory
370731 2021-02-24T14:13:42 Z MilosMilutinovic Jelly Flavours (IOI20_jelly) C++14
0 / 100
 31 ms 24684 KB 
#include "jelly.h"
#include <bits/stdc++.h>

using namespace std;

void ckmax(int& a, int b) {a = max(a, b);}
void ckmin(int& a, int b) {a = min(a, b);}

const int N = 12;

int dp[N][501][501];

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = (int) a.size();
	for (int i = 0; i < n; i++) {
		for (int xx = 0; xx <= x; xx++) {
			for (int yy = 0; yy <= y; yy++) {
				dp[i][xx][yy] = 0;
			}
		}
	}
	dp[0][x][y] = 0;
	if (x >= a[0]) dp[0][x - a[0]][y] = 1;
	if (y >= b[0]) dp[0][x][y - b[0]] = 1;
	for (int i = 1; i < n; i++) {
		ckmax(dp[i][x - a[i]][y], 1);
		ckmax(dp[i][x][y - b[i]], 1);
		for (int j = 0; j < i; j++) {
			for (int xx = 0; xx <= x; xx++) {
				for (int yy = 0; yy <= y; yy++) {
					if (xx + a[i] <= x) {
						ckmax(dp[i][xx][yy], dp[j][xx + a[i]][yy] + 1);
					}
					if (yy + b[i] <= x) {
						ckmax(dp[i][xx][yy], dp[j][xx][yy + b[j]] + 1);
					}
					ckmax(dp[i][xx][yy], dp[j][xx][yy]);
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int xx = 0; xx <= x; xx++) {
			for (int yy = 0; yy <= y; yy++) {
				ans = max(ans, dp[i][xx][yy]);
			}
		}
	}
	return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 9068 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 9068 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 25 ms 24536 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 31 ms 24684 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 24556 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 9068 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -