| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1002287 | gyg | Cup of Jamshid (IOI17_cup) | C++17 | 1 ms | 344 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 x) { return -MAX <= x && x <= 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};
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
