Submission #228747

#	Time	Username	Problem	Language	Result	Execution time	Memory
228747		jhtan	Cave (IOI13_cave)	C++14	0 / 100	16 ms	640 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int S[N];
    int D[N];

    // 12 points
    /*for(int i=0; i<N; i++) {
        S[i] = 0;
        D[i] = i;
    } 

    for(int i=0; i<N; i++) {
        int x = tryCombination(S);
        if(x == -1) break;
        if(x == i) S[i] = 1;
    }

    answer(S, D);*/

    memset(S, 0, sizeof(S));

    for(int i=0; i<N; i++) {
        S[i] = 1;
        D[tryCombination(S)] = i;
        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