# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
945013 | siewjh | Chameleon's Love (JOI20_chameleon) | C++17 | 7 ms | 596 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 "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
} // namespace
void Solve(int N) {
set<int> unp;
unp.insert(1);
for (int i = 2; i <= 2 * N; i++){
vector<int> vec;
for (int x : unp) vec.push_back(x);
vec.push_back(i);
int amt = Query(vec);
vec.pop_back();
if (amt == unp.size()){
int sz = vec.size(), l = 0, r = sz - 1;
while (l < r){
int m = (l + r) >> 1;
vector<int> qvec;
for (int j = l; j <= m; j++) qvec.push_back(vec[j]);
qvec.push_back(i);
if (Query(qvec) == qvec.size()) l = m + 1;
else r = m;
}
Answer(i, vec[r]);
unp.erase(vec[r]);
}
else unp.insert(i);
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |