oj.uz

답안 #987938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987938 2024-05-23T19:39:05 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 248 ms 48332 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 6 ms 6492 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 5 ms 8496 KB Output is correct
5 Correct 6 ms 6744 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 5 ms 8488 KB Output is correct
9 Correct 4 ms 8024 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 8280 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 6 ms 8540 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 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 5 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 5 ms 8372 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 25920 KB Output is correct
2 Correct 60 ms 27576 KB Output is correct
3 Correct 63 ms 27316 KB Output is correct
4 Correct 62 ms 26140 KB Output is correct
5 Correct 53 ms 17588 KB Output is correct
6 Correct 61 ms 17284 KB Output is correct
7 Correct 63 ms 25624 KB Output is correct
8 Correct 61 ms 27128 KB Output is correct
9 Correct 21 ms 8540 KB Output is correct
10 Correct 74 ms 25780 KB Output is correct
11 Correct 18 ms 8756 KB Output is correct
12 Correct 30 ms 9708 KB Output is correct
13 Correct 72 ms 26940 KB Output is correct
14 Correct 77 ms 25832 KB Output is correct
15 Correct 14 ms 8792 KB Output is correct
16 Correct 60 ms 25648 KB Output is correct
17 Correct 72 ms 27320 KB Output is correct
18 Correct 22 ms 9180 KB Output is correct
19 Correct 66 ms 25796 KB Output is correct
20 Correct 59 ms 27624 KB Output is correct
21 Correct 15 ms 8792 KB Output is correct
22 Correct 59 ms 16848 KB Output is correct
23 Correct 72 ms 25272 KB Output is correct
24 Correct 15 ms 8796 KB Output is correct
25 Correct 14 ms 6744 KB Output is correct
26 Correct 52 ms 18872 KB Output is correct
27 Correct 74 ms 14632 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 5 ms 8496 KB Output is correct
5 Correct 6 ms 6744 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 5 ms 8488 KB Output is correct
9 Correct 4 ms 8024 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 8280 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 6 ms 8540 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 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 5 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 5 ms 8372 KB Output is correct
29 Correct 58 ms 25920 KB Output is correct
30 Correct 60 ms 27576 KB Output is correct
31 Correct 63 ms 27316 KB Output is correct
32 Correct 62 ms 26140 KB Output is correct
33 Correct 53 ms 17588 KB Output is correct
34 Correct 61 ms 17284 KB Output is correct
35 Correct 63 ms 25624 KB Output is correct
36 Correct 61 ms 27128 KB Output is correct
37 Correct 21 ms 8540 KB Output is correct
38 Correct 74 ms 25780 KB Output is correct
39 Correct 18 ms 8756 KB Output is correct
40 Correct 30 ms 9708 KB Output is correct
41 Correct 72 ms 26940 KB Output is correct
42 Correct 77 ms 25832 KB Output is correct
43 Correct 14 ms 8792 KB Output is correct
44 Correct 60 ms 25648 KB Output is correct
45 Correct 72 ms 27320 KB Output is correct
46 Correct 22 ms 9180 KB Output is correct
47 Correct 66 ms 25796 KB Output is correct
48 Correct 59 ms 27624 KB Output is correct
49 Correct 15 ms 8792 KB Output is correct
50 Correct 59 ms 16848 KB Output is correct
51 Correct 72 ms 25272 KB Output is correct
52 Correct 15 ms 8796 KB Output is correct
53 Correct 14 ms 6744 KB Output is correct
54 Correct 52 ms 18872 KB Output is correct
55 Correct 74 ms 14632 KB Output is correct
56 Correct 159 ms 33300 KB Output is correct
57 Correct 196 ms 30888 KB Output is correct
58 Correct 137 ms 31588 KB Output is correct
59 Correct 138 ms 31192 KB Output is correct
60 Correct 164 ms 26424 KB Output is correct
61 Correct 151 ms 33452 KB Output is correct
62 Correct 152 ms 29728 KB Output is correct
63 Correct 122 ms 26388 KB Output is correct
64 Correct 55 ms 10704 KB Output is correct
65 Correct 193 ms 30796 KB Output is correct
66 Correct 73 ms 13436 KB Output is correct
67 Correct 48 ms 10188 KB Output is correct
68 Correct 96 ms 24440 KB Output is correct
69 Correct 197 ms 32664 KB Output is correct
70 Correct 21 ms 8864 KB Output is correct
71 Correct 91 ms 26548 KB Output is correct
72 Correct 153 ms 31680 KB Output is correct
73 Correct 15 ms 6604 KB Output is correct
74 Correct 74 ms 15700 KB Output is correct
75 Correct 225 ms 33804 KB Output is correct
76 Correct 18 ms 6668 KB Output is correct
77 Correct 88 ms 14552 KB Output is correct
78 Correct 134 ms 27116 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 7676 KB Output is correct
2 Correct 51 ms 6660 KB Output is correct
3 Correct 16 ms 5788 KB Output is correct
4 Correct 19 ms 5976 KB Output is correct
5 Correct 232 ms 33464 KB Output is correct
6 Correct 184 ms 32188 KB Output is correct
7 Correct 215 ms 32696 KB Output is correct
8 Correct 201 ms 31528 KB Output is correct
9 Correct 153 ms 33652 KB Output is correct
10 Correct 150 ms 31912 KB Output is correct
11 Correct 164 ms 30596 KB Output is correct
12 Correct 176 ms 30828 KB Output is correct
13 Correct 136 ms 14516 KB Output is correct
14 Correct 200 ms 32024 KB Output is correct
15 Correct 190 ms 32244 KB Output is correct
16 Correct 79 ms 14860 KB Output is correct
17 Correct 111 ms 22960 KB Output is correct
18 Correct 188 ms 32344 KB Output is correct
19 Correct 91 ms 23268 KB Output is correct
20 Correct 94 ms 22884 KB Output is correct
21 Correct 200 ms 31544 KB Output is correct
22 Correct 82 ms 14788 KB Output is correct
23 Correct 102 ms 23136 KB Output is correct
24 Correct 209 ms 33628 KB Output is correct
25 Correct 78 ms 23360 KB Output is correct
26 Correct 66 ms 23344 KB Output is correct
27 Correct 164 ms 30404 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 5 ms 8496 KB Output is correct
5 Correct 6 ms 6744 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 5 ms 8488 KB Output is correct
9 Correct 4 ms 8024 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 8280 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 6 ms 8540 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 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 5 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 5 ms 8372 KB Output is correct
29 Correct 58 ms 25920 KB Output is correct
30 Correct 60 ms 27576 KB Output is correct
31 Correct 63 ms 27316 KB Output is correct
32 Correct 62 ms 26140 KB Output is correct
33 Correct 53 ms 17588 KB Output is correct
34 Correct 61 ms 17284 KB Output is correct
35 Correct 63 ms 25624 KB Output is correct
36 Correct 61 ms 27128 KB Output is correct
37 Correct 21 ms 8540 KB Output is correct
38 Correct 74 ms 25780 KB Output is correct
39 Correct 18 ms 8756 KB Output is correct
40 Correct 30 ms 9708 KB Output is correct
41 Correct 72 ms 26940 KB Output is correct
42 Correct 77 ms 25832 KB Output is correct
43 Correct 14 ms 8792 KB Output is correct
44 Correct 60 ms 25648 KB Output is correct
45 Correct 72 ms 27320 KB Output is correct
46 Correct 22 ms 9180 KB Output is correct
47 Correct 66 ms 25796 KB Output is correct
48 Correct 59 ms 27624 KB Output is correct
49 Correct 15 ms 8792 KB Output is correct
50 Correct 59 ms 16848 KB Output is correct
51 Correct 72 ms 25272 KB Output is correct
52 Correct 15 ms 8796 KB Output is correct
53 Correct 14 ms 6744 KB Output is correct
54 Correct 52 ms 18872 KB Output is correct
55 Correct 74 ms 14632 KB Output is correct
56 Correct 159 ms 33300 KB Output is correct
57 Correct 196 ms 30888 KB Output is correct
58 Correct 137 ms 31588 KB Output is correct
59 Correct 138 ms 31192 KB Output is correct
60 Correct 164 ms 26424 KB Output is correct
61 Correct 151 ms 33452 KB Output is correct
62 Correct 152 ms 29728 KB Output is correct
63 Correct 122 ms 26388 KB Output is correct
64 Correct 55 ms 10704 KB Output is correct
65 Correct 193 ms 30796 KB Output is correct
66 Correct 73 ms 13436 KB Output is correct
67 Correct 48 ms 10188 KB Output is correct
68 Correct 96 ms 24440 KB Output is correct
69 Correct 197 ms 32664 KB Output is correct
70 Correct 21 ms 8864 KB Output is correct
71 Correct 91 ms 26548 KB Output is correct
72 Correct 153 ms 31680 KB Output is correct
73 Correct 15 ms 6604 KB Output is correct
74 Correct 74 ms 15700 KB Output is correct
75 Correct 225 ms 33804 KB Output is correct
76 Correct 18 ms 6668 KB Output is correct
77 Correct 88 ms 14552 KB Output is correct
78 Correct 134 ms 27116 KB Output is correct
79 Correct 51 ms 7676 KB Output is correct
80 Correct 51 ms 6660 KB Output is correct
81 Correct 16 ms 5788 KB Output is correct
82 Correct 19 ms 5976 KB Output is correct
83 Correct 232 ms 33464 KB Output is correct
84 Correct 184 ms 32188 KB Output is correct
85 Correct 215 ms 32696 KB Output is correct
86 Correct 201 ms 31528 KB Output is correct
87 Correct 153 ms 33652 KB Output is correct
88 Correct 150 ms 31912 KB Output is correct
89 Correct 164 ms 30596 KB Output is correct
90 Correct 176 ms 30828 KB Output is correct
91 Correct 136 ms 14516 KB Output is correct
92 Correct 200 ms 32024 KB Output is correct
93 Correct 190 ms 32244 KB Output is correct
94 Correct 79 ms 14860 KB Output is correct
95 Correct 111 ms 22960 KB Output is correct
96 Correct 188 ms 32344 KB Output is correct
97 Correct 91 ms 23268 KB Output is correct
98 Correct 94 ms 22884 KB Output is correct
99 Correct 200 ms 31544 KB Output is correct
100 Correct 82 ms 14788 KB Output is correct
101 Correct 102 ms 23136 KB Output is correct
102 Correct 209 ms 33628 KB Output is correct
103 Correct 78 ms 23360 KB Output is correct
104 Correct 66 ms 23344 KB Output is correct
105 Correct 164 ms 30404 KB Output is correct
106 Correct 40 ms 6304 KB Output is correct
107 Correct 47 ms 8044 KB Output is correct
108 Correct 44 ms 6924 KB Output is correct
109 Correct 46 ms 7880 KB Output is correct
110 Correct 248 ms 35448 KB Output is correct
111 Correct 227 ms 34660 KB Output is correct
112 Correct 232 ms 34276 KB Output is correct
113 Correct 229 ms 32600 KB Output is correct
114 Correct 241 ms 34068 KB Output is correct
115 Correct 217 ms 32512 KB Output is correct
116 Correct 230 ms 48332 KB Output is correct
117 Correct 199 ms 30032 KB Output is correct
118 Correct 124 ms 15944 KB Output is correct
119 Correct 102 ms 10444 KB Output is correct
120 Correct 232 ms 32276 KB Output is correct
121 Correct 97 ms 23468 KB Output is correct
122 Correct 92 ms 23468 KB Output is correct
123 Correct 191 ms 32960 KB Output is correct
124 Correct 85 ms 15360 KB Output is correct
125 Correct 105 ms 23160 KB Output is correct
126 Correct 190 ms 32320 KB Output is correct
127 Correct 82 ms 14700 KB Output is correct
128 Correct 78 ms 23680 KB Output is correct
129 Correct 197 ms 36336 KB Output is correct
130 Correct 103 ms 24316 KB Output is correct
131 Correct 84 ms 24244 KB Output is correct
132 Correct 150 ms 30672 KB Output is correct