oj.uz

Submission #987985

# Submission time Handle Problem Language Result Execution time Memory
987985 2024-05-23T20:06:58 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 187 ms 46244 KB 
///OWNERUL LUI ADI <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;long long 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:11:365: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   11 | using namespace std;long long 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:11:923: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   11 | using namespace std;long long 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:11:1872: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 | using namespace std;long long 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:11:2074: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | using namespace std;long long 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:11:2158: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 | using namespace std;long long 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[2000

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7892 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 6488 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 4 ms 6488 KB Output is correct
6 Correct 5 ms 6488 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 6 ms 5208 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 6448 KB Output is correct
15 Correct 4 ms 5276 KB Output is correct
16 Correct 4 ms 5464 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 6232 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5636 KB Output is correct
27 Correct 5 ms 8532 KB Output is correct
28 Correct 5 ms 8400 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 22968 KB Output is correct
2 Correct 64 ms 25720 KB Output is correct
3 Correct 80 ms 22956 KB Output is correct
4 Correct 63 ms 25948 KB Output is correct
5 Correct 53 ms 17612 KB Output is correct
6 Correct 68 ms 14504 KB Output is correct
7 Correct 64 ms 23480 KB Output is correct
8 Correct 64 ms 23468 KB Output is correct
9 Correct 14 ms 6492 KB Output is correct
10 Correct 78 ms 25800 KB Output is correct
11 Correct 14 ms 6488 KB Output is correct
12 Correct 31 ms 7636 KB Output is correct
13 Correct 81 ms 23464 KB Output is correct
14 Correct 69 ms 25928 KB Output is correct
15 Correct 16 ms 5724 KB Output is correct
16 Correct 64 ms 23484 KB Output is correct
17 Correct 63 ms 23736 KB Output is correct
18 Correct 22 ms 7132 KB Output is correct
19 Correct 67 ms 25880 KB Output is correct
20 Correct 62 ms 24212 KB Output is correct
21 Correct 16 ms 6576 KB Output is correct
22 Correct 63 ms 14788 KB Output is correct
23 Correct 71 ms 22176 KB Output is correct
24 Correct 21 ms 7772 KB Output is correct
25 Correct 13 ms 8536 KB Output is correct
26 Correct 50 ms 14656 KB Output is correct
27 Correct 69 ms 15320 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7892 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 6488 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 4 ms 6488 KB Output is correct
6 Correct 5 ms 6488 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 6 ms 5208 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 6448 KB Output is correct
15 Correct 4 ms 5276 KB Output is correct
16 Correct 4 ms 5464 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 6232 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5636 KB Output is correct
27 Correct 5 ms 8532 KB Output is correct
28 Correct 5 ms 8400 KB Output is correct
29 Correct 73 ms 22968 KB Output is correct
30 Correct 64 ms 25720 KB Output is correct
31 Correct 80 ms 22956 KB Output is correct
32 Correct 63 ms 25948 KB Output is correct
33 Correct 53 ms 17612 KB Output is correct
34 Correct 68 ms 14504 KB Output is correct
35 Correct 64 ms 23480 KB Output is correct
36 Correct 64 ms 23468 KB Output is correct
37 Correct 14 ms 6492 KB Output is correct
38 Correct 78 ms 25800 KB Output is correct
39 Correct 14 ms 6488 KB Output is correct
40 Correct 31 ms 7636 KB Output is correct
41 Correct 81 ms 23464 KB Output is correct
42 Correct 69 ms 25928 KB Output is correct
43 Correct 16 ms 5724 KB Output is correct
44 Correct 64 ms 23484 KB Output is correct
45 Correct 63 ms 23736 KB Output is correct
46 Correct 22 ms 7132 KB Output is correct
47 Correct 67 ms 25880 KB Output is correct
48 Correct 62 ms 24212 KB Output is correct
49 Correct 16 ms 6576 KB Output is correct
50 Correct 63 ms 14788 KB Output is correct
51 Correct 71 ms 22176 KB Output is correct
52 Correct 21 ms 7772 KB Output is correct
53 Correct 13 ms 8536 KB Output is correct
54 Correct 50 ms 14656 KB Output is correct
55 Correct 69 ms 15320 KB Output is correct
56 Correct 167 ms 32040 KB Output is correct
57 Correct 146 ms 30016 KB Output is correct
58 Correct 159 ms 30592 KB Output is correct
59 Correct 121 ms 29236 KB Output is correct
60 Correct 138 ms 24104 KB Output is correct
61 Correct 126 ms 30600 KB Output is correct
62 Correct 120 ms 28092 KB Output is correct
63 Correct 115 ms 26636 KB Output is correct
64 Correct 58 ms 10956 KB Output is correct
65 Correct 142 ms 30012 KB Output is correct
66 Correct 53 ms 11344 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 77 ms 26280 KB Output is correct
69 Correct 134 ms 30400 KB Output is correct
70 Correct 15 ms 9052 KB Output is correct
71 Correct 74 ms 26556 KB Output is correct
72 Correct 143 ms 29164 KB Output is correct
73 Correct 19 ms 8792 KB Output is correct
74 Correct 64 ms 18796 KB Output is correct
75 Correct 148 ms 32420 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 59 ms 17344 KB Output is correct
78 Correct 105 ms 26904 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 10484 KB Output is correct
2 Correct 37 ms 9436 KB Output is correct
3 Correct 14 ms 8796 KB Output is correct
4 Correct 15 ms 8792 KB Output is correct
5 Correct 156 ms 30520 KB Output is correct
6 Correct 156 ms 29492 KB Output is correct
7 Correct 153 ms 29736 KB Output is correct
8 Correct 155 ms 28728 KB Output is correct
9 Correct 170 ms 30824 KB Output is correct
10 Correct 147 ms 29176 KB Output is correct
11 Correct 142 ms 27840 KB Output is correct
12 Correct 128 ms 28500 KB Output is correct
13 Correct 99 ms 12364 KB Output is correct
14 Correct 164 ms 29240 KB Output is correct
15 Correct 155 ms 29232 KB Output is correct
16 Correct 62 ms 17844 KB Output is correct
17 Correct 73 ms 26032 KB Output is correct
18 Correct 160 ms 29580 KB Output is correct
19 Correct 69 ms 26200 KB Output is correct
20 Correct 76 ms 25784 KB Output is correct
21 Correct 142 ms 28772 KB Output is correct
22 Correct 84 ms 17848 KB Output is correct
23 Correct 79 ms 26028 KB Output is correct
24 Correct 159 ms 30764 KB Output is correct
25 Correct 64 ms 26436 KB Output is correct
26 Correct 62 ms 26288 KB Output is correct
27 Correct 125 ms 28340 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7892 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 6488 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 4 ms 6488 KB Output is correct
6 Correct 5 ms 6488 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 6 ms 5208 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 6448 KB Output is correct
15 Correct 4 ms 5276 KB Output is correct
16 Correct 4 ms 5464 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 6232 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5636 KB Output is correct
27 Correct 5 ms 8532 KB Output is correct
28 Correct 5 ms 8400 KB Output is correct
29 Correct 73 ms 22968 KB Output is correct
30 Correct 64 ms 25720 KB Output is correct
31 Correct 80 ms 22956 KB Output is correct
32 Correct 63 ms 25948 KB Output is correct
33 Correct 53 ms 17612 KB Output is correct
34 Correct 68 ms 14504 KB Output is correct
35 Correct 64 ms 23480 KB Output is correct
36 Correct 64 ms 23468 KB Output is correct
37 Correct 14 ms 6492 KB Output is correct
38 Correct 78 ms 25800 KB Output is correct
39 Correct 14 ms 6488 KB Output is correct
40 Correct 31 ms 7636 KB Output is correct
41 Correct 81 ms 23464 KB Output is correct
42 Correct 69 ms 25928 KB Output is correct
43 Correct 16 ms 5724 KB Output is correct
44 Correct 64 ms 23484 KB Output is correct
45 Correct 63 ms 23736 KB Output is correct
46 Correct 22 ms 7132 KB Output is correct
47 Correct 67 ms 25880 KB Output is correct
48 Correct 62 ms 24212 KB Output is correct
49 Correct 16 ms 6576 KB Output is correct
50 Correct 63 ms 14788 KB Output is correct
51 Correct 71 ms 22176 KB Output is correct
52 Correct 21 ms 7772 KB Output is correct
53 Correct 13 ms 8536 KB Output is correct
54 Correct 50 ms 14656 KB Output is correct
55 Correct 69 ms 15320 KB Output is correct
56 Correct 167 ms 32040 KB Output is correct
57 Correct 146 ms 30016 KB Output is correct
58 Correct 159 ms 30592 KB Output is correct
59 Correct 121 ms 29236 KB Output is correct
60 Correct 138 ms 24104 KB Output is correct
61 Correct 126 ms 30600 KB Output is correct
62 Correct 120 ms 28092 KB Output is correct
63 Correct 115 ms 26636 KB Output is correct
64 Correct 58 ms 10956 KB Output is correct
65 Correct 142 ms 30012 KB Output is correct
66 Correct 53 ms 11344 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 77 ms 26280 KB Output is correct
69 Correct 134 ms 30400 KB Output is correct
70 Correct 15 ms 9052 KB Output is correct
71 Correct 74 ms 26556 KB Output is correct
72 Correct 143 ms 29164 KB Output is correct
73 Correct 19 ms 8792 KB Output is correct
74 Correct 64 ms 18796 KB Output is correct
75 Correct 148 ms 32420 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 59 ms 17344 KB Output is correct
78 Correct 105 ms 26904 KB Output is correct
79 Correct 48 ms 10484 KB Output is correct
80 Correct 37 ms 9436 KB Output is correct
81 Correct 14 ms 8796 KB Output is correct
82 Correct 15 ms 8792 KB Output is correct
83 Correct 156 ms 30520 KB Output is correct
84 Correct 156 ms 29492 KB Output is correct
85 Correct 153 ms 29736 KB Output is correct
86 Correct 155 ms 28728 KB Output is correct
87 Correct 170 ms 30824 KB Output is correct
88 Correct 147 ms 29176 KB Output is correct
89 Correct 142 ms 27840 KB Output is correct
90 Correct 128 ms 28500 KB Output is correct
91 Correct 99 ms 12364 KB Output is correct
92 Correct 164 ms 29240 KB Output is correct
93 Correct 155 ms 29232 KB Output is correct
94 Correct 62 ms 17844 KB Output is correct
95 Correct 73 ms 26032 KB Output is correct
96 Correct 160 ms 29580 KB Output is correct
97 Correct 69 ms 26200 KB Output is correct
98 Correct 76 ms 25784 KB Output is correct
99 Correct 142 ms 28772 KB Output is correct
100 Correct 84 ms 17848 KB Output is correct
101 Correct 79 ms 26028 KB Output is correct
102 Correct 159 ms 30764 KB Output is correct
103 Correct 64 ms 26436 KB Output is correct
104 Correct 62 ms 26288 KB Output is correct
105 Correct 125 ms 28340 KB Output is correct
106 Correct 36 ms 9176 KB Output is correct
107 Correct 46 ms 10916 KB Output is correct
108 Correct 45 ms 9700 KB Output is correct
109 Correct 42 ms 10576 KB Output is correct
110 Correct 169 ms 31676 KB Output is correct
111 Correct 187 ms 30872 KB Output is correct
112 Correct 173 ms 30660 KB Output is correct
113 Correct 164 ms 29496 KB Output is correct
114 Correct 161 ms 31772 KB Output is correct
115 Correct 165 ms 30260 KB Output is correct
116 Correct 168 ms 46244 KB Output is correct
117 Correct 137 ms 28340 KB Output is correct
118 Correct 111 ms 14444 KB Output is correct
119 Correct 60 ms 11344 KB Output is correct
120 Correct 166 ms 30072 KB Output is correct
121 Correct 72 ms 26300 KB Output is correct
122 Correct 82 ms 26296 KB Output is correct
123 Correct 168 ms 30820 KB Output is correct
124 Correct 66 ms 18504 KB Output is correct
125 Correct 86 ms 26036 KB Output is correct
126 Correct 170 ms 29980 KB Output is correct
127 Correct 62 ms 17608 KB Output is correct
128 Correct 76 ms 26616 KB Output is correct
129 Correct 184 ms 32300 KB Output is correct
130 Correct 71 ms 26296 KB Output is correct
131 Correct 79 ms 26292 KB Output is correct
132 Correct 143 ms 28544 KB Output is correct