제출 #1029345

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029345		elpro123	동굴 (IOI13_cave)	C++14	100 / 100	216 ms	720 KiB

cave

#include"cave.h"
#include <bits/stdc++.h>
using namespace std;
 
void exploreCave(int n){
    int puerta[n], swit[n], bloq=0;
    
    if(n==1){  
        puerta[0] = 0; 
		swit[0] = 1;
        if(tryCombination(swit)==0){
			swit[0] = 0;
		}
        answer(swit, puerta);
    }
    
    
    for(int i=0; i<n; i++){
		puerta[i] = -1;
	}
    
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(puerta[j] == -1){
                swit[j] = 0;
            }
        }
        bloq = tryCombination(swit);
        
        int l=0,r= n-1, mid, key=1;
        while(l<r){
            if(!(bloq == -1 || bloq > i)){
                for(int j=l; j<=r; j++){
                    if (puerta[j] == -1){
                        swit[j] = (swit[j]+1)%2;//alternar
                    }
                }
            }   
            mid = (l+r)/2;
            for(int j=l; j<=mid; j++){
                if(puerta[j] == -1){
                    swit[j] = (swit[j]+1)%2;
                }
            }
            bloq = tryCombination(swit);
            if(bloq == i){
                r = mid;
                key = (swit[l]+1)%2;
            }else{
                l = mid+1;
                key = swit[l];
            }
            
        }
        puerta[l] = i;
        swit[l] = key;
        
    }
        
    answer(swit,puerta);
    
}

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