Submission #1030944

# Submission time Handle Problem Language Result Execution time Memory
1030944 2024-07-22T12:45:26 Z tvladm2009 Cup of Jamshid (IOI17_cup) C++17
100 / 100
1 ms 348 KB
#include "cup.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;

vector<int> find_cup() {
    int d = 5e8 + 2;
    int XOR = ask_shahrasb(-d, -d);
    int x = 0, y = 0;
    for (int b = 0; b <= 29; ++b) {
        if (ask_shahrasb((1 << b) - d, -d) == (XOR ^ (1 << b))) {
            x ^= (1 << b);
        }
    }
    y = x ^ XOR;
    x -= d;
    y -= d;
    vector<int> sol = {x, y};
    return sol;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct