oj.uz

Submission #1002289

# Submission time Handle Problem Language Result Execution time Memory
1002289 2024-06-19T11:54:55 Z gyg Cup of Jamshid (IOI17_cup) C++17
0 / 100
 0 ms 348 KB 
#include "cup.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int INF = 1e9, MAX = 5e8;

vector<int> find_cup() {
    int k = ask_shahrasb(-INF, -INF);

    int x = 0;
    for (int i = 0; i <= 28; i++) {
        int resp = ask_shahrasb(-INF + (1 << i), -INF);
        if (resp != (k ^ (1 << i))) continue;
        x ^= (1 << i);
    }
    for (pii bits : {make_pair(0, 0), make_pair(0, 1)}) {
        int new_x = x | (bits.first << 30) | (bits.second << 29);
        int new_y = new_x ^ k;
        
        auto is_valid = [](int z) { return -MAX <= z && z <= MAX; };
        if (!is_valid(-INF + new_x) || !is_valid(-INF + new_y)) continue;

        // cout << new_x << " " << new_y << endl;
        int pos = rand();
        if (ask_shahrasb(-INF + new_x, pos) != abs(-INF + new_y - pos)) continue;
        // cout << new_x << " " << new_y << endl;

        return {-INF + new_x, -INF + new_y};
    }
    x |= (1 << 30);
    int y = x ^ k;
    return {-INF + x, -INF + y};
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB WA in grader: -1
2 Halted 0 ms 0 KB -