Submission #745395

#TimeUsernameProblemLanguageResultExecution timeMemory
745395pzorro동굴 (IOI13_cave)C++14
12 / 100
9 ms424 KiB
#include <iostream>
#include <bits/stdc++.h>
#include "cave.h"
 
using namespace std;
 
int troca(int n){
    if(n) return 0;
    return 1;
}

void exploreCave(int n){
    int s[n];
    int d[n];
    for(int i = 0; i < n; i++){
        s[i] = 0;
        d[i] = i;
    }
    int res;
    while(1){
        res = tryCombination(s);
        if(res == -1)
            answer(s, d);
        s[res] = troca(s[res]);
    }
}
#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...