# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502230 | 2022-01-05T14:46:45 Z | srivatsav_kannan | Colors (BOI20_colors) | C++14 | 1 ms | 200 KB |
#include <iostream> #include <fstream> #include <vector> #include <set> #include <queue> #include <cmath> #include <map> #include <algorithm> #include <unordered_map> using namespace std; #define int long long int signed main() { int n; cin >> n; int l = 1, r = n; int prev = 1; cout << "? 1" << endl; int cur; cin >> cur; cout << "= " << prev << endl; // while (l <= r){ // int mid = (l+r)/2; // if (l == r-1) mid = r; // cout << "? " << prev+mid << endl; // cin >> cur; // prev += mid; // if (cur){ // if (l == r){ // cout << "= " << l << endl; // break; // } // l = mid; // } else { // r = mid-1; // } // } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Wrong guess |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Wrong guess |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Wrong guess |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Wrong guess |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Wrong guess |
2 | Halted | 0 ms | 0 KB | - |