Submission #1249210

#TimeUsernameProblemLanguageResultExecution timeMemory
1249210LIAChameleon's Love (JOI20_chameleon)C++17
0 / 100
0 ms416 KiB
#include "chameleon.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; #define ll int #define vll vector<ll> namespace { int variable_example = 1; } // namespace void Solve(int n) { vll p(2); vll found(2 * n); for (ll i = 0; i < 2 * n; ++i) { for (ll j = 0 ; j < 2 * n; ++j) { if (found[i]) continue; p[0] = i + 1, p[1] = j + 1; if (Query(p) == 1) { found[i] = found[j] = 1; Answer(i + 1, j + 1); } } } }
#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...