Submission #729879

#	Time	Username	Problem	Language	Result	Execution time	Memory
729879		Rasoul006	Cave (IOI13_cave)	C++17	13 / 100	11 ms	412 KiB

cave

#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++)
    {
        a[i] = !a[i] ;
        b[i] = tryCombination(a) ;
        a[i] = !a[i] ;
    }

    answer (a , b) ;
}

• Subtask 1: 0 / 12
• Subtask 2: 13 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24