제출 #771226

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771226		Tymond	동굴 (IOI13_cave)	C++17	46 / 100	24 ms	468 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

void exploreCave(int n) {
    int S[n];
    int D[n];
    
    for(int i = 0; i <= n - 1; i++){
        S[i] = 0;
    }
    
    for(int  i = 0; i <= n - 1; i++){
        int kture = tryCombination(S);
        if(kture > i || kture == -1){
            continue;
        }
        if(S[i] == 0){
                S[i] = 1;
                kture = tryCombination(S);
                //std::cout << kture << ' ' << i << ' ' << j << '\n';
                if(kture > i || kture == -1){
                    continue;
                }
                S[i] = 0;
            }else{
                S[i] = 0;
                kture = tryCombination(S);
                //std::cout << kture << ' ' << i << ' ' << j << '\n';
                if(kture > i || kture == -1){
                    continue;
                }
                S[i] = 1;
            }
        
        for(int j  = 0; j <= n - 1; j++){
            if(S[j] == 0){
                S[j] = 1;
                kture = tryCombination(S);
                //std::cout << kture << ' ' << i << ' ' << j << '\n';
                if(kture > i || kture == -1){
                    break;
                }
                S[j] = 0;
            }else{
                S[j] = 0;
                kture = tryCombination(S);
                //std::cout << kture << ' ' << i << ' ' << j << '\n';
                if(kture > i || kture == -1){
                    break;
                }
                S[j] = 1;
            }
        }
    }
    
    for(int i = 0; i <= n - 1; i++){
        if(S[i] == 0){
            S[i] = 1;
            int kture = tryCombination(S);
            D[i] = kture;
            S[i] = 0;
        }else{
            S[i] = 0;
            int kture = tryCombination(S);
            D[i] = kture;
            S[i] = 1;
        }
    }
    
    answer(S, D);
}

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