제출 #423745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423745		ioi	Cave (IOI13_cave)	C++14	13 / 100	16 ms	416 KiB

cave

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

void exploreCave(int N) {
    int com[N] , ans[N];
    memset(com , 0 , sizeof com);

    for(int i = 1 ; i < N ; i ++){
        /*
        com[i - 1] = 0 ;
        com[i] = 0 ;

        int c = tryCombination(com);
        com[i] = 1 ;

        int c2 = tryCombination(com);

        if(c == c2)
            ans[i - 1] = c , com[i - 1] = 1 ;
        else {
            com[i - 1] = 1 ;
            ans[i - 1] = tryCombination(com);
            com[i - 1] = 0 ;

        }
        */
        
        com[i - 1] = 1 ;
        ans[i - 1] = tryCombination(com);
        com[i - 1] = 0 ;
        


    }
    
    com[N - 1] = 1 ;

    int c = tryCombination(com);

    if(c == -1){
        com[N - 1] = 0 ;

        ans[N - 1] = tryCombination(com);
        com[N - 1] = 1 ;
    }
    else {

        ans[N - 1] = c ;

        com[N - 1] = 0 ;

    }
    answer(com , ans);
}

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