# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90604 | Milki | Nizovi (COI14_nizovi) | C++14 | 161 ms | 552 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>
using namespace std;
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
typedef long long ll;
typedef pair<int, int> point;
int a, b;
int cmp(int x, int y){
cout << "cmp" _ x _ y << endl;
fflush(stdout);
int ret; cin >> ret;
return ret;
}
void rev(int x, int y){
if(x == y) return;
cout << "reverse" _ x _ y << endl;
fflush(stdout);
}
int main(){
cin >> a >> b;
int start = 1, end = a + b, len = a;
REP(i, a){
int lo = start + len, hi = end;
if(lo >= hi) continue;
while(lo < hi){
int mid = (lo + hi + 1) >> 1;
int ans = cmp(start, mid);
if(ans <= 0)
hi = mid - 1;
else
lo = mid;
}
if(start >= lo){
assert(a == 0);
start ++; len --;
continue;
}
rev(start, lo);
rev(lo - len + 1, lo);
rev(start, lo - len);
len --; start = lo - len + 1;
}
cout << "end";
fflush(stdout);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |