Submission #377771

#TimeUsernameProblemLanguageResultExecution timeMemory
377771jlallas384Cave (IOI13_cave)C++14
12 / 100
14 ms512 KiB
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N){
    int ans[N] = {};
    while(1){
        int resp = tryCombination(ans);
        if(resp == -1) break;
        ans[resp] ^= 1;
    }
    int arr[N];
    for(int i = 0; i < N; i++){
        arr[i] = i;
    }
    answer(ans,arr);
}
#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...