# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722360 | FatihSolak | Library (JOI18_library) | C++17 | 312 ms | 436 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 <bits/stdc++.h>
#include "library.h"
using namespace std;
void Solve(int N){
if(N == 1){
Answer({1});
return;
}
vector<int> M(N);
int tot = 0;
auto ask = [&](vector<int> &v){
if(tot++ > 20000){
Answer({});
exit(0);
}
fill(M.begin(),M.end(),0);
for(auto u:v){
M[u] = 1;
}
return Query(M);
};
auto ok = [&](vector<int> v,int x)->bool{
if(v.empty())
return false;
int tmp = ask(v);
v.push_back(x);
return ask(v) <= tmp;
};
vector<int> adj[N];
vector<bool> used(N);
queue<int> q;
used[0] = 1;
q.push(0);
q.push(0);
while(q.size()){
int tp = q.front();
q.pop();
vector<int> v;
for(int i = 0;i<N;i++){
if(!used[i])
v.push_back(i);
}
if(!ok(v,tp))continue;
while(v.size() > 1){
vector<int> a;
while(a.size() < v.size()){
a.push_back(v.back());
v.pop_back();
}
if(!ok(v,tp)){
v = a;
}
}
if(!ok(v,tp))continue;
q.push(v[0]);
used[v[0]] = 1;
adj[tp].push_back(v[0]);
adj[v[0]].push_back(tp);
}
vector<int> res;
for(int i = 0;i<N;i++){
if(adj[i].size() == 1){
int now = i;
while(1){
int tmp = -1;
if(res.size())
tmp = res.back();
res.push_back(now);
if(res.size() == N)
break;
for(auto u:adj[now]){
if(u != tmp){
now = u;
break;
}
}
}
break;
}
}
for(auto &u:res)
u++;
Answer(res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |