Submission #29830

#	Time	Username	Problem	Language	Result	Execution time	Memory
29830		Nikefor	Cave (IOI13_cave)	C++98	25 / 100	34 ms	512 KiB

cave

#include "cave.h"

void exploreCave(int N) {
    int S[N], D[N];
    for(int i=0; i<N; i++) { S[i] = 0; D[i] = -1; }
    if(tryCombination(S)==-1) {
        for(int i=0; i<N; i++) {
            S[i] = 1;
            int d = tryCombination(S);
            D[i] = d;
            S[i] = 0;
        }
    answer(S, D);
    return;

    }
    /*else if(N<=100) {
        int d = tryCombination(S);
        while(d!=-1) {

            for(int i=0; i<N; i++) {
                if(D[i]!=-1) continue;
                S[i] = 1;
                int t = tryCombination(S);
                if(t<d) D[i] = t;
                if(t>d) { D[i] = d; break;}
                S[i] = 0;
            }
            d = tryCombination(S);
        }
        for(int i=0; i<N; i++) {
            if(D[i]!=-1) continue;
            S[i] = (S[i]+1)%2;
            D[i] = tryCombination(S);
            S[i] = (S[i]+1)%2;

        }
        answer(S, D);
        return;
    }*/
    for(int i=0; i<N; i++) D[i] = i;
    for(int i=0; i<N; i++) {
        if(tryCombination(S)==i) S[i] = 1;
    }
    answer(S, D);
}

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