Submission #891984

#	Time	Username	Problem	Language	Result	Execution time	Memory
891984		alexander707070	Cookies (JOI23_cookies)	C++14	6 / 100	857 ms	1048576 KiB

cookies

#include<bits/stdc++.h>
#define MAXN 15007
using namespace std;

int n,m,pt,total;
int a[MAXN],b[MAXN];

vector< pair<int,int> > v;
vector< vector<int> > sol;

bool li[MAXN][MAXN];
int dp[MAXN][MAXN];

int ff(int pos,int sum){
    if(sum<0)return 1000000;
    if(sum==0 and pos==0)return 0;
    else if(pos==0)return 1000000;

    if(li[pos][sum])return dp[pos][sum];
    li[pos][sum]=true;

    dp[pos][sum]=min(ff(pos-1,sum),ff(pos,sum-b[pos])+1);

    return dp[pos][sum];
}

int main(){

    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        total+=a[i];
        v.push_back({a[i],i});
    }
    reverse(v.begin(),v.end());

    cin>>m;
    for(int i=1;i<=m;i++){
        cin>>b[i];
    }

    if(ff(m,total)>total){
        cout<<"-1\n";
        return 0;
    }

    pt=m;
    while(!v.empty()){
        while(pt>=1 and (b[pt]>v.size() or ff(pt,total)!=ff(pt,total-b[pt])+1))pt--;

        sol.push_back({});

        for(int i=0;i<b[pt];i++){
            v[i].first--;
            sol.back().push_back(v[i].second);
        }
        total-=b[pt];

        sort(v.begin(),v.end());
        reverse(v.begin(),v.end());

        while(!v.empty() and v.back().first==0)v.pop_back();
    }

    cout<<sol.size()<<"\n";
    for(int i=0;i<sol.size();i++){
        cout<<sol[i].size()<<" ";
        for(int f:sol[i])cout<<f<<" ";
        cout<<"\n";
    }


    return 0;
}

Compilation message (stderr)

cookies.cpp: In function 'int main()':
cookies.cpp:49:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         while(pt>=1 and (b[pt]>v.size() or ff(pt,total)!=ff(pt,total-b[pt])+1))pt--;
      |                          ~~~~~^~~~~~~~~
cookies.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i=0;i<sol.size();i++){
      |                 ~^~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 45
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15