| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338816 | rafsanamin2020 | Speedrun (RMI21_speedrun) | C++20 | 13 ms | 588 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
