Submission #648714

#	Time	Username	Problem	Language	Result	Execution time	Memory
648714		tigar	Cave (IOI13_cave)	C++14	0 / 100	439 ms	408 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

void exploreCave(int N)
{
    int combos[2][N];
    int door[N];
    bool check[N];
    for(int i=0; i<N; i++){combos[0][i]=0; combos[1][i]=1; check[i]=false;}
    for(int i=0; i<N; i++)
    {
        int bol=1;
        int xx=tryCombination(combos[0]);
        if(xx>i or xx==-1)bol=0;
        int l=0, r=N, midd=N/2;
        while(l<=r)
        {
            for(int j=0; j<N; j++)
            {
                if((j>=midd or j<l) and !check[j])combos[bol][j]=abs(bol-1);
                else if((j<midd and j>=l) and !check[j])combos[bol][j]=bol;
            }
            int br=tryCombination(combos[bol]);
            if(l==r){check[l]=true; combos[0][l]=bol; combos[1][l]=bol; door[l]=i; break;}
            else if(br>i or br==-1){r=midd-1; midd=(l+r)/2;}
            else {l=midd; midd=(l+r)/2;}
        }
    }
    return answer(combos[0], door);
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24