oj.uz

Submission #987994

# Submission time Handle Problem Language Result Execution time Memory
987994 2024-05-23T20:11:22 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 183 ms 46264 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#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 5 ms 6492 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 8 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 3 ms 5976 KB Output is correct
10 Correct 7 ms 6524 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 5 ms 5424 KB Output is correct
13 Correct 4 ms 6488 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 4 ms 5464 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 6488 KB Output is correct
18 Correct 4 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 7 ms 5720 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5464 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 4 ms 5592 KB Output is correct
28 Correct 6 ms 5592 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 23052 KB Output is correct
2 Correct 66 ms 22964 KB Output is correct
3 Correct 65 ms 22812 KB Output is correct
4 Correct 63 ms 23916 KB Output is correct
5 Correct 55 ms 15536 KB Output is correct
6 Correct 60 ms 15308 KB Output is correct
7 Correct 67 ms 23524 KB Output is correct
8 Correct 61 ms 25508 KB Output is correct
9 Correct 12 ms 8540 KB Output is correct
10 Correct 66 ms 25816 KB Output is correct
11 Correct 16 ms 8536 KB Output is correct
12 Correct 27 ms 6580 KB Output is correct
13 Correct 65 ms 22580 KB Output is correct
14 Correct 66 ms 22960 KB Output is correct
15 Correct 13 ms 5720 KB Output is correct
16 Correct 63 ms 22456 KB Output is correct
17 Correct 63 ms 22704 KB Output is correct
18 Correct 20 ms 9180 KB Output is correct
19 Correct 63 ms 22936 KB Output is correct
20 Correct 60 ms 23208 KB Output is correct
21 Correct 16 ms 5976 KB Output is correct
22 Correct 57 ms 13944 KB Output is correct
23 Correct 58 ms 22192 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 5708 KB Output is correct
26 Correct 54 ms 14536 KB Output is correct
27 Correct 51 ms 14620 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6492 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 8 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 3 ms 5976 KB Output is correct
10 Correct 7 ms 6524 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 5 ms 5424 KB Output is correct
13 Correct 4 ms 6488 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 4 ms 5464 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 6488 KB Output is correct
18 Correct 4 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 7 ms 5720 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5464 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 4 ms 5592 KB Output is correct
28 Correct 6 ms 5592 KB Output is correct
29 Correct 61 ms 23052 KB Output is correct
30 Correct 66 ms 22964 KB Output is correct
31 Correct 65 ms 22812 KB Output is correct
32 Correct 63 ms 23916 KB Output is correct
33 Correct 55 ms 15536 KB Output is correct
34 Correct 60 ms 15308 KB Output is correct
35 Correct 67 ms 23524 KB Output is correct
36 Correct 61 ms 25508 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 66 ms 25816 KB Output is correct
39 Correct 16 ms 8536 KB Output is correct
40 Correct 27 ms 6580 KB Output is correct
41 Correct 65 ms 22580 KB Output is correct
42 Correct 66 ms 22960 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 63 ms 22456 KB Output is correct
45 Correct 63 ms 22704 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 63 ms 22936 KB Output is correct
48 Correct 60 ms 23208 KB Output is correct
49 Correct 16 ms 5976 KB Output is correct
50 Correct 57 ms 13944 KB Output is correct
51 Correct 58 ms 22192 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5708 KB Output is correct
54 Correct 54 ms 14536 KB Output is correct
55 Correct 51 ms 14620 KB Output is correct
56 Correct 141 ms 30772 KB Output is correct
57 Correct 145 ms 28160 KB Output is correct
58 Correct 140 ms 29076 KB Output is correct
59 Correct 121 ms 26852 KB Output is correct
60 Correct 163 ms 23128 KB Output is correct
61 Correct 127 ms 28992 KB Output is correct
62 Correct 120 ms 25324 KB Output is correct
63 Correct 108 ms 26620 KB Output is correct
64 Correct 55 ms 10980 KB Output is correct
65 Correct 131 ms 30152 KB Output is correct
66 Correct 48 ms 11332 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 76 ms 26620 KB Output is correct
69 Correct 137 ms 30604 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 78 ms 26528 KB Output is correct
72 Correct 124 ms 29236 KB Output is correct
73 Correct 12 ms 8792 KB Output is correct
74 Correct 66 ms 18724 KB Output is correct
75 Correct 139 ms 32312 KB Output is correct
76 Correct 11 ms 8536 KB Output is correct
77 Correct 62 ms 14528 KB Output is correct
78 Correct 103 ms 26744 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 10712 KB Output is correct
2 Correct 35 ms 9436 KB Output is correct
3 Correct 13 ms 8792 KB Output is correct
4 Correct 13 ms 8792 KB Output is correct
5 Correct 156 ms 30644 KB Output is correct
6 Correct 146 ms 29220 KB Output is correct
7 Correct 154 ms 29804 KB Output is correct
8 Correct 143 ms 28904 KB Output is correct
9 Correct 164 ms 30756 KB Output is correct
10 Correct 144 ms 29184 KB Output is correct
11 Correct 151 ms 27632 KB Output is correct
12 Correct 123 ms 28676 KB Output is correct
13 Correct 100 ms 12364 KB Output is correct
14 Correct 167 ms 29436 KB Output is correct
15 Correct 150 ms 29228 KB Output is correct
16 Correct 67 ms 17928 KB Output is correct
17 Correct 71 ms 26080 KB Output is correct
18 Correct 147 ms 29652 KB Output is correct
19 Correct 67 ms 26288 KB Output is correct
20 Correct 74 ms 26100 KB Output is correct
21 Correct 142 ms 28732 KB Output is correct
22 Correct 60 ms 17848 KB Output is correct
23 Correct 75 ms 26120 KB Output is correct
24 Correct 162 ms 30748 KB Output is correct
25 Correct 70 ms 26492 KB Output is correct
26 Correct 61 ms 26308 KB Output is correct
27 Correct 129 ms 28332 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6492 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 8 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 3 ms 5976 KB Output is correct
10 Correct 7 ms 6524 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 5 ms 5424 KB Output is correct
13 Correct 4 ms 6488 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 4 ms 5464 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 6488 KB Output is correct
18 Correct 4 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 7 ms 5720 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5464 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 4 ms 5592 KB Output is correct
28 Correct 6 ms 5592 KB Output is correct
29 Correct 61 ms 23052 KB Output is correct
30 Correct 66 ms 22964 KB Output is correct
31 Correct 65 ms 22812 KB Output is correct
32 Correct 63 ms 23916 KB Output is correct
33 Correct 55 ms 15536 KB Output is correct
34 Correct 60 ms 15308 KB Output is correct
35 Correct 67 ms 23524 KB Output is correct
36 Correct 61 ms 25508 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 66 ms 25816 KB Output is correct
39 Correct 16 ms 8536 KB Output is correct
40 Correct 27 ms 6580 KB Output is correct
41 Correct 65 ms 22580 KB Output is correct
42 Correct 66 ms 22960 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 63 ms 22456 KB Output is correct
45 Correct 63 ms 22704 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 63 ms 22936 KB Output is correct
48 Correct 60 ms 23208 KB Output is correct
49 Correct 16 ms 5976 KB Output is correct
50 Correct 57 ms 13944 KB Output is correct
51 Correct 58 ms 22192 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5708 KB Output is correct
54 Correct 54 ms 14536 KB Output is correct
55 Correct 51 ms 14620 KB Output is correct
56 Correct 141 ms 30772 KB Output is correct
57 Correct 145 ms 28160 KB Output is correct
58 Correct 140 ms 29076 KB Output is correct
59 Correct 121 ms 26852 KB Output is correct
60 Correct 163 ms 23128 KB Output is correct
61 Correct 127 ms 28992 KB Output is correct
62 Correct 120 ms 25324 KB Output is correct
63 Correct 108 ms 26620 KB Output is correct
64 Correct 55 ms 10980 KB Output is correct
65 Correct 131 ms 30152 KB Output is correct
66 Correct 48 ms 11332 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 76 ms 26620 KB Output is correct
69 Correct 137 ms 30604 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 78 ms 26528 KB Output is correct
72 Correct 124 ms 29236 KB Output is correct
73 Correct 12 ms 8792 KB Output is correct
74 Correct 66 ms 18724 KB Output is correct
75 Correct 139 ms 32312 KB Output is correct
76 Correct 11 ms 8536 KB Output is correct
77 Correct 62 ms 14528 KB Output is correct
78 Correct 103 ms 26744 KB Output is correct
79 Correct 40 ms 10712 KB Output is correct
80 Correct 35 ms 9436 KB Output is correct
81 Correct 13 ms 8792 KB Output is correct
82 Correct 13 ms 8792 KB Output is correct
83 Correct 156 ms 30644 KB Output is correct
84 Correct 146 ms 29220 KB Output is correct
85 Correct 154 ms 29804 KB Output is correct
86 Correct 143 ms 28904 KB Output is correct
87 Correct 164 ms 30756 KB Output is correct
88 Correct 144 ms 29184 KB Output is correct
89 Correct 151 ms 27632 KB Output is correct
90 Correct 123 ms 28676 KB Output is correct
91 Correct 100 ms 12364 KB Output is correct
92 Correct 167 ms 29436 KB Output is correct
93 Correct 150 ms 29228 KB Output is correct
94 Correct 67 ms 17928 KB Output is correct
95 Correct 71 ms 26080 KB Output is correct
96 Correct 147 ms 29652 KB Output is correct
97 Correct 67 ms 26288 KB Output is correct
98 Correct 74 ms 26100 KB Output is correct
99 Correct 142 ms 28732 KB Output is correct
100 Correct 60 ms 17848 KB Output is correct
101 Correct 75 ms 26120 KB Output is correct
102 Correct 162 ms 30748 KB Output is correct
103 Correct 70 ms 26492 KB Output is correct
104 Correct 61 ms 26308 KB Output is correct
105 Correct 129 ms 28332 KB Output is correct
106 Correct 39 ms 9176 KB Output is correct
107 Correct 41 ms 7888 KB Output is correct
108 Correct 38 ms 9752 KB Output is correct
109 Correct 41 ms 10700 KB Output is correct
110 Correct 172 ms 31880 KB Output is correct
111 Correct 183 ms 30596 KB Output is correct
112 Correct 161 ms 30676 KB Output is correct
113 Correct 153 ms 29484 KB Output is correct
114 Correct 161 ms 31716 KB Output is correct
115 Correct 155 ms 30260 KB Output is correct
116 Correct 169 ms 46264 KB Output is correct
117 Correct 138 ms 28480 KB Output is correct
118 Correct 113 ms 14460 KB Output is correct
119 Correct 58 ms 11460 KB Output is correct
120 Correct 159 ms 30004 KB Output is correct
121 Correct 78 ms 26332 KB Output is correct
122 Correct 82 ms 26436 KB Output is correct
123 Correct 162 ms 30600 KB Output is correct
124 Correct 65 ms 18264 KB Output is correct
125 Correct 83 ms 26040 KB Output is correct
126 Correct 148 ms 29944 KB Output is correct
127 Correct 63 ms 17604 KB Output is correct
128 Correct 77 ms 26544 KB Output is correct
129 Correct 168 ms 32212 KB Output is correct
130 Correct 81 ms 26288 KB Output is correct
131 Correct 83 ms 26328 KB Output is correct
132 Correct 140 ms 28424 KB Output is correct