| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 319102 | Wesley_Wang | 동굴 (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>
using namespace std;
int determine[5000];
int correspond[5000];
vector<int> undone;
int undones;
void exploreCave(int N) {
for (int i = 0; i < N; i++)
determine[i] = rand() % 2, correspond[i] = i, undone.push_back(i);
undones = N;
while (undones > 0)
{
int pivot = tryCombination(determine);
int pivot_point = 0;
int r = N;
if (pivot == -1)
break;
bool flag = false;
for (int p : undone)
{
int o = correspond[p];
determine[correspond[o]] = !determine[correspond[o]];
int t = tryCombination(determine);
if (t == -1)
flag = true, break;
if (t != pivot)
{
undone.erase(undone.begin() + p), undones--;
correspond[t] = p;
if (t > pivot)
pivot_point = p;
}
else
correspond[r--] = p;
determine[correspond[o]] = !determine[correspond[o]];
}
if (flag)
break;
determine[correspond[pivot_point]] = !determine[correspond[pivot_point]];
}
while (undones > 0)
{
int o = correspond[undone[0]];
determine[correspond[o]] = !determine[correspond[o]];
int t = tryCombination(determine);
correspond[undone[0]] = t, undone.erase(undone.begin()), undone--;
determine[correspond[o]] = !determine[correspond[o]];
}
answer(determine, correspond);
}