Submission #729877

#TimeUsernameProblemLanguageResultExecution timeMemory
729877Rasoul006Cave (IOI13_cave)C++17
12 / 100
9 ms468 KiB
#include "cave.h"

#include <bits/stdc++.h>

#define endl "\n"

#define F first

#define S second

#define pb push_back

#define all(x) x.begin() , x.end()

#define mid ((r+l)>>1)

#define lx (n<<1)

#define rx ((n<<1)|1)

typedef long long ll;

using namespace std;

const int N = 5e3+5;

const long long oo = 1e18 ;

int n , a[N] , b[N] ;

void exploreCave(int N) {

    n = N ;

    for (int i = 0 ; i<n ; i++)
        b[i] = i ;

    ll i = 0 ;

    while (i != -1)
    {
        a[i] = !a[i] ;
        i = tryCombination(a) ;
    }

    answer (a , b) ;
}
#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...