oj.uz

Submission #836861

# Submission time Handle Problem Language Result Execution time Memory
836861 2023-08-24T16:24:47 Z alvingogo Cookies (JOI23_cookies) C++14
19 / 100
 53 ms 84556 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

int main(){
    AquA;
    int n;
    cin >> n;
    vector<int> a(n);
    int s=0;
    const int gd=15005;
    vector<int> c(gd);
    for(int i=0;i<n;i++){
        cin >> a[i];
        c[a[i]]++;
        s+=a[i];
    }
    for(int i=gd-2;i>=1;i--){
        c[i]+=c[i+1];
    }
    for(int i=2;i<gd;i++){
        c[i]+=c[i-1];
    }
    int m;
    cin >> m;
    vector<int> b(m+1);
    for(int i=1;i<=m;i++){
        cin >> b[i];
    }
    sort(b.begin()+1,b.end(),greater<int>());
    vector<vector<bitset<gd> > > bt(gd+1);
    vector<bitset<gd> > lp(gd);
    for(int i=1;i<gd;i++){
        lp[i]|=lp[i-1];
        for(int j=c[i-1]+1;j<=c[i];j++){
            lp[i][j]=1;
        }
    }
    bt[0].resize(m+1);
    bt[0][0][0]=1;
    for(int i=0;i<gd;i++){
        for(int j=0;j+1<bt[i].size();j++){
            bt[i][j+1]|=bt[i][j];
        }
        int cnt=0;
        for(int j=1;j<=m && (i+1)*b[j]<gd;j++){
            cnt=j;
        }
        bt[i+1].resize(cnt+1);
        for(int j=1;j<bt[i+1].size();j++){
            bt[i+1][j]|=(bt[i][j]<<b[j])&lp[i+1];
        }
    }
    for(int i=0;i<gd;i++){
        for(int j=0;j<bt[i].size();j++){
            if(bt[i][j][s]){
                vector<int> k;
                while(i>0 && j>0){
                    if(i>0 && bt[i-1][j][s-b[j]]){
                        k.push_back(b[j]);
                        s-=b[j];
                        i--;
                    }
                    else{
                        j--;
                    }
                }
                p_q<pair<int,int> > pq;
                for(int f=0;f<n;f++){
                    pq.push({a[f],f});
                }
                cout << k.size() << "\n";
                for(auto h:k){
                    vector<pair<int,int> > d;
                    cout << h << ' ';
                    for(int p=0;p<h;p++){
                        d.push_back(pq.top());
                        pq.pop();
                    }
                    for(auto z:d){
                        pq.push({z.fs-1,z.sc});
                        cout << z.sc+1 << " ";
                    }
                    cout << "\n";
                }
                return 0;
            }
        }
    }
    cout << -1 << "\n";
    return 0;
}

Compilation message

