Submission #954334

#TimeUsernameProblemLanguageResultExecution timeMemory
954334LCJLYSuper Dango Maker (JOI22_dango3)C++17
100 / 100
3987 ms6836 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; //code #define show(x,y) cout << y << " " << #x << endl; #define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl; #define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl; #define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl; typedef pair<int,int>pii; typedef pair<pii,pii>pi2; //Query() Answer() //code #define show(x,y) cout << y << " " << #x << endl; #define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl; #define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl; #define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl; typedef pair<int,int>pii; typedef pair<pii,pii>pi2; //Query() Answer() void Solve(int n, int m) { vector<int>arr[m]; arr[0].push_back(1); vector<int>v; for(int x=n*m;x>=2;x--){ v.push_back(x); } int ptr=1; unordered_set<int>se[m+10]; se[0].insert(1); for(int x=0;x<=m;x++){ se[x].insert(1); } for(int x=2;x<=n*m;x++){ int l=0; int r=ptr; int mid; int best=r; while(l<=r){ mid=(l+r)/2; vector<int>que; for(int i=1;i<=n*m;i++){ if(i==x) continue; if(se[mid].find(i)!=se[mid].end()) continue; que.push_back(i); } int hold=Query(que); if(hold==m-mid-1){ best=mid; r=mid-1; } else l=mid+1; } ptr=max(ptr,best+1); //show(ptr,ptr); arr[best].push_back(x); for(int y=best;y<=m;y++){ se[y].insert(x); } } for(int x=0;x<m;x++){ Answer(arr[x]); } } //code
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...