# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951666 | pcc | Super Dango Maker (JOI22_dango3) | C++17 | 187 ms | 856 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>
using namespace std;
namespace {
const int mxn = 1e5+10;
vector<int> perm;
bitset<mxn> done;
int ask(vector<int> vv){
for(auto &i:vv)i = perm[i];
//cerr<<"ASK:";for(auto &i:vv)cerr<<i<<' ';cerr<<endl;
return Query(vv);
}
} // namespace
/*
std::vector<int> x(3);
x[0] = 1;
x[1] = 2;
x[2] = 3;
variable_example = Query(x);
for (int i = 0; i < M; i++) {
std::vector<int> a(N);
for (int j = 0; j < N; j++) {
a[j] = N * i + j + 1;
}
Answer(a);
}
*/
void Solve(int N, int M) {
for(int i = 0;i<=N*M;i++)perm.push_back(i);
mt19937 seed(7124);
shuffle(perm.begin()+1,perm.end(),seed);
vector<int> v,v2;
for(int i = 1;i<=M;i++){
v = v2;
v2.clear();
for(int j = 1;j<=N*M;j++){
if(done[j]||find(v.begin(),v.end(),j) != v.end())continue;
v.push_back(j);
if(v.size()<N)continue;
if(ask(v) != 0)break;
}
while(v.size()>N){
auto tmp = v.back();
v.pop_back();
if(ask(v) == 0)v.insert(v.begin(),tmp);
else v2.push_back(tmp);
//for(auto &j:v)cerr<<j<<' ';cerr<<endl;
}
for(auto &j:v)done[j] = true;
//cerr<<"ANS:";for(auto &j:v)cerr<<j<<' ';cerr<<endl;
for(auto &j:v)j = perm[j];
Answer(v);
}
return;
}
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... |