Submission #1291585

#TimeUsernameProblemLanguageResultExecution timeMemory
1291585hssaan_arifCave (IOI13_cave)C++20
12 / 100
14 ms504 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

#define endl "\n"
#define pb push_back
// #define int long long
#define fi first
#define se second

const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;

void exploreCave(int N) {
    int S[N] = {} , D[N] = {};
    for (int i=0 ; i<N ; i++){
        D[i] = i;
        int u = tryCombination(S);
        // cout << u << endl;
        if (u == -1 || u > i){
            continue;
        }else{
            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...