Submission #1216726

#TimeUsernameProblemLanguageResultExecution timeMemory
1216726lizi14Cave (IOI13_cave)C++20
12 / 100
8 ms328 KiB
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cstdio>
#include "cave.h"
 
using namespace std;
 
void exploreCave(int N) {
    int x[N];
    
    fill(x,x+N,0);
    int an=0;
    while(true){
        int a=tryCombination(x);
        if(a==-1){
            break;
        }
        if(a>an){
            an=a-1;
        }
        x[a]=1-x[a];
    }
    int c[N];
    for(int i=0; i<N; i++)c[i]=i;
    return answer(x, c);
}
#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...