oj.uz

Submission #436118

# Submission time Handle Problem Language Result Execution time Memory
436118 2021-06-24T09:08:37 Z dutch Aliens (IOI07_aliens) C++17
30 / 100
 4 ms 272 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, x, y;

bool q(int i, int j){
	if(min(i, j) < 1 || max(i, j) > n) return 0;
	cout << "examine " << i << ' ' << j << endl;
	string res; cin >> res;
	return res[0] == 't';
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> x >> y;
	int xMax = x, xMin = x, yMax = y;

	for(int i=1<<30, j; i/=2; ){
		j = xMax + i;
		if(q(j, y)){
			if(q((j+xMax)/2, y) && q(xMax+(i+3)/4, y)) xMax += i;
		}
		j = yMax + i;
		if(q(x, j)){
			if(q(x, (j+yMax)/2) && q(x, yMax+(i+3)/4)) yMax += i;
		}
		j = xMin - i;
		if(q(j, y)){
			if(q((j+xMin)/2, y) && q(xMin-(i+3)/4, y)) xMin -= i;
		}
	}

	int w = 2*(xMax - xMin + 1);
	int yMin = yMax - (xMax - xMin);
	x = (xMin + xMax) / 2;
	y = (yMin + yMax) / 2;

	xMin = xMax = x;
	yMin = yMax = y;

	if(q(x-w, y)) xMin -= w;
	if(q(x-w, y)) xMin -= w;
	if(q(x+w, y)) xMax += w;
	if(q(x+w, y)) xMax += w;

	if(q(x, y-w)) yMin -= w;
	if(q(x, y-w)) yMin -= w;
	if(q(x, y+w)) yMax += w;
	if(q(x, y+w)) yMax += w;

	cout << "solution " << (xMin+xMax)/2 << ' ' << (yMin+yMax)/2 << endl;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Incorrect 2 ms 200 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 272 KB Output is correct
2 Incorrect 4 ms 220 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

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

Subtask #10
0 / 10.0

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