# | TimeUTC-0 | 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);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |