oj.uz

Submission #1067918

# Submission time Handle Problem Language Result Execution time Memory
1067918 2024-08-21T05:32:44 Z Muhammet Aliens (IOI07_aliens) C++17
100 / 100
 2 ms 420 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

int n, a, b;

map <int,bool> vis;

signed main(){
	cin >> n >> a >> b;

	int x = a, y = b;
	while(1){
		int l = 1, r = y, k = 0;
		bool tr = 0;
		string s1;
		if(tr == 0){
			tr = 1;
			cout << "examine " << x << " " << l << '\n';
			cin >> s1;
			if(s1 == "true"){
				y = l;
				break;
			}
		}
		vis.clear();
		while(l < r-1){
			int md = (l + r) / 2;
			cout << "examine " << x << " " << md << '\n';
			string s;
			cin >> s;
			if(s == "true"){
				r = md;
			}
			else {
				l = md;
			}
			if(vis[md] == 1) break;
			vis[md] = 1;
		}
		cout << "examine " << x << " " << l << '\n';
		cin >> s1;
		if(s1 == "true") k = l;
		else k = r;
		if(k == y) break;
		y = k;
	}
	while(1){
		int l = 1, r = x, k = 0;
		bool tr = 0;
		string s1;
		if(tr == 0){
			tr = 1;
			cout << "examine " << l << " " << y << '\n';
			cin >> s1;
			if(s1 == "true"){
				x = l;
				break;
			}
		}
		vis.clear();
		while(l < r-1){
			int md = (l + r) / 2;
			cout << "examine " << md << " " << y << '\n';
			string s;
			cin >> s;
			if(s == "true"){
				r = md;
			}
			else {
				l = md;
			}
			if(vis[md] == 1) break;
			vis[md] = 1;
		}
		cout << "examine " << l << " " << y << '\n';
		cin >> s1;
		if(s1 == "true") k = l;
		else k = r;
		if(k == x) break;
		x = k;
	}
	if(x > 1 and y > 1){
		cout << "examine " << x-1 << " " << y-1 << '\n';
		string s2;
		cin >> s2;
		if(s2 == "true"){
			x--, y--;
			int l = 1, r = y, k = 0;
			while(l <= r){
				int md = (l + r) / 2;
				cout << "examine " << x << " " << md << '\n';
				cin >> s2;
				if(s2 == "true"){
					r = md-1;
					k = md;
				}
				else {
					l = md+1;
				}
			}
			y = k;
			l = 1, r = x;
			while(l <= r){
				int md = (l + r) / 2;
				cout << "examine " << md << " " << y << '\n';
				cin >> s2;
				if(s2 == "true"){
					r = md-1;
					k = md;
				}
				else {
					l = md+1;
				}
			}
			x = k;
		}
	}
	int y1 = y;
	while(1){
		int l = y, r = n, k = 0;
		bool tr = 0;
		string s1;
		if(tr == 0){
			tr = 1;
			cout << "examine " << x << " " << r << '\n';
			cin >> s1;
			if(s1 == "true"){
				y = r;
				break;
			}
		}
		vis.clear();
		while(l < r-1){
			int md = (l + r) / 2;
			cout << "examine " << x << " " << md << '\n';
			string s;
			cin >> s;
			if(s == "true"){
				l = md;
			}
			else {
				r = md;
			}
			if(vis[md] == 1) break;
			vis[md] = 1;
		}
		cout << "examine " << x << " " << r << '\n';
		cin >> s1;
		if(s1 == "true") k = r;
		else k = l;
		if(k == y) break;
		y = k;
	}

	int m = abs(y1-y)+1;
	m /= 5;
	swap(y,y1);
	x += m*2;
	y += m*2;
	x += m/2;
	y += m/2;
	cout << "solution " << x << ' ' << y;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 420 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct