oj.uz

답안 #987996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987996 2024-05-23T20:12:31 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++11
25 / 25
 182 ms 46032 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#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:11:365: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   11 | 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:11:923: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   11 | 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:11:1872: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 | 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:11:2074: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | 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:11:2158: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 | 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[2000

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 26032 KB Output is correct
2 Correct 66 ms 25780 KB Output is correct
3 Correct 67 ms 25780 KB Output is correct
4 Correct 62 ms 25772 KB Output is correct
5 Correct 55 ms 18024 KB Output is correct
6 Correct 55 ms 17344 KB Output is correct
7 Correct 65 ms 25552 KB Output is correct
8 Correct 59 ms 25528 KB Output is correct
9 Correct 13 ms 8536 KB Output is correct
10 Correct 64 ms 25836 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 27 ms 6736 KB Output is correct
13 Correct 65 ms 22628 KB Output is correct
14 Correct 72 ms 25768 KB Output is correct
15 Correct 13 ms 8792 KB Output is correct
16 Correct 62 ms 25528 KB Output is correct
17 Correct 64 ms 25820 KB Output is correct
18 Correct 20 ms 9176 KB Output is correct
19 Correct 66 ms 22964 KB Output is correct
20 Correct 62 ms 23384 KB Output is correct
21 Correct 13 ms 8796 KB Output is correct
22 Correct 56 ms 16836 KB Output is correct
23 Correct 58 ms 23220 KB Output is correct
24 Correct 12 ms 8536 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 51 ms 14524 KB Output is correct
27 Correct 50 ms 14536 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6492 KB Output is correct
2 Correct 4 ms 8488 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8536 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 5464 KB Output is correct
14 Correct 5 ms 5592 KB Output is correct
15 Correct 4 ms 5208 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 7976 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 60 ms 26032 KB Output is correct
30 Correct 66 ms 25780 KB Output is correct
31 Correct 67 ms 25780 KB Output is correct
32 Correct 62 ms 25772 KB Output is correct
33 Correct 55 ms 18024 KB Output is correct
34 Correct 55 ms 17344 KB Output is correct
35 Correct 65 ms 25552 KB Output is correct
36 Correct 59 ms 25528 KB Output is correct
37 Correct 13 ms 8536 KB Output is correct
38 Correct 64 ms 25836 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 6736 KB Output is correct
41 Correct 65 ms 22628 KB Output is correct
42 Correct 72 ms 25768 KB Output is correct
43 Correct 13 ms 8792 KB Output is correct
44 Correct 62 ms 25528 KB Output is correct
45 Correct 64 ms 25820 KB Output is correct
46 Correct 20 ms 9176 KB Output is correct
47 Correct 66 ms 22964 KB Output is correct
48 Correct 62 ms 23384 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 56 ms 16836 KB Output is correct
51 Correct 58 ms 23220 KB Output is correct
52 Correct 12 ms 8536 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 51 ms 14524 KB Output is correct
55 Correct 50 ms 14536 KB Output is correct
56 Correct 158 ms 32048 KB Output is correct
57 Correct 145 ms 30012 KB Output is correct
58 Correct 138 ms 30776 KB Output is correct
59 Correct 132 ms 29548 KB Output is correct
60 Correct 134 ms 24152 KB Output is correct
61 Correct 133 ms 30776 KB Output is correct
62 Correct 121 ms 28156 KB Output is correct
63 Correct 127 ms 26648 KB Output is correct
64 Correct 54 ms 10776 KB Output is correct
65 Correct 137 ms 30260 KB Output is correct
66 Correct 49 ms 11344 KB Output is correct
67 Correct 49 ms 12236 KB Output is correct
68 Correct 74 ms 26288 KB Output is correct
69 Correct 136 ms 30520 KB Output is correct
70 Correct 14 ms 9304 KB Output is correct
71 Correct 76 ms 26424 KB Output is correct
72 Correct 124 ms 29240 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 69 ms 18624 KB Output is correct
75 Correct 138 ms 32644 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 63 ms 17348 KB Output is correct
78 Correct 103 ms 26916 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 10712 KB Output is correct
2 Correct 35 ms 9432 KB Output is correct
3 Correct 14 ms 5852 KB Output is correct
4 Correct 13 ms 8796 KB Output is correct
5 Correct 172 ms 30968 KB Output is correct
6 Correct 156 ms 29232 KB Output is correct
7 Correct 155 ms 29884 KB Output is correct
8 Correct 142 ms 28984 KB Output is correct
9 Correct 163 ms 30860 KB Output is correct
10 Correct 150 ms 29212 KB Output is correct
11 Correct 159 ms 27756 KB Output is correct
12 Correct 121 ms 28584 KB Output is correct
13 Correct 104 ms 12408 KB Output is correct
14 Correct 159 ms 29280 KB Output is correct
15 Correct 149 ms 29576 KB Output is correct
16 Correct 63 ms 17852 KB Output is correct
17 Correct 74 ms 26032 KB Output is correct
18 Correct 167 ms 29644 KB Output is correct
19 Correct 69 ms 26288 KB Output is correct
20 Correct 75 ms 25780 KB Output is correct
21 Correct 162 ms 28924 KB Output is correct
22 Correct 60 ms 17848 KB Output is correct
23 Correct 74 ms 26104 KB Output is correct
24 Correct 163 ms 30768 KB Output is correct
25 Correct 63 ms 26292 KB Output is correct
26 Correct 62 ms 23424 KB Output is correct
27 Correct 130 ms 28264 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6492 KB Output is correct
2 Correct 4 ms 8488 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8536 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 5464 KB Output is correct
14 Correct 5 ms 5592 KB Output is correct
15 Correct 4 ms 5208 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 7976 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 60 ms 26032 KB Output is correct
30 Correct 66 ms 25780 KB Output is correct
31 Correct 67 ms 25780 KB Output is correct
32 Correct 62 ms 25772 KB Output is correct
33 Correct 55 ms 18024 KB Output is correct
34 Correct 55 ms 17344 KB Output is correct
35 Correct 65 ms 25552 KB Output is correct
36 Correct 59 ms 25528 KB Output is correct
37 Correct 13 ms 8536 KB Output is correct
38 Correct 64 ms 25836 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 6736 KB Output is correct
41 Correct 65 ms 22628 KB Output is correct
42 Correct 72 ms 25768 KB Output is correct
43 Correct 13 ms 8792 KB Output is correct
44 Correct 62 ms 25528 KB Output is correct
45 Correct 64 ms 25820 KB Output is correct
46 Correct 20 ms 9176 KB Output is correct
47 Correct 66 ms 22964 KB Output is correct
48 Correct 62 ms 23384 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 56 ms 16836 KB Output is correct
51 Correct 58 ms 23220 KB Output is correct
52 Correct 12 ms 8536 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 51 ms 14524 KB Output is correct
55 Correct 50 ms 14536 KB Output is correct
56 Correct 158 ms 32048 KB Output is correct
57 Correct 145 ms 30012 KB Output is correct
58 Correct 138 ms 30776 KB Output is correct
59 Correct 132 ms 29548 KB Output is correct
60 Correct 134 ms 24152 KB Output is correct
61 Correct 133 ms 30776 KB Output is correct
62 Correct 121 ms 28156 KB Output is correct
63 Correct 127 ms 26648 KB Output is correct
64 Correct 54 ms 10776 KB Output is correct
65 Correct 137 ms 30260 KB Output is correct
66 Correct 49 ms 11344 KB Output is correct
67 Correct 49 ms 12236 KB Output is correct
68 Correct 74 ms 26288 KB Output is correct
69 Correct 136 ms 30520 KB Output is correct
70 Correct 14 ms 9304 KB Output is correct
71 Correct 76 ms 26424 KB Output is correct
72 Correct 124 ms 29240 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 69 ms 18624 KB Output is correct
75 Correct 138 ms 32644 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 63 ms 17348 KB Output is correct
78 Correct 103 ms 26916 KB Output is correct
79 Correct 40 ms 10712 KB Output is correct
80 Correct 35 ms 9432 KB Output is correct
81 Correct 14 ms 5852 KB Output is correct
82 Correct 13 ms 8796 KB Output is correct
83 Correct 172 ms 30968 KB Output is correct
84 Correct 156 ms 29232 KB Output is correct
85 Correct 155 ms 29884 KB Output is correct
86 Correct 142 ms 28984 KB Output is correct
87 Correct 163 ms 30860 KB Output is correct
88 Correct 150 ms 29212 KB Output is correct
89 Correct 159 ms 27756 KB Output is correct
90 Correct 121 ms 28584 KB Output is correct
91 Correct 104 ms 12408 KB Output is correct
92 Correct 159 ms 29280 KB Output is correct
93 Correct 149 ms 29576 KB Output is correct
94 Correct 63 ms 17852 KB Output is correct
95 Correct 74 ms 26032 KB Output is correct
96 Correct 167 ms 29644 KB Output is correct
97 Correct 69 ms 26288 KB Output is correct
98 Correct 75 ms 25780 KB Output is correct
99 Correct 162 ms 28924 KB Output is correct
100 Correct 60 ms 17848 KB Output is correct
101 Correct 74 ms 26104 KB Output is correct
102 Correct 163 ms 30768 KB Output is correct
103 Correct 63 ms 26292 KB Output is correct
104 Correct 62 ms 23424 KB Output is correct
105 Correct 130 ms 28264 KB Output is correct
106 Correct 36 ms 9180 KB Output is correct
107 Correct 42 ms 10956 KB Output is correct
108 Correct 39 ms 9760 KB Output is correct
109 Correct 42 ms 10572 KB Output is correct
110 Correct 155 ms 31608 KB Output is correct
111 Correct 165 ms 30744 KB Output is correct
112 Correct 175 ms 30624 KB Output is correct
113 Correct 152 ms 29496 KB Output is correct
114 Correct 157 ms 31796 KB Output is correct
115 Correct 153 ms 30168 KB Output is correct
116 Correct 167 ms 46032 KB Output is correct
117 Correct 142 ms 28720 KB Output is correct
118 Correct 113 ms 14440 KB Output is correct
119 Correct 55 ms 11348 KB Output is correct
120 Correct 182 ms 30152 KB Output is correct
121 Correct 73 ms 26440 KB Output is correct
122 Correct 82 ms 26296 KB Output is correct
123 Correct 161 ms 30640 KB Output is correct
124 Correct 66 ms 18352 KB Output is correct
125 Correct 83 ms 26028 KB Output is correct
126 Correct 150 ms 29992 KB Output is correct
127 Correct 63 ms 17668 KB Output is correct
128 Correct 78 ms 26552 KB Output is correct
129 Correct 159 ms 32372 KB Output is correct
130 Correct 82 ms 26336 KB Output is correct
131 Correct 106 ms 26292 KB Output is correct
132 Correct 141 ms 27744 KB Output is correct