oj.uz

답안 #987964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987964 2024-05-23T19:47:00 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 185 ms 46900 KB 
///OWNERUL LUI Calin <3
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#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:5:359: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    5 | 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:5:917: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    5 | 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:5:1866: 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;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:5:2068: 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;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:5:2152: 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;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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8580 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 6504 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 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 5 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8492 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 26936 KB Output is correct
2 Correct 73 ms 26796 KB Output is correct
3 Correct 58 ms 27616 KB Output is correct
4 Correct 58 ms 26596 KB Output is correct
5 Correct 52 ms 19136 KB Output is correct
6 Correct 51 ms 17992 KB Output is correct
7 Correct 58 ms 26284 KB Output is correct
8 Correct 53 ms 25776 KB Output is correct
9 Correct 13 ms 8556 KB Output is correct
10 Correct 57 ms 27832 KB Output is correct
11 Correct 13 ms 8540 KB Output is correct
12 Correct 30 ms 9680 KB Output is correct
13 Correct 59 ms 25832 KB Output is correct
14 Correct 56 ms 26544 KB Output is correct
15 Correct 12 ms 8792 KB Output is correct
16 Correct 60 ms 26300 KB Output is correct
17 Correct 62 ms 27676 KB Output is correct
18 Correct 20 ms 9176 KB Output is correct
19 Correct 59 ms 26296 KB Output is correct
20 Correct 58 ms 27572 KB Output is correct
21 Correct 13 ms 8796 KB Output is correct
22 Correct 54 ms 17856 KB Output is correct
23 Correct 56 ms 25192 KB Output is correct
24 Correct 13 ms 8540 KB Output is correct
25 Correct 15 ms 8540 KB Output is correct
26 Correct 48 ms 18876 KB Output is correct
27 Correct 49 ms 19020 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8580 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 6504 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 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 5 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8492 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 56 ms 26936 KB Output is correct
30 Correct 73 ms 26796 KB Output is correct
31 Correct 58 ms 27616 KB Output is correct
32 Correct 58 ms 26596 KB Output is correct
33 Correct 52 ms 19136 KB Output is correct
34 Correct 51 ms 17992 KB Output is correct
35 Correct 58 ms 26284 KB Output is correct
36 Correct 53 ms 25776 KB Output is correct
37 Correct 13 ms 8556 KB Output is correct
38 Correct 57 ms 27832 KB Output is correct
39 Correct 13 ms 8540 KB Output is correct
40 Correct 30 ms 9680 KB Output is correct
41 Correct 59 ms 25832 KB Output is correct
42 Correct 56 ms 26544 KB Output is correct
43 Correct 12 ms 8792 KB Output is correct
44 Correct 60 ms 26300 KB Output is correct
45 Correct 62 ms 27676 KB Output is correct
46 Correct 20 ms 9176 KB Output is correct
47 Correct 59 ms 26296 KB Output is correct
48 Correct 58 ms 27572 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 54 ms 17856 KB Output is correct
51 Correct 56 ms 25192 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 15 ms 8540 KB Output is correct
54 Correct 48 ms 18876 KB Output is correct
55 Correct 49 ms 19020 KB Output is correct
56 Correct 176 ms 33404 KB Output is correct
57 Correct 124 ms 30276 KB Output is correct
58 Correct 130 ms 32568 KB Output is correct
59 Correct 117 ms 30956 KB Output is correct
60 Correct 150 ms 24204 KB Output is correct
61 Correct 134 ms 30980 KB Output is correct
62 Correct 132 ms 29528 KB Output is correct
63 Correct 103 ms 27112 KB Output is correct
64 Correct 53 ms 10952 KB Output is correct
65 Correct 123 ms 31540 KB Output is correct
66 Correct 50 ms 11480 KB Output is correct
67 Correct 54 ms 12228 KB Output is correct
68 Correct 71 ms 27404 KB Output is correct
69 Correct 135 ms 32316 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 72 ms 26808 KB Output is correct
72 Correct 114 ms 29320 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 62 ms 19392 KB Output is correct
75 Correct 141 ms 34208 KB Output is correct
76 Correct 15 ms 8540 KB Output is correct
77 Correct 58 ms 18308 KB Output is correct
78 Correct 102 ms 28172 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 10552 KB Output is correct
2 Correct 37 ms 9432 KB Output is correct
3 Correct 13 ms 8792 KB Output is correct
4 Correct 13 ms 8792 KB Output is correct
5 Correct 147 ms 31804 KB Output is correct
6 Correct 148 ms 30788 KB Output is correct
7 Correct 140 ms 31876 KB Output is correct
8 Correct 132 ms 28812 KB Output is correct
9 Correct 172 ms 31912 KB Output is correct
10 Correct 146 ms 30512 KB Output is correct
11 Correct 133 ms 29236 KB Output is correct
12 Correct 118 ms 28592 KB Output is correct
13 Correct 102 ms 12368 KB Output is correct
14 Correct 185 ms 31352 KB Output is correct
15 Correct 150 ms 31428 KB Output is correct
16 Correct 61 ms 19404 KB Output is correct
17 Correct 72 ms 26524 KB Output is correct
18 Correct 160 ms 30988 KB Output is correct
19 Correct 68 ms 27832 KB Output is correct
20 Correct 69 ms 26980 KB Output is correct
21 Correct 136 ms 29252 KB Output is correct
22 Correct 58 ms 17748 KB Output is correct
23 Correct 68 ms 28012 KB Output is correct
24 Correct 146 ms 30800 KB Output is correct
25 Correct 58 ms 26300 KB Output is correct
26 Correct 58 ms 27064 KB Output is correct
27 Correct 123 ms 29064 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8580 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 6504 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 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 5 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8492 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 56 ms 26936 KB Output is correct
30 Correct 73 ms 26796 KB Output is correct
31 Correct 58 ms 27616 KB Output is correct
32 Correct 58 ms 26596 KB Output is correct
33 Correct 52 ms 19136 KB Output is correct
34 Correct 51 ms 17992 KB Output is correct
35 Correct 58 ms 26284 KB Output is correct
36 Correct 53 ms 25776 KB Output is correct
37 Correct 13 ms 8556 KB Output is correct
38 Correct 57 ms 27832 KB Output is correct
39 Correct 13 ms 8540 KB Output is correct
40 Correct 30 ms 9680 KB Output is correct
41 Correct 59 ms 25832 KB Output is correct
42 Correct 56 ms 26544 KB Output is correct
43 Correct 12 ms 8792 KB Output is correct
44 Correct 60 ms 26300 KB Output is correct
45 Correct 62 ms 27676 KB Output is correct
46 Correct 20 ms 9176 KB Output is correct
47 Correct 59 ms 26296 KB Output is correct
48 Correct 58 ms 27572 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 54 ms 17856 KB Output is correct
51 Correct 56 ms 25192 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 15 ms 8540 KB Output is correct
54 Correct 48 ms 18876 KB Output is correct
55 Correct 49 ms 19020 KB Output is correct
56 Correct 176 ms 33404 KB Output is correct
57 Correct 124 ms 30276 KB Output is correct
58 Correct 130 ms 32568 KB Output is correct
59 Correct 117 ms 30956 KB Output is correct
60 Correct 150 ms 24204 KB Output is correct
61 Correct 134 ms 30980 KB Output is correct
62 Correct 132 ms 29528 KB Output is correct
63 Correct 103 ms 27112 KB Output is correct
64 Correct 53 ms 10952 KB Output is correct
65 Correct 123 ms 31540 KB Output is correct
66 Correct 50 ms 11480 KB Output is correct
67 Correct 54 ms 12228 KB Output is correct
68 Correct 71 ms 27404 KB Output is correct
69 Correct 135 ms 32316 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 72 ms 26808 KB Output is correct
72 Correct 114 ms 29320 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 62 ms 19392 KB Output is correct
75 Correct 141 ms 34208 KB Output is correct
76 Correct 15 ms 8540 KB Output is correct
77 Correct 58 ms 18308 KB Output is correct
78 Correct 102 ms 28172 KB Output is correct
79 Correct 42 ms 10552 KB Output is correct
80 Correct 37 ms 9432 KB Output is correct
81 Correct 13 ms 8792 KB Output is correct
82 Correct 13 ms 8792 KB Output is correct
83 Correct 147 ms 31804 KB Output is correct
84 Correct 148 ms 30788 KB Output is correct
85 Correct 140 ms 31876 KB Output is correct
86 Correct 132 ms 28812 KB Output is correct
87 Correct 172 ms 31912 KB Output is correct
88 Correct 146 ms 30512 KB Output is correct
89 Correct 133 ms 29236 KB Output is correct
90 Correct 118 ms 28592 KB Output is correct
91 Correct 102 ms 12368 KB Output is correct
92 Correct 185 ms 31352 KB Output is correct
93 Correct 150 ms 31428 KB Output is correct
94 Correct 61 ms 19404 KB Output is correct
95 Correct 72 ms 26524 KB Output is correct
96 Correct 160 ms 30988 KB Output is correct
97 Correct 68 ms 27832 KB Output is correct
98 Correct 69 ms 26980 KB Output is correct
99 Correct 136 ms 29252 KB Output is correct
100 Correct 58 ms 17748 KB Output is correct
101 Correct 68 ms 28012 KB Output is correct
102 Correct 146 ms 30800 KB Output is correct
103 Correct 58 ms 26300 KB Output is correct
104 Correct 58 ms 27064 KB Output is correct
105 Correct 123 ms 29064 KB Output is correct
106 Correct 37 ms 9256 KB Output is correct
107 Correct 43 ms 11020 KB Output is correct
108 Correct 39 ms 9936 KB Output is correct
109 Correct 47 ms 10708 KB Output is correct
110 Correct 152 ms 32068 KB Output is correct
111 Correct 159 ms 30784 KB Output is correct
112 Correct 153 ms 31060 KB Output is correct
113 Correct 154 ms 30976 KB Output is correct
114 Correct 155 ms 33592 KB Output is correct
115 Correct 150 ms 30536 KB Output is correct
116 Correct 160 ms 46900 KB Output is correct
117 Correct 140 ms 30500 KB Output is correct
118 Correct 112 ms 14296 KB Output is correct
119 Correct 50 ms 11340 KB Output is correct
120 Correct 156 ms 31424 KB Output is correct
121 Correct 70 ms 28308 KB Output is correct
122 Correct 71 ms 26552 KB Output is correct
123 Correct 167 ms 32268 KB Output is correct
124 Correct 62 ms 18636 KB Output is correct
125 Correct 85 ms 28008 KB Output is correct
126 Correct 155 ms 29892 KB Output is correct
127 Correct 58 ms 18624 KB Output is correct
128 Correct 71 ms 27824 KB Output is correct
129 Correct 158 ms 33472 KB Output is correct
130 Correct 76 ms 26808 KB Output is correct
131 Correct 81 ms 27844 KB Output is correct
132 Correct 138 ms 28452 KB Output is correct