Submission #1060506

#	Time	Username	Problem	Language	Result	Execution time	Memory
1060506		Halym2007	Aliens (IOI07_aliens)	C++17	20 / 100	2 ms	440 KiB

aliens

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <ll, ll>
const int N = 2e5 + 5;


ll n, sorag = 0;
ll m = 1;
bool ask (ll jj, ll kk) {
//	if (jj > n or kk > n) return 0;
//	if (jj < 1 or kk < 1) return 0;
	sorag++;
//	assert (sorag <= 300 and m <= 100);
	cout << "examine " << jj << " " << kk << endl;
	string s;
	cin >> s;
	if (s[0] == 't') return 1;
	return 0;
}


int main () {
//	freopen ("input.txt", "r", stdin);
//	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);	
	ll a, b;
	cin >> n >> a >> b;
	ll l = a, r = a;
	while (l > 1) {
		if (!ask(l - 1, b)) {
			break;
		}
		l--;
		m++;
	}
	while (r < n) {
		if (!ask(r + 1, b)) break;
		r++;
		m++;
	}

	ll l1 = b, r1 = b;
	while (l1 > 1) {
		if (!ask(a, l1 - 1)) {
			break;
		}
		l1--;
	}
	while (r1 < n) {
		if (!ask(a, r1 + 1)) break;
		r1++;
	}	
//	return 0;
	ll x = l, y = r1;
	while (x > m) {
		if (!ask(x - m, y)) break;
		x -= m;
	}
	if (x > m and y + m <= n) {
		if (ask(x - m, y + m)) {
			x -= m;
			y += m;
		}
	}
	while (y + 2 * m <= n) {
		if (!ask (x, y + 2LL * m)) {
			break;
		}
		y += 2*m;
	}
	
	ll jog1 = (x + 2 * m) + (m / 2LL), jog2 = (y - (2LL * m)) - (m / 2);
	cout << "solution " << jog1 << " " << jog2;
	
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10