oj.uz

답안 #987942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987942 2024-05-23T19:40:03 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 244 ms 46300 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;long long sum=0;ios_base::sync_with_stdio(false);cin.tie(NULL);cin>>n>>m>>k;for(i=1; i<=n; i++){cin>>a>>b;adj[a].push_back(b);}for(i=1; i<=m; i++){cin>>x[i]>>y[i];if(y[i]==0){cost[i]=inf;}else{sort(adj[i].begin(),adj[i].end());if(adj[i].size()<x[i]){for(int j=1; j<=k; j++){cout<<-1<<'\n';}return 0;}if(x[i]==0){if(adj[i].size()==0){cost[i]=inf;}else{init[i]=adj[i][0];cost[i]=adj[i][0];}}else{int vkuk=adj[i][0];init[i]=adj[i][0];for(int j=0; j<adj[i].size(); j++){if(j+1<=x[i]){sum+=adj[i][j];}adj[i][j]-=vkuk;}if(adj[i].size()==x[i]){cost[i]=inf;}else{cost[i]=adj[i][x[i]]-adj[i][x[i]-1];}}}ord.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:8:365: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    8 | using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;long long sum=0;ios_base::sync_with_stdio(false);cin.tie(NULL);cin>>n>>m>>k;for(i=1; i<=n; i++){cin>>a>>b;adj[a].push_back(b);}for(i=1; i<=m; i++){cin>>x[i]>>y[i];if(y[i]==0){cost[i]=inf;}else{sort(adj[i].begin(),adj[i].end());if(adj[i].size()<x[i]){for(int j=1; j<=k; j++){cout<<-1<<'\n';}return 0;}if(x[i]==0){if(adj[i].size()==0){cost[i]=inf;}else{init[i]=adj[i][0];cost[i]=adj[i][0];}}else{int vkuk=adj[i][0];init[i]=adj[i][0];for(int j=0; j<adj[i].size(); j++){if(j+1<=x[i]){sum+=adj[i][j];}adj[i][j]-=vkuk;}if(adj[i].size()==x[i]){cost[i]=inf;}else{cost[i]=adj[i][x[i]]-adj[i][x[i]-1];}}}ord.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                             ^
Main.cpp: In function 'node godown(node)':
Main.cpp:8:923: warning: variable 'g' set but not used [-Wunused-but-set-variable]
    8 | using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;long long sum=0;ios_base::sync_with_stdio(false);cin.tie(NULL);cin>>n>>m>>k;for(i=1; i<=n; i++){cin>>a>>b;adj[a].push_back(b);}for(i=1; i<=m; i++){cin>>x[i]>>y[i];if(y[i]==0){cost[i]=inf;}else{sort(adj[i].begin(),adj[i].end());if(adj[i].size()<x[i]){for(int j=1; j<=k; j++){cout<<-1<<'\n';}return 0;}if(x[i]==0){if(adj[i].size()==0){cost[i]=inf;}else{init[i]=adj[i][0];cost[i]=adj[i][0];}}else{int vkuk=adj[i][0];init[i]=adj[i][0];for(int j=0; j<adj[i].size(); j++){if(j+1<=x[i]){sum+=adj[i][j];}adj[i][j]-=vkuk;}if(adj[i].size()==x[i]){cost[i]=inf;}else{cost[i]=adj[i][x[i]]-adj[i][x[i]-1];}}}ord.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           ^
Main.cpp: In function 'int main()':
Main.cpp:8:1872: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 | using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;long long sum=0;ios_base::sync_with_stdio(false);cin.tie(NULL);cin>>n>>m>>k;for(i=1; i<=n; i++){cin>>a>>b;adj[a].push_back(b);}for(i=1; i<=m; i++){cin>>x[i]>>y[i];if(y[i]==0){cost[i]=inf;}else{sort(adj[i].begin(),adj[i].end());if(adj[i].size()<x[i]){for(int j=1; j<=k; j++){cout<<-1<<'\n';}return 0;}if(x[i]==0){if(adj[i].size()==0){cost[i]=inf;}else{init[i]=adj[i][0];cost[i]=adj[i][0];}}else{int vkuk=adj[i][0];init[i]=adj[i][0];for(int j=0; j<adj[i].size(); j++){if(j+1<=x[i]){sum+=adj[i][j];}adj[i][j]-=vkuk;}if(adj[i].size()==x[i]){cost[i]=inf;}else{cost[i]=adj[i][x[i]]-adj[i][x[i]-1];}}}ord.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   ~~~~~~~~~~~~~^~~~~
Main.cpp:8:2074: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[200005],cost[200005];bool cmp2(int a,int b){return cost[a]<cost[b];}node special(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];curr.lst=0;curr.sum+=adj[g2][0];curr.layer++;curr.biti=1;curr.bitipref=0;curr.rghtbord=adj[g2].size()-1;return curr;}node skip(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g]==0){curr.sum=curr.sum-adj[g][curr.lst];}else curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node godown(node curr){int g,g2;g=ord[curr.layer];g2=ord[curr.layer+1];if(x[g2]==0){return special(curr);}curr.layer++;curr.biti=x[g2];curr.lst=x[g2];curr.bitipref=x[g2]-1;curr.rghtbord=adj[g2].size()-1;curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;} node shift(node curr){int g;g=ord[curr.layer];curr.lst++;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandshift(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];return curr;} node fixborderandcreate(node curr){int g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum+=init[g];return curr;}signed  main(){int n,m,k,i,a,b;long long sum=0;ios_base::sync_with_stdio(false);cin.tie(NULL);cin>>n>>m>>k;for(i=1; i<=n; i++){cin>>a>>b;adj[a].push_back(b);}for(i=1; i<=m; i++){cin>>x[i]>>y[i];if(y[i]==0){cost[i]=inf;}else{sort(adj[i].begin(),adj[i].end());if(adj[i].size()<x[i]){for(int j=1; j<=k; j++){cout<<-1<<'\n';}return 0;}if(x[i]==0){if(adj[i].size()==0){cost[i]=inf;}else{init[i]=adj[i][0];cost[i]=adj[i][0];}}else{int vkuk=adj[i][0];init[i]=adj[i][0];for(int j=0; j<adj[i].size(); j++){if(j+1<=x[i]){sum+=adj[i][j];}adj[i][j]-=vkuk;}if(adj[i].size()==x[i]){cost[i]=inf;}else{cost[i]=adj[i][x[i]]-adj[i][x[i]-1];}}}ord.push_back(i);}sort(ord.begin(),ord.end(),cmp2);m--;for(i=0; i<ord.size(); i++){if(cost[ord[i]]==inf){m=i-1;break;}}node curr,curr2;cout<<sum<<'\n';k--;if(m>=0){int g=ord[0];if(x[g]==0){curr.layer=0;curr.sum=adj[g][0];curr.bitipref=0;curr.lst=0;curr.biti=1;curr.rghtbord=adj[g].size()-1;pq.push(curr);}else{curr.layer=0;curr.sum=adj[g][x[g]]-adj[g][x[g]-1];curr.bitipref=x[g]-1;curr.lst=x[g];curr.rghtbord=adj[g].size()-1;curr.biti=x[g];pq.push(curr);}while(pq.size() && k){curr=pq.top();pq.pop();k--;cout<<curr.sum+sum<<'\n';g=ord[curr.layer];if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0){curr2=skip(curr);pq.push(curr2);}if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m){curr2=skip(curr);pq.push(curr2);}if(curr.lst+1<=curr.rghtbord){curr2=shift(curr);pq.push(curr2);}if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1){curr2=fixborderandshift(curr);pq.push(curr2);}if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g]){curr2=fixborderandcreate(curr);pq.push(curr2);}if(curr.layer+1<=m){curr2=godown(curr);pq.push(curr2);}}}while(k){k--;cout<<-1<<'\n';}return 0;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~^~~~~~~~~~~~~~
Main.cpp:8:2158: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 | using namespace std;long long inf=1e9+10;struct node{long long  sum;int layer,bitipref,lst,rghtbord,biti;};struct cmp{bool operator()(node a,node  b){return a.sum>b.sum;}};priority_queue<node,vector<node>,cmp>pq;vector<int>adj[200005],ord;int y[200005],x[200005],init[2000

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 4 ms 6616 KB Output is correct
3 Correct 5 ms 6616 KB Output is correct
4 Correct 5 ms 6616 KB Output is correct
5 Correct 7 ms 5816 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 6 ms 6508 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 6 ms 5720 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 6404 KB Output is correct
14 Correct 5 ms 8628 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 7 ms 8664 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 6536 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 5592 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 6312 KB Output is correct
26 Correct 5 ms 6484 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 23880 KB Output is correct
2 Correct 68 ms 23728 KB Output is correct
3 Correct 77 ms 23724 KB Output is correct
4 Correct 61 ms 23992 KB Output is correct
5 Correct 54 ms 15796 KB Output is correct
6 Correct 56 ms 15476 KB Output is correct
7 Correct 67 ms 24764 KB Output is correct
8 Correct 59 ms 23576 KB Output is correct
9 Correct 14 ms 6744 KB Output is correct
10 Correct 70 ms 22912 KB Output is correct
11 Correct 15 ms 6748 KB Output is correct
12 Correct 29 ms 6708 KB Output is correct
13 Correct 65 ms 22704 KB Output is correct
14 Correct 65 ms 23856 KB Output is correct
15 Correct 22 ms 5848 KB Output is correct
16 Correct 67 ms 23364 KB Output is correct
17 Correct 69 ms 22704 KB Output is correct
18 Correct 22 ms 7160 KB Output is correct
19 Correct 71 ms 23776 KB Output is correct
20 Correct 69 ms 23324 KB Output is correct
21 Correct 22 ms 6740 KB Output is correct
22 Correct 61 ms 14712 KB Output is correct
23 Correct 60 ms 22312 KB Output is correct
24 Correct 14 ms 5684 KB Output is correct
25 Correct 13 ms 5720 KB Output is correct
26 Correct 51 ms 14524 KB Output is correct
27 Correct 52 ms 15452 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 4 ms 6616 KB Output is correct
3 Correct 5 ms 6616 KB Output is correct
4 Correct 5 ms 6616 KB Output is correct
5 Correct 7 ms 5816 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 6 ms 6508 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 6 ms 5720 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 6404 KB Output is correct
14 Correct 5 ms 8628 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 7 ms 8664 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 6536 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 5592 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 6312 KB Output is correct
26 Correct 5 ms 6484 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct
29 Correct 71 ms 23880 KB Output is correct
30 Correct 68 ms 23728 KB Output is correct
31 Correct 77 ms 23724 KB Output is correct
32 Correct 61 ms 23992 KB Output is correct
33 Correct 54 ms 15796 KB Output is correct
34 Correct 56 ms 15476 KB Output is correct
35 Correct 67 ms 24764 KB Output is correct
36 Correct 59 ms 23576 KB Output is correct
37 Correct 14 ms 6744 KB Output is correct
38 Correct 70 ms 22912 KB Output is correct
39 Correct 15 ms 6748 KB Output is correct
40 Correct 29 ms 6708 KB Output is correct
41 Correct 65 ms 22704 KB Output is correct
42 Correct 65 ms 23856 KB Output is correct
43 Correct 22 ms 5848 KB Output is correct
44 Correct 67 ms 23364 KB Output is correct
45 Correct 69 ms 22704 KB Output is correct
46 Correct 22 ms 7160 KB Output is correct
47 Correct 71 ms 23776 KB Output is correct
48 Correct 69 ms 23324 KB Output is correct
49 Correct 22 ms 6740 KB Output is correct
50 Correct 61 ms 14712 KB Output is correct
51 Correct 60 ms 22312 KB Output is correct
52 Correct 14 ms 5684 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 51 ms 14524 KB Output is correct
55 Correct 52 ms 15452 KB Output is correct
56 Correct 220 ms 33648 KB Output is correct
57 Correct 164 ms 30052 KB Output is correct
58 Correct 196 ms 29628 KB Output is correct
59 Correct 146 ms 26752 KB Output is correct
60 Correct 145 ms 23264 KB Output is correct
61 Correct 141 ms 28988 KB Output is correct
62 Correct 151 ms 25404 KB Output is correct
63 Correct 121 ms 23740 KB Output is correct
64 Correct 65 ms 7880 KB Output is correct
65 Correct 185 ms 28188 KB Output is correct
66 Correct 70 ms 8308 KB Output is correct
67 Correct 59 ms 9196 KB Output is correct
68 Correct 119 ms 23360 KB Output is correct
69 Correct 176 ms 28968 KB Output is correct
70 Correct 23 ms 5916 KB Output is correct
71 Correct 102 ms 23656 KB Output is correct
72 Correct 174 ms 26704 KB Output is correct
73 Correct 16 ms 5724 KB Output is correct
74 Correct 86 ms 15832 KB Output is correct
75 Correct 193 ms 31372 KB Output is correct
76 Correct 15 ms 5724 KB Output is correct
77 Correct 68 ms 14516 KB Output is correct
78 Correct 116 ms 23948 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 7724 KB Output is correct
2 Correct 44 ms 6636 KB Output is correct
3 Correct 17 ms 5724 KB Output is correct
4 Correct 23 ms 5980 KB Output is correct
5 Correct 188 ms 30628 KB Output is correct
6 Correct 188 ms 29628 KB Output is correct
7 Correct 234 ms 29736 KB Output is correct
8 Correct 167 ms 28724 KB Output is correct
9 Correct 221 ms 30864 KB Output is correct
10 Correct 237 ms 29144 KB Output is correct
11 Correct 156 ms 27672 KB Output is correct
12 Correct 131 ms 27808 KB Output is correct
13 Correct 121 ms 11676 KB Output is correct
14 Correct 206 ms 29312 KB Output is correct
15 Correct 201 ms 29216 KB Output is correct
16 Correct 75 ms 15008 KB Output is correct
17 Correct 102 ms 23132 KB Output is correct
18 Correct 206 ms 29564 KB Output is correct
19 Correct 81 ms 23368 KB Output is correct
20 Correct 91 ms 22904 KB Output is correct
21 Correct 155 ms 29872 KB Output is correct
22 Correct 89 ms 17716 KB Output is correct
23 Correct 88 ms 27220 KB Output is correct
24 Correct 195 ms 30952 KB Output is correct
25 Correct 64 ms 26804 KB Output is correct
26 Correct 71 ms 26444 KB Output is correct
27 Correct 143 ms 29832 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 4 ms 6616 KB Output is correct
3 Correct 5 ms 6616 KB Output is correct
4 Correct 5 ms 6616 KB Output is correct
5 Correct 7 ms 5816 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 6 ms 6508 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 6 ms 5720 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 5 ms 6404 KB Output is correct
14 Correct 5 ms 8628 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 7 ms 8664 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 6 ms 6536 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 5592 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 6312 KB Output is correct
26 Correct 5 ms 6484 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct
29 Correct 71 ms 23880 KB Output is correct
30 Correct 68 ms 23728 KB Output is correct
31 Correct 77 ms 23724 KB Output is correct
32 Correct 61 ms 23992 KB Output is correct
33 Correct 54 ms 15796 KB Output is correct
34 Correct 56 ms 15476 KB Output is correct
35 Correct 67 ms 24764 KB Output is correct
36 Correct 59 ms 23576 KB Output is correct
37 Correct 14 ms 6744 KB Output is correct
38 Correct 70 ms 22912 KB Output is correct
39 Correct 15 ms 6748 KB Output is correct
40 Correct 29 ms 6708 KB Output is correct
41 Correct 65 ms 22704 KB Output is correct
42 Correct 65 ms 23856 KB Output is correct
43 Correct 22 ms 5848 KB Output is correct
44 Correct 67 ms 23364 KB Output is correct
45 Correct 69 ms 22704 KB Output is correct
46 Correct 22 ms 7160 KB Output is correct
47 Correct 71 ms 23776 KB Output is correct
48 Correct 69 ms 23324 KB Output is correct
49 Correct 22 ms 6740 KB Output is correct
50 Correct 61 ms 14712 KB Output is correct
51 Correct 60 ms 22312 KB Output is correct
52 Correct 14 ms 5684 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 51 ms 14524 KB Output is correct
55 Correct 52 ms 15452 KB Output is correct
56 Correct 220 ms 33648 KB Output is correct
57 Correct 164 ms 30052 KB Output is correct
58 Correct 196 ms 29628 KB Output is correct
59 Correct 146 ms 26752 KB Output is correct
60 Correct 145 ms 23264 KB Output is correct
61 Correct 141 ms 28988 KB Output is correct
62 Correct 151 ms 25404 KB Output is correct
63 Correct 121 ms 23740 KB Output is correct
64 Correct 65 ms 7880 KB Output is correct
65 Correct 185 ms 28188 KB Output is correct
66 Correct 70 ms 8308 KB Output is correct
67 Correct 59 ms 9196 KB Output is correct
68 Correct 119 ms 23360 KB Output is correct
69 Correct 176 ms 28968 KB Output is correct
70 Correct 23 ms 5916 KB Output is correct
71 Correct 102 ms 23656 KB Output is correct
72 Correct 174 ms 26704 KB Output is correct
73 Correct 16 ms 5724 KB Output is correct
74 Correct 86 ms 15832 KB Output is correct
75 Correct 193 ms 31372 KB Output is correct
76 Correct 15 ms 5724 KB Output is correct
77 Correct 68 ms 14516 KB Output is correct
78 Correct 116 ms 23948 KB Output is correct
79 Correct 53 ms 7724 KB Output is correct
80 Correct 44 ms 6636 KB Output is correct
81 Correct 17 ms 5724 KB Output is correct
82 Correct 23 ms 5980 KB Output is correct
83 Correct 188 ms 30628 KB Output is correct
84 Correct 188 ms 29628 KB Output is correct
85 Correct 234 ms 29736 KB Output is correct
86 Correct 167 ms 28724 KB Output is correct
87 Correct 221 ms 30864 KB Output is correct
88 Correct 237 ms 29144 KB Output is correct
89 Correct 156 ms 27672 KB Output is correct
90 Correct 131 ms 27808 KB Output is correct
91 Correct 121 ms 11676 KB Output is correct
92 Correct 206 ms 29312 KB Output is correct
93 Correct 201 ms 29216 KB Output is correct
94 Correct 75 ms 15008 KB Output is correct
95 Correct 102 ms 23132 KB Output is correct
96 Correct 206 ms 29564 KB Output is correct
97 Correct 81 ms 23368 KB Output is correct
98 Correct 91 ms 22904 KB Output is correct
99 Correct 155 ms 29872 KB Output is correct
100 Correct 89 ms 17716 KB Output is correct
101 Correct 88 ms 27220 KB Output is correct
102 Correct 195 ms 30952 KB Output is correct
103 Correct 64 ms 26804 KB Output is correct
104 Correct 71 ms 26444 KB Output is correct
105 Correct 143 ms 29832 KB Output is correct
106 Correct 42 ms 6364 KB Output is correct
107 Correct 50 ms 7848 KB Output is correct
108 Correct 49 ms 6868 KB Output is correct
109 Correct 59 ms 7820 KB Output is correct
110 Correct 244 ms 31644 KB Output is correct
111 Correct 218 ms 31524 KB Output is correct
112 Correct 182 ms 32316 KB Output is correct
113 Correct 191 ms 29996 KB Output is correct
114 Correct 213 ms 31900 KB Output is correct
115 Correct 199 ms 30192 KB Output is correct
116 Correct 208 ms 46300 KB Output is correct
117 Correct 142 ms 28464 KB Output is correct
118 Correct 124 ms 14372 KB Output is correct
119 Correct 70 ms 9288 KB Output is correct
120 Correct 234 ms 30104 KB Output is correct
121 Correct 101 ms 24328 KB Output is correct
122 Correct 89 ms 27844 KB Output is correct
123 Correct 199 ms 30644 KB Output is correct
124 Correct 102 ms 16332 KB Output is correct
125 Correct 103 ms 26108 KB Output is correct
126 Correct 165 ms 31868 KB Output is correct
127 Correct 86 ms 18624 KB Output is correct
128 Correct 91 ms 24080 KB Output is correct
129 Correct 203 ms 32320 KB Output is correct
130 Correct 86 ms 26288 KB Output is correct
131 Correct 89 ms 27920 KB Output is correct
132 Correct 175 ms 29456 KB Output is correct