oj.uz

답안 #987934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987934 2024-05-23T19:38:19 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++17
25 / 25
 248 ms 48552 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;long long sum=0;ios_base::sync_with_stdio(false);cin.tie(NULL);cin>>n>>m>>k;for(i=1; i<=n; i++){cin>>a>>b;adj[a].push_back(b);}for(i=1; i<=m; i++){cin>>x[i]>>y[i];if(y[i]==0){cost[i]=inf;}else{sort(adj[i].begin(),adj[i].end());if(adj[i].size()<x[i]){for(int j=1; j<=k; j++){cout<<-1<<'\n';}return 0;}if(x[i]==0){if(adj[i].size()==0){cost[i]=inf;}else{init[i]=adj[i][0];cost[i]=adj[i][0];}}else{int vkuk=adj[i][0];init[i]=adj[i][0];for(int j=0; j<adj[i].size(); j++){if(j+1<=x[i]){sum+=adj[i][j];}adj[i][j]-=vkuk;}if(adj[i].size()==x[i]){cost[i]=inf;}else{cost[i]=adj[i][x[i]]-adj[i][x[i]-1];}}}ord.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:8:365: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    8 | 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:8:923: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    8 | 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:8:1872: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 | 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:8:2074: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | 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:8:2158: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 | using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],i

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 5 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8792 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8784 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 6 ms 8284 KB Output is correct
25 Correct 3 ms 6236 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 27764 KB Output is correct
2 Correct 63 ms 25788 KB Output is correct
3 Correct 63 ms 25716 KB Output is correct
4 Correct 66 ms 25780 KB Output is correct
5 Correct 67 ms 15532 KB Output is correct
6 Correct 54 ms 17344 KB Output is correct
7 Correct 86 ms 25464 KB Output is correct
8 Correct 59 ms 25520 KB Output is correct
9 Correct 14 ms 8540 KB Output is correct
10 Correct 72 ms 27568 KB Output is correct
11 Correct 13 ms 8536 KB Output is correct
12 Correct 31 ms 7544 KB Output is correct
13 Correct 62 ms 25576 KB Output is correct
14 Correct 64 ms 25876 KB Output is correct
15 Correct 22 ms 8780 KB Output is correct
16 Correct 68 ms 25528 KB Output is correct
17 Correct 62 ms 25780 KB Output is correct
18 Correct 24 ms 9288 KB Output is correct
19 Correct 67 ms 26944 KB Output is correct
20 Correct 63 ms 26252 KB Output is correct
21 Correct 14 ms 6744 KB Output is correct
22 Correct 59 ms 16896 KB Output is correct
23 Correct 66 ms 22664 KB Output is correct
24 Correct 13 ms 8584 KB Output is correct
25 Correct 12 ms 8536 KB Output is correct
26 Correct 56 ms 17344 KB Output is correct
27 Correct 49 ms 17344 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 5 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8792 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8784 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 6 ms 8284 KB Output is correct
25 Correct 3 ms 6236 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 60 ms 27764 KB Output is correct
30 Correct 63 ms 25788 KB Output is correct
31 Correct 63 ms 25716 KB Output is correct
32 Correct 66 ms 25780 KB Output is correct
33 Correct 67 ms 15532 KB Output is correct
34 Correct 54 ms 17344 KB Output is correct
35 Correct 86 ms 25464 KB Output is correct
36 Correct 59 ms 25520 KB Output is correct
37 Correct 14 ms 8540 KB Output is correct
38 Correct 72 ms 27568 KB Output is correct
39 Correct 13 ms 8536 KB Output is correct
40 Correct 31 ms 7544 KB Output is correct
41 Correct 62 ms 25576 KB Output is correct
42 Correct 64 ms 25876 KB Output is correct
43 Correct 22 ms 8780 KB Output is correct
44 Correct 68 ms 25528 KB Output is correct
45 Correct 62 ms 25780 KB Output is correct
46 Correct 24 ms 9288 KB Output is correct
47 Correct 67 ms 26944 KB Output is correct
48 Correct 63 ms 26252 KB Output is correct
49 Correct 14 ms 6744 KB Output is correct
50 Correct 59 ms 16896 KB Output is correct
51 Correct 66 ms 22664 KB Output is correct
52 Correct 13 ms 8584 KB Output is correct
53 Correct 12 ms 8536 KB Output is correct
54 Correct 56 ms 17344 KB Output is correct
55 Correct 49 ms 17344 KB Output is correct
56 Correct 179 ms 30948 KB Output is correct
57 Correct 156 ms 27980 KB Output is correct
58 Correct 174 ms 29020 KB Output is correct
59 Correct 153 ms 30224 KB Output is correct
60 Correct 187 ms 23760 KB Output is correct
61 Correct 155 ms 30792 KB Output is correct
62 Correct 158 ms 28056 KB Output is correct
63 Correct 137 ms 26624 KB Output is correct
64 Correct 62 ms 10956 KB Output is correct
65 Correct 180 ms 28720 KB Output is correct
66 Correct 68 ms 9336 KB Output is correct
67 Correct 57 ms 12216 KB Output is correct
68 Correct 89 ms 25036 KB Output is correct
69 Correct 193 ms 30500 KB Output is correct
70 Correct 19 ms 9052 KB Output is correct
71 Correct 127 ms 25548 KB Output is correct
72 Correct 131 ms 28620 KB Output is correct
73 Correct 16 ms 8724 KB Output is correct
74 Correct 77 ms 15904 KB Output is correct
75 Correct 174 ms 32464 KB Output is correct
76 Correct 20 ms 6492 KB Output is correct
77 Correct 78 ms 15280 KB Output is correct
78 Correct 127 ms 26776 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 8592 KB Output is correct
2 Correct 40 ms 9456 KB Output is correct
3 Correct 17 ms 7016 KB Output is correct
4 Correct 14 ms 6748 KB Output is correct
5 Correct 216 ms 30664 KB Output is correct
6 Correct 154 ms 29244 KB Output is correct
7 Correct 211 ms 29804 KB Output is correct
8 Correct 167 ms 30516 KB Output is correct
9 Correct 158 ms 30792 KB Output is correct
10 Correct 173 ms 29756 KB Output is correct
11 Correct 159 ms 29236 KB Output is correct
12 Correct 129 ms 27796 KB Output is correct
13 Correct 101 ms 11724 KB Output is correct
14 Correct 167 ms 29448 KB Output is correct
15 Correct 185 ms 30012 KB Output is correct
16 Correct 67 ms 15940 KB Output is correct
17 Correct 81 ms 26036 KB Output is correct
18 Correct 248 ms 31904 KB Output is correct
19 Correct 72 ms 24248 KB Output is correct
20 Correct 92 ms 24024 KB Output is correct
21 Correct 163 ms 31092 KB Output is correct
22 Correct 66 ms 14772 KB Output is correct
23 Correct 83 ms 22964 KB Output is correct
24 Correct 164 ms 32920 KB Output is correct
25 Correct 78 ms 23512 KB Output is correct
26 Correct 69 ms 23428 KB Output is correct
27 Correct 146 ms 29828 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 5 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8792 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8784 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 6 ms 8284 KB Output is correct
25 Correct 3 ms 6236 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 60 ms 27764 KB Output is correct
30 Correct 63 ms 25788 KB Output is correct
31 Correct 63 ms 25716 KB Output is correct
32 Correct 66 ms 25780 KB Output is correct
33 Correct 67 ms 15532 KB Output is correct
34 Correct 54 ms 17344 KB Output is correct
35 Correct 86 ms 25464 KB Output is correct
36 Correct 59 ms 25520 KB Output is correct
37 Correct 14 ms 8540 KB Output is correct
38 Correct 72 ms 27568 KB Output is correct
39 Correct 13 ms 8536 KB Output is correct
40 Correct 31 ms 7544 KB Output is correct
41 Correct 62 ms 25576 KB Output is correct
42 Correct 64 ms 25876 KB Output is correct
43 Correct 22 ms 8780 KB Output is correct
44 Correct 68 ms 25528 KB Output is correct
45 Correct 62 ms 25780 KB Output is correct
46 Correct 24 ms 9288 KB Output is correct
47 Correct 67 ms 26944 KB Output is correct
48 Correct 63 ms 26252 KB Output is correct
49 Correct 14 ms 6744 KB Output is correct
50 Correct 59 ms 16896 KB Output is correct
51 Correct 66 ms 22664 KB Output is correct
52 Correct 13 ms 8584 KB Output is correct
53 Correct 12 ms 8536 KB Output is correct
54 Correct 56 ms 17344 KB Output is correct
55 Correct 49 ms 17344 KB Output is correct
56 Correct 179 ms 30948 KB Output is correct
57 Correct 156 ms 27980 KB Output is correct
58 Correct 174 ms 29020 KB Output is correct
59 Correct 153 ms 30224 KB Output is correct
60 Correct 187 ms 23760 KB Output is correct
61 Correct 155 ms 30792 KB Output is correct
62 Correct 158 ms 28056 KB Output is correct
63 Correct 137 ms 26624 KB Output is correct
64 Correct 62 ms 10956 KB Output is correct
65 Correct 180 ms 28720 KB Output is correct
66 Correct 68 ms 9336 KB Output is correct
67 Correct 57 ms 12216 KB Output is correct
68 Correct 89 ms 25036 KB Output is correct
69 Correct 193 ms 30500 KB Output is correct
70 Correct 19 ms 9052 KB Output is correct
71 Correct 127 ms 25548 KB Output is correct
72 Correct 131 ms 28620 KB Output is correct
73 Correct 16 ms 8724 KB Output is correct
74 Correct 77 ms 15904 KB Output is correct
75 Correct 174 ms 32464 KB Output is correct
76 Correct 20 ms 6492 KB Output is correct
77 Correct 78 ms 15280 KB Output is correct
78 Correct 127 ms 26776 KB Output is correct
79 Correct 46 ms 8592 KB Output is correct
80 Correct 40 ms 9456 KB Output is correct
81 Correct 17 ms 7016 KB Output is correct
82 Correct 14 ms 6748 KB Output is correct
83 Correct 216 ms 30664 KB Output is correct
84 Correct 154 ms 29244 KB Output is correct
85 Correct 211 ms 29804 KB Output is correct
86 Correct 167 ms 30516 KB Output is correct
87 Correct 158 ms 30792 KB Output is correct
88 Correct 173 ms 29756 KB Output is correct
89 Correct 159 ms 29236 KB Output is correct
90 Correct 129 ms 27796 KB Output is correct
91 Correct 101 ms 11724 KB Output is correct
92 Correct 167 ms 29448 KB Output is correct
93 Correct 185 ms 30012 KB Output is correct
94 Correct 67 ms 15940 KB Output is correct
95 Correct 81 ms 26036 KB Output is correct
96 Correct 248 ms 31904 KB Output is correct
97 Correct 72 ms 24248 KB Output is correct
98 Correct 92 ms 24024 KB Output is correct
99 Correct 163 ms 31092 KB Output is correct
100 Correct 66 ms 14772 KB Output is correct
101 Correct 83 ms 22964 KB Output is correct
102 Correct 164 ms 32920 KB Output is correct
103 Correct 78 ms 23512 KB Output is correct
104 Correct 69 ms 23428 KB Output is correct
105 Correct 146 ms 29828 KB Output is correct
106 Correct 45 ms 6356 KB Output is correct
107 Correct 44 ms 7860 KB Output is correct
108 Correct 42 ms 7120 KB Output is correct
109 Correct 46 ms 7872 KB Output is correct
110 Correct 211 ms 33840 KB Output is correct
111 Correct 211 ms 33080 KB Output is correct
112 Correct 183 ms 32804 KB Output is correct
113 Correct 202 ms 31912 KB Output is correct
114 Correct 220 ms 34144 KB Output is correct
115 Correct 206 ms 32480 KB Output is correct
116 Correct 208 ms 48552 KB Output is correct
117 Correct 191 ms 30080 KB Output is correct
118 Correct 115 ms 15804 KB Output is correct
119 Correct 74 ms 10536 KB Output is correct
120 Correct 181 ms 32308 KB Output is correct
121 Correct 75 ms 23472 KB Output is correct
122 Correct 88 ms 23376 KB Output is correct
123 Correct 221 ms 32816 KB Output is correct
124 Correct 72 ms 15516 KB Output is correct
125 Correct 96 ms 23232 KB Output is correct
126 Correct 164 ms 32384 KB Output is correct
127 Correct 67 ms 14540 KB Output is correct
128 Correct 85 ms 23788 KB Output is correct
129 Correct 212 ms 34600 KB Output is correct
130 Correct 86 ms 23332 KB Output is correct
131 Correct 89 ms 23284 KB Output is correct
132 Correct 157 ms 29972 KB Output is correct