Submission #235302

#TimeUsernameProblemLanguageResultExecution timeMemory
235302pere_gilCave (IOI13_cave)C++14
25 / 100
26 ms512 KiB
#include <iostream>
#include "cave.h"
using namespace std;

void exploreCave(int N)
{
    int D[N],S[N];
    for(int i=0;i<N;i++){ S[i]=0; }
    
    if(tryCombination(S)==-1){
    for(int i=0;i<N;i++){
        S[i]=1;
        D[i]=tryCombination(S);
        S[i]=0;
    }    
    }
    
    else{
    for(int i=0;i<N;i++){
        D[i]=i;
        if(tryCombination(S)==i) S[i]=1;
    }
    }

    answer(S,D);
}

#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...