oj.uz

답안 #500624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500624 2021-12-31T15:37:44 Z 600Mihnea Aliens (IOI07_aliens) C++17
80 / 100
 3 ms 280 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

int dr[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};

vector<pair<int, int>> guys;


signed main() {
  int n, r0, c0;
  cin >> n >> r0 >> c0;

  int cnt = 0;
  function<bool(int, int)> is = [&] (int r, int c) {

    if (1 <= r && 1 <= c && r <= n && c <= n) {
      cnt++;
      if (cnt > 300 - 1) exit(0);
      cout << "examine " << r << " " << c << endl;
      string s;
      cin >> s;
      assert(s == "true" || s == "false");
      return (s == "true");
    }
    return false;
  };

  for (int k = 0; k < 4; k++) {
    int r = r0, c = c0;
    while (1) {
      pair<int, int> init = {r, c};

      for (int step = 1 << 30; step; step /= 2) {
        if (is(r + dr[k] * step, c + dc[k] * step)) {
          r += dr[k] * step;
          c += dc[k] * step;
        }
      }

      pair<int, int> fini = {r, c};

      if (init == fini) {
        break;
      }
    }
    guys.push_back({r, c});
  }

  cout << "solution ";
  cout << (guys[0].first + guys[2].first) / 2 << " ";
  cout << (guys[1].second + guys[3].second) / 2 << endl;


  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Incorrect 3 ms 200 KB Unexpected end of file - token expected

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 2 ms 200 KB Output is correct
3 Incorrect 1 ms 200 KB Unexpected end of file - token expected

Subtask #10
10.0 / 10.0

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