cookies.cpp: In function 'int main()':
cookies.cpp:46:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<15005> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int j=0;j+1<bt[i].size();j++){
      |                     ~~~^~~~~~~~~~~~~
cookies.cpp:54:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<15005> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for(int j=1;j<bt[i+1].size();j++){
      |                     ~^~~~~~~~~~~~~~~
cookies.cpp:59:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<15005> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for(int j=0;j<bt[i].size();j++){
      |                     ~^~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83660 KB Output is correct
2 Correct 38 ms 83696 KB Output is correct
3 Correct 40 ms 83660 KB Output is correct
4 Correct 33 ms 69844 KB Output is correct
5 Correct 39 ms 83608 KB Output is correct
6 Correct 32 ms 74344 KB Output is correct
7 Correct 31 ms 72588 KB Output is correct
8 Correct 39 ms 83760 KB Output is correct
9 Correct 22 ms 56032 KB Output is correct
10 Correct 41 ms 84556 KB Output is correct
11 Correct 33 ms 70356 KB Output is correct
12 Correct 40 ms 83056 KB Output is correct
13 Incorrect 28 ms 63272 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 62972 KB Output is correct
2 Correct 43 ms 83728 KB Output is correct
3 Correct 42 ms 83744 KB Output is correct
4 Correct 35 ms 69844 KB Output is correct
5 Correct 45 ms 83664 KB Output is correct
6 Correct 25 ms 56088 KB Output is correct
7 Correct 52 ms 83680 KB Output is correct
8 Correct 43 ms 83684 KB Output is correct
9 Correct 44 ms 83692 KB Output is correct
10 Correct 46 ms 83904 KB Output is correct
11 Correct 43 ms 83660 KB Output is correct
12 Correct 36 ms 69792 KB Output is correct
13 Correct 34 ms 69828 KB Output is correct
14 Correct 35 ms 65212 KB Output is correct
15 Correct 36 ms 69820 KB Output is correct
16 Correct 33 ms 58836 KB Output is correct
17 Correct 27 ms 58784 KB Output is correct
18 Correct 32 ms 62928 KB Output is correct
19 Correct 35 ms 65360 KB Output is correct
20 Correct 31 ms 56396 KB Output is correct
21 Correct 26 ms 56224 KB Output is correct
22 Correct 35 ms 56264 KB Output is correct
23 Correct 26 ms 56108 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 83684 KB Output is correct
2 Correct 29 ms 62932 KB Output is correct
3 Correct 44 ms 83752 KB Output is correct
4 Correct 44 ms 83644 KB Output is correct
5 Correct 34 ms 69852 KB Output is correct
6 Correct 42 ms 83572 KB Output is correct
7 Correct 36 ms 74384 KB Output is correct
8 Correct 34 ms 72536 KB Output is correct
9 Correct 48 ms 83700 KB Output is correct
10 Correct 43 ms 83772 KB Output is correct
11 Correct 35 ms 69844 KB Output is correct
12 Correct 33 ms 69892 KB Output is correct
13 Correct 31 ms 65228 KB Output is correct
14 Correct 34 ms 69796 KB Output is correct
15 Correct 45 ms 83520 KB Output is correct
16 Correct 38 ms 74404 KB Output is correct
17 Correct 45 ms 83672 KB Output is correct
18 Correct 33 ms 69844 KB Output is correct
19 Correct 37 ms 76724 KB Output is correct
20 Correct 39 ms 76716 KB Output is correct
21 Correct 35 ms 72696 KB Output is correct
22 Correct 38 ms 72556 KB Output is correct
23 Correct 35 ms 72520 KB Output is correct
24 Correct 38 ms 76716 KB Output is correct
25 Correct 38 ms 69844 KB Output is correct
26 Correct 33 ms 69796 KB Output is correct
27 Correct 37 ms 72632 KB Output is correct
28 Correct 53 ms 79028 KB Output is correct
29 Correct 41 ms 69776 KB Output is correct
30 Correct 33 ms 69816 KB Output is correct
31 Correct 37 ms 79696 KB Output is correct
32 Correct 36 ms 69832 KB Output is correct
33 Correct 29 ms 69808 KB Output is correct
34 Correct 32 ms 71692 KB Output is correct
35 Correct 35 ms 78540 KB Output is correct
36 Correct 38 ms 83532 KB Output is correct
37 Correct 31 ms 69852 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83660 KB Output is correct
2 Correct 38 ms 83696 KB Output is correct
3 Correct 40 ms 83660 KB Output is correct
4 Correct 33 ms 69844 KB Output is correct
5 Correct 39 ms 83608 KB Output is correct
6 Correct 32 ms 74344 KB Output is correct
7 Correct 31 ms 72588 KB Output is correct
8 Correct 39 ms 83760 KB Output is correct
9 Correct 22 ms 56032 KB Output is correct
10 Correct 41 ms 84556 KB Output is correct
11 Correct 33 ms 70356 KB Output is correct
12 Correct 40 ms 83056 KB Output is correct
13 Incorrect 28 ms 63272 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83660 KB Output is correct
2 Correct 38 ms 83696 KB Output is correct
3 Correct 40 ms 83660 KB Output is correct
4 Correct 33 ms 69844 KB Output is correct
5 Correct 39 ms 83608 KB Output is correct
6 Correct 32 ms 74344 KB Output is correct
7 Correct 31 ms 72588 KB Output is correct
8 Correct 39 ms 83760 KB Output is correct
9 Correct 22 ms 56032 KB Output is correct
10 Correct 41 ms 84556 KB Output is correct
11 Correct 33 ms 70356 KB Output is correct
12 Correct 40 ms 83056 KB Output is correct
13 Incorrect 28 ms 63272 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83660 KB Output is correct
2 Correct 38 ms 83696 KB Output is correct
3 Correct 40 ms 83660 KB Output is correct
4 Correct 33 ms 69844 KB Output is correct
5 Correct 39 ms 83608 KB Output is correct
6 Correct 32 ms 74344 KB Output is correct
7 Correct 31 ms 72588 KB Output is correct
8 Correct 39 ms 83760 KB Output is correct
9 Correct 22 ms 56032 KB Output is correct
10 Correct 41 ms 84556 KB Output is correct
11 Correct 33 ms 70356 KB Output is correct
12 Correct 40 ms 83056 KB Output is correct
13 Incorrect 28 ms 63272 KB Output isn't correct
14 Halted 0 ms 0 KB -