oj.uz

Submission #1094404

# Submission time Handle Problem Language Result Execution time Memory
1094404 2024-09-29T14:57:33 Z _8_8_ Cookies (JOI23_cookies) C++17
6 / 100
 149 ms 126368 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 5e2 + 12, MOD = (int)1e9 + 7;
 
int n, m, b[N], s = 0, val[N], c[N], p[N];
pair<int, int> a[N];
bool dp[N][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][j][k]) {
            i--;
            continue;
        }
        assert(j - b[i] >= 0);
        j -= b[i];
        k--;
        d.push_back(b[i]);
        if(dp[i - 1][j][k]) {
            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 = n; 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 j = 1; j <= s; j++) {
            for(int k = 1; k <= s; k++) {
                dp[i][j][k] = dp[i - 1][j][k];
                if(j - b[i] >= 0 && (dp[i - 1][j - b[i]][k - 1] || dp[i][j - b[i]][k - 1]) && check(j, k)) {
                    dp[i][j][k] = 1;
                }
            }
        }
    }
    for(int i = 1; i <= s; i++) {
        if(dp[m][s][i]) {
            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;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 149 ms 126368 KB Output is correct
11 Correct 69 ms 63312 KB Output is correct
12 Correct 17 ms 11612 KB Output is correct
13 Correct 41 ms 32156 KB Output is correct
14 Correct 64 ms 57172 KB Output is correct
15 Correct 65 ms 56148 KB Output is correct
16 Correct 68 ms 62800 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 3 ms 2140 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 4 ms 2908 KB Output is correct
21 Correct 29 ms 25588 KB Output is correct
22 Correct 73 ms 63216 KB Output is correct
23 Correct 76 ms 63108 KB Output is correct
24 Correct 10 ms 8024 KB Output is correct
25 Correct 9 ms 7772 KB Output is correct
26 Correct 9 ms 8028 KB Output is correct
27 Correct 9 ms 7772 KB Output is correct
28 Correct 41 ms 37700 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 149 ms 126368 KB Output is correct
11 Correct 69 ms 63312 KB Output is correct
12 Correct 17 ms 11612 KB Output is correct
13 Correct 41 ms 32156 KB Output is correct
14 Correct 64 ms 57172 KB Output is correct
15 Correct 65 ms 56148 KB Output is correct
16 Correct 68 ms 62800 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 3 ms 2140 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 4 ms 2908 KB Output is correct
21 Correct 29 ms 25588 KB Output is correct
22 Correct 73 ms 63216 KB Output is correct
23 Correct 76 ms 63108 KB Output is correct
24 Correct 10 ms 8024 KB Output is correct
25 Correct 9 ms 7772 KB Output is correct
26 Correct 9 ms 8028 KB Output is correct
27 Correct 9 ms 7772 KB Output is correct
28 Correct 41 ms 37700 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Incorrect 0 ms 348 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 149 ms 126368 KB Output is correct
11 Correct 69 ms 63312 KB Output is correct
12 Correct 17 ms 11612 KB Output is correct
13 Correct 41 ms 32156 KB Output is correct
14 Correct 64 ms 57172 KB Output is correct
15 Correct 65 ms 56148 KB Output is correct
16 Correct 68 ms 62800 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 3 ms 2140 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 4 ms 2908 KB Output is correct
21 Correct 29 ms 25588 KB Output is correct
22 Correct 73 ms 63216 KB Output is correct
23 Correct 76 ms 63108 KB Output is correct
24 Correct 10 ms 8024 KB Output is correct
25 Correct 9 ms 7772 KB Output is correct
26 Correct 9 ms 8028 KB Output is correct
27 Correct 9 ms 7772 KB Output is correct
28 Correct 41 ms 37700 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Incorrect 0 ms 348 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 149 ms 126368 KB Output is correct
11 Correct 69 ms 63312 KB Output is correct
12 Correct 17 ms 11612 KB Output is correct
13 Correct 41 ms 32156 KB Output is correct
14 Correct 64 ms 57172 KB Output is correct
15 Correct 65 ms 56148 KB Output is correct
16 Correct 68 ms 62800 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 3 ms 2140 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 4 ms 2908 KB Output is correct
21 Correct 29 ms 25588 KB Output is correct
22 Correct 73 ms 63216 KB Output is correct
23 Correct 76 ms 63108 KB Output is correct
24 Correct 10 ms 8024 KB Output is correct
25 Correct 9 ms 7772 KB Output is correct
26 Correct 9 ms 8028 KB Output is correct
27 Correct 9 ms 7772 KB Output is correct
28 Correct 41 ms 37700 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Incorrect 0 ms 348 KB Output isn't correct
36 Halted 0 ms 0 KB -