| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1082620 | KALARRY | 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.
//chockolateman
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
int pos[5005];
bool check(vector<int> combo,int door)
{
    int res = tryCombination(combo);
    return (res > door || res == -1);
}
void exploreCave(int N)
{
    vector<int> cur;
    for(int i = 0 ; i < N ; i++)
    {
        pos[i] = -1;
        cur.push_back(0);
    }
    for(int i = 0 ; i < N ; i++)
    {
        int res = tryCombination(cur);
        if(res > i || res==-1)
            for(int j = 0 ; j < N ; j++)
                if(pos[j]==-1)
                    cur[j] = (cur[j] + 1)%2;
        int cur_switch = -1;
        for(int b = N ; b >= 1 ; b/=2)
        {
            if(cur_switch + b > N)
                continue;
            vector<int> temp = cur;
            for(int j = 0 ; j <= cur_switch + b; j++)
                if(pos[j]==-1)
                    temp[j] = (temp[j] + 1)%2; 
            while(cur_switch + b < N && !check(temp,i))
            {
                cur_switch += b;
                for(int j = 0 ; j <= cur_switch ; j++)
                    if(pos[j]==-1)
                        cur[j] = (cur[j] + 1)%2; 
                for(int j = 0 ; j <= cur_switch + b; j++)
                    if(pos[j]==-1)
                        temp[j] = (temp[j] + 1)%2; 
            }
        }
        cur_switch++;
        pos[cur_switch] = i;
        cur[cur_switch] = (cur[cur_switch] + 1)%2;
    }
    vector<int> D;
    for(int i = 0 ; i < N ; i++)
        D.push_back(pos[i]);
    answer(cur,D);
}
