Submission #719124

#	Time	Username	Problem	Language	Result	Execution time	Memory
719124		TahirAliyev	Cave (IOI13_cave)	C++17	34 / 100	19 ms	428 KiB

cave

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

using namespace std;

void exploreCave(int n){
    int comb[n];
    memset(comb, 0, sizeof(comb));
    int doors[n];
    memset(doors, -1, sizeof(doors));
    for(int i = 0; i < n; i++)
    {
        int d = tryCombination(comb);
        if(d == -1) d = n;
        for (int i = 0; i < n; i++)
        {
            comb[i] ^= 1;
            int a = tryCombination(comb);
            if(a == -1){
                d = -1;
                break;
            }
            if(a < d){
                doors[i] = a;
                comb[i] ^= 1;
            }
            if(a > d){
                doors[i] = d + 1;
                d = a;
            }
        }
        if(d == n) break;
    }
    answer(comb, doors);
}

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