oj.uz

Submission #965322

# Submission time Handle Problem Language Result Execution time Memory
965322 2024-04-18T10:31:44 Z hirayuu_oj Aliens (IOI07_aliens) C++17
100 / 100
 2 ms 344 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end();
using ll=long long;

int N;
bool question(ll x,ll y){
    if(x<1)return false;
    if(x>N)return false;
    if(y<1)return false;
    if(y>N)return false;
    cout<<"examine "<<x<<" "<<y<<endl;
    string s;
    cin>>s;
    if(s=="true")return true;
    return false;
};
int main(){
    cin>>N;
    ll x,y;
    cin>>x>>y;
    rep(i,3){
        for(int j=28; j>=0; j--){
            if(question(x-(1LL<<j),y)){
                x-=1LL<<j;
            }
        }
    }
    rep(i,3){
        for(int j=28; j>=0; j--){
            if(question(x,y-(1LL<<j))){
                y-=1LL<<j;
            }
        }
    }
    for(int i=30; i>=0; i--){
        if(question(x+(1LL<<i),y+(1LL<<i))){
            x+=1LL<<i;
            y+=1LL<<i;
        }
    }
    ll bx=x,by=y;
    for(int i=30; i>=0; i--){
        if(question(x-(1LL<<i),y-(1LL<<i))){
            x-=1LL<<i;
            y-=1LL<<i;
        }
    }
    x=(x+bx)/2;
    y=(y+by)/2;
    for(int i=30; i>=0; i--){
        if(question(x-(1LL<<i),y+(1LL<<i))){
            x-=1LL<<i;
            y+=1LL<<i;
        }
    }
    bx=x;
    by=y;
    for(int i=30; i>=0; i--){
        if(question(x+(1LL<<i),y-(1LL<<i))){
            x+=1LL<<i;
            y-=1LL<<i;
        }
    }
    x=(x+bx)/2;
    y=(y+by)/2;
    cout<<"solution "<<x<<" "<<y<<endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct