Submission #1249172

#TimeUsernameProblemLanguageResultExecution timeMemory
1249172sliviuSpeedrun (RMI21_speedrun)C++20
21 / 100
13 ms588 KiB
#include "speedrun.h" constexpr int NMAX=1001; int N; void dfs(int node, int tt=-1) { for(int i=1;i<=N;++i) if(i!=tt && getHint(i)) { goTo(i); dfs(i, node); goTo(node); } } void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */ setHintLen(N); for(int i=1;i<N;++i) { setHint(A[i], B[i], 1); setHint(B[i], A[i], 1); } } void speedrun(int subtask, int N, int start) { /* your solution here */ ::N=N; dfs(start); }
#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...