oj.uz

답안 #987913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987913 2024-05-23T19:08:28 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 179 ms 46408 KB 
///OWNERUL LUI ADI <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#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];
int cost[200005];
vector<int>ord;
bool cmp2(int a,int b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
int init[200005];
node special(node curr){long long 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){long long 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=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;}
node godown(node curr){long long 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=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;}
node shift(node curr){long long g;g=ord[curr.layer];curr.lst++;curr.sum=curr.sum+adj[g][curr.lst]-adj[g][curr.lst-1];return curr;}node fixborderandshift(node curr){long long g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=curr.bitipref;curr.bitipref--;curr.sum=curr.sum+adj[g][curr.lst]-adj[g][curr.lst-1];return curr;}
node fixborderandcreate(node curr){long long g;g=ord[curr.layer];curr.rghtbord=curr.lst-1;curr.lst=0;curr.biti++;curr.sum=curr.sum+init[g];return curr;}
signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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:26:35: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   26 | node special(node curr){long long 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;}
      |                                   ^
Main.cpp: In function 'node godown(node)':
Main.cpp:28:34: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   28 | node godown(node curr){long long 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=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];return curr;}
      |                                  ^
Main.cpp: In function 'int main()':
Main.cpp:31:314: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 | signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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:31:534: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 | signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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:31:618: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 | signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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:31:748: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 | signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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:31:182: warning: unused variable 'minim' [-Wunused-variable]
   31 | signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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:31:192: warning: unused variable 'poz' [-Wunused-variable]
   31 | signed  main(){long long  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);}long long imp=0,minim=inf,poz=m;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(long long 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{long long vkuk=adj[i][0];init[i]=adj[i][0];for(long long 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){long long 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 && imp==0){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;}
      |                                                                                                                                                                                                ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6492 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 4 ms 6492 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 6488 KB Output is correct
6 Correct 4 ms 6532 KB Output is correct
7 Correct 5 ms 6488 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 3 ms 6488 KB Output is correct
14 Correct 5 ms 6488 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 5 ms 6452 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 ms 6488 KB Output is correct
21 Correct 3 ms 5980 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 4 ms 6236 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 4 ms 6492 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 5 ms 6492 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 23808 KB Output is correct
2 Correct 76 ms 25772 KB Output is correct
3 Correct 65 ms 23744 KB Output is correct
4 Correct 63 ms 23784 KB Output is correct
5 Correct 55 ms 15820 KB Output is correct
6 Correct 54 ms 15292 KB Output is correct
7 Correct 63 ms 23484 KB Output is correct
8 Correct 59 ms 23524 KB Output is correct
9 Correct 12 ms 8536 KB Output is correct
10 Correct 64 ms 23712 KB Output is correct
11 Correct 15 ms 6492 KB Output is correct
12 Correct 27 ms 7712 KB Output is correct
13 Correct 72 ms 23724 KB Output is correct
14 Correct 65 ms 23976 KB Output is correct
15 Correct 14 ms 6748 KB Output is correct
16 Correct 66 ms 23472 KB Output is correct
17 Correct 72 ms 23724 KB Output is correct
18 Correct 20 ms 7132 KB Output is correct
19 Correct 66 ms 23728 KB Output is correct
20 Correct 72 ms 24168 KB Output is correct
21 Correct 14 ms 6764 KB Output is correct
22 Correct 59 ms 15080 KB Output is correct
23 Correct 59 ms 23212 KB Output is correct
24 Correct 13 ms 6488 KB Output is correct
25 Correct 13 ms 6492 KB Output is correct
26 Correct 51 ms 15528 KB Output is correct
27 Correct 59 ms 15664 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6492 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 4 ms 6492 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 6488 KB Output is correct
6 Correct 4 ms 6532 KB Output is correct
7 Correct 5 ms 6488 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 3 ms 6488 KB Output is correct
14 Correct 5 ms 6488 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 5 ms 6452 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 ms 6488 KB Output is correct
21 Correct 3 ms 5980 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 4 ms 6236 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 4 ms 6492 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 5 ms 6492 KB Output is correct
29 Correct 64 ms 23808 KB Output is correct
30 Correct 76 ms 25772 KB Output is correct
31 Correct 65 ms 23744 KB Output is correct
32 Correct 63 ms 23784 KB Output is correct
33 Correct 55 ms 15820 KB Output is correct
34 Correct 54 ms 15292 KB Output is correct
35 Correct 63 ms 23484 KB Output is correct
36 Correct 59 ms 23524 KB Output is correct
37 Correct 12 ms 8536 KB Output is correct
38 Correct 64 ms 23712 KB Output is correct
39 Correct 15 ms 6492 KB Output is correct
40 Correct 27 ms 7712 KB Output is correct
41 Correct 72 ms 23724 KB Output is correct
42 Correct 65 ms 23976 KB Output is correct
43 Correct 14 ms 6748 KB Output is correct
44 Correct 66 ms 23472 KB Output is correct
45 Correct 72 ms 23724 KB Output is correct
46 Correct 20 ms 7132 KB Output is correct
47 Correct 66 ms 23728 KB Output is correct
48 Correct 72 ms 24168 KB Output is correct
49 Correct 14 ms 6764 KB Output is correct
50 Correct 59 ms 15080 KB Output is correct
51 Correct 59 ms 23212 KB Output is correct
52 Correct 13 ms 6488 KB Output is correct
53 Correct 13 ms 6492 KB Output is correct
54 Correct 51 ms 15528 KB Output is correct
55 Correct 59 ms 15664 KB Output is correct
56 Correct 136 ms 31276 KB Output is correct
57 Correct 135 ms 30012 KB Output is correct
58 Correct 149 ms 29788 KB Output is correct
59 Correct 120 ms 27572 KB Output is correct
60 Correct 132 ms 23516 KB Output is correct
61 Correct 156 ms 31040 KB Output is correct
62 Correct 120 ms 26388 KB Output is correct
63 Correct 110 ms 24444 KB Output is correct
64 Correct 53 ms 8908 KB Output is correct
65 Correct 130 ms 28876 KB Output is correct
66 Correct 51 ms 9356 KB Output is correct
67 Correct 50 ms 10188 KB Output is correct
68 Correct 77 ms 24432 KB Output is correct
69 Correct 141 ms 29572 KB Output is correct
70 Correct 14 ms 7004 KB Output is correct
71 Correct 84 ms 24728 KB Output is correct
72 Correct 136 ms 27700 KB Output is correct
73 Correct 12 ms 6748 KB Output is correct
74 Correct 68 ms 16824 KB Output is correct
75 Correct 141 ms 31740 KB Output is correct
76 Correct 12 ms 6492 KB Output is correct
77 Correct 61 ms 15308 KB Output is correct
78 Correct 105 ms 26804 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 9064 KB Output is correct
2 Correct 37 ms 7404 KB Output is correct
3 Correct 13 ms 6748 KB Output is correct
4 Correct 13 ms 6748 KB Output is correct
5 Correct 168 ms 30560 KB Output is correct
6 Correct 161 ms 29276 KB Output is correct
7 Correct 152 ms 29908 KB Output is correct
8 Correct 138 ms 28940 KB Output is correct
9 Correct 148 ms 30844 KB Output is correct
10 Correct 143 ms 29232 KB Output is correct
11 Correct 136 ms 27784 KB Output is correct
12 Correct 119 ms 27824 KB Output is correct
13 Correct 99 ms 11680 KB Output is correct
14 Correct 144 ms 29240 KB Output is correct
15 Correct 147 ms 29484 KB Output is correct
16 Correct 60 ms 15796 KB Output is correct
17 Correct 75 ms 26032 KB Output is correct
18 Correct 152 ms 29688 KB Output is correct
19 Correct 66 ms 24244 KB Output is correct
20 Correct 72 ms 25788 KB Output is correct
21 Correct 152 ms 28716 KB Output is correct
22 Correct 61 ms 15800 KB Output is correct
23 Correct 71 ms 24224 KB Output is correct
24 Correct 149 ms 30780 KB Output is correct
25 Correct 66 ms 24240 KB Output is correct
26 Correct 62 ms 24328 KB Output is correct
27 Correct 127 ms 27496 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6492 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 4 ms 6492 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 6488 KB Output is correct
6 Correct 4 ms 6532 KB Output is correct
7 Correct 5 ms 6488 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 3 ms 6488 KB Output is correct
14 Correct 5 ms 6488 KB Output is correct
15 Correct 3 ms 6236 KB Output is correct
16 Correct 5 ms 6452 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 ms 6488 KB Output is correct
21 Correct 3 ms 5980 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 4 ms 6236 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 4 ms 6492 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 5 ms 6492 KB Output is correct
29 Correct 64 ms 23808 KB Output is correct
30 Correct 76 ms 25772 KB Output is correct
31 Correct 65 ms 23744 KB Output is correct
32 Correct 63 ms 23784 KB Output is correct
33 Correct 55 ms 15820 KB Output is correct
34 Correct 54 ms 15292 KB Output is correct
35 Correct 63 ms 23484 KB Output is correct
36 Correct 59 ms 23524 KB Output is correct
37 Correct 12 ms 8536 KB Output is correct
38 Correct 64 ms 23712 KB Output is correct
39 Correct 15 ms 6492 KB Output is correct
40 Correct 27 ms 7712 KB Output is correct
41 Correct 72 ms 23724 KB Output is correct
42 Correct 65 ms 23976 KB Output is correct
43 Correct 14 ms 6748 KB Output is correct
44 Correct 66 ms 23472 KB Output is correct
45 Correct 72 ms 23724 KB Output is correct
46 Correct 20 ms 7132 KB Output is correct
47 Correct 66 ms 23728 KB Output is correct
48 Correct 72 ms 24168 KB Output is correct
49 Correct 14 ms 6764 KB Output is correct
50 Correct 59 ms 15080 KB Output is correct
51 Correct 59 ms 23212 KB Output is correct
52 Correct 13 ms 6488 KB Output is correct
53 Correct 13 ms 6492 KB Output is correct
54 Correct 51 ms 15528 KB Output is correct
55 Correct 59 ms 15664 KB Output is correct
56 Correct 136 ms 31276 KB Output is correct
57 Correct 135 ms 30012 KB Output is correct
58 Correct 149 ms 29788 KB Output is correct
59 Correct 120 ms 27572 KB Output is correct
60 Correct 132 ms 23516 KB Output is correct
61 Correct 156 ms 31040 KB Output is correct
62 Correct 120 ms 26388 KB Output is correct
63 Correct 110 ms 24444 KB Output is correct
64 Correct 53 ms 8908 KB Output is correct
65 Correct 130 ms 28876 KB Output is correct
66 Correct 51 ms 9356 KB Output is correct
67 Correct 50 ms 10188 KB Output is correct
68 Correct 77 ms 24432 KB Output is correct
69 Correct 141 ms 29572 KB Output is correct
70 Correct 14 ms 7004 KB Output is correct
71 Correct 84 ms 24728 KB Output is correct
72 Correct 136 ms 27700 KB Output is correct
73 Correct 12 ms 6748 KB Output is correct
74 Correct 68 ms 16824 KB Output is correct
75 Correct 141 ms 31740 KB Output is correct
76 Correct 12 ms 6492 KB Output is correct
77 Correct 61 ms 15308 KB Output is correct
78 Correct 105 ms 26804 KB Output is correct
79 Correct 44 ms 9064 KB Output is correct
80 Correct 37 ms 7404 KB Output is correct
81 Correct 13 ms 6748 KB Output is correct
82 Correct 13 ms 6748 KB Output is correct
83 Correct 168 ms 30560 KB Output is correct
84 Correct 161 ms 29276 KB Output is correct
85 Correct 152 ms 29908 KB Output is correct
86 Correct 138 ms 28940 KB Output is correct
87 Correct 148 ms 30844 KB Output is correct
88 Correct 143 ms 29232 KB Output is correct
89 Correct 136 ms 27784 KB Output is correct
90 Correct 119 ms 27824 KB Output is correct
91 Correct 99 ms 11680 KB Output is correct
92 Correct 144 ms 29240 KB Output is correct
93 Correct 147 ms 29484 KB Output is correct
94 Correct 60 ms 15796 KB Output is correct
95 Correct 75 ms 26032 KB Output is correct
96 Correct 152 ms 29688 KB Output is correct
97 Correct 66 ms 24244 KB Output is correct
98 Correct 72 ms 25788 KB Output is correct
99 Correct 152 ms 28716 KB Output is correct
100 Correct 61 ms 15800 KB Output is correct
101 Correct 71 ms 24224 KB Output is correct
102 Correct 149 ms 30780 KB Output is correct
103 Correct 66 ms 24240 KB Output is correct
104 Correct 62 ms 24328 KB Output is correct
105 Correct 127 ms 27496 KB Output is correct
106 Correct 36 ms 7132 KB Output is correct
107 Correct 43 ms 8844 KB Output is correct
108 Correct 38 ms 7760 KB Output is correct
109 Correct 41 ms 8656 KB Output is correct
110 Correct 156 ms 31544 KB Output is correct
111 Correct 163 ms 30752 KB Output is correct
112 Correct 157 ms 30640 KB Output is correct
113 Correct 153 ms 29600 KB Output is correct
114 Correct 162 ms 31896 KB Output is correct
115 Correct 163 ms 30272 KB Output is correct
116 Correct 179 ms 46408 KB Output is correct
117 Correct 139 ms 27684 KB Output is correct
118 Correct 111 ms 13532 KB Output is correct
119 Correct 59 ms 9448 KB Output is correct
120 Correct 164 ms 29952 KB Output is correct
121 Correct 71 ms 24464 KB Output is correct
122 Correct 81 ms 24244 KB Output is correct
123 Correct 170 ms 30520 KB Output is correct
124 Correct 64 ms 16324 KB Output is correct
125 Correct 82 ms 26204 KB Output is correct
126 Correct 147 ms 29960 KB Output is correct
127 Correct 60 ms 15568 KB Output is correct
128 Correct 75 ms 24752 KB Output is correct
129 Correct 153 ms 32240 KB Output is correct
130 Correct 73 ms 24240 KB Output is correct
131 Correct 78 ms 24252 KB Output is correct
132 Correct 139 ms 27752 KB Output is correct