oj.uz

답안 #987958

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 25940 KB Output is correct
2 Correct 67 ms 25776 KB Output is correct
3 Correct 70 ms 27460 KB Output is correct
4 Correct 82 ms 26240 KB Output is correct
5 Correct 66 ms 17368 KB Output is correct
6 Correct 67 ms 18040 KB Output is correct
7 Correct 75 ms 27156 KB Output is correct
8 Correct 64 ms 26140 KB Output is correct
9 Correct 13 ms 8536 KB Output is correct
10 Correct 66 ms 26324 KB Output is correct
11 Correct 13 ms 8536 KB Output is correct
12 Correct 30 ms 9752 KB Output is correct
13 Correct 76 ms 25600 KB Output is correct
14 Correct 64 ms 25940 KB Output is correct
15 Correct 13 ms 8796 KB Output is correct
16 Correct 73 ms 27480 KB Output is correct
17 Correct 63 ms 25780 KB Output is correct
18 Correct 20 ms 9176 KB Output is correct
19 Correct 79 ms 25796 KB Output is correct
20 Correct 58 ms 26124 KB Output is correct
21 Correct 22 ms 8792 KB Output is correct
22 Correct 75 ms 14012 KB Output is correct
23 Correct 60 ms 25328 KB Output is correct
24 Correct 13 ms 8536 KB Output is correct
25 Correct 20 ms 8584 KB Output is correct
26 Correct 48 ms 17568 KB Output is correct
27 Correct 53 ms 17752 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8540 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 7 ms 6492 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 ms 6492 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 4 ms 8024 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 6 ms 6236 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 7 ms 6492 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 80 ms 25940 KB Output is correct
30 Correct 67 ms 25776 KB Output is correct
31 Correct 70 ms 27460 KB Output is correct
32 Correct 82 ms 26240 KB Output is correct
33 Correct 66 ms 17368 KB Output is correct
34 Correct 67 ms 18040 KB Output is correct
35 Correct 75 ms 27156 KB Output is correct
36 Correct 64 ms 26140 KB Output is correct
37 Correct 13 ms 8536 KB Output is correct
38 Correct 66 ms 26324 KB Output is correct
39 Correct 13 ms 8536 KB Output is correct
40 Correct 30 ms 9752 KB Output is correct
41 Correct 76 ms 25600 KB Output is correct
42 Correct 64 ms 25940 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 73 ms 27480 KB Output is correct
45 Correct 63 ms 25780 KB Output is correct
46 Correct 20 ms 9176 KB Output is correct
47 Correct 79 ms 25796 KB Output is correct
48 Correct 58 ms 26124 KB Output is correct
49 Correct 22 ms 8792 KB Output is correct
50 Correct 75 ms 14012 KB Output is correct
51 Correct 60 ms 25328 KB Output is correct
52 Correct 13 ms 8536 KB Output is correct
53 Correct 20 ms 8584 KB Output is correct
54 Correct 48 ms 17568 KB Output is correct
55 Correct 53 ms 17752 KB Output is correct
56 Correct 187 ms 33436 KB Output is correct
57 Correct 163 ms 31408 KB Output is correct
58 Correct 156 ms 32208 KB Output is correct
59 Correct 137 ms 29152 KB Output is correct
60 Correct 150 ms 24292 KB Output is correct
61 Correct 193 ms 30636 KB Output is correct
62 Correct 135 ms 28196 KB Output is correct
63 Correct 117 ms 26084 KB Output is correct
64 Correct 57 ms 10960 KB Output is correct
65 Correct 145 ms 30240 KB Output is correct
66 Correct 55 ms 9280 KB Output is correct
67 Correct 56 ms 12208 KB Output is correct
68 Correct 80 ms 27060 KB Output is correct
69 Correct 159 ms 31880 KB Output is correct
70 Correct 23 ms 8960 KB Output is correct
71 Correct 85 ms 24508 KB Output is correct
72 Correct 155 ms 27612 KB Output is correct
73 Correct 21 ms 5828 KB Output is correct
74 Correct 96 ms 15764 KB Output is correct
75 Correct 187 ms 31316 KB Output is correct
76 Correct 13 ms 8540 KB Output is correct
77 Correct 70 ms 17068 KB Output is correct
78 Correct 131 ms 27408 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 10552 KB Output is correct
2 Correct 38 ms 9524 KB Output is correct
3 Correct 15 ms 8816 KB Output is correct
4 Correct 14 ms 8720 KB Output is correct
5 Correct 195 ms 32112 KB Output is correct
6 Correct 191 ms 30816 KB Output is correct
7 Correct 185 ms 31804 KB Output is correct
8 Correct 169 ms 29816 KB Output is correct
9 Correct 179 ms 30712 KB Output is correct
10 Correct 179 ms 29268 KB Output is correct
11 Correct 153 ms 29264 KB Output is correct
12 Correct 140 ms 28704 KB Output is correct
13 Correct 111 ms 11528 KB Output is correct
14 Correct 186 ms 29656 KB Output is correct
15 Correct 180 ms 29480 KB Output is correct
16 Correct 70 ms 15820 KB Output is correct
17 Correct 96 ms 24988 KB Output is correct
18 Correct 191 ms 31296 KB Output is correct
19 Correct 85 ms 27820 KB Output is correct
20 Correct 86 ms 27716 KB Output is correct
21 Correct 171 ms 28764 KB Output is correct
22 Correct 71 ms 17776 KB Output is correct
23 Correct 79 ms 26556 KB Output is correct
24 Correct 178 ms 31060 KB Output is correct
25 Correct 86 ms 26292 KB Output is correct
26 Correct 84 ms 23480 KB Output is correct
27 Correct 158 ms 27420 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8540 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 7 ms 6492 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 ms 6492 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8536 KB Output is correct
9 Correct 4 ms 8024 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 6 ms 6236 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 7 ms 6492 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 80 ms 25940 KB Output is correct
30 Correct 67 ms 25776 KB Output is correct
31 Correct 70 ms 27460 KB Output is correct
32 Correct 82 ms 26240 KB Output is correct
33 Correct 66 ms 17368 KB Output is correct
34 Correct 67 ms 18040 KB Output is correct
35 Correct 75 ms 27156 KB Output is correct
36 Correct 64 ms 26140 KB Output is correct
37 Correct 13 ms 8536 KB Output is correct
38 Correct 66 ms 26324 KB Output is correct
39 Correct 13 ms 8536 KB Output is correct
40 Correct 30 ms 9752 KB Output is correct
41 Correct 76 ms 25600 KB Output is correct
42 Correct 64 ms 25940 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 73 ms 27480 KB Output is correct
45 Correct 63 ms 25780 KB Output is correct
46 Correct 20 ms 9176 KB Output is correct
47 Correct 79 ms 25796 KB Output is correct
48 Correct 58 ms 26124 KB Output is correct
49 Correct 22 ms 8792 KB Output is correct
50 Correct 75 ms 14012 KB Output is correct
51 Correct 60 ms 25328 KB Output is correct
52 Correct 13 ms 8536 KB Output is correct
53 Correct 20 ms 8584 KB Output is correct
54 Correct 48 ms 17568 KB Output is correct
55 Correct 53 ms 17752 KB Output is correct
56 Correct 187 ms 33436 KB Output is correct
57 Correct 163 ms 31408 KB Output is correct
58 Correct 156 ms 32208 KB Output is correct
59 Correct 137 ms 29152 KB Output is correct
60 Correct 150 ms 24292 KB Output is correct
61 Correct 193 ms 30636 KB Output is correct
62 Correct 135 ms 28196 KB Output is correct
63 Correct 117 ms 26084 KB Output is correct
64 Correct 57 ms 10960 KB Output is correct
65 Correct 145 ms 30240 KB Output is correct
66 Correct 55 ms 9280 KB Output is correct
67 Correct 56 ms 12208 KB Output is correct
68 Correct 80 ms 27060 KB Output is correct
69 Correct 159 ms 31880 KB Output is correct
70 Correct 23 ms 8960 KB Output is correct
71 Correct 85 ms 24508 KB Output is correct
72 Correct 155 ms 27612 KB Output is correct
73 Correct 21 ms 5828 KB Output is correct
74 Correct 96 ms 15764 KB Output is correct
75 Correct 187 ms 31316 KB Output is correct
76 Correct 13 ms 8540 KB Output is correct
77 Correct 70 ms 17068 KB Output is correct
78 Correct 131 ms 27408 KB Output is correct
79 Correct 45 ms 10552 KB Output is correct
80 Correct 38 ms 9524 KB Output is correct
81 Correct 15 ms 8816 KB Output is correct
82 Correct 14 ms 8720 KB Output is correct
83 Correct 195 ms 32112 KB Output is correct
84 Correct 191 ms 30816 KB Output is correct
85 Correct 185 ms 31804 KB Output is correct
86 Correct 169 ms 29816 KB Output is correct
87 Correct 179 ms 30712 KB Output is correct
88 Correct 179 ms 29268 KB Output is correct
89 Correct 153 ms 29264 KB Output is correct
90 Correct 140 ms 28704 KB Output is correct
91 Correct 111 ms 11528 KB Output is correct
92 Correct 186 ms 29656 KB Output is correct
93 Correct 180 ms 29480 KB Output is correct
94 Correct 70 ms 15820 KB Output is correct
95 Correct 96 ms 24988 KB Output is correct
96 Correct 191 ms 31296 KB Output is correct
97 Correct 85 ms 27820 KB Output is correct
98 Correct 86 ms 27716 KB Output is correct
99 Correct 171 ms 28764 KB Output is correct
100 Correct 71 ms 17776 KB Output is correct
101 Correct 79 ms 26556 KB Output is correct
102 Correct 178 ms 31060 KB Output is correct
103 Correct 86 ms 26292 KB Output is correct
104 Correct 84 ms 23480 KB Output is correct
105 Correct 158 ms 27420 KB Output is correct
106 Correct 51 ms 7128 KB Output is correct
107 Correct 46 ms 10956 KB Output is correct
108 Correct 48 ms 6960 KB Output is correct
109 Correct 43 ms 10720 KB Output is correct
110 Correct 208 ms 31788 KB Output is correct
111 Correct 178 ms 30756 KB Output is correct
112 Correct 185 ms 32208 KB Output is correct
113 Correct 205 ms 31536 KB Output is correct
114 Correct 172 ms 32080 KB Output is correct
115 Correct 185 ms 31856 KB Output is correct
116 Correct 188 ms 46252 KB Output is correct
117 Correct 156 ms 28780 KB Output is correct
118 Correct 119 ms 14476 KB Output is correct
119 Correct 76 ms 11240 KB Output is correct
120 Correct 203 ms 31552 KB Output is correct
121 Correct 80 ms 25604 KB Output is correct
122 Correct 87 ms 26556 KB Output is correct
123 Correct 206 ms 30732 KB Output is correct
124 Correct 83 ms 17324 KB Output is correct
125 Correct 81 ms 26392 KB Output is correct
126 Correct 194 ms 30020 KB Output is correct
127 Correct 68 ms 17528 KB Output is correct
128 Correct 95 ms 26352 KB Output is correct
129 Correct 201 ms 32352 KB Output is correct
130 Correct 75 ms 27304 KB Output is correct
131 Correct 78 ms 27084 KB Output is correct
132 Correct 161 ms 28608 KB Output is correct