Submission #813183

#	Time	Username	Problem	Language	Result	Execution time	Memory
813183		Kerim	Cave (IOI13_cave)	C++17	13 / 100	477 ms	392 KiB

cave

#include "cave.h"

void exploreCave(int n) {
    int a[n], b[n];
    for (int i = 0; i < n; i++)
        b[i] = -1;
    for (int i = 0; i < n; i++){
        int st = 0, en = n-1;
        while (st < en){
            int mid = (st + en) >> 1;
            for (int j = 0; j < n; j++){
                if (b[j] == -1)
                    a[j] = (j <= mid);
                else    
                    a[j] = 0;
            }
            if (tryCombination(a) == i)
                en = mid;
            else    
                st = mid + 1;
        }
        b[st] = i;
    }
    for (int i = 0; i < n; i++)
        a[i] = 0;
    answer(a, b);
}

// tryCombination

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