oj.uz

Submission #789335

# Submission time Handle Problem Language Result Execution time Memory
789335 2023-07-21T09:23:19 Z 박영우(#10045) Cookies (JOI23_cookies) C++17
0 / 100
 13 ms 36180 KB 
#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 3030
#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;
int bdp[MAX];
void print() {
	vector<int> v;
	vector<vector<int>> res;
	int i;
	for (i = 1; i <= N; i++) v.push_back(i);
	for (auto b : ansv) {
		vector<int> nv;
		sort(v.begin(), v.end(), [&](int i, int j) {return A[i] > A[j]; });
		for (i = 0; i < b; i++) {
			nv.push_back(v[i]);
			A[v[i]]--;
		}
		res.push_back(nv);
	}
	for (i = 1; i <= N; i++) if (A[i]) {
		cout << -1 << ln;
		exit(0);
	}
	cout << res.size() << ln;
	for (auto& v : res) {
		cout << v.size() << bb;
		for (auto x : v) cout << x << bb;
		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]++;
	}
	cin >> M;
	for (i = 1; i <= M; i++) cin >> B[i];
	if (M == 1) {
		if (S % B[1]) {
			cout << -1 << ln;
			return 0;
		}
		ansv = vector<int>(S / B[1], B[1]);
		print();
		return 0;
	}
	memset(bdp, -1, sizeof(bdp));
	bdp[0] = 0;
	for (i = M; i >= 1; i--) for (j = 0; j + B[i] <= S; j++) if (~bdp[j]) bdp[j + B[i]] = j;
	int p = 0;
	for (i = 1; i <= M; i++) if (!bdp[B[i]]) B[++p] = B[i];
	M = p;
	for (i = 1; i <= S; i++) cnt[i] += cnt[i - 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; k++) if (j + B[k] <= cnt[i] && B[k] <= dp[i - 1][j]) dp[i][j + B[k]] = max(dp[i][j + B[k]], B[k]);
		}
	}
	int loc;
	for (i = 1; i <= S; i++) if (~dp[i][S]) break;
	loc = i;
	if (loc > S) {
		cout << -1;
		return 0;
	}
	int n = S;
	for (i = loc; i >= 1; i--) {
		int path = dp[i][n];
		assert(path != -1);
		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 13 ms 36180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 45.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 15.0

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