| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 995620 | onbert | Super Dango Maker (JOI22_dango3) | C++17 | 275 ms | 944 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>
using namespace std;
#define int long long
void Solve(int32_t n, int32_t m) {
vector<pair<int, vector<int32_t>>> v = {{m, {}}};
for (int i=1;i<=n*m;i++) v[0].second.push_back(i);
for (int i=0;i<v.size();i++) {
auto [sz, a] = v[i];
if (sz==1) {
// cout << "ANS\n";
// for (int j:a) cout << j << " "; cout << endl;
Answer(a);
continue;
}
int mid = sz/2;
v.push_back({(sz+1)/2, {}});
vector<int32_t> A = a;
for (int j:a) {
A.erase(find(A.begin(), A.end(), j));
if (Query(A) >= mid) v.back().second.push_back(j);
else A.push_back(j);
}
v.push_back({mid, A});
}
}
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... | ||||
