| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 216211 | MODDI | 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 "cave.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vll vector<pll>
#define vii vector<pii>
using namespace std;
void exploreCave(int n){
int door[n], guess[n], status[n];
memset(door,-1,sizeof(door));
for(int i = 0; i < n; i++){
int before_swap = tryCombination(status);
int l = 0, r = n - 1;
while(l <= r){
bool ok = false;
int mid = (r + l) / 2;
for(int i = 0; i < n; i++){
if(i >= l && i <= mid){
if(door[i] != -1)
guess[i] = status[i];
else{
guess[i] = !status[i];
changed = true;
}
}
else
guess[i] = status[i];
}
int K = before_swap;
if(changed)
K = tryCombination(guess);
if(before_swap == i){
if(K > i || K == -1)
h = mid;
else
l = mid + 1;
}
else{
if(K == i)
h = mid;
else
l = mid + 1;
}
}
door[l] = i;
if(before_swap == i)
status[l] = !status[l];
}
answer(status,door);
}