제출 #1249171

#제출 시각아이디문제언어결과실행 시간메모리
1249171sliviuSpeedrun (RMI21_speedrun)C++20
21 / 100
13 ms596 KiB
#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...