Submission #728653

#TimeUsernameProblemLanguageResultExecution timeMemory
728653vjudge1Cave (IOI13_cave)C++17
12 / 100
12 ms384 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

//#define N '\n';
#define VI <vector <int>>
#define VVI <vector <vector <int>>>  

void exploreCave(int N){
    int el[N];

    for (int i = 0; i < N; i++) {
        el[i] = 0;
    }
    int lastAns = -2;
    int i = -1;
    while(lastAns != -1){
        if(i != -1){
            el[i] = 1;
        }
        lastAns = tryCombination(el);
        i = lastAns;
    }
    int d[N];
    for(int i = 0; i < N; i++){
        d[i] = i;
    }
    answer(el, 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...