Submission #1167477

#TimeUsernameProblemLanguageResultExecution timeMemory
1167477sleepntsheepChameleon's Love (JOI20_chameleon)C++20
0 / 100
0 ms400 KiB
#include "chameleon.h" #include <vector> namespace { } // namespace void Solve(int N) { for (int i = 1; i <= N; ++i) { int lower = N, upper = N + N + 1; while (upper - lower > 1) { std::vector<int> v = { i }; int mid = lower + (upper - lower) / 2; for (int j = N + 1; j <= mid; ++j) v.push_back(j); if (Query(v) < v.size()) upper = mid; else lower = mid; } Answer(i, upper); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...