Submission #981414

#TimeUsernameProblemLanguageResultExecution timeMemory
981414batsukh2006Cave (IOI13_cave)C++17
12 / 100
17 ms564 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N){
	int pos[N],ans[N];
	memset(pos,0,sizeof(pos));
    for(int i=0; i<N; i++){
    	ans[i]=i;
    	if(tryCombination(pos)==i) pos[i]=1; 
    }
    answer(pos,ans);
}
#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...