#include "cup.h"
#include <bits/stdc++.h>
using namespace std;
#define Q ask_shahrasb
vector<int> find_cup() {
    vector<int> res(2);
    int q[30];
    int base = Q(0, 0);
    for (int i = 0; i < 30; i ++) {
        q[i] = Q(1 << i, 0);
        if (q[i] == (base^(1 << i))) res[0] ^= (1 << i);
    }
    if (res[0] > 5e8) {
        res[0] = 0;
        for (int i = 0; i < 30; i ++) {
            if (q[i] != (base^(1 << i))) res[0] ^= (1 << i);
        }
        res[0] = -res[0];
    }
    res[1] = base ^ abs(res[0]);
    if (Q(0, res[1]) != abs(res[0])) res[1] = -res[1];
    return res;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |