제출 #874330

#제출 시각아이디문제언어결과실행 시간메모리
874330asli_bg동굴 (IOI13_cave)C++11
0 / 100
63 ms592 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=5e3+3;
int S1[MAXN];
int S2[MAXN];
int D[MAXN];

void exploreCave(int N) {
    /* ... */

    int bas=0;

    for(int i=0;i<N;i++){
        D[i]=i;
    }

    ////////////////////////////////
    while(bas<N){
        for(int i=bas;i<N;i++){
            S1[i]=0;
        }

        int z=tryCombination(S1);

        for(int i=bas;i<N;i++){
            S2[i]=1;
        }

        int o=tryCombination(S2);

        if(z==-1){
            answer(S1,D);
        }
        else if(o==-1){
            answer(S2,D);
        }
        else{
            bas=max(o,z);
        }
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...