oj.uz

Submission #79138

# Submission time Handle Problem Language Result Execution time Memory
79138 2018-10-11T11:53:08 Z Sherazin Aliens (IOI07_aliens) C++14
100 / 100
 5 ms 572 KB 
#include <bits/stdc++.h>

#define int long long 
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

int n, a, b, m;
map<pii, int> mp;

void print(const char *c, int x, int y) { printf(c, x, y), fflush(stdout); }

bool get(int x, int y) {
	if(x < 1 || x > n || y < 1 || y > n) return false;
	if(!mp.count(pii(x, y))) {
		char s[10];
		print("examine %lld %lld\n", x, y);
		scanf(" %s", s);
		mp[pii(x, y)] = (s[0] == 't');
	}
	return mp[pii(x, y)];
}

int find(int x, int y, int dx, int dy) {
	int d = 1;
	while(get(x + dx*d, y + dy*d)) d <<= 1;
	int l = d >> 1, r = d;
	while(l < r) {
		int m = (l + r + 1) >> 1;
		if(get(a + dx*m, b + dy*m)) l = m;
		else r = m-1;
	}
	return l;
}

int32_t main() {
	scanf("%lld %lld %lld", &n, &a, &b);
	int left = find(a, b, -1, 0), right = find(a, b, 1, 0);
	int up = find(a, b, 0, 1), down = find(a, b, 0, -1);
        m = right + left + 1;

    	int xm = (2*a + right - left) / 2, ym = (2*b + up - down) / 2;

        while(get(xm - 2*m, ym)) xm -= 2*m;
        while(get(xm, ym - 2*m)) ym -= 2*m;
        while(get(xm - m, ym - m)) xm -= m, ym -= m;

        int ax = xm + m*2, ay = ym + m*2;
        print("solution %lld %lld\n", ax, ay);

	return 0;
}

Compilation message

aliens.cpp: In function 'bool get(long long int, long long int)':
aliens.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %s", s);
   ~~~~~^~~~~~~~~~
aliens.cpp: In function 'int32_t main()':
aliens.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld", &n, &a, &b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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