oj.uz

답안 #987941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987941 2024-05-23T19:39:52 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 241 ms 48508 KB 
///OWNERUL LUI Calin <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 8536 KB Output is correct
2 Correct 5 ms 6616 KB Output is correct
3 Correct 6 ms 8680 KB Output is correct
4 Correct 5 ms 6616 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 7640 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 6 ms 6616 KB Output is correct
11 Correct 3 ms 6204 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 6 ms 8660 KB Output is correct
15 Correct 5 ms 5212 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 6312 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 7 ms 6616 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 6 ms 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 4 ms 5208 KB Output is correct
26 Correct 6 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 23072 KB Output is correct
2 Correct 68 ms 22956 KB Output is correct
3 Correct 76 ms 23016 KB Output is correct
4 Correct 66 ms 22964 KB Output is correct
5 Correct 55 ms 14776 KB Output is correct
6 Correct 70 ms 14388 KB Output is correct
7 Correct 70 ms 22616 KB Output is correct
8 Correct 65 ms 22572 KB Output is correct
9 Correct 15 ms 5976 KB Output is correct
10 Correct 69 ms 23020 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 36 ms 6900 KB Output is correct
13 Correct 71 ms 22704 KB Output is correct
14 Correct 81 ms 22916 KB Output is correct
15 Correct 17 ms 5720 KB Output is correct
16 Correct 65 ms 22452 KB Output is correct
17 Correct 70 ms 22928 KB Output is correct
18 Correct 30 ms 6352 KB Output is correct
19 Correct 68 ms 23080 KB Output is correct
20 Correct 64 ms 23232 KB Output is correct
21 Correct 16 ms 5724 KB Output is correct
22 Correct 59 ms 14020 KB Output is correct
23 Correct 59 ms 22204 KB Output is correct
24 Correct 21 ms 5724 KB Output is correct
25 Correct 14 ms 5724 KB Output is correct
26 Correct 54 ms 14468 KB Output is correct
27 Correct 52 ms 14528 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 6616 KB Output is correct
3 Correct 6 ms 8680 KB Output is correct
4 Correct 5 ms 6616 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 7640 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 6 ms 6616 KB Output is correct
11 Correct 3 ms 6204 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 6 ms 8660 KB Output is correct
15 Correct 5 ms 5212 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 6312 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 7 ms 6616 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 6 ms 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 4 ms 5208 KB Output is correct
26 Correct 6 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 64 ms 23072 KB Output is correct
30 Correct 68 ms 22956 KB Output is correct
31 Correct 76 ms 23016 KB Output is correct
32 Correct 66 ms 22964 KB Output is correct
33 Correct 55 ms 14776 KB Output is correct
34 Correct 70 ms 14388 KB Output is correct
35 Correct 70 ms 22616 KB Output is correct
36 Correct 65 ms 22572 KB Output is correct
37 Correct 15 ms 5976 KB Output is correct
38 Correct 69 ms 23020 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 36 ms 6900 KB Output is correct
41 Correct 71 ms 22704 KB Output is correct
42 Correct 81 ms 22916 KB Output is correct
43 Correct 17 ms 5720 KB Output is correct
44 Correct 65 ms 22452 KB Output is correct
45 Correct 70 ms 22928 KB Output is correct
46 Correct 30 ms 6352 KB Output is correct
47 Correct 68 ms 23080 KB Output is correct
48 Correct 64 ms 23232 KB Output is correct
49 Correct 16 ms 5724 KB Output is correct
50 Correct 59 ms 14020 KB Output is correct
51 Correct 59 ms 22204 KB Output is correct
52 Correct 21 ms 5724 KB Output is correct
53 Correct 14 ms 5724 KB Output is correct
54 Correct 54 ms 14468 KB Output is correct
55 Correct 52 ms 14528 KB Output is correct
56 Correct 170 ms 34576 KB Output is correct
57 Correct 160 ms 31428 KB Output is correct
58 Correct 149 ms 34476 KB Output is correct
59 Correct 126 ms 30000 KB Output is correct
60 Correct 157 ms 26776 KB Output is correct
61 Correct 161 ms 32392 KB Output is correct
62 Correct 161 ms 28436 KB Output is correct
63 Correct 114 ms 26912 KB Output is correct
64 Correct 62 ms 11280 KB Output is correct
65 Correct 202 ms 31660 KB Output is correct
66 Correct 58 ms 11836 KB Output is correct
67 Correct 56 ms 10200 KB Output is correct
68 Correct 86 ms 24728 KB Output is correct
69 Correct 144 ms 33928 KB Output is correct
70 Correct 16 ms 6852 KB Output is correct
71 Correct 86 ms 26152 KB Output is correct
72 Correct 161 ms 32284 KB Output is correct
73 Correct 14 ms 6680 KB Output is correct
74 Correct 73 ms 16816 KB Output is correct
75 Correct 186 ms 35424 KB Output is correct
76 Correct 16 ms 6568 KB Output is correct
77 Correct 59 ms 15768 KB Output is correct
78 Correct 115 ms 26252 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 8652 KB Output is correct
2 Correct 39 ms 7388 KB Output is correct
3 Correct 16 ms 6748 KB Output is correct
4 Correct 15 ms 6744 KB Output is correct
5 Correct 210 ms 34532 KB Output is correct
6 Correct 170 ms 33348 KB Output is correct
7 Correct 152 ms 33932 KB Output is correct
8 Correct 184 ms 32904 KB Output is correct
9 Correct 210 ms 34612 KB Output is correct
10 Correct 193 ms 33200 KB Output is correct
11 Correct 190 ms 31720 KB Output is correct
12 Correct 128 ms 32484 KB Output is correct
13 Correct 120 ms 15400 KB Output is correct
14 Correct 205 ms 31656 KB Output is correct
15 Correct 210 ms 31524 KB Output is correct
16 Correct 78 ms 15916 KB Output is correct
17 Correct 109 ms 24948 KB Output is correct
18 Correct 207 ms 32364 KB Output is correct
19 Correct 84 ms 23220 KB Output is correct
20 Correct 90 ms 22976 KB Output is correct
21 Correct 177 ms 30868 KB Output is correct
22 Correct 82 ms 14856 KB Output is correct
23 Correct 89 ms 23080 KB Output is correct
24 Correct 235 ms 32988 KB Output is correct
25 Correct 86 ms 23500 KB Output is correct
26 Correct 78 ms 23340 KB Output is correct
27 Correct 150 ms 29684 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 6616 KB Output is correct
3 Correct 6 ms 8680 KB Output is correct
4 Correct 5 ms 6616 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 7640 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 6 ms 6616 KB Output is correct
11 Correct 3 ms 6204 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 6 ms 8660 KB Output is correct
15 Correct 5 ms 5212 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 6312 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 7 ms 6616 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 6 ms 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 4 ms 5208 KB Output is correct
26 Correct 6 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 64 ms 23072 KB Output is correct
30 Correct 68 ms 22956 KB Output is correct
31 Correct 76 ms 23016 KB Output is correct
32 Correct 66 ms 22964 KB Output is correct
33 Correct 55 ms 14776 KB Output is correct
34 Correct 70 ms 14388 KB Output is correct
35 Correct 70 ms 22616 KB Output is correct
36 Correct 65 ms 22572 KB Output is correct
37 Correct 15 ms 5976 KB Output is correct
38 Correct 69 ms 23020 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 36 ms 6900 KB Output is correct
41 Correct 71 ms 22704 KB Output is correct
42 Correct 81 ms 22916 KB Output is correct
43 Correct 17 ms 5720 KB Output is correct
44 Correct 65 ms 22452 KB Output is correct
45 Correct 70 ms 22928 KB Output is correct
46 Correct 30 ms 6352 KB Output is correct
47 Correct 68 ms 23080 KB Output is correct
48 Correct 64 ms 23232 KB Output is correct
49 Correct 16 ms 5724 KB Output is correct
50 Correct 59 ms 14020 KB Output is correct
51 Correct 59 ms 22204 KB Output is correct
52 Correct 21 ms 5724 KB Output is correct
53 Correct 14 ms 5724 KB Output is correct
54 Correct 54 ms 14468 KB Output is correct
55 Correct 52 ms 14528 KB Output is correct
56 Correct 170 ms 34576 KB Output is correct
57 Correct 160 ms 31428 KB Output is correct
58 Correct 149 ms 34476 KB Output is correct
59 Correct 126 ms 30000 KB Output is correct
60 Correct 157 ms 26776 KB Output is correct
61 Correct 161 ms 32392 KB Output is correct
62 Correct 161 ms 28436 KB Output is correct
63 Correct 114 ms 26912 KB Output is correct
64 Correct 62 ms 11280 KB Output is correct
65 Correct 202 ms 31660 KB Output is correct
66 Correct 58 ms 11836 KB Output is correct
67 Correct 56 ms 10200 KB Output is correct
68 Correct 86 ms 24728 KB Output is correct
69 Correct 144 ms 33928 KB Output is correct
70 Correct 16 ms 6852 KB Output is correct
71 Correct 86 ms 26152 KB Output is correct
72 Correct 161 ms 32284 KB Output is correct
73 Correct 14 ms 6680 KB Output is correct
74 Correct 73 ms 16816 KB Output is correct
75 Correct 186 ms 35424 KB Output is correct
76 Correct 16 ms 6568 KB Output is correct
77 Correct 59 ms 15768 KB Output is correct
78 Correct 115 ms 26252 KB Output is correct
79 Correct 43 ms 8652 KB Output is correct
80 Correct 39 ms 7388 KB Output is correct
81 Correct 16 ms 6748 KB Output is correct
82 Correct 15 ms 6744 KB Output is correct
83 Correct 210 ms 34532 KB Output is correct
84 Correct 170 ms 33348 KB Output is correct
85 Correct 152 ms 33932 KB Output is correct
86 Correct 184 ms 32904 KB Output is correct
87 Correct 210 ms 34612 KB Output is correct
88 Correct 193 ms 33200 KB Output is correct
89 Correct 190 ms 31720 KB Output is correct
90 Correct 128 ms 32484 KB Output is correct
91 Correct 120 ms 15400 KB Output is correct
92 Correct 205 ms 31656 KB Output is correct
93 Correct 210 ms 31524 KB Output is correct
94 Correct 78 ms 15916 KB Output is correct
95 Correct 109 ms 24948 KB Output is correct
96 Correct 207 ms 32364 KB Output is correct
97 Correct 84 ms 23220 KB Output is correct
98 Correct 90 ms 22976 KB Output is correct
99 Correct 177 ms 30868 KB Output is correct
100 Correct 82 ms 14856 KB Output is correct
101 Correct 89 ms 23080 KB Output is correct
102 Correct 235 ms 32988 KB Output is correct
103 Correct 86 ms 23500 KB Output is correct
104 Correct 78 ms 23340 KB Output is correct
105 Correct 150 ms 29684 KB Output is correct
106 Correct 59 ms 6264 KB Output is correct
107 Correct 57 ms 7860 KB Output is correct
108 Correct 42 ms 6968 KB Output is correct
109 Correct 44 ms 7768 KB Output is correct
110 Correct 221 ms 33852 KB Output is correct
111 Correct 241 ms 33308 KB Output is correct
112 Correct 185 ms 32752 KB Output is correct
113 Correct 179 ms 31800 KB Output is correct
114 Correct 202 ms 34088 KB Output is correct
115 Correct 207 ms 32652 KB Output is correct
116 Correct 217 ms 48508 KB Output is correct
117 Correct 159 ms 29888 KB Output is correct
118 Correct 134 ms 15852 KB Output is correct
119 Correct 74 ms 10472 KB Output is correct
120 Correct 200 ms 32288 KB Output is correct
121 Correct 97 ms 23420 KB Output is correct
122 Correct 85 ms 23540 KB Output is correct
123 Correct 198 ms 33012 KB Output is correct
124 Correct 88 ms 15392 KB Output is correct
125 Correct 97 ms 23064 KB Output is correct
126 Correct 170 ms 30040 KB Output is correct
127 Correct 77 ms 14748 KB Output is correct
128 Correct 99 ms 23632 KB Output is correct
129 Correct 218 ms 32240 KB Output is correct
130 Correct 84 ms 23448 KB Output is correct
131 Correct 95 ms 23108 KB Output is correct
132 Correct 166 ms 27748 KB Output is correct