제출 #852535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852535		muratcepeda	동굴 (IOI13_cave)	C++17	0 / 100	135 ms	752 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;
    int ayu = 0;
    int nuevo = 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; ++borra){
            if(bien[borra] == 0) arr[borra] = 0;
        }
        ayu = tryCombination(arr);
        ini = 0;
        fin = N - 1;
        while(ini < fin){
            mitad = (ini + fin) / 2;
            for(int j = ini; j <= mitad; ++j)if(bien[j] == 0) arr[j] ^= 1;
            nuevo = tryCombination(arr);
            if(nuevo == ayu || (ayu != i && nuevo != i)) ini = mitad + 1;
            else fin = mitad;
            ayu = nuevo;
        }
        puerta[i] = ini;
        if(nuevo == i) arr[ini] ^= 1;
        pos[ini] = arr[ini]; 
        bien[ini] = 1;
    }
    answer(pos, puerta);
}

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