This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// i hope this works
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
} // namespace
random_device rd;
mt19937 g(rd());
void Solve(int N, int M) {
vector<int> p;
for (int i = 1; i <= N * M; i++) p.push_back(i);
shuffle(p.begin(), p.end(), g);
vector<int> sus(N * M + 1, 0);
for (int it = 1; it <= M; it++) {
vector<int> amogus;
for (int ii = 1; ii <= N * M; ii++) {
int i = p[ii - 1];
if (sus[i]) continue;
amogus.push_back(i);
sus[i] = 1;
vector<int> alice;
for (int j = 1; j <= N * M; j++) if (sus[j] != 1) alice.push_back(j);
if (Query(alice) < M - 1) {
amogus.pop_back();
sus[i] = 0;
}
}
Answer(amogus);
for (auto& baby : amogus) sus[baby] = 2;
}
}
# | 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... |