# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
772270 | raysh07 | Super Dango Maker (JOI22_dango3) | C++17 | 1829 ms | 696 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;
namespace {
int variable_example = 1;
} // namespace
void Solve(int n, int m) {
// std::vector<int> x(3);
// x[0] = 1;
// x[1] = 2;
// x[2] = 3;
// variable_example = Query(x);
// for (int i = 0; i < M; i++) {
// std::vector<int> a(N);
// for (int j = 0; j < N; j++) {
// a[j] = N * i + j + 1;
// }
// Answer(a);
// }
vector <vector <int>> ans(m);
vector <int> a(n * m);
for (int i = 1; i <= n * m; i++){
int l = 0, r = m - 1;
while (l != r){
int mid = (l + r)/2;
for (auto &x : a) x = 1;
for (int i = mid + 1; i < m; i++){
for (auto x : ans[i]) a[x - 1] = 0;
}
a[i - 1] = 0;
vector <int> qry;
for (int i = 0; i < n * m; i++) if (a[i]) qry.push_back(i + 1);
int get = Query(qry);
// cout << get << " " << mid << "\n";
if (get >= mid + 1) l = mid + 1;
else r = mid;
}
ans[l].push_back(i);
// cout << l << "\n";
}
for (int i = 0; i < m; i++) Answer(ans[i]);
}
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... |