Submission #919860

#TimeUsernameProblemLanguageResultExecution timeMemory
919860SuPythonyCave (IOI13_cave)C++17
12 / 100
15 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); for (int i=0; i<n; i++) { int a=tryCombination(s); if (a==i) { s[i]=!s[i]; } } int d[n]; iota(d, d+n, 0); 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...