oj.uz

Submission #987936

# Submission time Handle Problem Language Result Execution time Memory
987936 2024-05-23T19:38:54 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++11
25 / 25
 270 ms 49832 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;int inf=1e9+10;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],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}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];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}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];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;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];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;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(int 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{int vkuk=adj[i][0];init[i]=adj[i][0];for(int 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.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:8:359: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    8 | using namespace std;int inf=1e9+10;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],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}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];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}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];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;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];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;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(int 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{int vkuk=adj[i][0];init[i]=adj[i][0];for(int 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.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                       ^
Main.cpp: In function 'node godown(node)':
Main.cpp:8:917: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    8 | using namespace std;int inf=1e9+10;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],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}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];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}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];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;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];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;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(int 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{int vkuk=adj[i][0];init[i]=adj[i][0];for(int 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.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                     ^
Main.cpp: In function 'int main()':
Main.cpp:8:1866: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 | using namespace std;int inf=1e9+10;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],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}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];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}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];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;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];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;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(int 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{int vkuk=adj[i][0];init[i]=adj[i][0];for(int 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.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             ~~~~~~~~~~~~~^~~~~
Main.cpp:8:2068: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | using namespace std;int inf=1e9+10;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],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}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];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}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];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;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];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;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(int 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{int vkuk=adj[i][0];init[i]=adj[i][0];for(int 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.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   ~^~~~~~~~~~~~~~
Main.cpp:8:2152: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 | using namespace std;int inf=1e9+10;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],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8660 KB Output is correct
2 Correct 4 ms 6608 KB Output is correct
3 Correct 5 ms 8660 KB Output is correct
4 Correct 5 ms 6612 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 6492 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 5 ms 5208 KB Output is correct
12 Correct 5 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 6 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5544 KB Output is correct
17 Correct 7 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 5 ms 5512 KB Output is correct
20 Correct 5 ms 5720 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5592 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 7 ms 5592 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 26040 KB Output is correct
2 Correct 68 ms 23904 KB Output is correct
3 Correct 86 ms 25144 KB Output is correct
4 Correct 69 ms 25812 KB Output is correct
5 Correct 59 ms 15744 KB Output is correct
6 Correct 60 ms 15644 KB Output is correct
7 Correct 59 ms 26048 KB Output is correct
8 Correct 61 ms 25392 KB Output is correct
9 Correct 12 ms 8540 KB Output is correct
10 Correct 63 ms 23904 KB Output is correct
11 Correct 16 ms 6744 KB Output is correct
12 Correct 32 ms 9680 KB Output is correct
13 Correct 80 ms 23468 KB Output is correct
14 Correct 68 ms 23988 KB Output is correct
15 Correct 13 ms 6748 KB Output is correct
16 Correct 68 ms 25596 KB Output is correct
17 Correct 74 ms 23868 KB Output is correct
18 Correct 32 ms 6364 KB Output is correct
19 Correct 68 ms 23984 KB Output is correct
20 Correct 66 ms 24148 KB Output is correct
21 Correct 14 ms 8796 KB Output is correct
22 Correct 67 ms 16836 KB Output is correct
23 Correct 63 ms 23212 KB Output is correct
24 Correct 12 ms 6744 KB Output is correct
25 Correct 14 ms 5680 KB Output is correct
26 Correct 57 ms 15544 KB Output is correct
27 Correct 51 ms 15496 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8660 KB Output is correct
2 Correct 4 ms 6608 KB Output is correct
3 Correct 5 ms 8660 KB Output is correct
4 Correct 5 ms 6612 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 6492 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 5 ms 5208 KB Output is correct
12 Correct 5 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 6 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5544 KB Output is correct
17 Correct 7 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 5 ms 5512 KB Output is correct
20 Correct 5 ms 5720 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5592 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 7 ms 5592 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 67 ms 26040 KB Output is correct
30 Correct 68 ms 23904 KB Output is correct
31 Correct 86 ms 25144 KB Output is correct
32 Correct 69 ms 25812 KB Output is correct
33 Correct 59 ms 15744 KB Output is correct
34 Correct 60 ms 15644 KB Output is correct
35 Correct 59 ms 26048 KB Output is correct
36 Correct 61 ms 25392 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 63 ms 23904 KB Output is correct
39 Correct 16 ms 6744 KB Output is correct
40 Correct 32 ms 9680 KB Output is correct
41 Correct 80 ms 23468 KB Output is correct
42 Correct 68 ms 23988 KB Output is correct
43 Correct 13 ms 6748 KB Output is correct
44 Correct 68 ms 25596 KB Output is correct
45 Correct 74 ms 23868 KB Output is correct
46 Correct 32 ms 6364 KB Output is correct
47 Correct 68 ms 23984 KB Output is correct
48 Correct 66 ms 24148 KB Output is correct
49 Correct 14 ms 8796 KB Output is correct
50 Correct 67 ms 16836 KB Output is correct
51 Correct 63 ms 23212 KB Output is correct
52 Correct 12 ms 6744 KB Output is correct
53 Correct 14 ms 5680 KB Output is correct
54 Correct 57 ms 15544 KB Output is correct
55 Correct 51 ms 15496 KB Output is correct
56 Correct 206 ms 33588 KB Output is correct
57 Correct 132 ms 30256 KB Output is correct
58 Correct 194 ms 33188 KB Output is correct
59 Correct 138 ms 31280 KB Output is correct
60 Correct 166 ms 26568 KB Output is correct
61 Correct 150 ms 31932 KB Output is correct
62 Correct 129 ms 28232 KB Output is correct
63 Correct 118 ms 28444 KB Output is correct
64 Correct 56 ms 10872 KB Output is correct
65 Correct 171 ms 31372 KB Output is correct
66 Correct 52 ms 11384 KB Output is correct
67 Correct 55 ms 12060 KB Output is correct
68 Correct 84 ms 27288 KB Output is correct
69 Correct 169 ms 31792 KB Output is correct
70 Correct 17 ms 9052 KB Output is correct
71 Correct 83 ms 27960 KB Output is correct
72 Correct 131 ms 30708 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 67 ms 19060 KB Output is correct
75 Correct 174 ms 32620 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 69 ms 18424 KB Output is correct
78 Correct 117 ms 25872 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 10712 KB Output is correct
2 Correct 38 ms 9436 KB Output is correct
3 Correct 13 ms 8796 KB Output is correct
4 Correct 15 ms 8796 KB Output is correct
5 Correct 193 ms 34380 KB Output is correct
6 Correct 177 ms 32040 KB Output is correct
7 Correct 183 ms 34004 KB Output is correct
8 Correct 138 ms 31352 KB Output is correct
9 Correct 198 ms 34464 KB Output is correct
10 Correct 173 ms 31980 KB Output is correct
11 Correct 146 ms 30220 KB Output is correct
12 Correct 137 ms 31892 KB Output is correct
13 Correct 126 ms 14784 KB Output is correct
14 Correct 175 ms 31780 KB Output is correct
15 Correct 205 ms 31884 KB Output is correct
16 Correct 63 ms 17848 KB Output is correct
17 Correct 81 ms 26036 KB Output is correct
18 Correct 180 ms 31980 KB Output is correct
19 Correct 67 ms 24876 KB Output is correct
20 Correct 78 ms 27540 KB Output is correct
21 Correct 164 ms 31032 KB Output is correct
22 Correct 74 ms 17732 KB Output is correct
23 Correct 74 ms 23888 KB Output is correct
24 Correct 210 ms 33364 KB Output is correct
25 Correct 72 ms 24268 KB Output is correct
26 Correct 67 ms 25084 KB Output is correct
27 Correct 135 ms 29784 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8660 KB Output is correct
2 Correct 4 ms 6608 KB Output is correct
3 Correct 5 ms 8660 KB Output is correct
4 Correct 5 ms 6612 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 6492 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 5 ms 5208 KB Output is correct
12 Correct 5 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 6 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5544 KB Output is correct
17 Correct 7 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 5 ms 5512 KB Output is correct
20 Correct 5 ms 5720 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5592 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 7 ms 5592 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 67 ms 26040 KB Output is correct
30 Correct 68 ms 23904 KB Output is correct
31 Correct 86 ms 25144 KB Output is correct
32 Correct 69 ms 25812 KB Output is correct
33 Correct 59 ms 15744 KB Output is correct
34 Correct 60 ms 15644 KB Output is correct
35 Correct 59 ms 26048 KB Output is correct
36 Correct 61 ms 25392 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 63 ms 23904 KB Output is correct
39 Correct 16 ms 6744 KB Output is correct
40 Correct 32 ms 9680 KB Output is correct
41 Correct 80 ms 23468 KB Output is correct
42 Correct 68 ms 23988 KB Output is correct
43 Correct 13 ms 6748 KB Output is correct
44 Correct 68 ms 25596 KB Output is correct
45 Correct 74 ms 23868 KB Output is correct
46 Correct 32 ms 6364 KB Output is correct
47 Correct 68 ms 23984 KB Output is correct
48 Correct 66 ms 24148 KB Output is correct
49 Correct 14 ms 8796 KB Output is correct
50 Correct 67 ms 16836 KB Output is correct
51 Correct 63 ms 23212 KB Output is correct
52 Correct 12 ms 6744 KB Output is correct
53 Correct 14 ms 5680 KB Output is correct
54 Correct 57 ms 15544 KB Output is correct
55 Correct 51 ms 15496 KB Output is correct
56 Correct 206 ms 33588 KB Output is correct
57 Correct 132 ms 30256 KB Output is correct
58 Correct 194 ms 33188 KB Output is correct
59 Correct 138 ms 31280 KB Output is correct
60 Correct 166 ms 26568 KB Output is correct
61 Correct 150 ms 31932 KB Output is correct
62 Correct 129 ms 28232 KB Output is correct
63 Correct 118 ms 28444 KB Output is correct
64 Correct 56 ms 10872 KB Output is correct
65 Correct 171 ms 31372 KB Output is correct
66 Correct 52 ms 11384 KB Output is correct
67 Correct 55 ms 12060 KB Output is correct
68 Correct 84 ms 27288 KB Output is correct
69 Correct 169 ms 31792 KB Output is correct
70 Correct 17 ms 9052 KB Output is correct
71 Correct 83 ms 27960 KB Output is correct
72 Correct 131 ms 30708 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 67 ms 19060 KB Output is correct
75 Correct 174 ms 32620 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 69 ms 18424 KB Output is correct
78 Correct 117 ms 25872 KB Output is correct
79 Correct 51 ms 10712 KB Output is correct
80 Correct 38 ms 9436 KB Output is correct
81 Correct 13 ms 8796 KB Output is correct
82 Correct 15 ms 8796 KB Output is correct
83 Correct 193 ms 34380 KB Output is correct
84 Correct 177 ms 32040 KB Output is correct
85 Correct 183 ms 34004 KB Output is correct
86 Correct 138 ms 31352 KB Output is correct
87 Correct 198 ms 34464 KB Output is correct
88 Correct 173 ms 31980 KB Output is correct
89 Correct 146 ms 30220 KB Output is correct
90 Correct 137 ms 31892 KB Output is correct
91 Correct 126 ms 14784 KB Output is correct
92 Correct 175 ms 31780 KB Output is correct
93 Correct 205 ms 31884 KB Output is correct
94 Correct 63 ms 17848 KB Output is correct
95 Correct 81 ms 26036 KB Output is correct
96 Correct 180 ms 31980 KB Output is correct
97 Correct 67 ms 24876 KB Output is correct
98 Correct 78 ms 27540 KB Output is correct
99 Correct 164 ms 31032 KB Output is correct
100 Correct 74 ms 17732 KB Output is correct
101 Correct 74 ms 23888 KB Output is correct
102 Correct 210 ms 33364 KB Output is correct
103 Correct 72 ms 24268 KB Output is correct
104 Correct 67 ms 25084 KB Output is correct
105 Correct 135 ms 29784 KB Output is correct
106 Correct 42 ms 9280 KB Output is correct
107 Correct 43 ms 10800 KB Output is correct
108 Correct 45 ms 9856 KB Output is correct
109 Correct 45 ms 10652 KB Output is correct
110 Correct 210 ms 34136 KB Output is correct
111 Correct 175 ms 33160 KB Output is correct
112 Correct 215 ms 33084 KB Output is correct
113 Correct 202 ms 32064 KB Output is correct
114 Correct 225 ms 35504 KB Output is correct
115 Correct 220 ms 33992 KB Output is correct
116 Correct 178 ms 49832 KB Output is correct
117 Correct 162 ms 31524 KB Output is correct
118 Correct 118 ms 17444 KB Output is correct
119 Correct 62 ms 11744 KB Output is correct
120 Correct 258 ms 33644 KB Output is correct
121 Correct 86 ms 23448 KB Output is correct
122 Correct 104 ms 23456 KB Output is correct
123 Correct 270 ms 34336 KB Output is correct
124 Correct 83 ms 15572 KB Output is correct
125 Correct 130 ms 23220 KB Output is correct
126 Correct 228 ms 33624 KB Output is correct
127 Correct 74 ms 14756 KB Output is correct
128 Correct 89 ms 23848 KB Output is correct
129 Correct 241 ms 35868 KB Output is correct
130 Correct 82 ms 23324 KB Output is correct
131 Correct 90 ms 23200 KB Output is correct
132 Correct 171 ms 31400 KB Output is correct