# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589674 | LastRonin | Super Dango Maker (JOI22_dango3) | C++17 | 10 ms | 504 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>
#define pb push_back
using namespace std;
mt19937_64 bruh(chrono::steady_clock::now().time_since_epoch().count());
namespace {
int variable_example = 1;
} // namespace
void Solve(int N, int M) {
vector<int> x;
for(int i = 0; i < N; i++) {
for(int j = 0; j < M; j++) {
x.pb(M * i + j + 1);
}
}
int kek = 0;
vector<int> y;
while(kek < M) {
shuffle(x.begin(), x.end(), bruh);
int za = Query(x);
int f = x.size();
vector<int> ans;
if(kek <= 25) {
ans.pb(x.back());
x.pop_back();
for(int j = f - 2; j >= 0; j--) {
int mem = x.back();
x.pop_back();
for(auto u : y) x.pb(u);
int answ = Query(y);
for(auto u : y)x.pop_back();
if(answ == za - 2) y.pb(mem);
else ans.pb(mem);
}
x = y;
y.clear();
}
else {
}
kek++;
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... |