oj.uz

답안 #68388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68388 2018-08-17T04:08:37 Z nvmdava Aliens (IOI07_aliens) C++17
50 / 100
 1000 ms 524 KB 
#include <bits/stdc++.h>
using namespace std;

int n;
char s[10];

bool ask(int x, int y){
	if(x > n || x < 1 || y > n || y < 1){
		return 0;
	}
	printf("examine %d %d\n", x, y);
	fflush(stdout);
	scanf("%s", &s);
	return (s[0] == 't');
}

int x, y, m;

int main(){
	scanf("%d %d %d",&n,&x,&y);
	int left, right, up, down;
	
	int l = 0, r = x;
	while(l + 1 != r){
		int m = (l + r) / 2;
		if(ask(m, y)){
			r = m;
		} else {
			l = m;
		}
	}
	left = l;
	
	l = x, r = n + 1;
	while(l + 1 != r){
		int m = (l + r) / 2;
		if(ask(m, y)){
			l = m;
		} else {
			r = m;
		}
	}
	right = l;
	
	l = 0, r = y;
	while(l + 1 != r){
		int m = (l + r) / 2;
		if(ask(x, m)){
			r = m;
		} else {
			l = m;
		}
	}
	up = l;
	
	l = y, r = n + 1;
	while(l + 1 != r){
		int m = (l + r) / 2;
		if(ask(x, m)){
			l = m;
		} else {
			r = m;
		}
	}
	down = l;
	m = __gcd(right - left, down - up);
	
	right = left + m;
	down = up + m;
	x = (right + left) / 2 + 1;
	y = (down + up) / 2 + 1;
	if(m % 3 == 0){
		if(ask(x, y + m / 3) == 0){
			m/=3;
		}
	}
	if(m % 5 == 0){
		if(ask(x + m / 5, y) == 0){	
			m /= 5;
		}
	}
	right = left + m;
	down = up + m;
	x = (right + left) / 2 + 1;
	y = (down + up) / 2 + 1;
	
	while(ask(x - m, y - m)){
		x -= m;
		y -= m;
	}
	while(ask(x - m, y)){
		x -= m;
	}
	while(ask(x, y - m)){
		y -= m;
	}
	
	printf("solution %d %d\n", x + 2 * m, y + 2 * m);
}

Compilation message

aliens.cpp: In function 'bool ask(int, int)':
aliens.cpp:13:16: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[10]' [-Wformat=]
  scanf("%s", &s);
              ~~^
aliens.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", &s);
  ~~~~~^~~~~~~~~~
aliens.cpp: In function 'int main()':
aliens.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&x,&y);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 436 KB Output is correct
2 Correct 3 ms 436 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 436 KB Output is correct
2 Correct 3 ms 448 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 500 KB Output is correct
2 Incorrect 3 ms 500 KB Incorrect

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 500 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 500 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 524 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 524 KB Output is correct
2 Correct 3 ms 524 KB Output is correct
3 Correct 3 ms 524 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1061 ms 524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 524 KB Output is correct
2 Execution timed out 1075 ms 524 KB Time limit exceeded
3 Halted 0 ms 0 KB -