Submission #291380

#	Time	Username	Problem	Language	Result	Execution time	Memory
291380		cig32	동굴 (IOI13_cave)	C++14	46 / 100	23 ms	512 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
void exploreCave(int N) {
    int S[N], D[N];
    for(int i=0;i<N;i++){
        S[i]=0;
        D[i]=-1;
    }
    int prev=tryCombination(S);
    if(prev==-1){
        for(int i=0;i<N;i++){
            S[i]=1;
            int now=tryCombination(S);
            D[i]=now;
            S[i]=0;
        }
        answer(S,D);
        return;
    }
    if(N>100){
        for(int i=0;i<N;i++)D[i]=i;
        for(int i=0;i<N;i++){
            S[i]=1;
            if(tryCombination(S)==i){
                S[i]=0;
            }
        }
        answer(S,D);
        return;
    }
    while(true){
        bool ok=true;
        for(int i=0;i<N;i++){
            if(D[i]==-1)ok=false;
        }
        if(ok){
            answer(S,D);
            return;
        }
        for(int i=0;i<N;i++){
            if(D[i]==-1){
                S[i]=1-S[i];
                int now=tryCombination(S);
                if(now==-1 || now>prev){
                    D[i]=prev;
                    prev=now;
                }
                else{
                    S[i]=1-S[i];
                }
            }
        }
    }
}

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