# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915736 | IBory | Super Dango Maker (JOI22_dango3) | C++17 | 394 ms | 852 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 <random>
using namespace std;
const int MAX = 10004;
int V[MAX];
void Solve(int N, int M) {
random_device rd;
vector<int> P;
for (int i = 1; i <= N * M; ++i) P.push_back(i);
shuffle(P.begin(), P.end(), rd);
for (int t = 1; t <= M; ++t) {
vector<int> G, T;
for (int i = 0; i < N * M; ++i) {
if (V[P[i]]) continue;
G.push_back(P[i]);
}
if (G.size() == N) {
Answer(G);
return;
}
T.push_back(G.back()); G.pop_back();
int idx = 0;
while (T.size() < N) {
swap(G[idx], G[G.size() - 1]);
int n = G.back(); G.pop_back();
if (Query(G) == M - t) T.push_back(n);
else {
G.push_back(n);
swap(G[idx], G[G.size() - 1]);
idx++;
}
}
Answer(T);
for (int n : T) V[n] = 1;
}
}
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... |