제출 #1338816

#제출 시각아이디문제언어결과실행 시간메모리
1338816rafsanamin2020Speedrun (RMI21_speedrun)C++20
21 / 100
13 ms588 KiB
#include "speedrun.h"
#include <bits/stdc++.h>

using namespace std;

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], 1);
    setHint(B[i], A[i], 1);
  }
}

void dfs(int x, int prev, int N, vector<bool> &visited)
{
  if (visited[x])
    return;

  visited[x] = true;

  if (prev != 0)
  {
    goTo(x);
  }

  for (int i = 1; i <= N; i++)
  {
    bool adj = getHint(i);
    if (adj)
    {
      dfs(i, x, N, visited);
    }
  }

  if (prev != 0)
  {
    goTo(prev);
  }
}

void speedrun(int subtask, int N, int start)
{

  vector<bool> visited(N + 1, false);

  dfs(start, 0, N, visited);
}
#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...