Submission #919871

#TimeUsernameProblemLanguageResultExecution timeMemory
919871SuPythonyCave (IOI13_cave)C++17
0 / 100
12 ms600 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; typedef long long ll; int tryCombination(int S[]); void answer(int S[] , int D[]); void exploreCave(int n) { int s[n]; fill(s, s+n, 0); int d[n]; fill(d, d+n, -1); while (true) { int c=0; for (int i=0; i<n; i++) { if (d[i]!=-1) continue; int a=tryCombination(s); s[i]=!s[i]; int b=tryCombination(s); if (b<a) { d[i]=b; s[i]=!s[i]; } else if (b>a) { d[i]=b; } else { c++; } } if (c==0) break; } answer(s, d); }
#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...