Submission #1216685

#TimeUsernameProblemLanguageResultExecution timeMemory
1216685nataliaaCave (IOI13_cave)C++20
0 / 100
6 ms324 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; void exploreCave(int N) { int v[N]; int a[N] ={}; for(int i = 0; i < N; i++) v[i]= i; for(int i = 0; i < N; i++) { int k = tryCombination(a); if(k>i) continue; if(a[i]==1) a[i]=0; else a[i]=1; } return answer( a,v); }
#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...