Submission #1167533

#TimeUsernameProblemLanguageResultExecution timeMemory
1167533kunzaZa183카멜레온의 사랑 (JOI20_chameleon)C++20
4 / 100
6 ms432 KiB
#include "chameleon.h" #include <bits/stdc++.h> using namespace std; void Solve(int N) { N *= 2; vector<pair<int, int>> spii; vector<int> cur(1, 1); for (int i = 2; i <= N; i++) { cur.push_back(i); int x = Query(cur); if (x == cur.size()) { continue; } int l = 0, r = cur.size() - 2; while (l < r) { int mid = (l + r) / 2; vector<int> vi; vi.push_back(cur.back()); for (int j = l; j <= mid; j++) { vi.push_back(cur[j]); } x = Query(vi); if (x == vi.size() - 1) { r = mid; } else { l = mid + 1; } } Answer(cur.back(), cur[l]); cur.pop_back(); cur.erase(cur.begin() + l); } }
#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...