#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT
// freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
/* online submission */
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
/****************************************************************/
int cmp(int x, int y) {
x++, y++;
cout << "cmp " << x << " " << y << endl;
int res;
cin >> res;
return res;
}
void rev(int i, int j) {
if (i == j) return;
i++, j++;
cout << "reverse " << i << " " << j << endl;
}
int main() {
io();
int na, nb;
cin >> na >> nb;
int i = 0, j = na;
while (i < j && j < na + nb) {
if (cmp(j, i) >= 0)
i++;
else {
int d = j - i;
int p = j;
//while (p + 1 < na + nb && cmp(i, p + 1) > 0) // find last p st C[i]>C[p]
// p++;
if (cmp(i, na + nb - 1) > 0) {//C[i] > C[na + nb])
p = na + nb - 1;
}
else { // find 1st val p* st C[i]<=C[p] // array: 0 0 0 0 1 1 1
int lo = j;
int hi = na + nb - 1;
while (lo<hi) {
int mid = (hi + lo) / 2;
if ((cmp(mid, i) >= 0) == false) { // C[i]<=C[mid]
lo = mid + 1;
}
else {
hi = mid;
}
}
p = lo - 1;
}
rev(i, p);
rev(i, i + p - j);
rev(i + p - j + 1, p);
i = i + p - j + 1;
j = i + d;
}
}
cout << "end" << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
324 KB |
Output is correct |
| 3 |
Correct |
4 ms |
528 KB |
Output is correct |
| 4 |
Correct |
32 ms |
576 KB |
Output is correct |
| 5 |
Correct |
27 ms |
576 KB |
Output is correct |
| 6 |
Correct |
35 ms |
652 KB |
Output is correct |
| 7 |
Correct |
96 ms |
652 KB |
Output is correct |
| 8 |
Correct |
157 ms |
652 KB |
Output is correct |
| 9 |
Correct |
173 ms |
652 KB |
Output is correct |
| 10 |
Correct |
177 ms |
652 KB |
Output is correct |
