| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 975087 | marinaluca | Cup of Jamshid (IOI17_cup) | C++14 | 1 ms | 348 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 <bits/stdc++.h>
#include "cup.h"
using namespace std;
//#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin(x), end(x)
#define FOR (i, a, b) for (auto i = (a); i < (b); ++ i)
const int NMAX = 30;
vector <int> find_cup(){
    int mini = -1e9;
    int rez =0;
    int val = ask_shahrasb(mini, mini);
    for (int i = 0; i < NMAX + 1; ++ i){
        int ans = ask_shahrasb(mini + (1 << i), mini);
        if (mini == (val ^ (1 << i)))
            rez |= (1 << i);
    }
    int aa = val ^ rez;
    int x = mini + rez, y = mini + aa;
    return {x, y};
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
