제출 #145150

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

cave

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


int n , door[5005] , Comb[5005] ;
/*
int tryCombination(int S[]){
    for(int i =0 ; i < n ; i++ )cout << S[i] ;
    cout << endl;
    int ans ; cin >> ans ; return ans ;
}
void answer(int S[],int D[]){
    for(int i =0; i < n ; i++ )cout << S[i]; cout << endl;
    for(int i =0; i < n ; i++ )cout << D[i]; cout << endl;
}*/
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);

    //cerr << "findSwitch of "<<start<<endl;
    while (l<r && start != -1 ){
        int mid = (l+r)/2 ;
        Rev(l,mid);
     //   cerr << l << " " <<mid << " " << r <<endl;
        int rep = tryCombination(Comb);
        Rev(l,mid);
        if( rep == start )l=mid+1;
        else r = mid ;
    }
    assert(l==r||start==-1);
    if( l == r ){
        door[l]=start;
        Comb[l]=!Comb[l];

   // cout << "door of "<<l<<" " << start << endl;
    }
    //cout << "start "<<start<<endl;
}

void exploreCave(int N){
    n = 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){
            Comb[i]=!Comb[i];
            door[i]=tryCombination(Comb);
            Comb[i]=!Comb[i];
        }
    }
    answer(Comb,door);
}
/*
int main(){
    cin >> n ;
    exploreCave(n);
}*/

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