# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257271 | shrek12357 | Carnival (CEOI14_carnival) | C++14 | 8 ms | 256 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;
int n;
int main() {
cin >> n;
vector<int> cur;
cur.push_back(1);
vector<int> place;
vector<int> ans(n + 1);
ans[1] = 1;
for (int i = 1; i < n; i++) {
cout << cur.size() + 1 << " ";
for (int i = 0; i < cur.size(); i++) {
cout << cur[i] << " ";
}
cout << i + 1 << endl;
int temp;
cin >> temp;
if (temp == cur.size() + 1) {
cur.push_back(i + 1);
ans[i + 1] = i + 1;
}
else {
place.push_back(i + 1);
}
}
for (int i = 0; i < place.size(); i++) {
int lo = 0;
int hi = cur.size() - 1;
while (lo < hi) {
int mid = (lo + hi) / 2;
cout << mid - lo + 2 << " ";
for (int j = lo; j <= mid; j++) {
cout << cur[j] << " ";
}
cout << place[i] << endl;
int temp;
cin >> temp;
if (temp == mid - lo + 2) {
lo = mid + 1;
}
else {
hi = mid;
}
}
ans[place[i]] = cur[lo];
}
cout << 0 << " ";
for (int i = 1; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
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... |