제출 #145071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145071		youssefbou62	동굴 (IOI13_cave)	C++14	0 / 100	66 ms	860 KiB

cave

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


int n , door[5005] , Comb[5005] ;

void Rev(int l , int r ){
    for(;l<=r;l++)if(door[l]!=-1)Comb[l]=!Comb[l];
}
void findDoor(){

    int l =0 , r = n-1 ;
    int start = tryCombination(Comb);
    while (l<r && start != -1 ){
        int mid = (l+r)/2 ;
        Rev(l,mid);

        int rep = tryCombination(Comb);
        Rev(l,mid);
        if( rep == start )l=mid+1;
        else r = mid ;
    }
    assert(l==r||start==-1);
    door[l]=start;
}

void exploreCave(int N){
    memset(door,-1,sizeof door);
    for(int i = 0 ; i < N ; i++ ){
        findDoor();
    }
    for(int i = 0 ; i< N ; i++ ){
        if( door[i]==-1){
            Rev(i,i);
            door[i]=tryCombination(Comb);
            Rev(i,i);
        }
    }
    answer(Comb,door);
}

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