oj.uz

Submission #151219

# Submission time Handle Problem Language Result Execution time Memory
151219 2019-09-02T08:55:51 Z georgerapeanu Aliens (IOI07_aliens) C++11
100 / 100
 4 ms 380 KB 
#include <iostream>

using namespace std;

long long n,x,y;
    
bool ask(long long x,long long y){
    if(x < 1 || x > n || y < 1 || y > n){
        return false;
    }
    string ans;
    cout << "examine " << x << " " << y << endl;
    cin >> ans;
    return (ans == "true");
}

void answer(long long x,long long y){
    cout << "solution " << x << " " << y << endl;
}

int main(){
    cin >> n >> x >> y;

    long long delta = 1;

    while(ask(x,y + delta) == true){
        delta *= 2;
    }
   
    delta /= 2;
   
    for(;delta;delta /= 2){
        if(ask(x,y + delta) == true){
            y += delta;
        }
    }

    delta = 1;
    while(ask(x + delta,y) == true){
        delta *= 2;
    }
    
    delta /= 2;
    
    for(;delta;delta /= 2){
        if(ask(x + delta,y) == true){
            x += delta;
        }
    }

    delta = 1;
    while(ask(x - delta,y) == true){
        delta *= 2;
    }

    delta /= 2;

    long long m = 0;

    for(;delta;delta /= 2){
        if(ask(x - m - delta,y) == true){
            m += delta;
        }
    }

    m++;

    x -= (m / 2);
    y -= (m / 2);

    while(ask(x - m,y - m)){
        x -= m;
        y -= m;
    }

    while(ask(x - 2 * m,y)){
        x -= 2 * m;
    }

    while(ask(x,y - 2 * m)){
        y -= 2 * m;
    }

    x += 2 * m;
    y += 2 * m;

    answer(x,y);

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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