Submission #1083085

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083085		erdemfurkan	Cave (IOI13_cave)	C++14	25 / 100	9 ms	568 KiB

cave

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

void exploreCave(int N) {
    int combination[N];
    int S[N];
    int D[N];
    for(int i = 0; i < N; i++) {
        combination[i] = 0;
    }
    // Hepsi açık
    if(tryCombination(combination) == -1) {
        for(int i = 0; i < N; i++) {
            S[i] = 0;
        }
        for(int i = 0; i < N; i++) {
            combination[i] = 1;
            int x = tryCombination(combination);
            D[i] = x;
            combination[i] = 0;
        }
        answer(S, D);       
    } else {
        for(int i = 0; i < N; i++) {
            S[i] = 1;
        }
        for(int i = 0; i < N; i++) {
            D[i] = i;
        }
        for(int i = 0; i < N; i++) {
            combination[i] = 1;
            int x = tryCombination(combination);
            if(x == i) {
                S[i] = 0;
                combination[i] = 0;
            }
        }
        answer(S, D);
    }
}

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