제출 #1030374

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030374		thinknoexit	Graph (BOI20_graph)	C++17	0 / 100	1 ms	348 KiB

Graph

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
namespace Grader {
    ll c, cur = 0;
    void getinput() {
        cin >> c;
    }
    bool ask(ll x) {
        bool ch = abs(cur - x) >= c;
        cur = x;
        return ch;
    }
};
ll now = 0;
bool ask(ll x) {
    now = x;
    cout << "? " << x << endl;
    cin >> x; return x;
    // return Grader::ask(x);
}
void answer(ll x) {
    cout << "= " << x << endl;
    exit(0);
}
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    ll n;
    cin >> n;
    // debug
    Grader::getinput();
    //
    ll l = 1, r = n;
    ask(1);
    while (l < r) {
        if (now == l) {
            if (!ask(r)) answer(r - l + 1);
            else r--;
        }
        else {
            if (!ask(l)) answer(r - l + 1);
            else l++;
        }
    }
    answer(1);
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 12
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 42