제출 #481191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481191		nadorb	동굴 (IOI13_cave)	C++14	100 / 100	971 ms	460 KiB

cave

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

void exploreCave(int n) {
    int s[n], known[n], whereto[n];
    for(int i = 0; i < n; i++){
        known[i] = -1;
        whereto[i] = -1;
    }
    for(int i = 0; i < n; i++){ // minden ajtora
        for(int j = 0; j < n; j++){
            if(known[j] == -1){
                s[j] = 1;
            }
            else{
                s[j] = known[j];
            }
        }
        int g = tryCombination(s);
        bool  door = (g == -1 || g > i);
        int l = 0, r = n - 1;
        while(l < r && i < n - 1){
            int mid = (l + r) / 2;
            for(int j = 0; j < n; j++){
                if(known[j] > -1){
                    s[j] = known[j];
                }
                else{
                    if(l <= j && j <= mid){
                        s[j] = door;
                    }
                    else{
                        s[j] = 1 - door;
                    }
                }
            }
            int res = tryCombination(s);
            if(res == - 1 || res > i){
                r = mid;
            }
            else{
                l = mid + 1;
            }
        }
        if(i == n - 1){
            for(int j = 0; j < n; j++){
                if(whereto[j] == -1){
                    whereto[j] = n - 1;
                    known[j] = door;
                }
            }
        }
        else{
            whereto[l] = i;
            known[l] = door;
        }
    }
    answer(known, whereto);
}

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