Submission #727948

#	Time	Username	Problem	Language	Result	Execution time	Memory
727948		Elvin_Fritl	Cave (IOI13_cave)	C++17	34 / 100	16 ms	392 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
    int v[n];
    memset(v, 0, sizeof(v));
    int res[n];
    memset(v, 0, sizeof(v));
    memset(res, -1, sizeof(res));
    for(int i = 0; i < n; i++){
        int d = tryCombination(v);
        if(d == -1) d = n;
        for (int i = 0; i < n; i++)
        {
            v[i] ^= 1;
            int a = tryCombination(v);
            if(a == -1){
                d = -1;
                break;
            }
            if(a < d){
                res[i] = a;
                v[i] ^= 1;
            }
            if(a > d){
                res[i] = d + 1;
                d = a;
            }
        }
        if(d == n) break;
    }
    if(tryCombination(v)==-1){
        answer(v,res);
        return;
    }
    memset(v, 0, sizeof(v));
    for(int i=0;i<n;i++){
        res[i]=i;
    }
    int z=n*2,k;
    while(z--){
        k=tryCombination(v);
        if(k==-1){
            break;
        }
        v[k]^=1;
    }

    answer(v,res);
}

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