Submission #870636

#	Time	Username	Problem	Language	Result	Execution time	Memory
870636		aykhn	동굴 (IOI13_cave)	C++17	100 / 100	760 ms	600 KiB

cave

#include "cave.h"
 
void exploreCave(int n) {
    int a[n], b[n], used[n], d[n];
    for(int i = 0; i<n; i++)
    {
        a[i] = 0;
        b[i] = 0;
        d[i] = 0;
        used[i] = 0;
    }
    
    int l, r, mid;
    for(int i = 0; i<n; i++)
    {
        l = 0, r = n-1;
        int q = tryCombination(a);
        if(q == -1)q = n;
 
        while(l < r)
        {
            mid = (l + r) / 2;
 
            for(int i = 0; i<n; i++)
            {
                b[i] = a[i];
                if(used[i])continue;
                if(mid+1 <= i && i <= r) b[i] = 1;
            }
            int k = tryCombination(b);
            if(k == -1)k = n;
 
            if((q == i && k > i) || (q > i && k == i))l = mid + 1;
            else r = mid;
        }
        d[l] = i;
        if(q == i)a[l] = !a[l];
        used[l] = 1;
    }
    
    answer(a, d);
}

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