Submission #1216265

#TimeUsernameProblemLanguageResultExecution timeMemory
1216265PenguinsAreCuteSuper Dango Maker (JOI22_dango3)C++17
7 / 100
206 ms568 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; void Solve(int N, int M) { vector<bool> used(N * M, 0); for(int i=0;i<M;i++) { vector<int> cur(N, -1); for(int j=0;j<N;j++) { int l = 0, h = N * M; while(h - l > 1) { int m = (l + h) / 2; vector<int> qry; for(int k=0;k<m;k++) if(!used[k]) qry.push_back(k+1); for(auto k: cur) if(k-1 >= m) qry.push_back(k); if(Query(qry)) h = m; else l = m; } cur[j] = l+1; } Answer(cur); for(auto j: cur) used[j-1] = 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...