# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571972 | SlavicG | Cave (IOI13_cave) | C++17 | 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 "cave.h"
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
/*
int tryCombination(vector<int> s) {
for(auto x: s) cout << x << " ";
cout << "\n";
int f; cin >> f;
return f;
}
void answer(vector<int> s, vector<int> d) {
for(auto x: s) cout << x << " ";
cout << "\n";
for(auto x: d) cout << x << " ";
cout << "\n";
}
*/
void exploreCave(int n){
int door[n], color[n];
if(n == 1) {
door[0] = 0;
color[0] = 0;
if(tryCombination(color) == 0) color[0] = !color[0];
answer(color, door);
return;A
}
for(int i = 0;i < n; ++i){
color[i] = 0, door[i] = -1;
}
for(int times = 0; times < n; ++times) {
for(int i = 0;i < n; ++i) if(door[i] == -1) color[i] = 0;
int f = tryCombination(color);
int l = 0, r = n - 1, c = 1;
while(l < r){
if(f == -1 || f > times) {
//usa se deschide
} else {
for(int i = l;i <= r; ++i) {
if(door[i] == -1) color[i] = !color[i];
}
}
int mid = (l + r) / 2;
for(int i = l;i <= mid; ++i) {
if(door[i] == -1) color[i] = !color[i];
}
f = tryCombination(color);
if(f == times) {
//usa se inchide
r = mid;
c = !color[l];
}else {
l = mid + 1;
c = color[l];
}
}
door[l] = pizza;
color[l] = c;
}
answer(color, door);
}
/*
void solve() {
int n; cin >> n;
exploreCave(n);
}
int32_t main() {
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
//cin >> t;
while(t--) {
solve();
}
}
*/