Submission #498666

#TimeUsernameProblemLanguageResultExecution timeMemory
498666model_codeSpeedrun (RMI21_speedrun)C++17
21 / 100
56 ms784 KiB
// speedrun_brute_tinca.cpp #include <bits/stdc++.h> #include "speedrun.h" void assignHints(int subtask, int N, int A[], int B[]) { setHintLen(N); for (int i = 1; i <= N - 1; ++i) { setHint(A[i], B[i], true); setHint(B[i], A[i], true); } } void dfs(int node, int l, int father = 0) { for (int i = 1; i <= l; ++i) { if (i != father && getHint(i)) { goTo(i); dfs(i, l, node); goTo(node); } } } void speedrun(int subtask, int N, int start) { dfs(start, getLength()); }
#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...