Submission #5630509

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;
//typedef tuple<ll, ll, ll> T;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }


int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    string res,res0;
    cin>>n;
    cout<<0<<endl;
    cin>>res0;
    if(res0=="Vacant") return 0;
    cout<<n-1<<endl;
    cin>>res;
    if(res=="Vacant") return 0;
    int l=0,r=n;
    while(r-l>1){
        int m=(l+r)/2;
        cout<<m<<endl;
        cin>>res;
        if(res=="Vacant") return 0;
        if((m%2==0 && res0==res) || (m%2==1 && res0 != res)) l=m;
        else r=m;
    }
}

Submission Info

Judge Result