Submission #988043

#	Time	Username	Problem	Language	Result	Execution time	Memory
988043		activedeltorre	Shopping Plans (CCO20_day2problem3)	C++17	25 / 25	181 ms	46080 KiB

Main

///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
int inf=1000000007;
struct node
{
    long long  sum;
    int layer,bitipref,lst,rghtbord,biti;
};
struct  cmp
{
    bool operator()(node a,node b)
        {return a.sum>b.sum;}
};
priority_queue<node,vector<node>,cmp>pq;
vector<int>adj[200005];
int cost[200005];
int ord[200005];
bool cmp2(int a,int b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
int init[200005];
int g,g2;
void special(node curr)
{
    g2=ord[curr.layer+1];
    curr.lst=0;
    curr.sum+=init[g2];
    curr.layer++;
    curr.biti=1;
    curr.bitipref=0;
    curr.rghtbord=adj[g2].size()-1;
    pq.push(curr);
}
void skip(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g]==0)
       curr.sum-=adj[g][curr.lst];
    else
        curr.sum+=adj[g][curr.lst-1]-adj[g][curr.lst];
    if(x[g2]==0)
        {special(curr);
        return;
        }
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];
    pq.push(curr);
}
void godown(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g2]==0)
         {special(curr);return;}
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];
    pq.push(curr);
}
void shift(node curr)
{
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    pq.push(curr);
}
void fixborderandshift(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=curr.bitipref;
    curr.bitipref--;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    pq.push(curr);
}
void fixborderandcreate(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum+=init[g];
    pq.push(curr);
}
int main()
{
    int  n,m,k,i,a,b,j,vkuk;
    long long sum=0;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>m>>k;
    for(i=1; i<=n; i++)
    {
        cin>>a>>b;
        adj[a].push_back(b);
    }
    for(i=1; i<=m; i++)
    {
        cin>>x[i]>>y[i];
        if(y[i]==0)
            cost[i]=inf;
        else
        {
            sort(adj[i].begin(),adj[i].end());
            if(adj[i].size()<x[i])
            {
                for(j=1; j<=k; j++)
                    cout<<-1<<'\n';
                return 0;
            }
            if(x[i]==0)
            {
                if(adj[i].size()==0)
                    cost[i]=inf;
                else
                {
                    init[i]=adj[i][0];
                    cost[i]=adj[i][0];
                }
            }
            else
            {
                vkuk=adj[i][0];
                init[i]=adj[i][0];
                for(j=0; j<adj[i].size(); j++)
                {
                    if(j+1<=x[i])
                        sum+=adj[i][j];
                    adj[i][j]-=vkuk;
                }
                if(adj[i].size()==x[i])
                    cost[i]=inf;
                else
                    cost[i]=adj[i][x[i]]-adj[i][x[i]-1];
            }
        }
        ord[i-1]=i;
    }
    sort(ord,ord+m,cmp2);
    m--;
    for(i=0; i<=m; i++)
    {
        if(cost[ord[i]]==inf)
        {
            m=i-1;
            break;
        }
    }
    node curr,curr2;
    cout<<sum<<'\n';
    k--;
    if(m>=0)
    {
        int g3=ord[0];
        if(x[g3]==0)
        {
            curr.layer=0;
            curr.sum=adj[g3][0];
            curr.bitipref=0;
            curr.lst=0;
            curr.biti=1;
            curr.rghtbord=adj[g3].size()-1;
            pq.push(curr);
        }
        else
        {
            curr.layer=0;
            curr.sum=adj[g3][x[g3]]-adj[g3][x[g3]-1];
            curr.bitipref=x[g3]-1;
            curr.lst=x[g3];
            curr.rghtbord=adj[g3].size()-1;
            curr.biti=x[g3];
            pq.push(curr);
        }
        while(pq.size() && k)
        {
            curr=pq.top();
            pq.pop();
            k--;
            cout<<curr.sum+sum<<'\n';
            g3=ord[curr.layer];
            if(x[g3]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0)
               skip(curr);
            else if(curr.lst==x[g3] && curr.bitipref==x[g3]-1 && curr.biti==x[g3] && curr.layer+1<=m)
                skip(curr);
            if(curr.lst+1<=curr.rghtbord)
                shift(curr);
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
                fixborderandshift(curr);
            else if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g3])
                fixborderandcreate(curr);
            if(curr.layer+1<=m)
                godown(curr);
        }
    }
    while(k--)
        cout<<-1<<'\n';
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:121:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  121 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:141:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:147:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  147 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:165:15: warning: unused variable 'curr2' [-Wunused-variable]
  165 |     node curr,curr2;
      |               ^~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5