Submission #235641

#	Time	Username	Problem	Language	Result	Execution time	Memory
235641		jam_xd_	Cave (IOI13_cave)	C++17	25 / 100	17 ms	512 KiB

cave

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

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

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