oj.uz

Submission #925422

# Submission time Handle Problem Language Result Execution time Memory
925422 2024-02-11T15:13:40 Z ttamx Cookies (JOI23_cookies) C++14
0 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>

using namespace std;

const int N=20;

int n,m,sum;
int a[N],b[N],cnt[N];
bitset<N> dp[N],filt[N];

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        sum+=a[i];
        cnt[a[i]]++;
    }
    cin >> m;
    for(int i=1;i<=m;i++)cin >> b[i];
    reverse(b+1,b+m+1);
    filt[0][0]=1;
    for(int i=1,k=0,sz=n;i<=sum;i++){
        filt[i]=filt[i-1];
        for(int j=0;j<sz;j++)filt[i][++k]=1;
        sz-=cnt[i];
    }
    dp[0][0]=1;
    for(int i=1;i<=m;i++){
        for(int j=1;j*b[i]<=sum;j++){
            dp[j]|=dp[j-1]<<b[i]&filt[j];
        }
    }
    int st=0;
    while(st<=sum&&!dp[st][sum])st++;
    if(st>sum)cout << -1,exit(0);
    priority_queue<pair<int,int>> pq;
    for(int i=1;i<=n;i++)pq.emplace(a[i],i);
    cout << st << "\n";
    for(int i=st,j=sum,p=0;i>0;i--){
        while(j<b[p]||!dp[i-1][j-b[p]])p++;
        j-=b[p];
        cout << b[p] << " ";
        vector<pair<int,int>> res;
        for(int t=1;t<=b[p];t++){
            auto [sz,id]=pq.top();
            pq.pop();
            cout << id << " \n"[t==b[p]];
            if(--sz)res.emplace_back(sz,id);
        }
        for(auto v:res)pq.emplace(v);
    }
}

Compilation message

cookies.cpp: In function 'int main()':
cookies.cpp:46:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |             auto [sz,id]=pq.top();
      |                  ^

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 460 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 456 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 Runtime error 1 ms 604 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -