Submission #1298442

#TimeUsernameProblemLanguageResultExecution timeMemory
1298442scalifrastico_098Cave (IOI13_cave)C++20
0 / 100
21 ms512 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int a[n], b[n], c[n]; for(int i=0; i<n; i++){a[i]=0; b[i]=-1;} int i=tryCombination(a); while(i!=-1) { for(int j=0; j<n; j++) { a[i]=1; int u=tryCombination(c); if(u>i||u==-1){c[i]=1; i=u; break;} if(u<i)c[i]=1; a[i]=0; } } for(int i=0; i<n; i++) { int u=tryCombination(a);b[i]=u; } answer(a, b); }
#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...