Submission #670588

#TimeUsernameProblemLanguageResultExecution timeMemory
670588mseebacherCave (IOI13_cave)C++17
0 / 100
2 ms340 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; typedef long long ll; typedef vector<int> vi; #define MAXI (int)1e5 void exploreCave(int n){ int b[n]; for(int i = 1;i<=n;i++){ b[i-1] = i; } int s[n]; for(int i = 0;i<n;i++) s[i] = 0; for(int i = 1;i<=n;i++){ if(tryCombination(s) != i+1){ s[i] = 1-s[i]; } } answer(s,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...