oj.uz

답안 #987945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987945 2024-05-23T19:40:41 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 234 ms 46216 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 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8540 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 8540 KB Output is correct
6 Correct 6 ms 6492 KB Output is correct
7 Correct 4 ms 8536 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 6552 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 6492 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 5 ms 8408 KB Output is correct
20 Correct 7 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 6 ms 8540 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 4 ms 8264 KB Output is correct
26 Correct 7 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 26388 KB Output is correct
2 Correct 84 ms 25916 KB Output is correct
3 Correct 75 ms 24524 KB Output is correct
4 Correct 65 ms 26544 KB Output is correct
5 Correct 71 ms 15036 KB Output is correct
6 Correct 53 ms 17552 KB Output is correct
7 Correct 63 ms 26056 KB Output is correct
8 Correct 64 ms 25584 KB Output is correct
9 Correct 20 ms 6720 KB Output is correct
10 Correct 81 ms 27828 KB Output is correct
11 Correct 20 ms 8716 KB Output is correct
12 Correct 30 ms 9676 KB Output is correct
13 Correct 63 ms 26720 KB Output is correct
14 Correct 77 ms 26892 KB Output is correct
15 Correct 17 ms 8796 KB Output is correct
16 Correct 68 ms 25776 KB Output is correct
17 Correct 65 ms 27468 KB Output is correct
18 Correct 22 ms 9304 KB Output is correct
19 Correct 64 ms 27040 KB Output is correct
20 Correct 68 ms 26228 KB Output is correct
21 Correct 17 ms 8796 KB Output is correct
22 Correct 55 ms 18308 KB Output is correct
23 Correct 54 ms 25780 KB Output is correct
24 Correct 23 ms 8620 KB Output is correct
25 Correct 21 ms 6492 KB Output is correct
26 Correct 54 ms 15424 KB Output is correct
27 Correct 73 ms 14644 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8540 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 8540 KB Output is correct
6 Correct 6 ms 6492 KB Output is correct
7 Correct 4 ms 8536 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 6552 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 6492 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 5 ms 8408 KB Output is correct
20 Correct 7 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 6 ms 8540 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 4 ms 8264 KB Output is correct
26 Correct 7 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 62 ms 26388 KB Output is correct
30 Correct 84 ms 25916 KB Output is correct
31 Correct 75 ms 24524 KB Output is correct
32 Correct 65 ms 26544 KB Output is correct
33 Correct 71 ms 15036 KB Output is correct
34 Correct 53 ms 17552 KB Output is correct
35 Correct 63 ms 26056 KB Output is correct
36 Correct 64 ms 25584 KB Output is correct
37 Correct 20 ms 6720 KB Output is correct
38 Correct 81 ms 27828 KB Output is correct
39 Correct 20 ms 8716 KB Output is correct
40 Correct 30 ms 9676 KB Output is correct
41 Correct 63 ms 26720 KB Output is correct
42 Correct 77 ms 26892 KB Output is correct
43 Correct 17 ms 8796 KB Output is correct
44 Correct 68 ms 25776 KB Output is correct
45 Correct 65 ms 27468 KB Output is correct
46 Correct 22 ms 9304 KB Output is correct
47 Correct 64 ms 27040 KB Output is correct
48 Correct 68 ms 26228 KB Output is correct
49 Correct 17 ms 8796 KB Output is correct
50 Correct 55 ms 18308 KB Output is correct
51 Correct 54 ms 25780 KB Output is correct
52 Correct 23 ms 8620 KB Output is correct
53 Correct 21 ms 6492 KB Output is correct
54 Correct 54 ms 15424 KB Output is correct
55 Correct 73 ms 14644 KB Output is correct
56 Correct 185 ms 30760 KB Output is correct
57 Correct 141 ms 29760 KB Output is correct
58 Correct 141 ms 30776 KB Output is correct
59 Correct 157 ms 29192 KB Output is correct
60 Correct 182 ms 23608 KB Output is correct
61 Correct 135 ms 29756 KB Output is correct
62 Correct 149 ms 29004 KB Output is correct
63 Correct 122 ms 28624 KB Output is correct
64 Correct 61 ms 10760 KB Output is correct
65 Correct 169 ms 30236 KB Output is correct
66 Correct 65 ms 11408 KB Output is correct
67 Correct 52 ms 12088 KB Output is correct
68 Correct 78 ms 26632 KB Output is correct
69 Correct 167 ms 31964 KB Output is correct
70 Correct 17 ms 8992 KB Output is correct
71 Correct 89 ms 28200 KB Output is correct
72 Correct 136 ms 29348 KB Output is correct
73 Correct 21 ms 5724 KB Output is correct
74 Correct 84 ms 18880 KB Output is correct
75 Correct 162 ms 32312 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 80 ms 18476 KB Output is correct
78 Correct 115 ms 26808 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 10672 KB Output is correct
2 Correct 43 ms 9556 KB Output is correct
3 Correct 22 ms 8796 KB Output is correct
4 Correct 17 ms 8792 KB Output is correct
5 Correct 188 ms 30908 KB Output is correct
6 Correct 172 ms 29380 KB Output is correct
7 Correct 179 ms 30636 KB Output is correct
8 Correct 155 ms 28984 KB Output is correct
9 Correct 201 ms 31136 KB Output is correct
10 Correct 214 ms 29200 KB Output is correct
11 Correct 147 ms 29240 KB Output is correct
12 Correct 132 ms 28576 KB Output is correct
13 Correct 108 ms 12320 KB Output is correct
14 Correct 173 ms 30176 KB Output is correct
15 Correct 204 ms 29196 KB Output is correct
16 Correct 61 ms 18888 KB Output is correct
17 Correct 90 ms 26020 KB Output is correct
18 Correct 187 ms 31544 KB Output is correct
19 Correct 72 ms 27100 KB Output is correct
20 Correct 105 ms 25824 KB Output is correct
21 Correct 145 ms 28676 KB Output is correct
22 Correct 86 ms 17844 KB Output is correct
23 Correct 94 ms 27924 KB Output is correct
24 Correct 199 ms 30776 KB Output is correct
25 Correct 65 ms 26272 KB Output is correct
26 Correct 74 ms 27580 KB Output is correct
27 Correct 128 ms 29584 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8540 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 8540 KB Output is correct
6 Correct 6 ms 6492 KB Output is correct
7 Correct 4 ms 8536 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 6552 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 6492 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 5 ms 8408 KB Output is correct
20 Correct 7 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 6 ms 8540 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 4 ms 8264 KB Output is correct
26 Correct 7 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 62 ms 26388 KB Output is correct
30 Correct 84 ms 25916 KB Output is correct
31 Correct 75 ms 24524 KB Output is correct
32 Correct 65 ms 26544 KB Output is correct
33 Correct 71 ms 15036 KB Output is correct
34 Correct 53 ms 17552 KB Output is correct
35 Correct 63 ms 26056 KB Output is correct
36 Correct 64 ms 25584 KB Output is correct
37 Correct 20 ms 6720 KB Output is correct
38 Correct 81 ms 27828 KB Output is correct
39 Correct 20 ms 8716 KB Output is correct
40 Correct 30 ms 9676 KB Output is correct
41 Correct 63 ms 26720 KB Output is correct
42 Correct 77 ms 26892 KB Output is correct
43 Correct 17 ms 8796 KB Output is correct
44 Correct 68 ms 25776 KB Output is correct
45 Correct 65 ms 27468 KB Output is correct
46 Correct 22 ms 9304 KB Output is correct
47 Correct 64 ms 27040 KB Output is correct
48 Correct 68 ms 26228 KB Output is correct
49 Correct 17 ms 8796 KB Output is correct
50 Correct 55 ms 18308 KB Output is correct
51 Correct 54 ms 25780 KB Output is correct
52 Correct 23 ms 8620 KB Output is correct
53 Correct 21 ms 6492 KB Output is correct
54 Correct 54 ms 15424 KB Output is correct
55 Correct 73 ms 14644 KB Output is correct
56 Correct 185 ms 30760 KB Output is correct
57 Correct 141 ms 29760 KB Output is correct
58 Correct 141 ms 30776 KB Output is correct
59 Correct 157 ms 29192 KB Output is correct
60 Correct 182 ms 23608 KB Output is correct
61 Correct 135 ms 29756 KB Output is correct
62 Correct 149 ms 29004 KB Output is correct
63 Correct 122 ms 28624 KB Output is correct
64 Correct 61 ms 10760 KB Output is correct
65 Correct 169 ms 30236 KB Output is correct
66 Correct 65 ms 11408 KB Output is correct
67 Correct 52 ms 12088 KB Output is correct
68 Correct 78 ms 26632 KB Output is correct
69 Correct 167 ms 31964 KB Output is correct
70 Correct 17 ms 8992 KB Output is correct
71 Correct 89 ms 28200 KB Output is correct
72 Correct 136 ms 29348 KB Output is correct
73 Correct 21 ms 5724 KB Output is correct
74 Correct 84 ms 18880 KB Output is correct
75 Correct 162 ms 32312 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 80 ms 18476 KB Output is correct
78 Correct 115 ms 26808 KB Output is correct
79 Correct 43 ms 10672 KB Output is correct
80 Correct 43 ms 9556 KB Output is correct
81 Correct 22 ms 8796 KB Output is correct
82 Correct 17 ms 8792 KB Output is correct
83 Correct 188 ms 30908 KB Output is correct
84 Correct 172 ms 29380 KB Output is correct
85 Correct 179 ms 30636 KB Output is correct
86 Correct 155 ms 28984 KB Output is correct
87 Correct 201 ms 31136 KB Output is correct
88 Correct 214 ms 29200 KB Output is correct
89 Correct 147 ms 29240 KB Output is correct
90 Correct 132 ms 28576 KB Output is correct
91 Correct 108 ms 12320 KB Output is correct
92 Correct 173 ms 30176 KB Output is correct
93 Correct 204 ms 29196 KB Output is correct
94 Correct 61 ms 18888 KB Output is correct
95 Correct 90 ms 26020 KB Output is correct
96 Correct 187 ms 31544 KB Output is correct
97 Correct 72 ms 27100 KB Output is correct
98 Correct 105 ms 25824 KB Output is correct
99 Correct 145 ms 28676 KB Output is correct
100 Correct 86 ms 17844 KB Output is correct
101 Correct 94 ms 27924 KB Output is correct
102 Correct 199 ms 30776 KB Output is correct
103 Correct 65 ms 26272 KB Output is correct
104 Correct 74 ms 27580 KB Output is correct
105 Correct 128 ms 29584 KB Output is correct
106 Correct 48 ms 9188 KB Output is correct
107 Correct 44 ms 11020 KB Output is correct
108 Correct 42 ms 9936 KB Output is correct
109 Correct 53 ms 10672 KB Output is correct
110 Correct 184 ms 32856 KB Output is correct
111 Correct 208 ms 31144 KB Output is correct
112 Correct 191 ms 30428 KB Output is correct
113 Correct 199 ms 29604 KB Output is correct
114 Correct 206 ms 31696 KB Output is correct
115 Correct 210 ms 31304 KB Output is correct
116 Correct 229 ms 46216 KB Output is correct
117 Correct 166 ms 29248 KB Output is correct
118 Correct 128 ms 14460 KB Output is correct
119 Correct 67 ms 11344 KB Output is correct
120 Correct 200 ms 30540 KB Output is correct
121 Correct 100 ms 27204 KB Output is correct
122 Correct 95 ms 26340 KB Output is correct
123 Correct 234 ms 31412 KB Output is correct
124 Correct 85 ms 18508 KB Output is correct
125 Correct 123 ms 25968 KB Output is correct
126 Correct 187 ms 29888 KB Output is correct
127 Correct 70 ms 18124 KB Output is correct
128 Correct 90 ms 28196 KB Output is correct
129 Correct 202 ms 33240 KB Output is correct
130 Correct 79 ms 26404 KB Output is correct
131 Correct 92 ms 25872 KB Output is correct
132 Correct 150 ms 29920 KB Output is correct