oj.uz

Submission #896015

# Submission time Handle Problem Language Result Execution time Memory
896015 2023-12-31T12:33:38 Z Andrey Aliens (IOI07_aliens) C++14
100 / 100
 2 ms 600 KB 
#include<bits/stdc++.h>
using namespace std;

long long n;

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

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    long long x,y;
    cin >> n >> x >> y;
    long long r = x,c,l = x,u = y;
    for(long long i = 0; i < 31; i++) {
        c = i;
        if(!query(r+(1LL << i),y)) {
            break;
        }
    }
    for(long long i = c; i >= 0; i--) {
        if(query(r+(1LL << i),y)) {
            r+=(1LL << i);
        }
    }
    c = 0;
    for(long long i = 0; i < 31; i++) {
        c = i;
        if(!query(l-(1LL << i),y)) {
            break;
        }
    }
    for(long long i = c; i >= 0; i--) {
        if(query(l-(1LL << i),y)) {
            l-=(1LL << i);
        }
    }
    long long m = r-l+1;
    c = 0;
    for(long long i = 0; i < 31; i++) {
        c = i;
        if(!query(x,u+(1LL << i))) {
            break;
        }
    }
    for(long long i = c; i >= 0; i--) {
        if(query(x,u+(1LL << i))) {
            u+=(1LL << i);
        }
    }
    long long d = u-m+1;
    x = (l+r)/2,y = (u+d)/2;
    long long sb1 = 0,sb2 = 0;
    for(long long i = -5; i <= 5; i++) {
        for(long long j = -5; j <= 5; j++) {
            if(query(x+i*m,y+j*m)) {
                sb1+=x+i*m;
                sb2+=y+j*m;
            }
        }
    }
    cout << "solution " << sb1/13 << " " << sb2/13 << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
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 #3
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 #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 2 ms 424 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct