oj.uz

답안 #987957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987957 2024-05-23T19:44:31 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 218 ms 46216 KB 
///OWNERUL LUI Calin <3
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma gcc target("avx2")
using namespace std;int 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:5: warning: ignoring '#pragma gcc target' [-Wunknown-pragmas]
    5 | #pragma gcc target("avx2")
      | 
Main.cpp: In function 'node special(node)':
Main.cpp:6:359: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    6 | using namespace std;int 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:6:917: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    6 | using namespace std;int 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:6:1866: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    6 | using namespace std;int 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:6:2068: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | using namespace std;int 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:6:2152: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    6 | using namespace std;int 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

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 4 ms 8540 KB Output is correct
4 Correct 5 ms 6448 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 6488 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 ms 8496 KB Output is correct
17 Correct 7 ms 8540 KB Output is correct
18 Correct 4 ms 8280 KB Output is correct
19 Correct 5 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 6 ms 8536 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 5 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 6 ms 8540 KB Output is correct
28 Correct 5 ms 8544 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 26032 KB Output is correct
2 Correct 64 ms 25696 KB Output is correct
3 Correct 66 ms 26516 KB Output is correct
4 Correct 58 ms 25944 KB Output is correct
5 Correct 60 ms 18876 KB Output is correct
6 Correct 52 ms 17864 KB Output is correct
7 Correct 64 ms 27240 KB Output is correct
8 Correct 62 ms 25436 KB Output is correct
9 Correct 12 ms 8552 KB Output is correct
10 Correct 64 ms 27828 KB Output is correct
11 Correct 13 ms 8540 KB Output is correct
12 Correct 28 ms 9760 KB Output is correct
13 Correct 83 ms 26164 KB Output is correct
14 Correct 65 ms 27220 KB Output is correct
15 Correct 14 ms 8640 KB Output is correct
16 Correct 68 ms 25908 KB Output is correct
17 Correct 63 ms 25788 KB Output is correct
18 Correct 21 ms 9180 KB Output is correct
19 Correct 92 ms 26040 KB Output is correct
20 Correct 60 ms 26120 KB Output is correct
21 Correct 13 ms 8796 KB Output is correct
22 Correct 59 ms 16844 KB Output is correct
23 Correct 54 ms 26908 KB Output is correct
24 Correct 21 ms 8648 KB Output is correct
25 Correct 12 ms 8540 KB Output is correct
26 Correct 49 ms 16584 KB Output is correct
27 Correct 75 ms 14524 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 4 ms 8540 KB Output is correct
4 Correct 5 ms 6448 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 6488 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 ms 8496 KB Output is correct
17 Correct 7 ms 8540 KB Output is correct
18 Correct 4 ms 8280 KB Output is correct
19 Correct 5 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 6 ms 8536 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 5 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 6 ms 8540 KB Output is correct
28 Correct 5 ms 8544 KB Output is correct
29 Correct 80 ms 26032 KB Output is correct
30 Correct 64 ms 25696 KB Output is correct
31 Correct 66 ms 26516 KB Output is correct
32 Correct 58 ms 25944 KB Output is correct
33 Correct 60 ms 18876 KB Output is correct
34 Correct 52 ms 17864 KB Output is correct
35 Correct 64 ms 27240 KB Output is correct
36 Correct 62 ms 25436 KB Output is correct
37 Correct 12 ms 8552 KB Output is correct
38 Correct 64 ms 27828 KB Output is correct
39 Correct 13 ms 8540 KB Output is correct
40 Correct 28 ms 9760 KB Output is correct
41 Correct 83 ms 26164 KB Output is correct
42 Correct 65 ms 27220 KB Output is correct
43 Correct 14 ms 8640 KB Output is correct
44 Correct 68 ms 25908 KB Output is correct
45 Correct 63 ms 25788 KB Output is correct
46 Correct 21 ms 9180 KB Output is correct
47 Correct 92 ms 26040 KB Output is correct
48 Correct 60 ms 26120 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 59 ms 16844 KB Output is correct
51 Correct 54 ms 26908 KB Output is correct
52 Correct 21 ms 8648 KB Output is correct
53 Correct 12 ms 8540 KB Output is correct
54 Correct 49 ms 16584 KB Output is correct
55 Correct 75 ms 14524 KB Output is correct
56 Correct 135 ms 31020 KB Output is correct
57 Correct 134 ms 28740 KB Output is correct
58 Correct 141 ms 31952 KB Output is correct
59 Correct 146 ms 29236 KB Output is correct
60 Correct 192 ms 24180 KB Output is correct
61 Correct 144 ms 32384 KB Output is correct
62 Correct 145 ms 28068 KB Output is correct
63 Correct 121 ms 26672 KB Output is correct
64 Correct 62 ms 10816 KB Output is correct
65 Correct 182 ms 30020 KB Output is correct
66 Correct 65 ms 11488 KB Output is correct
67 Correct 54 ms 12244 KB Output is correct
68 Correct 97 ms 27636 KB Output is correct
69 Correct 150 ms 30464 KB Output is correct
70 Correct 15 ms 7004 KB Output is correct
71 Correct 96 ms 27964 KB Output is correct
72 Correct 136 ms 30652 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 77 ms 18752 KB Output is correct
75 Correct 165 ms 32480 KB Output is correct
76 Correct 16 ms 8540 KB Output is correct
77 Correct 78 ms 17352 KB Output is correct
78 Correct 112 ms 25512 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 10664 KB Output is correct
2 Correct 51 ms 7388 KB Output is correct
3 Correct 14 ms 8796 KB Output is correct
4 Correct 21 ms 8792 KB Output is correct
5 Correct 176 ms 31484 KB Output is correct
6 Correct 147 ms 29248 KB Output is correct
7 Correct 181 ms 30360 KB Output is correct
8 Correct 149 ms 30636 KB Output is correct
9 Correct 181 ms 31796 KB Output is correct
10 Correct 193 ms 29940 KB Output is correct
11 Correct 147 ms 28424 KB Output is correct
12 Correct 123 ms 29904 KB Output is correct
13 Correct 102 ms 12424 KB Output is correct
14 Correct 162 ms 30084 KB Output is correct
15 Correct 186 ms 30704 KB Output is correct
16 Correct 81 ms 15024 KB Output is correct
17 Correct 81 ms 27304 KB Output is correct
18 Correct 186 ms 29484 KB Output is correct
19 Correct 77 ms 26356 KB Output is correct
20 Correct 81 ms 26016 KB Output is correct
21 Correct 154 ms 28696 KB Output is correct
22 Correct 60 ms 17984 KB Output is correct
23 Correct 70 ms 26120 KB Output is correct
24 Correct 209 ms 31148 KB Output is correct
25 Correct 72 ms 28020 KB Output is correct
26 Correct 69 ms 24240 KB Output is correct
27 Correct 171 ms 27480 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 4 ms 8540 KB Output is correct
4 Correct 5 ms 6448 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 6488 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 ms 8496 KB Output is correct
17 Correct 7 ms 8540 KB Output is correct
18 Correct 4 ms 8280 KB Output is correct
19 Correct 5 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 6 ms 8536 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 5 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 6 ms 8540 KB Output is correct
28 Correct 5 ms 8544 KB Output is correct
29 Correct 80 ms 26032 KB Output is correct
30 Correct 64 ms 25696 KB Output is correct
31 Correct 66 ms 26516 KB Output is correct
32 Correct 58 ms 25944 KB Output is correct
33 Correct 60 ms 18876 KB Output is correct
34 Correct 52 ms 17864 KB Output is correct
35 Correct 64 ms 27240 KB Output is correct
36 Correct 62 ms 25436 KB Output is correct
37 Correct 12 ms 8552 KB Output is correct
38 Correct 64 ms 27828 KB Output is correct
39 Correct 13 ms 8540 KB Output is correct
40 Correct 28 ms 9760 KB Output is correct
41 Correct 83 ms 26164 KB Output is correct
42 Correct 65 ms 27220 KB Output is correct
43 Correct 14 ms 8640 KB Output is correct
44 Correct 68 ms 25908 KB Output is correct
45 Correct 63 ms 25788 KB Output is correct
46 Correct 21 ms 9180 KB Output is correct
47 Correct 92 ms 26040 KB Output is correct
48 Correct 60 ms 26120 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 59 ms 16844 KB Output is correct
51 Correct 54 ms 26908 KB Output is correct
52 Correct 21 ms 8648 KB Output is correct
53 Correct 12 ms 8540 KB Output is correct
54 Correct 49 ms 16584 KB Output is correct
55 Correct 75 ms 14524 KB Output is correct
56 Correct 135 ms 31020 KB Output is correct
57 Correct 134 ms 28740 KB Output is correct
58 Correct 141 ms 31952 KB Output is correct
59 Correct 146 ms 29236 KB Output is correct
60 Correct 192 ms 24180 KB Output is correct
61 Correct 144 ms 32384 KB Output is correct
62 Correct 145 ms 28068 KB Output is correct
63 Correct 121 ms 26672 KB Output is correct
64 Correct 62 ms 10816 KB Output is correct
65 Correct 182 ms 30020 KB Output is correct
66 Correct 65 ms 11488 KB Output is correct
67 Correct 54 ms 12244 KB Output is correct
68 Correct 97 ms 27636 KB Output is correct
69 Correct 150 ms 30464 KB Output is correct
70 Correct 15 ms 7004 KB Output is correct
71 Correct 96 ms 27964 KB Output is correct
72 Correct 136 ms 30652 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 77 ms 18752 KB Output is correct
75 Correct 165 ms 32480 KB Output is correct
76 Correct 16 ms 8540 KB Output is correct
77 Correct 78 ms 17352 KB Output is correct
78 Correct 112 ms 25512 KB Output is correct
79 Correct 43 ms 10664 KB Output is correct
80 Correct 51 ms 7388 KB Output is correct
81 Correct 14 ms 8796 KB Output is correct
82 Correct 21 ms 8792 KB Output is correct
83 Correct 176 ms 31484 KB Output is correct
84 Correct 147 ms 29248 KB Output is correct
85 Correct 181 ms 30360 KB Output is correct
86 Correct 149 ms 30636 KB Output is correct
87 Correct 181 ms 31796 KB Output is correct
88 Correct 193 ms 29940 KB Output is correct
89 Correct 147 ms 28424 KB Output is correct
90 Correct 123 ms 29904 KB Output is correct
91 Correct 102 ms 12424 KB Output is correct
92 Correct 162 ms 30084 KB Output is correct
93 Correct 186 ms 30704 KB Output is correct
94 Correct 81 ms 15024 KB Output is correct
95 Correct 81 ms 27304 KB Output is correct
96 Correct 186 ms 29484 KB Output is correct
97 Correct 77 ms 26356 KB Output is correct
98 Correct 81 ms 26016 KB Output is correct
99 Correct 154 ms 28696 KB Output is correct
100 Correct 60 ms 17984 KB Output is correct
101 Correct 70 ms 26120 KB Output is correct
102 Correct 209 ms 31148 KB Output is correct
103 Correct 72 ms 28020 KB Output is correct
104 Correct 69 ms 24240 KB Output is correct
105 Correct 171 ms 27480 KB Output is correct
106 Correct 38 ms 6332 KB Output is correct
107 Correct 53 ms 7896 KB Output is correct
108 Correct 39 ms 6872 KB Output is correct
109 Correct 44 ms 10716 KB Output is correct
110 Correct 218 ms 31540 KB Output is correct
111 Correct 194 ms 31432 KB Output is correct
112 Correct 173 ms 30664 KB Output is correct
113 Correct 192 ms 31036 KB Output is correct
114 Correct 197 ms 32060 KB Output is correct
115 Correct 192 ms 32136 KB Output is correct
116 Correct 217 ms 46216 KB Output is correct
117 Correct 148 ms 28784 KB Output is correct
118 Correct 120 ms 14456 KB Output is correct
119 Correct 72 ms 11492 KB Output is correct
120 Correct 197 ms 30532 KB Output is correct
121 Correct 80 ms 26340 KB Output is correct
122 Correct 78 ms 27828 KB Output is correct
123 Correct 205 ms 30604 KB Output is correct
124 Correct 88 ms 18444 KB Output is correct
125 Correct 103 ms 25972 KB Output is correct
126 Correct 186 ms 30076 KB Output is correct
127 Correct 69 ms 17680 KB Output is correct
128 Correct 78 ms 26684 KB Output is correct
129 Correct 185 ms 33840 KB Output is correct
130 Correct 74 ms 26224 KB Output is correct
131 Correct 95 ms 26284 KB Output is correct
132 Correct 165 ms 27900 KB Output is correct