oj.uz

답안 #987943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987943 2024-05-23T19:40:13 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 235 ms 46180 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],init[2000

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5724 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 6492 KB Output is correct
6 Correct 8 ms 5580 KB Output is correct
7 Correct 7 ms 6500 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 7 ms 5660 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 6 ms 5540 KB Output is correct
14 Correct 5 ms 5636 KB Output is correct
15 Correct 6 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 5 ms 5548 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5272 KB Output is correct
26 Correct 6 ms 5592 KB Output is correct
27 Correct 7 ms 5592 KB Output is correct
28 Correct 6 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 22924 KB Output is correct
2 Correct 87 ms 22960 KB Output is correct
3 Correct 77 ms 22884 KB Output is correct
4 Correct 67 ms 22864 KB Output is correct
5 Correct 55 ms 14688 KB Output is correct
6 Correct 60 ms 14516 KB Output is correct
7 Correct 79 ms 22572 KB Output is correct
8 Correct 67 ms 22644 KB Output is correct
9 Correct 15 ms 5724 KB Output is correct
10 Correct 65 ms 22972 KB Output is correct
11 Correct 18 ms 5720 KB Output is correct
12 Correct 41 ms 6608 KB Output is correct
13 Correct 85 ms 22700 KB Output is correct
14 Correct 67 ms 23040 KB Output is correct
15 Correct 21 ms 5724 KB Output is correct
16 Correct 85 ms 22656 KB Output is correct
17 Correct 84 ms 22868 KB Output is correct
18 Correct 22 ms 6364 KB Output is correct
19 Correct 76 ms 22968 KB Output is correct
20 Correct 76 ms 23364 KB Output is correct
21 Correct 17 ms 6008 KB Output is correct
22 Correct 57 ms 14032 KB Output is correct
23 Correct 76 ms 22300 KB Output is correct
24 Correct 14 ms 5692 KB Output is correct
25 Correct 17 ms 5720 KB Output is correct
26 Correct 75 ms 14524 KB Output is correct
27 Correct 73 ms 14464 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5724 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 6492 KB Output is correct
6 Correct 8 ms 5580 KB Output is correct
7 Correct 7 ms 6500 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 7 ms 5660 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 6 ms 5540 KB Output is correct
14 Correct 5 ms 5636 KB Output is correct
15 Correct 6 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 5 ms 5548 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5272 KB Output is correct
26 Correct 6 ms 5592 KB Output is correct
27 Correct 7 ms 5592 KB Output is correct
28 Correct 6 ms 5468 KB Output is correct
29 Correct 75 ms 22924 KB Output is correct
30 Correct 87 ms 22960 KB Output is correct
31 Correct 77 ms 22884 KB Output is correct
32 Correct 67 ms 22864 KB Output is correct
33 Correct 55 ms 14688 KB Output is correct
34 Correct 60 ms 14516 KB Output is correct
35 Correct 79 ms 22572 KB Output is correct
36 Correct 67 ms 22644 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 65 ms 22972 KB Output is correct
39 Correct 18 ms 5720 KB Output is correct
40 Correct 41 ms 6608 KB Output is correct
41 Correct 85 ms 22700 KB Output is correct
42 Correct 67 ms 23040 KB Output is correct
43 Correct 21 ms 5724 KB Output is correct
44 Correct 85 ms 22656 KB Output is correct
45 Correct 84 ms 22868 KB Output is correct
46 Correct 22 ms 6364 KB Output is correct
47 Correct 76 ms 22968 KB Output is correct
48 Correct 76 ms 23364 KB Output is correct
49 Correct 17 ms 6008 KB Output is correct
50 Correct 57 ms 14032 KB Output is correct
51 Correct 76 ms 22300 KB Output is correct
52 Correct 14 ms 5692 KB Output is correct
53 Correct 17 ms 5720 KB Output is correct
54 Correct 75 ms 14524 KB Output is correct
55 Correct 73 ms 14464 KB Output is correct
56 Correct 192 ms 30812 KB Output is correct
57 Correct 163 ms 28008 KB Output is correct
58 Correct 167 ms 29216 KB Output is correct
59 Correct 160 ms 26736 KB Output is correct
60 Correct 156 ms 23168 KB Output is correct
61 Correct 152 ms 28972 KB Output is correct
62 Correct 160 ms 25396 KB Output is correct
63 Correct 121 ms 23568 KB Output is correct
64 Correct 59 ms 7836 KB Output is correct
65 Correct 157 ms 28356 KB Output is correct
66 Correct 73 ms 11372 KB Output is correct
67 Correct 71 ms 12184 KB Output is correct
68 Correct 77 ms 26536 KB Output is correct
69 Correct 173 ms 30520 KB Output is correct
70 Correct 16 ms 9048 KB Output is correct
71 Correct 83 ms 26920 KB Output is correct
72 Correct 144 ms 31156 KB Output is correct
73 Correct 22 ms 5720 KB Output is correct
74 Correct 94 ms 15792 KB Output is correct
75 Correct 191 ms 31404 KB Output is correct
76 Correct 14 ms 5724 KB Output is correct
77 Correct 63 ms 14460 KB Output is correct
78 Correct 116 ms 26836 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 8652 KB Output is correct
2 Correct 40 ms 9436 KB Output is correct
3 Correct 18 ms 8796 KB Output is correct
4 Correct 15 ms 8832 KB Output is correct
5 Correct 196 ms 31188 KB Output is correct
6 Correct 154 ms 29756 KB Output is correct
7 Correct 182 ms 29892 KB Output is correct
8 Correct 174 ms 28840 KB Output is correct
9 Correct 190 ms 30688 KB Output is correct
10 Correct 171 ms 31156 KB Output is correct
11 Correct 171 ms 27736 KB Output is correct
12 Correct 136 ms 30408 KB Output is correct
13 Correct 105 ms 11596 KB Output is correct
14 Correct 214 ms 30712 KB Output is correct
15 Correct 172 ms 31332 KB Output is correct
16 Correct 68 ms 17852 KB Output is correct
17 Correct 102 ms 25896 KB Output is correct
18 Correct 175 ms 29692 KB Output is correct
19 Correct 85 ms 26280 KB Output is correct
20 Correct 92 ms 26088 KB Output is correct
21 Correct 154 ms 30032 KB Output is correct
22 Correct 70 ms 17092 KB Output is correct
23 Correct 110 ms 25672 KB Output is correct
24 Correct 164 ms 32576 KB Output is correct
25 Correct 69 ms 26384 KB Output is correct
26 Correct 75 ms 26032 KB Output is correct
27 Correct 143 ms 28284 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5724 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 6492 KB Output is correct
6 Correct 8 ms 5580 KB Output is correct
7 Correct 7 ms 6500 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 7 ms 5660 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 6 ms 5540 KB Output is correct
14 Correct 5 ms 5636 KB Output is correct
15 Correct 6 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 5 ms 5468 KB Output is correct
23 Correct 5 ms 5548 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5272 KB Output is correct
26 Correct 6 ms 5592 KB Output is correct
27 Correct 7 ms 5592 KB Output is correct
28 Correct 6 ms 5468 KB Output is correct
29 Correct 75 ms 22924 KB Output is correct
30 Correct 87 ms 22960 KB Output is correct
31 Correct 77 ms 22884 KB Output is correct
32 Correct 67 ms 22864 KB Output is correct
33 Correct 55 ms 14688 KB Output is correct
34 Correct 60 ms 14516 KB Output is correct
35 Correct 79 ms 22572 KB Output is correct
36 Correct 67 ms 22644 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 65 ms 22972 KB Output is correct
39 Correct 18 ms 5720 KB Output is correct
40 Correct 41 ms 6608 KB Output is correct
41 Correct 85 ms 22700 KB Output is correct
42 Correct 67 ms 23040 KB Output is correct
43 Correct 21 ms 5724 KB Output is correct
44 Correct 85 ms 22656 KB Output is correct
45 Correct 84 ms 22868 KB Output is correct
46 Correct 22 ms 6364 KB Output is correct
47 Correct 76 ms 22968 KB Output is correct
48 Correct 76 ms 23364 KB Output is correct
49 Correct 17 ms 6008 KB Output is correct
50 Correct 57 ms 14032 KB Output is correct
51 Correct 76 ms 22300 KB Output is correct
52 Correct 14 ms 5692 KB Output is correct
53 Correct 17 ms 5720 KB Output is correct
54 Correct 75 ms 14524 KB Output is correct
55 Correct 73 ms 14464 KB Output is correct
56 Correct 192 ms 30812 KB Output is correct
57 Correct 163 ms 28008 KB Output is correct
58 Correct 167 ms 29216 KB Output is correct
59 Correct 160 ms 26736 KB Output is correct
60 Correct 156 ms 23168 KB Output is correct
61 Correct 152 ms 28972 KB Output is correct
62 Correct 160 ms 25396 KB Output is correct
63 Correct 121 ms 23568 KB Output is correct
64 Correct 59 ms 7836 KB Output is correct
65 Correct 157 ms 28356 KB Output is correct
66 Correct 73 ms 11372 KB Output is correct
67 Correct 71 ms 12184 KB Output is correct
68 Correct 77 ms 26536 KB Output is correct
69 Correct 173 ms 30520 KB Output is correct
70 Correct 16 ms 9048 KB Output is correct
71 Correct 83 ms 26920 KB Output is correct
72 Correct 144 ms 31156 KB Output is correct
73 Correct 22 ms 5720 KB Output is correct
74 Correct 94 ms 15792 KB Output is correct
75 Correct 191 ms 31404 KB Output is correct
76 Correct 14 ms 5724 KB Output is correct
77 Correct 63 ms 14460 KB Output is correct
78 Correct 116 ms 26836 KB Output is correct
79 Correct 48 ms 8652 KB Output is correct
80 Correct 40 ms 9436 KB Output is correct
81 Correct 18 ms 8796 KB Output is correct
82 Correct 15 ms 8832 KB Output is correct
83 Correct 196 ms 31188 KB Output is correct
84 Correct 154 ms 29756 KB Output is correct
85 Correct 182 ms 29892 KB Output is correct
86 Correct 174 ms 28840 KB Output is correct
87 Correct 190 ms 30688 KB Output is correct
88 Correct 171 ms 31156 KB Output is correct
89 Correct 171 ms 27736 KB Output is correct
90 Correct 136 ms 30408 KB Output is correct
91 Correct 105 ms 11596 KB Output is correct
92 Correct 214 ms 30712 KB Output is correct
93 Correct 172 ms 31332 KB Output is correct
94 Correct 68 ms 17852 KB Output is correct
95 Correct 102 ms 25896 KB Output is correct
96 Correct 175 ms 29692 KB Output is correct
97 Correct 85 ms 26280 KB Output is correct
98 Correct 92 ms 26088 KB Output is correct
99 Correct 154 ms 30032 KB Output is correct
100 Correct 70 ms 17092 KB Output is correct
101 Correct 110 ms 25672 KB Output is correct
102 Correct 164 ms 32576 KB Output is correct
103 Correct 69 ms 26384 KB Output is correct
104 Correct 75 ms 26032 KB Output is correct
105 Correct 143 ms 28284 KB Output is correct
106 Correct 37 ms 9184 KB Output is correct
107 Correct 42 ms 10868 KB Output is correct
108 Correct 56 ms 9852 KB Output is correct
109 Correct 60 ms 10812 KB Output is correct
110 Correct 186 ms 32576 KB Output is correct
111 Correct 185 ms 30772 KB Output is correct
112 Correct 193 ms 30580 KB Output is correct
113 Correct 192 ms 29476 KB Output is correct
114 Correct 209 ms 32032 KB Output is correct
115 Correct 163 ms 32296 KB Output is correct
116 Correct 182 ms 46180 KB Output is correct
117 Correct 166 ms 28564 KB Output is correct
118 Correct 143 ms 15492 KB Output is correct
119 Correct 71 ms 11296 KB Output is correct
120 Correct 190 ms 30764 KB Output is correct
121 Correct 85 ms 28380 KB Output is correct
122 Correct 111 ms 28296 KB Output is correct
123 Correct 235 ms 30712 KB Output is correct
124 Correct 75 ms 19272 KB Output is correct
125 Correct 112 ms 26808 KB Output is correct
126 Correct 194 ms 31276 KB Output is correct
127 Correct 71 ms 17760 KB Output is correct
128 Correct 79 ms 27240 KB Output is correct
129 Correct 183 ms 33440 KB Output is correct
130 Correct 97 ms 28032 KB Output is correct
131 Correct 86 ms 28052 KB Output is correct
132 Correct 169 ms 30080 KB Output is correct