Submission #852533

#	Time	Username	Problem	Language	Result	Execution time	Memory
852533		muratcepeda	Cave (IOI13_cave)	C++17	0 / 100	2045 ms	348 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int arr[N], bien[N], puerta[N], pos[N];
    int ini = 0;
    int fin = N;
    int mitad = 0;
    for(int i = 0; i < N; ++i) arr[i] = bien[i] = puerta[i] = pos[i] = 0;
    for(int i = 0; i < N; ++i){
        for(int borra = 0; borra < N; ++i){
            if(bien[i] == 0) arr[i] = 0;
        }
        while(ini <= fin){
            mitad = (ini + fin) / 2;
            for(int j = 0; j < N; ++j) arr[i] = 1;
            if(tryCombination(arr) == i) fin = mitad - 1;
            else ini = mitad + 1;
        }
        puerta[i] = arr[mitad];
        pos[i] = mitad;
        bien[mitad] = 1;
    }
    answer(puerta, pos);
}

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