oj.uz

답안 #988015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988015 2024-05-23T20:29:26 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 213 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 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 7 ms 8664 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8664 KB Output is correct
4 Correct 6 ms 8884 KB Output is correct
5 Correct 5 ms 8632 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 5 ms 8512 KB Output is correct
9 Correct 4 ms 8120 KB Output is correct
10 Correct 4 ms 6616 KB Output is correct
11 Correct 3 ms 8236 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 4 ms 6616 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 4 ms 6616 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5540 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 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 23172 KB Output is correct
2 Correct 77 ms 22952 KB Output is correct
3 Correct 61 ms 23804 KB Output is correct
4 Correct 64 ms 23988 KB Output is correct
5 Correct 64 ms 15784 KB Output is correct
6 Correct 55 ms 15296 KB Output is correct
7 Correct 72 ms 23468 KB Output is correct
8 Correct 67 ms 23440 KB Output is correct
9 Correct 13 ms 6492 KB Output is correct
10 Correct 64 ms 22848 KB Output is correct
11 Correct 12 ms 5724 KB Output is correct
12 Correct 31 ms 6700 KB Output is correct
13 Correct 67 ms 23468 KB Output is correct
14 Correct 70 ms 23084 KB Output is correct
15 Correct 13 ms 5720 KB Output is correct
16 Correct 65 ms 22632 KB Output is correct
17 Correct 66 ms 22880 KB Output is correct
18 Correct 20 ms 6356 KB Output is correct
19 Correct 65 ms 23060 KB Output is correct
20 Correct 61 ms 23244 KB Output is correct
21 Correct 13 ms 5724 KB Output is correct
22 Correct 59 ms 13936 KB Output is correct
23 Correct 58 ms 22200 KB Output is correct
24 Correct 14 ms 5720 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 49 ms 14532 KB Output is correct
27 Correct 52 ms 14524 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8664 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8664 KB Output is correct
4 Correct 6 ms 8884 KB Output is correct
5 Correct 5 ms 8632 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 5 ms 8512 KB Output is correct
9 Correct 4 ms 8120 KB Output is correct
10 Correct 4 ms 6616 KB Output is correct
11 Correct 3 ms 8236 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 4 ms 6616 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 4 ms 6616 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5540 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 63 ms 23172 KB Output is correct
30 Correct 77 ms 22952 KB Output is correct
31 Correct 61 ms 23804 KB Output is correct
32 Correct 64 ms 23988 KB Output is correct
33 Correct 64 ms 15784 KB Output is correct
34 Correct 55 ms 15296 KB Output is correct
35 Correct 72 ms 23468 KB Output is correct
36 Correct 67 ms 23440 KB Output is correct
37 Correct 13 ms 6492 KB Output is correct
38 Correct 64 ms 22848 KB Output is correct
39 Correct 12 ms 5724 KB Output is correct
40 Correct 31 ms 6700 KB Output is correct
41 Correct 67 ms 23468 KB Output is correct
42 Correct 70 ms 23084 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 65 ms 22632 KB Output is correct
45 Correct 66 ms 22880 KB Output is correct
46 Correct 20 ms 6356 KB Output is correct
47 Correct 65 ms 23060 KB Output is correct
48 Correct 61 ms 23244 KB Output is correct
49 Correct 13 ms 5724 KB Output is correct
50 Correct 59 ms 13936 KB Output is correct
51 Correct 58 ms 22200 KB Output is correct
52 Correct 14 ms 5720 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 49 ms 14532 KB Output is correct
55 Correct 52 ms 14524 KB Output is correct
56 Correct 145 ms 34756 KB Output is correct
57 Correct 138 ms 31612 KB Output is correct
58 Correct 142 ms 32560 KB Output is correct
59 Correct 129 ms 29976 KB Output is correct
60 Correct 136 ms 26804 KB Output is correct
61 Correct 135 ms 32372 KB Output is correct
62 Correct 137 ms 28368 KB Output is correct
63 Correct 108 ms 25960 KB Output is correct
64 Correct 55 ms 10192 KB Output is correct
65 Correct 145 ms 31588 KB Output is correct
66 Correct 51 ms 11624 KB Output is correct
67 Correct 49 ms 9220 KB Output is correct
68 Correct 83 ms 23468 KB Output is correct
69 Correct 148 ms 32636 KB Output is correct
70 Correct 15 ms 5980 KB Output is correct
71 Correct 75 ms 23452 KB Output is correct
72 Correct 133 ms 30032 KB Output is correct
73 Correct 17 ms 5720 KB Output is correct
74 Correct 66 ms 15796 KB Output is correct
75 Correct 167 ms 34956 KB Output is correct
76 Correct 12 ms 5632 KB Output is correct
77 Correct 61 ms 14484 KB Output is correct
78 Correct 109 ms 26212 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 7604 KB Output is correct
2 Correct 36 ms 6604 KB Output is correct
3 Correct 13 ms 5720 KB Output is correct
4 Correct 14 ms 5980 KB Output is correct
5 Correct 156 ms 34528 KB Output is correct
6 Correct 152 ms 33292 KB Output is correct
7 Correct 151 ms 33596 KB Output is correct
8 Correct 151 ms 32772 KB Output is correct
9 Correct 157 ms 34604 KB Output is correct
10 Correct 155 ms 33036 KB Output is correct
11 Correct 149 ms 31448 KB Output is correct
12 Correct 124 ms 31656 KB Output is correct
13 Correct 105 ms 15348 KB Output is correct
14 Correct 190 ms 33076 KB Output is correct
15 Correct 153 ms 33068 KB Output is correct
16 Correct 63 ms 15024 KB Output is correct
17 Correct 72 ms 23156 KB Output is correct
18 Correct 153 ms 33364 KB Output is correct
19 Correct 87 ms 23664 KB Output is correct
20 Correct 74 ms 22964 KB Output is correct
21 Correct 147 ms 32444 KB Output is correct
22 Correct 61 ms 14768 KB Output is correct
23 Correct 96 ms 23136 KB Output is correct
24 Correct 155 ms 34612 KB Output is correct
25 Correct 77 ms 23436 KB Output is correct
26 Correct 62 ms 23480 KB Output is correct
27 Correct 142 ms 31360 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8664 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8664 KB Output is correct
4 Correct 6 ms 8884 KB Output is correct
5 Correct 5 ms 8632 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 5 ms 8512 KB Output is correct
9 Correct 4 ms 8120 KB Output is correct
10 Correct 4 ms 6616 KB Output is correct
11 Correct 3 ms 8236 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 4 ms 6616 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 4 ms 6616 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5540 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 63 ms 23172 KB Output is correct
30 Correct 77 ms 22952 KB Output is correct
31 Correct 61 ms 23804 KB Output is correct
32 Correct 64 ms 23988 KB Output is correct
33 Correct 64 ms 15784 KB Output is correct
34 Correct 55 ms 15296 KB Output is correct
35 Correct 72 ms 23468 KB Output is correct
36 Correct 67 ms 23440 KB Output is correct
37 Correct 13 ms 6492 KB Output is correct
38 Correct 64 ms 22848 KB Output is correct
39 Correct 12 ms 5724 KB Output is correct
40 Correct 31 ms 6700 KB Output is correct
41 Correct 67 ms 23468 KB Output is correct
42 Correct 70 ms 23084 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 65 ms 22632 KB Output is correct
45 Correct 66 ms 22880 KB Output is correct
46 Correct 20 ms 6356 KB Output is correct
47 Correct 65 ms 23060 KB Output is correct
48 Correct 61 ms 23244 KB Output is correct
49 Correct 13 ms 5724 KB Output is correct
50 Correct 59 ms 13936 KB Output is correct
51 Correct 58 ms 22200 KB Output is correct
52 Correct 14 ms 5720 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 49 ms 14532 KB Output is correct
55 Correct 52 ms 14524 KB Output is correct
56 Correct 145 ms 34756 KB Output is correct
57 Correct 138 ms 31612 KB Output is correct
58 Correct 142 ms 32560 KB Output is correct
59 Correct 129 ms 29976 KB Output is correct
60 Correct 136 ms 26804 KB Output is correct
61 Correct 135 ms 32372 KB Output is correct
62 Correct 137 ms 28368 KB Output is correct
63 Correct 108 ms 25960 KB Output is correct
64 Correct 55 ms 10192 KB Output is correct
65 Correct 145 ms 31588 KB Output is correct
66 Correct 51 ms 11624 KB Output is correct
67 Correct 49 ms 9220 KB Output is correct
68 Correct 83 ms 23468 KB Output is correct
69 Correct 148 ms 32636 KB Output is correct
70 Correct 15 ms 5980 KB Output is correct
71 Correct 75 ms 23452 KB Output is correct
72 Correct 133 ms 30032 KB Output is correct
73 Correct 17 ms 5720 KB Output is correct
74 Correct 66 ms 15796 KB Output is correct
75 Correct 167 ms 34956 KB Output is correct
76 Correct 12 ms 5632 KB Output is correct
77 Correct 61 ms 14484 KB Output is correct
78 Correct 109 ms 26212 KB Output is correct
79 Correct 42 ms 7604 KB Output is correct
80 Correct 36 ms 6604 KB Output is correct
81 Correct 13 ms 5720 KB Output is correct
82 Correct 14 ms 5980 KB Output is correct
83 Correct 156 ms 34528 KB Output is correct
84 Correct 152 ms 33292 KB Output is correct
85 Correct 151 ms 33596 KB Output is correct
86 Correct 151 ms 32772 KB Output is correct
87 Correct 157 ms 34604 KB Output is correct
88 Correct 155 ms 33036 KB Output is correct
89 Correct 149 ms 31448 KB Output is correct
90 Correct 124 ms 31656 KB Output is correct
91 Correct 105 ms 15348 KB Output is correct
92 Correct 190 ms 33076 KB Output is correct
93 Correct 153 ms 33068 KB Output is correct
94 Correct 63 ms 15024 KB Output is correct
95 Correct 72 ms 23156 KB Output is correct
96 Correct 153 ms 33364 KB Output is correct
97 Correct 87 ms 23664 KB Output is correct
98 Correct 74 ms 22964 KB Output is correct
99 Correct 147 ms 32444 KB Output is correct
100 Correct 61 ms 14768 KB Output is correct
101 Correct 96 ms 23136 KB Output is correct
102 Correct 155 ms 34612 KB Output is correct
103 Correct 77 ms 23436 KB Output is correct
104 Correct 62 ms 23480 KB Output is correct
105 Correct 142 ms 31360 KB Output is correct
106 Correct 36 ms 6364 KB Output is correct
107 Correct 42 ms 8136 KB Output is correct
108 Correct 38 ms 6868 KB Output is correct
109 Correct 42 ms 7628 KB Output is correct
110 Correct 192 ms 35380 KB Output is correct
111 Correct 197 ms 34452 KB Output is correct
112 Correct 175 ms 34368 KB Output is correct
113 Correct 159 ms 33384 KB Output is correct
114 Correct 206 ms 35544 KB Output is correct
115 Correct 177 ms 34212 KB Output is correct
116 Correct 172 ms 50080 KB Output is correct
117 Correct 146 ms 31524 KB Output is correct
118 Correct 113 ms 17336 KB Output is correct
119 Correct 64 ms 11860 KB Output is correct
120 Correct 213 ms 33836 KB Output is correct
121 Correct 73 ms 23476 KB Output is correct
122 Correct 78 ms 23296 KB Output is correct
123 Correct 173 ms 34556 KB Output is correct
124 Correct 69 ms 15544 KB Output is correct
125 Correct 84 ms 23032 KB Output is correct
126 Correct 147 ms 33844 KB Output is correct
127 Correct 75 ms 14816 KB Output is correct
128 Correct 79 ms 23620 KB Output is correct
129 Correct 164 ms 36148 KB Output is correct
130 Correct 76 ms 23232 KB Output is correct
131 Correct 80 ms 23124 KB Output is correct
132 Correct 141 ms 31576 KB Output is correct