oj.uz

답안 #987953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987953 2024-05-23T19:43:36 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 231 ms 46148 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;}}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8536 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 5 ms 8024 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 4 ms 8284 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 8536 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 27332 KB Output is correct
2 Correct 62 ms 25784 KB Output is correct
3 Correct 59 ms 26032 KB Output is correct
4 Correct 60 ms 27796 KB Output is correct
5 Correct 60 ms 18864 KB Output is correct
6 Correct 63 ms 18140 KB Output is correct
7 Correct 73 ms 25524 KB Output is correct
8 Correct 59 ms 26996 KB Output is correct
9 Correct 12 ms 8536 KB Output is correct
10 Correct 64 ms 25828 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 28 ms 9688 KB Output is correct
13 Correct 65 ms 27356 KB Output is correct
14 Correct 83 ms 25264 KB Output is correct
15 Correct 13 ms 8680 KB Output is correct
16 Correct 69 ms 26600 KB Output is correct
17 Correct 66 ms 26852 KB Output is correct
18 Correct 20 ms 9180 KB Output is correct
19 Correct 77 ms 25784 KB Output is correct
20 Correct 74 ms 28028 KB Output is correct
21 Correct 13 ms 8792 KB Output is correct
22 Correct 56 ms 17252 KB Output is correct
23 Correct 54 ms 26776 KB Output is correct
24 Correct 13 ms 8540 KB Output is correct
25 Correct 12 ms 8540 KB Output is correct
26 Correct 48 ms 17856 KB Output is correct
27 Correct 48 ms 19164 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8536 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 5 ms 8024 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 4 ms 8284 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 8536 KB Output is correct
29 Correct 60 ms 27332 KB Output is correct
30 Correct 62 ms 25784 KB Output is correct
31 Correct 59 ms 26032 KB Output is correct
32 Correct 60 ms 27796 KB Output is correct
33 Correct 60 ms 18864 KB Output is correct
34 Correct 63 ms 18140 KB Output is correct
35 Correct 73 ms 25524 KB Output is correct
36 Correct 59 ms 26996 KB Output is correct
37 Correct 12 ms 8536 KB Output is correct
38 Correct 64 ms 25828 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 28 ms 9688 KB Output is correct
41 Correct 65 ms 27356 KB Output is correct
42 Correct 83 ms 25264 KB Output is correct
43 Correct 13 ms 8680 KB Output is correct
44 Correct 69 ms 26600 KB Output is correct
45 Correct 66 ms 26852 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 77 ms 25784 KB Output is correct
48 Correct 74 ms 28028 KB Output is correct
49 Correct 13 ms 8792 KB Output is correct
50 Correct 56 ms 17252 KB Output is correct
51 Correct 54 ms 26776 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 12 ms 8540 KB Output is correct
54 Correct 48 ms 17856 KB Output is correct
55 Correct 48 ms 19164 KB Output is correct
56 Correct 135 ms 33852 KB Output is correct
57 Correct 128 ms 31296 KB Output is correct
58 Correct 142 ms 31800 KB Output is correct
59 Correct 122 ms 29996 KB Output is correct
60 Correct 128 ms 24136 KB Output is correct
61 Correct 150 ms 31268 KB Output is correct
62 Correct 128 ms 28080 KB Output is correct
63 Correct 127 ms 26636 KB Output is correct
64 Correct 53 ms 10960 KB Output is correct
65 Correct 141 ms 30184 KB Output is correct
66 Correct 53 ms 11248 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 82 ms 26732 KB Output is correct
69 Correct 148 ms 32056 KB Output is correct
70 Correct 17 ms 9052 KB Output is correct
71 Correct 89 ms 27264 KB Output is correct
72 Correct 133 ms 31276 KB Output is correct
73 Correct 15 ms 8796 KB Output is correct
74 Correct 76 ms 19276 KB Output is correct
75 Correct 173 ms 32976 KB Output is correct
76 Correct 13 ms 8540 KB Output is correct
77 Correct 69 ms 18792 KB Output is correct
78 Correct 104 ms 27380 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 10664 KB Output is correct
2 Correct 38 ms 9436 KB Output is correct
3 Correct 14 ms 8776 KB Output is correct
4 Correct 13 ms 8792 KB Output is correct
5 Correct 163 ms 31728 KB Output is correct
6 Correct 190 ms 31296 KB Output is correct
7 Correct 152 ms 31296 KB Output is correct
8 Correct 158 ms 29492 KB Output is correct
9 Correct 199 ms 31012 KB Output is correct
10 Correct 186 ms 31124 KB Output is correct
11 Correct 154 ms 28920 KB Output is correct
12 Correct 132 ms 29104 KB Output is correct
13 Correct 104 ms 12336 KB Output is correct
14 Correct 164 ms 30004 KB Output is correct
15 Correct 166 ms 29308 KB Output is correct
16 Correct 60 ms 17848 KB Output is correct
17 Correct 77 ms 26248 KB Output is correct
18 Correct 175 ms 30876 KB Output is correct
19 Correct 79 ms 27464 KB Output is correct
20 Correct 78 ms 26344 KB Output is correct
21 Correct 153 ms 30416 KB Output is correct
22 Correct 69 ms 19140 KB Output is correct
23 Correct 69 ms 24252 KB Output is correct
24 Correct 193 ms 32304 KB Output is correct
25 Correct 63 ms 27468 KB Output is correct
26 Correct 63 ms 26448 KB Output is correct
27 Correct 139 ms 28096 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8536 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 5 ms 8024 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 4 ms 8284 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 8536 KB Output is correct
29 Correct 60 ms 27332 KB Output is correct
30 Correct 62 ms 25784 KB Output is correct
31 Correct 59 ms 26032 KB Output is correct
32 Correct 60 ms 27796 KB Output is correct
33 Correct 60 ms 18864 KB Output is correct
34 Correct 63 ms 18140 KB Output is correct
35 Correct 73 ms 25524 KB Output is correct
36 Correct 59 ms 26996 KB Output is correct
37 Correct 12 ms 8536 KB Output is correct
38 Correct 64 ms 25828 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 28 ms 9688 KB Output is correct
41 Correct 65 ms 27356 KB Output is correct
42 Correct 83 ms 25264 KB Output is correct
43 Correct 13 ms 8680 KB Output is correct
44 Correct 69 ms 26600 KB Output is correct
45 Correct 66 ms 26852 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 77 ms 25784 KB Output is correct
48 Correct 74 ms 28028 KB Output is correct
49 Correct 13 ms 8792 KB Output is correct
50 Correct 56 ms 17252 KB Output is correct
51 Correct 54 ms 26776 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 12 ms 8540 KB Output is correct
54 Correct 48 ms 17856 KB Output is correct
55 Correct 48 ms 19164 KB Output is correct
56 Correct 135 ms 33852 KB Output is correct
57 Correct 128 ms 31296 KB Output is correct
58 Correct 142 ms 31800 KB Output is correct
59 Correct 122 ms 29996 KB Output is correct
60 Correct 128 ms 24136 KB Output is correct
61 Correct 150 ms 31268 KB Output is correct
62 Correct 128 ms 28080 KB Output is correct
63 Correct 127 ms 26636 KB Output is correct
64 Correct 53 ms 10960 KB Output is correct
65 Correct 141 ms 30184 KB Output is correct
66 Correct 53 ms 11248 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 82 ms 26732 KB Output is correct
69 Correct 148 ms 32056 KB Output is correct
70 Correct 17 ms 9052 KB Output is correct
71 Correct 89 ms 27264 KB Output is correct
72 Correct 133 ms 31276 KB Output is correct
73 Correct 15 ms 8796 KB Output is correct
74 Correct 76 ms 19276 KB Output is correct
75 Correct 173 ms 32976 KB Output is correct
76 Correct 13 ms 8540 KB Output is correct
77 Correct 69 ms 18792 KB Output is correct
78 Correct 104 ms 27380 KB Output is correct
79 Correct 41 ms 10664 KB Output is correct
80 Correct 38 ms 9436 KB Output is correct
81 Correct 14 ms 8776 KB Output is correct
82 Correct 13 ms 8792 KB Output is correct
83 Correct 163 ms 31728 KB Output is correct
84 Correct 190 ms 31296 KB Output is correct
85 Correct 152 ms 31296 KB Output is correct
86 Correct 158 ms 29492 KB Output is correct
87 Correct 199 ms 31012 KB Output is correct
88 Correct 186 ms 31124 KB Output is correct
89 Correct 154 ms 28920 KB Output is correct
90 Correct 132 ms 29104 KB Output is correct
91 Correct 104 ms 12336 KB Output is correct
92 Correct 164 ms 30004 KB Output is correct
93 Correct 166 ms 29308 KB Output is correct
94 Correct 60 ms 17848 KB Output is correct
95 Correct 77 ms 26248 KB Output is correct
96 Correct 175 ms 30876 KB Output is correct
97 Correct 79 ms 27464 KB Output is correct
98 Correct 78 ms 26344 KB Output is correct
99 Correct 153 ms 30416 KB Output is correct
100 Correct 69 ms 19140 KB Output is correct
101 Correct 69 ms 24252 KB Output is correct
102 Correct 193 ms 32304 KB Output is correct
103 Correct 63 ms 27468 KB Output is correct
104 Correct 63 ms 26448 KB Output is correct
105 Correct 139 ms 28096 KB Output is correct
106 Correct 52 ms 7136 KB Output is correct
107 Correct 43 ms 10956 KB Output is correct
108 Correct 51 ms 9676 KB Output is correct
109 Correct 41 ms 8656 KB Output is correct
110 Correct 190 ms 31532 KB Output is correct
111 Correct 214 ms 30764 KB Output is correct
112 Correct 213 ms 31148 KB Output is correct
113 Correct 186 ms 31212 KB Output is correct
114 Correct 205 ms 32328 KB Output is correct
115 Correct 205 ms 30764 KB Output is correct
116 Correct 177 ms 46148 KB Output is correct
117 Correct 158 ms 29760 KB Output is correct
118 Correct 119 ms 14272 KB Output is correct
119 Correct 77 ms 11320 KB Output is correct
120 Correct 190 ms 30544 KB Output is correct
121 Correct 95 ms 27988 KB Output is correct
122 Correct 80 ms 26264 KB Output is correct
123 Correct 231 ms 30768 KB Output is correct
124 Correct 72 ms 18420 KB Output is correct
125 Correct 95 ms 27372 KB Output is correct
126 Correct 162 ms 31804 KB Output is correct
127 Correct 67 ms 18960 KB Output is correct
128 Correct 74 ms 27028 KB Output is correct
129 Correct 174 ms 32144 KB Output is correct
130 Correct 77 ms 27360 KB Output is correct
131 Correct 104 ms 26824 KB Output is correct
132 Correct 145 ms 28916 KB Output is correct