Submission #789237

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
789237	2023-07-21T08:33:37 Z	박영우(#10045)	Cookies (JOI23_cookies)	C++17	0 / 100	5 ms	1620 KB

cookies

#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 600
#define MAXS 20
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
int A[MAX];
int cnt[MAX];
int B[MAX];
int dp[MAX][MAX];
vector<int> ansv;
int N, M;
void print() {
	vector<int> v;
	int i;
	for (i = 1; i <= N; i++) v.push_back(i);
	cout << ansv.size() << ln;
	for (auto b : ansv) {
		cout << b << bb;
		sort(v.begin(), v.end(), [&](int i, int j) {return A[i] > A[j]; });
		for (i = 0; i < b; i++) {
			cout << v[i] << bb;
			A[v[i]]--;
		}
		cout << ln;
	}
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> N;
	int i, j, k;
	int S = 0;
	for (i = 1; i <= N; i++) {
		cin >> A[i];
		S += A[i];
		for (j = 1; j <= A[i]; j++) cnt[j]++;
	}
	for (i = 1; i <= S; i++) cnt[i] += cnt[i - 1];
	cin >> M;
	for (i = 1; i <= M; i++) cin >> B[i];
	M++;
	sort(B + 1, B + M + 1);
	memset(dp, -1, sizeof(dp));
	dp[0][0] = 1e9;
	for (i = 1; i <= S; i++) {
		for (j = 0; j <= cnt[i - 1]; j++) {
			if (!~dp[i - 1][j]) continue;
			for (k = 1; k <= M && B[k] <= dp[i - 1][j]; k++) if (j + B[k] <= cnt[i]) dp[i][j + B[k]] = max(dp[i][j + B[k]], B[k]);
		}
	}
	if (!~dp[S][S]) {
		cout << -1;
		return 0;
	}
	int n = S;
	for (i = S; i >= 1; i--) {
		int path = dp[i][n];
		n -= path;
		if (path) ansv.push_back(path);
	}
	sort(ansv.begin(), ansv.end(), [&](int i, int j) {return i > j; });
	print();
}

Subtask #1

0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	1620 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1620 KB	Output is correct
2	Correct	1 ms	1620 KB	Output is correct
3	Correct	1 ms	1620 KB	Output is correct
4	Correct	2 ms	1620 KB	Output is correct
5	Correct	5 ms	1620 KB	Output is correct
6	Correct	2 ms	1620 KB	Output is correct
7	Correct	1 ms	1620 KB	Output is correct
8	Correct	1 ms	1620 KB	Output is correct
9	Runtime error	1 ms	468 KB	Execution killed with signal 11
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	1620 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	1620 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	1620 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	1620 KB	Output isn't correct
2	Halted	0 ms	0 KB	-