# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971684 | 12345678 | Super Dango Maker (JOI22_dango3) | C++17 | 1731 ms | 624 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;
const int nx=1e4+5;
int used[nx], n, m;
int query()
{
vector<int> qrs;
for (int i=1; i<=n*m; i++) if (!used[i]) qrs.push_back(i);
return Query(qrs);
}
void Solve(int N, int M) {
n=N, m=M;
for (int i=M; i>=1; i--)
{
vector<int> res;
for (int j=1; j<=N*M; j++)
{
if (res.size()==N) break;
if (used[j]) continue;
used[j]=1;
if (query()==i-1) res.push_back(j);
else used[j]=0;
}
Answer(res);
}
}
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... |