oj.uz

답안 #988074

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988074 2024-05-24T03:35:51 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 201 ms 50080 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],i

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5976 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5720 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 ms 5224 KB Output is correct
10 Correct 5 ms 5976 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5588 KB Output is correct
24 Correct 5 ms 5464 KB Output is correct
25 Correct 4 ms 5464 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5604 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 23184 KB Output is correct
2 Correct 64 ms 23132 KB Output is correct
3 Correct 65 ms 22960 KB Output is correct
4 Correct 71 ms 23008 KB Output is correct
5 Correct 56 ms 14676 KB Output is correct
6 Correct 55 ms 14412 KB Output is correct
7 Correct 64 ms 22712 KB Output is correct
8 Correct 59 ms 22448 KB Output is correct
9 Correct 14 ms 5724 KB Output is correct
10 Correct 78 ms 22832 KB Output is correct
11 Correct 13 ms 5720 KB Output is correct
12 Correct 37 ms 6604 KB Output is correct
13 Correct 65 ms 22700 KB Output is correct
14 Correct 85 ms 22964 KB Output is correct
15 Correct 15 ms 5812 KB Output is correct
16 Correct 63 ms 22444 KB Output is correct
17 Correct 67 ms 22956 KB Output is correct
18 Correct 22 ms 6352 KB Output is correct
19 Correct 63 ms 22960 KB Output is correct
20 Correct 62 ms 23212 KB Output is correct
21 Correct 15 ms 5724 KB Output is correct
22 Correct 62 ms 13828 KB Output is correct
23 Correct 71 ms 22452 KB Output is correct
24 Correct 16 ms 5704 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 55 ms 14524 KB Output is correct
27 Correct 51 ms 14528 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5976 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5720 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 ms 5224 KB Output is correct
10 Correct 5 ms 5976 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5588 KB Output is correct
24 Correct 5 ms 5464 KB Output is correct
25 Correct 4 ms 5464 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5604 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 63 ms 23184 KB Output is correct
30 Correct 64 ms 23132 KB Output is correct
31 Correct 65 ms 22960 KB Output is correct
32 Correct 71 ms 23008 KB Output is correct
33 Correct 56 ms 14676 KB Output is correct
34 Correct 55 ms 14412 KB Output is correct
35 Correct 64 ms 22712 KB Output is correct
36 Correct 59 ms 22448 KB Output is correct
37 Correct 14 ms 5724 KB Output is correct
38 Correct 78 ms 22832 KB Output is correct
39 Correct 13 ms 5720 KB Output is correct
40 Correct 37 ms 6604 KB Output is correct
41 Correct 65 ms 22700 KB Output is correct
42 Correct 85 ms 22964 KB Output is correct
43 Correct 15 ms 5812 KB Output is correct
44 Correct 63 ms 22444 KB Output is correct
45 Correct 67 ms 22956 KB Output is correct
46 Correct 22 ms 6352 KB Output is correct
47 Correct 63 ms 22960 KB Output is correct
48 Correct 62 ms 23212 KB Output is correct
49 Correct 15 ms 5724 KB Output is correct
50 Correct 62 ms 13828 KB Output is correct
51 Correct 71 ms 22452 KB Output is correct
52 Correct 16 ms 5704 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 55 ms 14524 KB Output is correct
55 Correct 51 ms 14528 KB Output is correct
56 Correct 154 ms 34572 KB Output is correct
57 Correct 136 ms 31440 KB Output is correct
58 Correct 148 ms 32632 KB Output is correct
59 Correct 130 ms 29996 KB Output is correct
60 Correct 136 ms 26928 KB Output is correct
61 Correct 131 ms 32452 KB Output is correct
62 Correct 121 ms 28340 KB Output is correct
63 Correct 115 ms 25860 KB Output is correct
64 Correct 56 ms 10340 KB Output is correct
65 Correct 138 ms 31956 KB Output is correct
66 Correct 50 ms 11860 KB Output is correct
67 Correct 50 ms 9160 KB Output is correct
68 Correct 77 ms 23476 KB Output is correct
69 Correct 147 ms 32320 KB Output is correct
70 Correct 17 ms 5980 KB Output is correct
71 Correct 78 ms 23476 KB Output is correct
72 Correct 138 ms 29900 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 66 ms 15800 KB Output is correct
75 Correct 154 ms 34948 KB Output is correct
76 Correct 14 ms 5720 KB Output is correct
77 Correct 64 ms 14528 KB Output is correct
78 Correct 105 ms 26248 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 8144 KB Output is correct
2 Correct 37 ms 6436 KB Output is correct
3 Correct 16 ms 5724 KB Output is correct
4 Correct 15 ms 5976 KB Output is correct
5 Correct 160 ms 34680 KB Output is correct
6 Correct 151 ms 33336 KB Output is correct
7 Correct 151 ms 33852 KB Output is correct
8 Correct 150 ms 32928 KB Output is correct
9 Correct 153 ms 34608 KB Output is correct
10 Correct 151 ms 33072 KB Output is correct
11 Correct 144 ms 31788 KB Output is correct
12 Correct 124 ms 31664 KB Output is correct
13 Correct 114 ms 15404 KB Output is correct
14 Correct 148 ms 33376 KB Output is correct
15 Correct 165 ms 33296 KB Output is correct
16 Correct 63 ms 15028 KB Output is correct
17 Correct 79 ms 22964 KB Output is correct
18 Correct 164 ms 33592 KB Output is correct
19 Correct 78 ms 23220 KB Output is correct
20 Correct 75 ms 22996 KB Output is correct
21 Correct 158 ms 32552 KB Output is correct
22 Correct 63 ms 14772 KB Output is correct
23 Correct 73 ms 22964 KB Output is correct
24 Correct 159 ms 34612 KB Output is correct
25 Correct 74 ms 23484 KB Output is correct
26 Correct 62 ms 23476 KB Output is correct
27 Correct 157 ms 31372 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5976 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5720 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 ms 5224 KB Output is correct
10 Correct 5 ms 5976 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5588 KB Output is correct
24 Correct 5 ms 5464 KB Output is correct
25 Correct 4 ms 5464 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5604 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 63 ms 23184 KB Output is correct
30 Correct 64 ms 23132 KB Output is correct
31 Correct 65 ms 22960 KB Output is correct
32 Correct 71 ms 23008 KB Output is correct
33 Correct 56 ms 14676 KB Output is correct
34 Correct 55 ms 14412 KB Output is correct
35 Correct 64 ms 22712 KB Output is correct
36 Correct 59 ms 22448 KB Output is correct
37 Correct 14 ms 5724 KB Output is correct
38 Correct 78 ms 22832 KB Output is correct
39 Correct 13 ms 5720 KB Output is correct
40 Correct 37 ms 6604 KB Output is correct
41 Correct 65 ms 22700 KB Output is correct
42 Correct 85 ms 22964 KB Output is correct
43 Correct 15 ms 5812 KB Output is correct
44 Correct 63 ms 22444 KB Output is correct
45 Correct 67 ms 22956 KB Output is correct
46 Correct 22 ms 6352 KB Output is correct
47 Correct 63 ms 22960 KB Output is correct
48 Correct 62 ms 23212 KB Output is correct
49 Correct 15 ms 5724 KB Output is correct
50 Correct 62 ms 13828 KB Output is correct
51 Correct 71 ms 22452 KB Output is correct
52 Correct 16 ms 5704 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 55 ms 14524 KB Output is correct
55 Correct 51 ms 14528 KB Output is correct
56 Correct 154 ms 34572 KB Output is correct
57 Correct 136 ms 31440 KB Output is correct
58 Correct 148 ms 32632 KB Output is correct
59 Correct 130 ms 29996 KB Output is correct
60 Correct 136 ms 26928 KB Output is correct
61 Correct 131 ms 32452 KB Output is correct
62 Correct 121 ms 28340 KB Output is correct
63 Correct 115 ms 25860 KB Output is correct
64 Correct 56 ms 10340 KB Output is correct
65 Correct 138 ms 31956 KB Output is correct
66 Correct 50 ms 11860 KB Output is correct
67 Correct 50 ms 9160 KB Output is correct
68 Correct 77 ms 23476 KB Output is correct
69 Correct 147 ms 32320 KB Output is correct
70 Correct 17 ms 5980 KB Output is correct
71 Correct 78 ms 23476 KB Output is correct
72 Correct 138 ms 29900 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 66 ms 15800 KB Output is correct
75 Correct 154 ms 34948 KB Output is correct
76 Correct 14 ms 5720 KB Output is correct
77 Correct 64 ms 14528 KB Output is correct
78 Correct 105 ms 26248 KB Output is correct
79 Correct 48 ms 8144 KB Output is correct
80 Correct 37 ms 6436 KB Output is correct
81 Correct 16 ms 5724 KB Output is correct
82 Correct 15 ms 5976 KB Output is correct
83 Correct 160 ms 34680 KB Output is correct
84 Correct 151 ms 33336 KB Output is correct
85 Correct 151 ms 33852 KB Output is correct
86 Correct 150 ms 32928 KB Output is correct
87 Correct 153 ms 34608 KB Output is correct
88 Correct 151 ms 33072 KB Output is correct
89 Correct 144 ms 31788 KB Output is correct
90 Correct 124 ms 31664 KB Output is correct
91 Correct 114 ms 15404 KB Output is correct
92 Correct 148 ms 33376 KB Output is correct
93 Correct 165 ms 33296 KB Output is correct
94 Correct 63 ms 15028 KB Output is correct
95 Correct 79 ms 22964 KB Output is correct
96 Correct 164 ms 33592 KB Output is correct
97 Correct 78 ms 23220 KB Output is correct
98 Correct 75 ms 22996 KB Output is correct
99 Correct 158 ms 32552 KB Output is correct
100 Correct 63 ms 14772 KB Output is correct
101 Correct 73 ms 22964 KB Output is correct
102 Correct 159 ms 34612 KB Output is correct
103 Correct 74 ms 23484 KB Output is correct
104 Correct 62 ms 23476 KB Output is correct
105 Correct 157 ms 31372 KB Output is correct
106 Correct 36 ms 6440 KB Output is correct
107 Correct 47 ms 7972 KB Output is correct
108 Correct 38 ms 6860 KB Output is correct
109 Correct 43 ms 7880 KB Output is correct
110 Correct 162 ms 35628 KB Output is correct
111 Correct 201 ms 34924 KB Output is correct
112 Correct 162 ms 34616 KB Output is correct
113 Correct 175 ms 33588 KB Output is correct
114 Correct 165 ms 35884 KB Output is correct
115 Correct 157 ms 34384 KB Output is correct
116 Correct 174 ms 50080 KB Output is correct
117 Correct 140 ms 31820 KB Output is correct
118 Correct 114 ms 17788 KB Output is correct
119 Correct 55 ms 11860 KB Output is correct
120 Correct 181 ms 34052 KB Output is correct
121 Correct 71 ms 23472 KB Output is correct
122 Correct 79 ms 23460 KB Output is correct
123 Correct 167 ms 34616 KB Output is correct
124 Correct 67 ms 15544 KB Output is correct
125 Correct 84 ms 23216 KB Output is correct
126 Correct 156 ms 33980 KB Output is correct
127 Correct 61 ms 14716 KB Output is correct
128 Correct 76 ms 23732 KB Output is correct
129 Correct 190 ms 36164 KB Output is correct
130 Correct 71 ms 23232 KB Output is correct
131 Correct 79 ms 23228 KB Output is correct
132 Correct 143 ms 31780 KB Output is correct