Submission #992811

#TimeUsernameProblemLanguageResultExecution timeMemory
992811vjudge1Cave (IOI13_cave)C++17
0 / 100
1 ms348 KiB
#include"cave.h"
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
//#define f first
//#define s second
using namespace std;

int tryCombination(int S[]);

void answer(int S[],int D[]);

void exploreCave(int n)
{
    int s[n],d[n];
    for (int i=0; n>i; i++)
    {
        s[i] = 0;
    }
    for (int i=0; n>i; i++)
    {
        s[i] = 1;
        int x = tryCombination(s);
        d[i] = x;
    }
    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...