Submission #481642

#TimeUsernameProblemLanguageResultExecution timeMemory
481642SlavicGCave (IOI13_cave)C++17
12 / 100
9 ms392 KiB
#include"cave.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 

void exploreCave(int n){
    int a[n];
    forn(i, n)a[i] = 0;
    int x = tryCombination(a);
    while(x != -1){
        a[x] ^= 1;
        x = tryCombination(a);
    }
    int v[n];
    forn(i, n)v[i] = i;

    answer(a, v);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...