| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 687270 | Bliznetc | 동굴 (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 pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
#define F first
#define S second
typedef pair < int, int > pii;
typedef vector < int > vi;
typedef vector < vi > vvi;
void exploreCave (int n) {
vector<int> ask(n);
vector<int> good(n, -1), d(n, -1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (good[j] != -1) {
ask[j] = 0;
}
else {
ask[j] = good[j];
}
}
int x = tryCombination(ask);
if (x == i) {
for (int j = 0; j < n; j++) {
if (good[j] != -1) {
ask[j] = 1;
}
else {
ask[j] = good[j];
}
}
}
int l = 0, r = n - 1;
while (r - l > 1) {
int mid = (l + r) / 2;
for (int j = l; j < mid; j++) {
if (good[j] != -1) {
ask[j] = 1 - ask[j];
}
else {
ask[j] = good[j];
}
}
x = tryCombination(ask);
if (x == i) {
for (int j = l; j < mid; j++) {
if (good[j] != -1) {
ask[j] = 1 - ask[j];
}
else {
ask[j] = good[j];
}
}
for (int j = mid; j <= r; j++) {
if (good[j] != -1) {
ask[j] = 1 - ask[j];
}
else {
ask[j] = good[j];
}
}
r = mid - 1;
}
else {
l = mid;
}
}
if (good[l] != -1) {
ask[l] = 1 - ask[l];
}
else {
ask[l] = good[l];
}
x = tryCombination(ask);
if (x == i) {
if (good[l] != -1) {
ask[l] = 1 - ask[l];
}
else {
ask[l] = good[l];
}
l = r;
}
good[i] = ask[l];
d[i] = l;
}
answer(good, d);
}
/*
signed main() {
vi a;
a.pb(-2);
a.pb(2);
a.pb(2);
a.pb(-2);
a.pb(-2);
a.pb(2);
cout << count_swaps(a);
}
*/