제출 #1258142

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258142		kunzaZa183	Aliens (IOI07_aliens)	C++20	0 / 100	1 ms	416 KiB

aliens

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
bool ask(int x, int y) {
  if (x <= 0 || x > n || y <= 0 || y > n)
    return false;
  cout << "examine " << x << " " << y << endl;
  string s;
  cin >> s;
  return s == "true";
}
signed main() {
  int x, y;
  cin >> n >> x >> y;
  int top, right, down, left;
  const int mn = 32;
  for (int i = 0; i < mn; i++) {
    if (!ask(x, y + (1 << i))) {
      int cury = y;
      for (int j = i - 1; j >= 0; j--) {
        if (ask(x, cury + (1 << j))) {
          cury += (1 << j);
        }
      }
      top = cury - y;
      break;
    }
  }
  for (int i = 0; i < mn; i++) {
    if (!ask(x, y - (1 << i))) {
      int cury = y;
      for (int j = i - 1; j >= 0; j--) {
        if (ask(x, cury - (1 << j))) {
          cury -= (1 << j);
        }
      }
      down = y - cury;
      break;
    }
  }
  for (int i = 0; i < mn; i++) {
    if (!ask(x + (1 << i), y)) {
      int curx = x;
      for (int j = i - 1; j >= 0; j--) {
        if (ask(curx + (1 << j), y)) {
          curx += (1 << j);
        }
      }
      right = curx - x;
      break;
    }
  }
  for (int i = 0; i < mn; i++) {
    if (!ask(x - (1 << i), y)) {
      int curx = x;
      for (int j = i - 1; j >= 0; j--) {
        if (ask(curx - (1 << j), y)) {
          curx -= (1 << j);
        }
      }
      left = x - curx;
      break;
    }
  }

  int m = left + right + 1;

  assert(m % 2 == 1);

  for (int i = -2; i <= 2; i++)
    for (int j = -2; j <= 2; j++) {

      int curx = x + i * m, cury = y + i * m;

      if (ask(curx, cury) && ask(curx + 2 * m, cury) &&
          ask(curx, cury + 2 * m) && ask(curx - 2 * m, cury) &&
          ask(curx, cury - 2 * m)) {
        cout << "solution " << (right - left) / 2 + curx << " "
             << (top - down) / 2 + cury << endl;
        return 0;
      }
    }
  assert(0);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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