Submission #1106387

#	Time	Username	Problem	Language	Result	Execution time	Memory
1106387		Nonbangkok	Cave (IOI13_cave)	C++17	0 / 100	2 ms	508 KiB

cave

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

void exploreCave(int N) {
    int S[N], D[N], last=-2, start=0, closed;
    for(int i=0;i<N;i++)S[i]=D[i]=0;

    while(start!=N){
        for(int i=start;i<N;i++){
            closed = tryCombination(S);
            if(closed != last){
                D[last] = i;
                start++;
                i = start;
                last = closed;
                continue;
            }
            S[i] = 1;
            closed = tryCombination(S);
            if(closed != last){
                D[last] = i;
                start++;
                i = start;
                last = closed;
                continue;
            }
            S[i] = 0;
        }
    }
    answer(S,D);
}

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