oj.uz

Submission #1107272

# Submission time Handle Problem Language Result Execution time Memory
1107272 2024-11-01T05:36:40 Z jadai007 Aliens (IOI07_aliens) C++17
100 / 100
 2 ms 336 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

int n, xo, yo; 
string ck;

bool check(int x, int y){
    if(x < 1 || x > n || y < 1 || y > n) return false;
    cout << "examine " << x << ' ' << y << endl;
    cin >> ck;
    if(ck == "false") return false;
    return true;
}

int32_t main(){
    cin >> n >> xo >> yo;
    int lx = xo, ly = yo, x, y;
    for(int j = 0; j < 3; ++j){
        for(int i = 31; i >= 0; --i){
            x = lx - (1ll<<i), y = ly;
            if(check(x, y)) lx = x, ly = y;
        }
    }
    for(int j = 0; j < 3; ++j){
        for(int i = 31; i >= 0; --i){
            x = lx, y = ly - (1ll<<i);
            if(check(x, y)) lx = x, ly = y;
        }
    }
    for(int i = 31; i >= 0; --i){
        x = lx - (1<<i), y = ly - (1ll<<i);
        if(check(x, y)) lx = x, ly = y;
    }
    int m = 0ll;
    x = lx, y = ly;
    for (int i = 31; i >= 0; i--) {
        if (check(x + (1ll<<i), y + (1ll<<i))) m += (1ll<<i), x += (1ll<<i), y += (1ll<<i);
    }
    cout << "solution " << lx + m/2 << " " << ly + m/2 << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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