Submission #927044

#	Time	Username	Problem	Language	Result	Execution time	Memory
927044		Art_ogo	Cave (IOI13_cave)	C++17	0 / 100	199 ms	544 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int S[N];
    int D[N];
    bool ok[N];
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++)
            if(!ok[j])
                S[j] = 0;
        int ans = tryCombination(S);
        if(ans == i)
            for(int j = 0; j < N; j++)
                if(!ok[j])
                    S[j] = 1;
        int l = 0, r = N - 1;
        while(l < r){
            int mid = (l + r) >> 1;
            for(int j = l; j <= mid; j++)
                if(!ok[j])
                    S[j] = 1 - S[j];
            ans = tryCombination(S);
            if(ans == i)
                r = mid;
            else l = mid + 1;
            for(int j = l; j <= mid; j++)
                if(!ok[j])
                    S[j] = 1 - S[j];
        }
        ok[l] = 1;
        D[l] = i;
    }
    answer(S, D);
}

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