Submission #285919

#	Time	Username	Problem	Language	Result	Execution time	Memory
285919		amalla	Cave (IOI13_cave)	C++17	0 / 100	12 ms	512 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
int S[10000], D[10000], n, first;
bool never = true, picked[10000];

void solve(int curr) {
    int ans;
    for (int i = 0; i<n; ++i) { // intenta la puerta S[i]
        if (picked[i]) continue;
        S[i] ^= 1;
        ans = tryCombination(S);
        if (ans!=first) {
            picked[i] = 1;
            if (ans>first) {
                first = ans;
                D[first] = i;
                
            }
            else {
                D[ans] = i;
                S[i] ^= 1;
                
            }
            continue;            
        }
        if (ans == curr) {
            D[curr] = i;
            picked[i] = 1;
            S[i] ^= 1;
            return;
        }
        S[i] ^= 1;
        ans = tryCombination(S);
        if (ans == curr) {
            D[curr] = i;
            picked[i] = 1;
            S[i] ^= 1;
            return;
        }
    }
}

void exploreCave(int N) {
    n = N;    
    for (int i = 0; i<10000; ++i) {
        S[i] = 0;
        D[i] = -1;
        picked[i] = 0;
    }
    first = tryCombination(S);
    for (int i = 0; i<N; ++i) { // para la puerta D[i]
        if (picked[i]) continue;
        solve(i);      
    }
    answer(S, D);
}

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