Submission #1218710

#TimeUsernameProblemLanguageResultExecution timeMemory
1218710laurraCave (IOI13_cave)C++20
0 / 100
5 ms328 KiB
#include <iostream>
#include "cave.h"

using namespace std;

void exploreCave(int N)
{
    int i,S[N],D[N],rasp;
    for(i=0;i<N;i++)
    {
        D[i]=i;
        S[i]=0;
    }
    for(i=0;i<N;i++)
    {
        rasp=tryCombination(S);
        if(rasp==-1)
            answer(S,D);
        if(rasp==i)
        {
            S[i]=1;
        }
    }
}
#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...