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<bits/stdc++.h>
#include "dango3.h"
using namespace std;
vector<int> ans, v2, x;
void Solve(int n, int m) {
for (int i = n * m; i >= 1; i--) x.push_back(i);
v2 = x;
while(!x.empty()) {
int cur = x.back();
x.pop_back();
v2 = x;
for (int i: ans) v2.push_back(i);
if(Query(v2) == 0) {
ans.push_back(cur);
}
}
Answer(ans);
}
# | 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... |