| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1086934 | MateiKing80 | 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>
using namespace std;
using pii = pair<int, int>;
#define fr first
#define sc second
/*
vector<int> ss, dd;
int n;
void init()
{
cin >> n;
for(int i = 0; i < n; i ++)
cin >> ss[i];
for(int i = 0; i < n; i ++)
cin >> dd[i];
}
int tryCombination(vector<int> s)
{
vector<int> bn(n);
for(int i = 0; i < n; i ++)
}*/
void exploreCave(int n)
{
//init();
const int lg = (int)log2(n);
vector<pii> ans;
vector<bool> f(n, false);
for(int i = 0; i < n; i ++)
{
vector<int> sus;
for(int j = 0; j < n; j ++)
sus.pb(1);
for(auto j : ans)
sus[j.fr] = j.sc;
bool turip = (tryCombination(sus) == i);
int pas = 1 << lg, pos = -1;
while(pas)
{
vector<int> di(n, 1);
for(int j = 0; j <= max(n - 1, pos + pas); j ++)
di[j] = 0;
for(auto j : ans)
di[j.fr] = j.sc;
bool nturip = (tryCombination(sus) == i);
if(nturip == turip)
pos += pas;
pas /= 2;
}
pos ++;
if(turip)
ans.push_back({pos, 0});
else
ans.push_back({pos, 1});
}
vector<int> s(n), d(n);
int sus = 0;
for(auto i : ans)
s[i.fr] = i.sc, d[sus ++] = i.fr;
answer(s, d);
}