제출 #348698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348698		apostoldaniel854	Aliens (IOI07_aliens)	C++14	0 / 100	3 ms	512 KiB

aliens

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"

int n;

bool ask (int x, int y) { /// if the grass on (x, y) is flattened
    if (x <= 0 || y <= 0 || x > n || y > n)
        return false;
    cout << "extract " << x << " " << y << endl;
    string answer;
    cin >> answer;
    if (answer == "true")
        return true;
    return false;
}

int main() {
    int xn, yn;
    cin >> n >> xn >> yn;
    int sz = 0;
    int x = xn, y = yn;
    while (ask (x, y + (1 << sz)))
        sz++;
    sz--;
    int y2 = y;
    while (sz >= 0) {
        if (ask (x, y2 + (1 << sz)))
            y2 += (1 << sz);
        sz--;
    }
    sz = 0;
    while (ask (x, y - (1 << sz)))
        sz++;
    sz--;
    int y1 = y;
    while (sz >= 0) {
        if (ask (x, y2 - (1 << sz)))
            y2 -= (1 << sz);
        sz--;
    }

    sz = 0;
    while (ask (x + (1 << sz), y))
        sz++;
    sz--;
    int x2 = x;
    while (sz >= 0) {
        if (ask (x2 + (1 << sz), y))
            x2 += (1 << sz);
        sz--;
    }
    sz = 0;
    while (ask (x - (1 << sz), y))
        sz++;
    sz--;
    int x1 = x;
    while (sz >= 0) {
        if (ask (x1 - (1 << sz), y))
            x1 -= (1 << sz);
        sz--;
    }
    int m = x2 - x1 + 1;
    int x_mid = (x2 - x1 + 1) / 2;
    int y_mid = (y2 - y1 + 1) / 2;
    if (ask (x_mid + 2 * m, y_mid))
        x_mid += m;
    if (ask (x_mid - 2 * m, y_mid))
        x_mid -= m;
    if (ask (x_mid, y_mid + 2 * m))
        y_mid += m;
    if (ask (x_mid, y_mid - 2 * m))
        y_mid -= m;
    cout << "solution " << x_mid << " " << y_mid << "\n";
    return 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