oj.uz

답안 #987960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987960 2024-05-23T19:45:00 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 213 ms 46232 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 7 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8536 KB Output is correct
4 Correct 4 ms 8520 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8792 KB Output is correct
7 Correct 5 ms 8548 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 3 ms 8312 KB Output is correct
13 Correct 5 ms 7516 KB Output is correct
14 Correct 7 ms 8540 KB Output is correct
15 Correct 3 ms 8280 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8280 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 5 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 6 ms 8540 KB Output is correct
27 Correct 6 ms 8500 KB Output is correct
28 Correct 5 ms 6488 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 25928 KB Output is correct
2 Correct 64 ms 25844 KB Output is correct
3 Correct 74 ms 27692 KB Output is correct
4 Correct 62 ms 25952 KB Output is correct
5 Correct 58 ms 18932 KB Output is correct
6 Correct 78 ms 17496 KB Output is correct
7 Correct 67 ms 25616 KB Output is correct
8 Correct 68 ms 23948 KB Output is correct
9 Correct 21 ms 8724 KB Output is correct
10 Correct 68 ms 27708 KB Output is correct
11 Correct 14 ms 8540 KB Output is correct
12 Correct 30 ms 9688 KB Output is correct
13 Correct 72 ms 24632 KB Output is correct
14 Correct 78 ms 25568 KB Output is correct
15 Correct 21 ms 8796 KB Output is correct
16 Correct 73 ms 26252 KB Output is correct
17 Correct 75 ms 25644 KB Output is correct
18 Correct 22 ms 9116 KB Output is correct
19 Correct 68 ms 26040 KB Output is correct
20 Correct 66 ms 26976 KB Output is correct
21 Correct 20 ms 8796 KB Output is correct
22 Correct 67 ms 18884 KB Output is correct
23 Correct 62 ms 25200 KB Output is correct
24 Correct 20 ms 8540 KB Output is correct
25 Correct 16 ms 8540 KB Output is correct
26 Correct 53 ms 14484 KB Output is correct
27 Correct 52 ms 14460 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8536 KB Output is correct
4 Correct 4 ms 8520 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8792 KB Output is correct
7 Correct 5 ms 8548 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 3 ms 8312 KB Output is correct
13 Correct 5 ms 7516 KB Output is correct
14 Correct 7 ms 8540 KB Output is correct
15 Correct 3 ms 8280 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8280 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 5 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 6 ms 8540 KB Output is correct
27 Correct 6 ms 8500 KB Output is correct
28 Correct 5 ms 6488 KB Output is correct
29 Correct 68 ms 25928 KB Output is correct
30 Correct 64 ms 25844 KB Output is correct
31 Correct 74 ms 27692 KB Output is correct
32 Correct 62 ms 25952 KB Output is correct
33 Correct 58 ms 18932 KB Output is correct
34 Correct 78 ms 17496 KB Output is correct
35 Correct 67 ms 25616 KB Output is correct
36 Correct 68 ms 23948 KB Output is correct
37 Correct 21 ms 8724 KB Output is correct
38 Correct 68 ms 27708 KB Output is correct
39 Correct 14 ms 8540 KB Output is correct
40 Correct 30 ms 9688 KB Output is correct
41 Correct 72 ms 24632 KB Output is correct
42 Correct 78 ms 25568 KB Output is correct
43 Correct 21 ms 8796 KB Output is correct
44 Correct 73 ms 26252 KB Output is correct
45 Correct 75 ms 25644 KB Output is correct
46 Correct 22 ms 9116 KB Output is correct
47 Correct 68 ms 26040 KB Output is correct
48 Correct 66 ms 26976 KB Output is correct
49 Correct 20 ms 8796 KB Output is correct
50 Correct 67 ms 18884 KB Output is correct
51 Correct 62 ms 25200 KB Output is correct
52 Correct 20 ms 8540 KB Output is correct
53 Correct 16 ms 8540 KB Output is correct
54 Correct 53 ms 14484 KB Output is correct
55 Correct 52 ms 14460 KB Output is correct
56 Correct 183 ms 30964 KB Output is correct
57 Correct 155 ms 28228 KB Output is correct
58 Correct 131 ms 31996 KB Output is correct
59 Correct 144 ms 30264 KB Output is correct
60 Correct 185 ms 24060 KB Output is correct
61 Correct 171 ms 30800 KB Output is correct
62 Correct 159 ms 28932 KB Output is correct
63 Correct 119 ms 28672 KB Output is correct
64 Correct 59 ms 10972 KB Output is correct
65 Correct 154 ms 32092 KB Output is correct
66 Correct 62 ms 11348 KB Output is correct
67 Correct 55 ms 10144 KB Output is correct
68 Correct 89 ms 26364 KB Output is correct
69 Correct 197 ms 32016 KB Output is correct
70 Correct 23 ms 8980 KB Output is correct
71 Correct 91 ms 26592 KB Output is correct
72 Correct 125 ms 29592 KB Output is correct
73 Correct 14 ms 8756 KB Output is correct
74 Correct 67 ms 15860 KB Output is correct
75 Correct 185 ms 32308 KB Output is correct
76 Correct 19 ms 8804 KB Output is correct
77 Correct 69 ms 19184 KB Output is correct
78 Correct 108 ms 26916 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 10672 KB Output is correct
2 Correct 45 ms 9352 KB Output is correct
3 Correct 21 ms 8716 KB Output is correct
4 Correct 15 ms 6748 KB Output is correct
5 Correct 190 ms 30564 KB Output is correct
6 Correct 187 ms 30132 KB Output is correct
7 Correct 183 ms 30804 KB Output is correct
8 Correct 169 ms 30772 KB Output is correct
9 Correct 181 ms 32320 KB Output is correct
10 Correct 178 ms 31264 KB Output is correct
11 Correct 149 ms 28168 KB Output is correct
12 Correct 153 ms 28528 KB Output is correct
13 Correct 101 ms 12408 KB Output is correct
14 Correct 152 ms 31288 KB Output is correct
15 Correct 180 ms 29220 KB Output is correct
16 Correct 63 ms 15796 KB Output is correct
17 Correct 95 ms 27336 KB Output is correct
18 Correct 200 ms 29872 KB Output is correct
19 Correct 72 ms 26296 KB Output is correct
20 Correct 82 ms 25432 KB Output is correct
21 Correct 188 ms 30064 KB Output is correct
22 Correct 83 ms 17796 KB Output is correct
23 Correct 78 ms 27728 KB Output is correct
24 Correct 199 ms 32668 KB Output is correct
25 Correct 66 ms 26300 KB Output is correct
26 Correct 60 ms 27832 KB Output is correct
27 Correct 134 ms 29324 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8536 KB Output is correct
4 Correct 4 ms 8520 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8792 KB Output is correct
7 Correct 5 ms 8548 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 3 ms 8312 KB Output is correct
13 Correct 5 ms 7516 KB Output is correct
14 Correct 7 ms 8540 KB Output is correct
15 Correct 3 ms 8280 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 4 ms 8280 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 5 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 6 ms 8540 KB Output is correct
27 Correct 6 ms 8500 KB Output is correct
28 Correct 5 ms 6488 KB Output is correct
29 Correct 68 ms 25928 KB Output is correct
30 Correct 64 ms 25844 KB Output is correct
31 Correct 74 ms 27692 KB Output is correct
32 Correct 62 ms 25952 KB Output is correct
33 Correct 58 ms 18932 KB Output is correct
34 Correct 78 ms 17496 KB Output is correct
35 Correct 67 ms 25616 KB Output is correct
36 Correct 68 ms 23948 KB Output is correct
37 Correct 21 ms 8724 KB Output is correct
38 Correct 68 ms 27708 KB Output is correct
39 Correct 14 ms 8540 KB Output is correct
40 Correct 30 ms 9688 KB Output is correct
41 Correct 72 ms 24632 KB Output is correct
42 Correct 78 ms 25568 KB Output is correct
43 Correct 21 ms 8796 KB Output is correct
44 Correct 73 ms 26252 KB Output is correct
45 Correct 75 ms 25644 KB Output is correct
46 Correct 22 ms 9116 KB Output is correct
47 Correct 68 ms 26040 KB Output is correct
48 Correct 66 ms 26976 KB Output is correct
49 Correct 20 ms 8796 KB Output is correct
50 Correct 67 ms 18884 KB Output is correct
51 Correct 62 ms 25200 KB Output is correct
52 Correct 20 ms 8540 KB Output is correct
53 Correct 16 ms 8540 KB Output is correct
54 Correct 53 ms 14484 KB Output is correct
55 Correct 52 ms 14460 KB Output is correct
56 Correct 183 ms 30964 KB Output is correct
57 Correct 155 ms 28228 KB Output is correct
58 Correct 131 ms 31996 KB Output is correct
59 Correct 144 ms 30264 KB Output is correct
60 Correct 185 ms 24060 KB Output is correct
61 Correct 171 ms 30800 KB Output is correct
62 Correct 159 ms 28932 KB Output is correct
63 Correct 119 ms 28672 KB Output is correct
64 Correct 59 ms 10972 KB Output is correct
65 Correct 154 ms 32092 KB Output is correct
66 Correct 62 ms 11348 KB Output is correct
67 Correct 55 ms 10144 KB Output is correct
68 Correct 89 ms 26364 KB Output is correct
69 Correct 197 ms 32016 KB Output is correct
70 Correct 23 ms 8980 KB Output is correct
71 Correct 91 ms 26592 KB Output is correct
72 Correct 125 ms 29592 KB Output is correct
73 Correct 14 ms 8756 KB Output is correct
74 Correct 67 ms 15860 KB Output is correct
75 Correct 185 ms 32308 KB Output is correct
76 Correct 19 ms 8804 KB Output is correct
77 Correct 69 ms 19184 KB Output is correct
78 Correct 108 ms 26916 KB Output is correct
79 Correct 43 ms 10672 KB Output is correct
80 Correct 45 ms 9352 KB Output is correct
81 Correct 21 ms 8716 KB Output is correct
82 Correct 15 ms 6748 KB Output is correct
83 Correct 190 ms 30564 KB Output is correct
84 Correct 187 ms 30132 KB Output is correct
85 Correct 183 ms 30804 KB Output is correct
86 Correct 169 ms 30772 KB Output is correct
87 Correct 181 ms 32320 KB Output is correct
88 Correct 178 ms 31264 KB Output is correct
89 Correct 149 ms 28168 KB Output is correct
90 Correct 153 ms 28528 KB Output is correct
91 Correct 101 ms 12408 KB Output is correct
92 Correct 152 ms 31288 KB Output is correct
93 Correct 180 ms 29220 KB Output is correct
94 Correct 63 ms 15796 KB Output is correct
95 Correct 95 ms 27336 KB Output is correct
96 Correct 200 ms 29872 KB Output is correct
97 Correct 72 ms 26296 KB Output is correct
98 Correct 82 ms 25432 KB Output is correct
99 Correct 188 ms 30064 KB Output is correct
100 Correct 83 ms 17796 KB Output is correct
101 Correct 78 ms 27728 KB Output is correct
102 Correct 199 ms 32668 KB Output is correct
103 Correct 66 ms 26300 KB Output is correct
104 Correct 60 ms 27832 KB Output is correct
105 Correct 134 ms 29324 KB Output is correct
106 Correct 43 ms 9212 KB Output is correct
107 Correct 42 ms 10816 KB Output is correct
108 Correct 39 ms 9688 KB Output is correct
109 Correct 45 ms 10696 KB Output is correct
110 Correct 213 ms 33252 KB Output is correct
111 Correct 162 ms 30764 KB Output is correct
112 Correct 178 ms 32056 KB Output is correct
113 Correct 163 ms 30472 KB Output is correct
114 Correct 185 ms 33748 KB Output is correct
115 Correct 172 ms 30300 KB Output is correct
116 Correct 190 ms 46232 KB Output is correct
117 Correct 137 ms 28008 KB Output is correct
118 Correct 118 ms 14648 KB Output is correct
119 Correct 51 ms 11476 KB Output is correct
120 Correct 164 ms 31548 KB Output is correct
121 Correct 76 ms 26980 KB Output is correct
122 Correct 89 ms 28080 KB Output is correct
123 Correct 210 ms 31380 KB Output is correct
124 Correct 84 ms 19152 KB Output is correct
125 Correct 78 ms 26552 KB Output is correct
126 Correct 164 ms 31436 KB Output is correct
127 Correct 62 ms 19400 KB Output is correct
128 Correct 76 ms 27628 KB Output is correct
129 Correct 176 ms 32168 KB Output is correct
130 Correct 80 ms 26292 KB Output is correct
131 Correct 80 ms 26136 KB Output is correct
132 Correct 148 ms 29028 KB Output is correct