# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1002232 |
2024-06-19T11:14:58 Z |
gyg |
Cup of Jamshid (IOI17_cup) |
C++17 |
|
1 ms |
344 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);
if (-INF + new_x < -MAX || -INF + new_x > MAX) continue;
int new_y = ask_shahrasb(-INF + new_x, -INF);
if (-INF + new_y < -MAX || -INF + new_y > MAX) continue;
// cout << -INF + new_x << " " << -INF + new_y << endl;
if ((new_x ^ new_y) != k) continue;
// cout << "ANSWER " << -INF + new_x << " " << -INF + new_y << endl;
return {-INF + new_x, -INF + new_y};
}
x |= (1 << 30);
int y = x ^ k;
// cout << "ANSWER " << -INF + x << " " << -INF + y << endl;
return {-INF + x, -INF + y};
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
wrong cup location |
2 |
Halted |
0 ms |
0 KB |
- |