Submission #970581

#	Time	Username	Problem	Language	Result	Execution time	Memory
970581		Acanikolic	Cave (IOI13_cave)	C++14	0 / 100	20 ms	500 KiB

cave

#include <bits/stdc++.h>

#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int S[N],D[N];
    for(int i = 0; i < N; i++) {
        S[i] = 0;
        D[i] = -1;
    }
    for(int k = 0; k < N; k++) {
        int index = tryCombination(S);
        if(index == -1) break;
        for(int j = 0; j < N; j++) {
            if(D[j] != -1) continue;
            S[j] ^= 1;
            if(tryCombination(S) != index) {
                D[j] = index;
                break;
            }
            S[j] ^= 1;
        }
    }
    int SS[N];
    for(int i = 0; i < N; i++) {
        SS[i] = 1;
    }
    for(int k = 0; k < N; k++) {
        int index = tryCombination(SS);
        if(index == -1) break;
        for(int j = 0; j < N; j++) {
            if(D[j] != -1) continue;
            SS[j] ^= 1;
            if(tryCombination(SS) != index) {
                D[j] = index;
                break;
            }
            SS[j] ^= 1;
        }
    }
    answer(S,D);
}

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