Submission #992792

#TimeUsernameProblemLanguageResultExecution timeMemory
992792emad234Cave (IOI13_cave)C++17
13 / 100
12 ms604 KiB
#include "cave.h"
#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<ll,ll>
const int mxN = 4e6 + 5;
const int mod = 1e9 + 7;
using namespace std;

void exploreCave(int N) {
    int c[N] = {},ans[N];
    for(int i = 0;i < N;i++){
        c[i] = 1;
        int x = tryCombination(c);
        ans[i] = x; 
        c[i] = 0;
    }
    c[N] = 0;
    answer(c,ans);

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