| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 311642 | saarang123 | Cave (IOI13_cave) | C++14 | 0 ms | 0 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 "cave.h"
using namespace std;
using ll = long long;
using ld = long double;
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
template<class T> bool remin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool remax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
void answer(vector<int> s, vector<int> d) {
cout << "Code: ";
for(int c : s) cout << c << " "; cout << endl;
cout << "Doors: ";
for(int c : d) cout << c << " "; cout << endl;
cout << "Exit" << endl;
}
int tryCombination(vector<int> s) {
cout << "Query for doors: ";
for(int c : s) cout << c << " "; cout << endl;
int x; cin >> x;
return x;
}
*/
int binsearch(vector<int> a, int k) {
int mn = 0, mx = a.size() - 1;
while(mn < mx) {
int mid = (mn + mx) >> 1;
for(int i = mn; i <= mid; i++)
a[i] ^= 1;
int x = tryCombination(a);
for(int i = mn; i <= mid; i++)
a[i] ^= 1;
if(x != k)
mx = mid;
else
mn = mid + 1;
}
return mn;
}
void exploreCave(int n) {
vector<int> a(n, 0), d(n, -1);
int x = tryCombination(a);
while(x != -1) {
int id = binsearch(a, x);
d[id] = x;
a[id] ^= 1;
x = tryCombination(a);
}
vector<int> s = a;
for(int i = 0; i < n; i++) {
if(d[i] != -1) continue;
s[i] ^= 1;
d[i] = tryCombination(s);
s[i] ^= 1;
}
answer(s, d);
}
/*
signed main() {
std::ios::sync_with_stdio(0);
std::cout.tie(0);
std::cin.tie(0);
int n, i, j;
cin >> n;
exploreCave(n);
return 0;
}*/