# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706230 | vjudge1 | Nizovi (COI14_nizovi) | C++17 | 831 ms | 328 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 <bits/stdc++.h>
// #define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
typedef long long ll;
using namespace std;
const int N = 2e5 + 10;
int n, m;
signed main() {
FAST;
cin >> n >> m;
int idx = n + 1;
int left = n + 1, right = m + n;
while(idx--) {
if(idx == 0) {
cout << "end" << endl;
return 0;
}
int l = left, r = right;
while(l < r) {
int mid = (l + r) / 2;
cout << "cmp " << idx << ' ' << mid << endl;
int x; cin >> x;
if(x == 1) l = mid;
else r = mid - 1;
}
cout << "cmp " << idx << ' ' << l << endl;
int x; cin >> x;
if(x == 1) {
for(int i = idx; i < l; i++) cout << "reverse " << i << ' ' << i + 1 << endl;
right = l - 1;
left = idx;
}
else {
for(int i = idx; i < l - 1; i++) cout << "reverse " << i << ' ' << i + 1 << endl;
right = l - 2;
left = idx;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |