Submission #1083095

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083095		erdemfurkan	Cave (IOI13_cave)	C++14	0 / 100	1 ms	348 KiB

cave

#include "cave.h"
#include <algorithm> 

void exploreCave(int N) {
    int S[N] = {};
    int D[N];
    int prev = tryCombination(S);
    for(int i = 0; i < N; i++) {
        S[i] = !S[i];
        int x = tryCombination(S);
        if(x == -1) {
            break;
        } else {
            if(x < prev) {
                S[i] = !S[i];
            }
        }
    }
    for(int i = 0; i < N; i++) {
        S[i] = !S[i];
        int x = tryCombination(S);
        D[i] = x;
        S[i] = !S[i];
    }
    answer(S,D);
}

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