# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
904928 | nguyentunglam | Super Dango Maker (JOI22_dango3) | C++17 | 361 ms | 684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dango3.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
mt19937 rng(1);
void Solve(int n, int m) {
vector<int> p;
for(int i = 1; i <= n * m; i++) p.push_back(i);
for(int group = 1; group <= m; group++) {
// shuffle(p.begin(), p.end(), rng);
int l = n, r = p.size(), last = 0;
while (l <= r) {
int mid = l + r >> 1;
vector<int> tmp;
for(int i = 0; i < mid; i++) tmp.push_back(p[i]);
if (Query(tmp)) {
r = mid - 1;
last = mid;
} else l = mid + 1;
}
assert(last);
vector<int> _p, ans;
for(int i = last; i < p.size(); i++) _p.push_back(p[i]);
for(int i = 0; i < last; i++) ans.push_back(p[i]);
for(int i = 0; i < last; i++) {
vector<int> _ans;
for(int &j : ans) if (j != p[i]) _ans.push_back(j);
if (Query(_ans)) {
ans = _ans;
_p.push_back(p[i]);
}
}
p = _p;
Answer(ans);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |