oj.uz

Submission #987931

# Submission time Handle Problem Language Result Execution time Memory
987931 2024-05-23T19:37:43 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 196 ms 46244 KB 
///OWNERUL LUI CALIN <3
#include <bits/stdc++.h>
#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:5:365: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    5 | 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:5:923: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    5 | 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:5:1872: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    5 | 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:5:2074: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | 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:5:2158: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    5 | 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],i

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8280 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 6 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 28036 KB Output is correct
2 Correct 58 ms 26044 KB Output is correct
3 Correct 58 ms 27320 KB Output is correct
4 Correct 63 ms 27000 KB Output is correct
5 Correct 56 ms 19132 KB Output is correct
6 Correct 51 ms 18632 KB Output is correct
7 Correct 57 ms 27060 KB Output is correct
8 Correct 56 ms 27452 KB Output is correct
9 Correct 14 ms 8540 KB Output is correct
10 Correct 69 ms 26544 KB Output is correct
11 Correct 12 ms 8536 KB Output is correct
12 Correct 28 ms 9676 KB Output is correct
13 Correct 59 ms 26548 KB Output is correct
14 Correct 58 ms 26804 KB Output is correct
15 Correct 15 ms 8848 KB Output is correct
16 Correct 59 ms 27324 KB Output is correct
17 Correct 62 ms 25776 KB Output is correct
18 Correct 22 ms 9176 KB Output is correct
19 Correct 62 ms 23016 KB Output is correct
20 Correct 59 ms 23180 KB Output is correct
21 Correct 14 ms 5724 KB Output is correct
22 Correct 64 ms 13804 KB Output is correct
23 Correct 82 ms 22196 KB Output is correct
24 Correct 13 ms 5828 KB Output is correct
25 Correct 22 ms 5724 KB Output is correct
26 Correct 51 ms 14468 KB Output is correct
27 Correct 53 ms 18108 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8280 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 6 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 56 ms 28036 KB Output is correct
30 Correct 58 ms 26044 KB Output is correct
31 Correct 58 ms 27320 KB Output is correct
32 Correct 63 ms 27000 KB Output is correct
33 Correct 56 ms 19132 KB Output is correct
34 Correct 51 ms 18632 KB Output is correct
35 Correct 57 ms 27060 KB Output is correct
36 Correct 56 ms 27452 KB Output is correct
37 Correct 14 ms 8540 KB Output is correct
38 Correct 69 ms 26544 KB Output is correct
39 Correct 12 ms 8536 KB Output is correct
40 Correct 28 ms 9676 KB Output is correct
41 Correct 59 ms 26548 KB Output is correct
42 Correct 58 ms 26804 KB Output is correct
43 Correct 15 ms 8848 KB Output is correct
44 Correct 59 ms 27324 KB Output is correct
45 Correct 62 ms 25776 KB Output is correct
46 Correct 22 ms 9176 KB Output is correct
47 Correct 62 ms 23016 KB Output is correct
48 Correct 59 ms 23180 KB Output is correct
49 Correct 14 ms 5724 KB Output is correct
50 Correct 64 ms 13804 KB Output is correct
51 Correct 82 ms 22196 KB Output is correct
52 Correct 13 ms 5828 KB Output is correct
53 Correct 22 ms 5724 KB Output is correct
54 Correct 51 ms 14468 KB Output is correct
55 Correct 53 ms 18108 KB Output is correct
56 Correct 187 ms 33236 KB Output is correct
57 Correct 130 ms 30388 KB Output is correct
58 Correct 133 ms 31744 KB Output is correct
59 Correct 122 ms 30252 KB Output is correct
60 Correct 152 ms 24380 KB Output is correct
61 Correct 137 ms 30992 KB Output is correct
62 Correct 124 ms 28592 KB Output is correct
63 Correct 104 ms 28696 KB Output is correct
64 Correct 59 ms 10880 KB Output is correct
65 Correct 127 ms 30552 KB Output is correct
66 Correct 57 ms 11356 KB Output is correct
67 Correct 54 ms 12228 KB Output is correct
68 Correct 77 ms 27192 KB Output is correct
69 Correct 135 ms 31020 KB Output is correct
70 Correct 16 ms 8912 KB Output is correct
71 Correct 89 ms 27264 KB Output is correct
72 Correct 121 ms 30956 KB Output is correct
73 Correct 16 ms 8792 KB Output is correct
74 Correct 65 ms 18636 KB Output is correct
75 Correct 146 ms 34360 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 58 ms 19148 KB Output is correct
78 Correct 115 ms 27316 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 10708 KB Output is correct
2 Correct 37 ms 9532 KB Output is correct
3 Correct 15 ms 8796 KB Output is correct
4 Correct 14 ms 8792 KB Output is correct
5 Correct 151 ms 31340 KB Output is correct
6 Correct 143 ms 29504 KB Output is correct
7 Correct 150 ms 30248 KB Output is correct
8 Correct 148 ms 29228 KB Output is correct
9 Correct 149 ms 31800 KB Output is correct
10 Correct 168 ms 29748 KB Output is correct
11 Correct 138 ms 27740 KB Output is correct
12 Correct 117 ms 29636 KB Output is correct
13 Correct 101 ms 12336 KB Output is correct
14 Correct 185 ms 29912 KB Output is correct
15 Correct 151 ms 29204 KB Output is correct
16 Correct 87 ms 15704 KB Output is correct
17 Correct 83 ms 23984 KB Output is correct
18 Correct 148 ms 29500 KB Output is correct
19 Correct 63 ms 26908 KB Output is correct
20 Correct 75 ms 26760 KB Output is correct
21 Correct 153 ms 28980 KB Output is correct
22 Correct 60 ms 18628 KB Output is correct
23 Correct 85 ms 26888 KB Output is correct
24 Correct 192 ms 32264 KB Output is correct
25 Correct 75 ms 27092 KB Output is correct
26 Correct 64 ms 28112 KB Output is correct
27 Correct 139 ms 29332 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8280 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 6 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 56 ms 28036 KB Output is correct
30 Correct 58 ms 26044 KB Output is correct
31 Correct 58 ms 27320 KB Output is correct
32 Correct 63 ms 27000 KB Output is correct
33 Correct 56 ms 19132 KB Output is correct
34 Correct 51 ms 18632 KB Output is correct
35 Correct 57 ms 27060 KB Output is correct
36 Correct 56 ms 27452 KB Output is correct
37 Correct 14 ms 8540 KB Output is correct
38 Correct 69 ms 26544 KB Output is correct
39 Correct 12 ms 8536 KB Output is correct
40 Correct 28 ms 9676 KB Output is correct
41 Correct 59 ms 26548 KB Output is correct
42 Correct 58 ms 26804 KB Output is correct
43 Correct 15 ms 8848 KB Output is correct
44 Correct 59 ms 27324 KB Output is correct
45 Correct 62 ms 25776 KB Output is correct
46 Correct 22 ms 9176 KB Output is correct
47 Correct 62 ms 23016 KB Output is correct
48 Correct 59 ms 23180 KB Output is correct
49 Correct 14 ms 5724 KB Output is correct
50 Correct 64 ms 13804 KB Output is correct
51 Correct 82 ms 22196 KB Output is correct
52 Correct 13 ms 5828 KB Output is correct
53 Correct 22 ms 5724 KB Output is correct
54 Correct 51 ms 14468 KB Output is correct
55 Correct 53 ms 18108 KB Output is correct
56 Correct 187 ms 33236 KB Output is correct
57 Correct 130 ms 30388 KB Output is correct
58 Correct 133 ms 31744 KB Output is correct
59 Correct 122 ms 30252 KB Output is correct
60 Correct 152 ms 24380 KB Output is correct
61 Correct 137 ms 30992 KB Output is correct
62 Correct 124 ms 28592 KB Output is correct
63 Correct 104 ms 28696 KB Output is correct
64 Correct 59 ms 10880 KB Output is correct
65 Correct 127 ms 30552 KB Output is correct
66 Correct 57 ms 11356 KB Output is correct
67 Correct 54 ms 12228 KB Output is correct
68 Correct 77 ms 27192 KB Output is correct
69 Correct 135 ms 31020 KB Output is correct
70 Correct 16 ms 8912 KB Output is correct
71 Correct 89 ms 27264 KB Output is correct
72 Correct 121 ms 30956 KB Output is correct
73 Correct 16 ms 8792 KB Output is correct
74 Correct 65 ms 18636 KB Output is correct
75 Correct 146 ms 34360 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 58 ms 19148 KB Output is correct
78 Correct 115 ms 27316 KB Output is correct
79 Correct 40 ms 10708 KB Output is correct
80 Correct 37 ms 9532 KB Output is correct
81 Correct 15 ms 8796 KB Output is correct
82 Correct 14 ms 8792 KB Output is correct
83 Correct 151 ms 31340 KB Output is correct
84 Correct 143 ms 29504 KB Output is correct
85 Correct 150 ms 30248 KB Output is correct
86 Correct 148 ms 29228 KB Output is correct
87 Correct 149 ms 31800 KB Output is correct
88 Correct 168 ms 29748 KB Output is correct
89 Correct 138 ms 27740 KB Output is correct
90 Correct 117 ms 29636 KB Output is correct
91 Correct 101 ms 12336 KB Output is correct
92 Correct 185 ms 29912 KB Output is correct
93 Correct 151 ms 29204 KB Output is correct
94 Correct 87 ms 15704 KB Output is correct
95 Correct 83 ms 23984 KB Output is correct
96 Correct 148 ms 29500 KB Output is correct
97 Correct 63 ms 26908 KB Output is correct
98 Correct 75 ms 26760 KB Output is correct
99 Correct 153 ms 28980 KB Output is correct
100 Correct 60 ms 18628 KB Output is correct
101 Correct 85 ms 26888 KB Output is correct
102 Correct 192 ms 32264 KB Output is correct
103 Correct 75 ms 27092 KB Output is correct
104 Correct 64 ms 28112 KB Output is correct
105 Correct 139 ms 29332 KB Output is correct
106 Correct 43 ms 9424 KB Output is correct
107 Correct 42 ms 10956 KB Output is correct
108 Correct 44 ms 9872 KB Output is correct
109 Correct 44 ms 10664 KB Output is correct
110 Correct 192 ms 31552 KB Output is correct
111 Correct 167 ms 30812 KB Output is correct
112 Correct 171 ms 32276 KB Output is correct
113 Correct 158 ms 30576 KB Output is correct
114 Correct 189 ms 31904 KB Output is correct
115 Correct 170 ms 30556 KB Output is correct
116 Correct 187 ms 46244 KB Output is correct
117 Correct 172 ms 28524 KB Output is correct
118 Correct 122 ms 13528 KB Output is correct
119 Correct 57 ms 11348 KB Output is correct
120 Correct 177 ms 29952 KB Output is correct
121 Correct 87 ms 26968 KB Output is correct
122 Correct 78 ms 24316 KB Output is correct
123 Correct 186 ms 32376 KB Output is correct
124 Correct 87 ms 18420 KB Output is correct
125 Correct 92 ms 27844 KB Output is correct
126 Correct 175 ms 30124 KB Output is correct
127 Correct 64 ms 18544 KB Output is correct
128 Correct 86 ms 26712 KB Output is correct
129 Correct 196 ms 32156 KB Output is correct
130 Correct 70 ms 27068 KB Output is correct
131 Correct 80 ms 27324 KB Output is correct
132 Correct 138 ms 29956 KB Output is correct