oj.uz

Submission #90253

# Submission time Handle Problem Language Result Execution time Memory
90253 2018-12-21T02:36:28 Z jasony123123 Nizovi (COI14_nizovi) C++11
0 / 100
 24 ms 540 KB 
#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)
				p++;
			rev(i, p);
			rev(i, i + p - j);
			rev(i + p - j + 1, p);
			i = i + p - j + 1;
			j = i + d - 1;
		}
	}
	cout << "end" << endl;

	return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Incorrect
2 Incorrect 2 ms 324 KB Incorrect
3 Incorrect 2 ms 400 KB Incorrect
4 Incorrect 6 ms 484 KB Incorrect
5 Incorrect 3 ms 484 KB Incorrect
6 Incorrect 3 ms 484 KB Incorrect
7 Incorrect 12 ms 484 KB Incorrect
8 Incorrect 24 ms 496 KB Incorrect
9 Incorrect 18 ms 540 KB Incorrect
10 Incorrect 16 ms 540 KB Incorrect