oj.uz

답안 #969661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969661 2024-04-25T12:45:31 Z NoMercy Aliens (IOI07_aliens) C++14
0 / 100
 1 ms 440 KB 
#include <bits/stdc++.h>
using namespace std;
 
    
int TIME = clock();

#define file \
            freopen("in.txt" , "r" , stdin); \
            freopen("out.txt" , "w" , stdout);
 
typedef long long ll;

void test_case () {
    ll n , x , y;
    cin >> n >> x >> y;
    auto ask = [&](ll fi , ll se) -> int {
        cout << "examine " << fi << " " << se << endl;
        int as;
        cin >> as;
        return as;
    };
    ll l = 1, r = x , best[4] = {x , y , x , y};
    while (l <= r) {
        ll mid = (l + r) / 2;
        if (ask(mid , y) == true && ask((mid + x) / 2 , y) == true) {
            best[0] = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }
    l = 1 , r = y;
    while (l <= r) {
        ll mid = (l + r) / 2;
        if (ask(x , mid) == true && ask(x , (mid + y) / 2) == true) {
            best[1] = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }
    l = x , r = n;
    while (l <= r) {
        ll mid = (l + r) / 2;
        if (ask(mid , y) == true && ask((mid + x) / 2 , y) == true) {
            best[2] = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    l = y , r = n;
    while (l <= r) {
        ll mid = (l + r) / 2;
        if (ask(x , mid) == true && ask(x , (mid + y) / 2) == true) {
            best[3] = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    ///// cout << best[0] << " " << best[1] << " " << best[2] << " " << best[3] << endl;
    x = (best[0] + best[2]) / 2;
    y = (best[1] + best[3]) / 2;
    ll m = best[2] - best[0] + 1;
    while (x - m > 0 && y - m > 0) {
        if (ask(x - m , y - m) == true) {
            x -= m;
            y -= m;
        } else {
            break;
        }
    }
    while (x - m > 0) {
        if (ask(x - m , y) == true) {
            x -= m;
        } else {
            break;
        }
    }
    while (y - m > 0) {
        if (ask(x , y - m) == true) {
            y -= m;
        } else {
            break;
        }
    }
    cout << "solution " << x + m + m << " " << y + m + y << endl;
}
 
int32_t main () {
 
        // file
    
 
    int t = 1;
    // cin >> t;
 
    while (t --) {
        test_case();
    }
 
    cerr << "\nTime elapsed: " << (clock() - TIME) * 1000.0 / CLOCKS_PER_SEC << " ms\n";
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 432 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 440 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 432 KB Incorrect
2 Halted 0 ms 0 KB -