Submission #382320

#TimeUsernameProblemLanguageResultExecution timeMemory
382320Andyvanh1Cave (IOI13_cave)C++14
12 / 100
14 ms492 KiB
#include <iostream>
#include <vector>
#include "cave.h"
using namespace std;



void exploreCave(int n){
    int S[n];
    int D[n];
    for(int i = 0; i < n; i++){
        S[i] = 0;
        D[i] = i;
    }
    int k = 0;
    while(k<n){
        k = tryCombination(S);
        if(k==-1){
            break;
        }
        S[k] ^=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...