oj.uz

Submission #987940

# Submission time Handle Problem Language Result Execution time Memory
987940 2024-05-23T19:39:21 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 219 ms 50208 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#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:6:359: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    6 | 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:6:917: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    6 | 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:6:1866: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    6 | 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:6:2068: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | 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:6:2152: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    6 | 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 5 ms 5724 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 7 ms 5684 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 7 ms 5724 KB Output is correct
7 Correct 8 ms 7640 KB Output is correct
8 Correct 7 ms 5588 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 4 ms 5172 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 6 ms 5720 KB Output is correct
15 Correct 6 ms 5296 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 6 ms 5724 KB Output is correct
18 Correct 4 ms 5328 KB Output is correct
19 Correct 5 ms 5540 KB Output is correct
20 Correct 7 ms 5724 KB Output is correct
21 Correct 5 ms 5160 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 6 ms 5600 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 6 ms 5732 KB Output is correct
27 Correct 6 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 23192 KB Output is correct
2 Correct 81 ms 22848 KB Output is correct
3 Correct 72 ms 23024 KB Output is correct
4 Correct 63 ms 22872 KB Output is correct
5 Correct 72 ms 14860 KB Output is correct
6 Correct 59 ms 14536 KB Output is correct
7 Correct 66 ms 22804 KB Output is correct
8 Correct 62 ms 22652 KB Output is correct
9 Correct 18 ms 5656 KB Output is correct
10 Correct 80 ms 22956 KB Output is correct
11 Correct 21 ms 5720 KB Output is correct
12 Correct 37 ms 6572 KB Output is correct
13 Correct 73 ms 22672 KB Output is correct
14 Correct 72 ms 23116 KB Output is correct
15 Correct 14 ms 5724 KB Output is correct
16 Correct 71 ms 22600 KB Output is correct
17 Correct 86 ms 22884 KB Output is correct
18 Correct 32 ms 6356 KB Output is correct
19 Correct 71 ms 22896 KB Output is correct
20 Correct 63 ms 23212 KB Output is correct
21 Correct 19 ms 8796 KB Output is correct
22 Correct 78 ms 14788 KB Output is correct
23 Correct 62 ms 23220 KB Output is correct
24 Correct 12 ms 6748 KB Output is correct
25 Correct 13 ms 6744 KB Output is correct
26 Correct 51 ms 15544 KB Output is correct
27 Correct 49 ms 18116 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 7 ms 5684 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 7 ms 5724 KB Output is correct
7 Correct 8 ms 7640 KB Output is correct
8 Correct 7 ms 5588 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 4 ms 5172 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 6 ms 5720 KB Output is correct
15 Correct 6 ms 5296 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 6 ms 5724 KB Output is correct
18 Correct 4 ms 5328 KB Output is correct
19 Correct 5 ms 5540 KB Output is correct
20 Correct 7 ms 5724 KB Output is correct
21 Correct 5 ms 5160 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 6 ms 5600 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 6 ms 5732 KB Output is correct
27 Correct 6 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 67 ms 23192 KB Output is correct
30 Correct 81 ms 22848 KB Output is correct
31 Correct 72 ms 23024 KB Output is correct
32 Correct 63 ms 22872 KB Output is correct
33 Correct 72 ms 14860 KB Output is correct
34 Correct 59 ms 14536 KB Output is correct
35 Correct 66 ms 22804 KB Output is correct
36 Correct 62 ms 22652 KB Output is correct
37 Correct 18 ms 5656 KB Output is correct
38 Correct 80 ms 22956 KB Output is correct
39 Correct 21 ms 5720 KB Output is correct
40 Correct 37 ms 6572 KB Output is correct
41 Correct 73 ms 22672 KB Output is correct
42 Correct 72 ms 23116 KB Output is correct
43 Correct 14 ms 5724 KB Output is correct
44 Correct 71 ms 22600 KB Output is correct
45 Correct 86 ms 22884 KB Output is correct
46 Correct 32 ms 6356 KB Output is correct
47 Correct 71 ms 22896 KB Output is correct
48 Correct 63 ms 23212 KB Output is correct
49 Correct 19 ms 8796 KB Output is correct
50 Correct 78 ms 14788 KB Output is correct
51 Correct 62 ms 23220 KB Output is correct
52 Correct 12 ms 6748 KB Output is correct
53 Correct 13 ms 6744 KB Output is correct
54 Correct 51 ms 15544 KB Output is correct
55 Correct 49 ms 18116 KB Output is correct
56 Correct 148 ms 35644 KB Output is correct
57 Correct 157 ms 34364 KB Output is correct
58 Correct 172 ms 35904 KB Output is correct
59 Correct 116 ms 32940 KB Output is correct
60 Correct 129 ms 27848 KB Output is correct
61 Correct 129 ms 34876 KB Output is correct
62 Correct 120 ms 31076 KB Output is correct
63 Correct 129 ms 29956 KB Output is correct
64 Correct 55 ms 13264 KB Output is correct
65 Correct 139 ms 33524 KB Output is correct
66 Correct 57 ms 14800 KB Output is correct
67 Correct 50 ms 12236 KB Output is correct
68 Correct 75 ms 27288 KB Output is correct
69 Correct 134 ms 34132 KB Output is correct
70 Correct 14 ms 9128 KB Output is correct
71 Correct 71 ms 26548 KB Output is correct
72 Correct 152 ms 32400 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 70 ms 18932 KB Output is correct
75 Correct 136 ms 36548 KB Output is correct
76 Correct 12 ms 8592 KB Output is correct
77 Correct 64 ms 17976 KB Output is correct
78 Correct 107 ms 29580 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 10964 KB Output is correct
2 Correct 44 ms 9432 KB Output is correct
3 Correct 13 ms 8748 KB Output is correct
4 Correct 13 ms 8936 KB Output is correct
5 Correct 153 ms 34616 KB Output is correct
6 Correct 141 ms 33972 KB Output is correct
7 Correct 155 ms 35056 KB Output is correct
8 Correct 149 ms 34140 KB Output is correct
9 Correct 147 ms 35172 KB Output is correct
10 Correct 147 ms 32984 KB Output is correct
11 Correct 154 ms 31320 KB Output is correct
12 Correct 180 ms 31132 KB Output is correct
13 Correct 110 ms 14880 KB Output is correct
14 Correct 207 ms 32924 KB Output is correct
15 Correct 159 ms 33332 KB Output is correct
16 Correct 79 ms 17804 KB Output is correct
17 Correct 82 ms 26048 KB Output is correct
18 Correct 200 ms 33464 KB Output is correct
19 Correct 80 ms 23948 KB Output is correct
20 Correct 84 ms 25840 KB Output is correct
21 Correct 179 ms 32672 KB Output is correct
22 Correct 75 ms 15760 KB Output is correct
23 Correct 91 ms 23124 KB Output is correct
24 Correct 191 ms 34720 KB Output is correct
25 Correct 65 ms 23452 KB Output is correct
26 Correct 61 ms 23488 KB Output is correct
27 Correct 144 ms 31380 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 7 ms 5684 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 7 ms 5724 KB Output is correct
7 Correct 8 ms 7640 KB Output is correct
8 Correct 7 ms 5588 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 4 ms 5172 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 6 ms 5720 KB Output is correct
15 Correct 6 ms 5296 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 6 ms 5724 KB Output is correct
18 Correct 4 ms 5328 KB Output is correct
19 Correct 5 ms 5540 KB Output is correct
20 Correct 7 ms 5724 KB Output is correct
21 Correct 5 ms 5160 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 6 ms 5600 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 6 ms 5732 KB Output is correct
27 Correct 6 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 67 ms 23192 KB Output is correct
30 Correct 81 ms 22848 KB Output is correct
31 Correct 72 ms 23024 KB Output is correct
32 Correct 63 ms 22872 KB Output is correct
33 Correct 72 ms 14860 KB Output is correct
34 Correct 59 ms 14536 KB Output is correct
35 Correct 66 ms 22804 KB Output is correct
36 Correct 62 ms 22652 KB Output is correct
37 Correct 18 ms 5656 KB Output is correct
38 Correct 80 ms 22956 KB Output is correct
39 Correct 21 ms 5720 KB Output is correct
40 Correct 37 ms 6572 KB Output is correct
41 Correct 73 ms 22672 KB Output is correct
42 Correct 72 ms 23116 KB Output is correct
43 Correct 14 ms 5724 KB Output is correct
44 Correct 71 ms 22600 KB Output is correct
45 Correct 86 ms 22884 KB Output is correct
46 Correct 32 ms 6356 KB Output is correct
47 Correct 71 ms 22896 KB Output is correct
48 Correct 63 ms 23212 KB Output is correct
49 Correct 19 ms 8796 KB Output is correct
50 Correct 78 ms 14788 KB Output is correct
51 Correct 62 ms 23220 KB Output is correct
52 Correct 12 ms 6748 KB Output is correct
53 Correct 13 ms 6744 KB Output is correct
54 Correct 51 ms 15544 KB Output is correct
55 Correct 49 ms 18116 KB Output is correct
56 Correct 148 ms 35644 KB Output is correct
57 Correct 157 ms 34364 KB Output is correct
58 Correct 172 ms 35904 KB Output is correct
59 Correct 116 ms 32940 KB Output is correct
60 Correct 129 ms 27848 KB Output is correct
61 Correct 129 ms 34876 KB Output is correct
62 Correct 120 ms 31076 KB Output is correct
63 Correct 129 ms 29956 KB Output is correct
64 Correct 55 ms 13264 KB Output is correct
65 Correct 139 ms 33524 KB Output is correct
66 Correct 57 ms 14800 KB Output is correct
67 Correct 50 ms 12236 KB Output is correct
68 Correct 75 ms 27288 KB Output is correct
69 Correct 134 ms 34132 KB Output is correct
70 Correct 14 ms 9128 KB Output is correct
71 Correct 71 ms 26548 KB Output is correct
72 Correct 152 ms 32400 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 70 ms 18932 KB Output is correct
75 Correct 136 ms 36548 KB Output is correct
76 Correct 12 ms 8592 KB Output is correct
77 Correct 64 ms 17976 KB Output is correct
78 Correct 107 ms 29580 KB Output is correct
79 Correct 40 ms 10964 KB Output is correct
80 Correct 44 ms 9432 KB Output is correct
81 Correct 13 ms 8748 KB Output is correct
82 Correct 13 ms 8936 KB Output is correct
83 Correct 153 ms 34616 KB Output is correct
84 Correct 141 ms 33972 KB Output is correct
85 Correct 155 ms 35056 KB Output is correct
86 Correct 149 ms 34140 KB Output is correct
87 Correct 147 ms 35172 KB Output is correct
88 Correct 147 ms 32984 KB Output is correct
89 Correct 154 ms 31320 KB Output is correct
90 Correct 180 ms 31132 KB Output is correct
91 Correct 110 ms 14880 KB Output is correct
92 Correct 207 ms 32924 KB Output is correct
93 Correct 159 ms 33332 KB Output is correct
94 Correct 79 ms 17804 KB Output is correct
95 Correct 82 ms 26048 KB Output is correct
96 Correct 200 ms 33464 KB Output is correct
97 Correct 80 ms 23948 KB Output is correct
98 Correct 84 ms 25840 KB Output is correct
99 Correct 179 ms 32672 KB Output is correct
100 Correct 75 ms 15760 KB Output is correct
101 Correct 91 ms 23124 KB Output is correct
102 Correct 191 ms 34720 KB Output is correct
103 Correct 65 ms 23452 KB Output is correct
104 Correct 61 ms 23488 KB Output is correct
105 Correct 144 ms 31380 KB Output is correct
106 Correct 40 ms 6364 KB Output is correct
107 Correct 46 ms 8032 KB Output is correct
108 Correct 39 ms 6872 KB Output is correct
109 Correct 43 ms 7872 KB Output is correct
110 Correct 219 ms 35552 KB Output is correct
111 Correct 194 ms 34612 KB Output is correct
112 Correct 199 ms 34604 KB Output is correct
113 Correct 215 ms 33532 KB Output is correct
114 Correct 183 ms 35916 KB Output is correct
115 Correct 178 ms 34312 KB Output is correct
116 Correct 197 ms 50208 KB Output is correct
117 Correct 153 ms 31712 KB Output is correct
118 Correct 127 ms 17668 KB Output is correct
119 Correct 53 ms 11848 KB Output is correct
120 Correct 218 ms 33944 KB Output is correct
121 Correct 85 ms 23456 KB Output is correct
122 Correct 95 ms 23384 KB Output is correct
123 Correct 201 ms 34492 KB Output is correct
124 Correct 78 ms 15356 KB Output is correct
125 Correct 107 ms 26176 KB Output is correct
126 Correct 193 ms 33796 KB Output is correct
127 Correct 79 ms 14684 KB Output is correct
128 Correct 109 ms 23636 KB Output is correct
129 Correct 177 ms 36168 KB Output is correct
130 Correct 86 ms 24180 KB Output is correct
131 Correct 103 ms 23224 KB Output is correct
132 Correct 184 ms 31688 KB Output is correct