| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 250401 | hhh07 | 동굴 (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 <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <set>
#include <cmath>
#include <climits>
#include <cstring>
#include "cave.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> ii;
void exploreCave(int n){
int x[n];
int curr = 0, curr2 = n - 1;
int pitaj[n], ans[n];
for (int i = 0; i < n; i++){
pitaj[i] = 1;
ans[i] = 1;
x[i] = -1;
}
for (int i = 0; i < n; i++){
int beg = curr, end = curr2, odg = 0;
int y = tryCombination(pitaj);
if (y > i || y == -1)
odg = 1;
while(beg < end){
int mid = (beg + end)/2;
for (int j = 0; j < n; j++)
pitaj[j] = ans[j];
int y = ask(n, pitaj, x, odg, beg, mid, end);
if (y > i)
end = mid;
else
beg = mid + 1;
}
x[beg] = i;
pitaj[beg] = odg;
ans[beg] = odg;
if (beg == curr)
curr = beg + 1;
if (beg == curr2)
curr2 = beg - 1;
}
answer(pitaj, x);
}