oj.uz

답안 #1024189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024189 2024-07-15T15:18:52 Z lucri Aliens (IOI07_aliens) C++17
100 / 100
 2 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
long long n,x,y,m=1,b,e;
char q[15];
int main()
{
    cin>>n>>x>>y;
    if(x>1)
    {
        cout<<"examine "<<x-m<<' '<<y<<'\n';
        cout.flush();
        cin>>q;
        while(q[0]=='t')
        {
            m*=2;
            cout<<"examine "<<x-m<<' '<<y<<'\n';
            cout.flush();
            cin>>q;
        }
        m/=2;
    }
    b=m,e=min(m*2,x-1);
    while(b<=e)
    {
        int mid=(b+e)/2;
        cout<<"examine "<<x-mid<<' '<<y<<'\n';
        cout.flush();
        cin>>q;
        if(q[0]=='t')
            b=mid+1;
        else
            e=mid-1;
    }
    x=x-e;
    m=1;
    cout<<"examine "<<x+m<<' '<<y<<'\n';
    cout.flush();
    cin>>q;
    while(q[0]=='t')
    {
        m*=2;
        cout<<"examine "<<x+m<<' '<<y<<'\n';
        cout.flush();
        cin>>q;
    }
    m/=2;
    b=m,e=min(m*2,n-x);
    while(b<=e)
    {
        int mid=(b+e)/2;
        cout<<"examine "<<x+mid<<' '<<y<<'\n';
        cout.flush();
        cin>>q;
        if(q[0]=='t')
            b=mid+1;
        else
            e=mid-1;
    }
    m=b;
    b=0,e=m-1;
    while(b<=e)
    {
        int mid=(b+e)/2;
        cout<<"examine "<<x<<' '<<y-mid<<'\n';
        cout.flush();
        cin>>q;
        if(q[0]=='t')
            b=mid+1;
        else
            e=mid-1;
    }
    y-=e;
    while(x>m&&y>m)
    {
        cout<<"examine "<<x-m<<' '<<y-m<<'\n';
        cout.flush();
        cin>>q;
        if(q[0]=='t')
        {
            x-=m;
            y-=m;
        }
        else
            break;
    }
    while(x>m*2)
    {
        cout<<"examine "<<x-m*2<<' '<<y<<'\n';
        cout.flush();
        cin>>q;
        if(q[0]=='t')
        {
            x-=m*2;
        }
        else
            break;
    }
    while(y>m*2)
    {
        cout<<"examine "<<x<<' '<<y-m*2<<'\n';
        cout.flush();
        cin>>q;
        if(q[0]=='t')
        {
            y-=m*2;
        }
        else
            break;
    }
    cout<<"solution "<<x+2*m+m/2<<' '<<y+2*m+m/2<<'\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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