oj.uz

답안 #1094422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094422 2024-09-29T15:14:10 Z _8_8_ Cookies (JOI23_cookies) C++17
12 / 100
 1 ms 604 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];
vector<bitset<N>> dp[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) {
        int t = (i ? (s + b[i] - 1) / b[i] + 1 : 1) + 10;
        dp[i].resize(t);
        dp[i][0][0] = 1;
    }
    for(int i = 1; i <= m; i++) {
        for(int k = 1; k < dp[i].size(); 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 < dp[m].size(); 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;
}

Compilation message

cookies.cpp: In function 'void test()':
cookies.cpp:73:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<512> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int k = 1; k < dp[i].size(); k++) {
      |                        ~~^~~~~~~~~~~~~~
cookies.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<512> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i = 1; i < dp[m].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 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 Runtime error 1 ms 604 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 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 348 KB Output is correct
32 Correct 1 ms 348 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 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 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 Runtime error 1 ms 604 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 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 Runtime error 1 ms 604 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 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 Runtime error 1 ms 604 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -