| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1094415 | _8_8_ | Cookies (JOI23_cookies) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e3 + 12, MOD = (int)1e9 + 7;
int n, m, b[N], s = 0, val[N], c[N], p[N];
pair<int, int> a[N];
bitset<N> dp[N][N];
bool check(int j, int k) {
return (val[k] >= j);
}
void out(int res) {
vector<int> d;
int i = m, j = s, k = res;
while(j) {
if(dp[i - 1][k][j]) {
i--;
continue;
}
assert(j - b[i] >= 0);
j -= b[i];
k--;
d.push_back(b[i]);
if(dp[i - 1][k][j]) {
i--;
}
}
cout << res << '\n';
assert((int)d.size() == res);
for(int i:d) {
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
cout << i << ' ';
for(int j = 1; j <= i; j++) {
a[j].first--;
cout << a[j].second << ' ';
}
cout << '\n';
}
}
void test() {
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i].first, c[i] = a[i].first;
s += c[i];
a[i].second = i;
}
sort(a + 1, a + n + 1);
sort(c + 1, c + n + 1);
for(int i = 1; i <= n; i++) {
p[i] = p[i - 1] + c[i];
}
int it = n;
for(int i = s; i >= 1; i--) {
while(it >= 1 && c[it] >= i) {
it--;
}
val[i] = p[it] + (n - it) * 1ll * i;
}
cin >> m;
for(int i = 1; i <= m; i++) {
cin >> b[i];
}
reverse(b + 1, b + m + 1);
for(int i = 0; i <= m; ++i) {
dp[i][0][0] = 1;
}
for(int i = 1; i <= m; i++) {
for(int k = 1; k <= s; k++) {
for(int j = k * b[i]; j <= s; j++) {
dp[i][k][j] = dp[i - 1][k][j];
if(j - b[i] >= 0 && (dp[i - 1][k - 1][j - b[i]] || dp[i][k - 1][j - b[i]]) && check(j, k)) {
dp[i][k][j] = 1;
}
}
}
}
for(int i = 1; i <= s; i++) {
if(dp[m][i][s]) {
out(i);
return;
}
}
cout << -1 << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--)
test();
return 0;
}