Submission #852532

#TimeUsernameProblemLanguageResultExecution timeMemory
852532muratcepedaCave (IOI13_cave)C++17
12 / 100
8 ms520 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int arr[N], puerta[N]; int ayu = 0; for(int i = 0; i < N; ++i){ arr[i] = 0; puerta[i] = i; } for(int i = 0; i < N; ++i){ ayu = tryCombination(arr); if(ayu == -1) break; arr[ayu] = 1; } answer(arr, puerta); }
#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...