| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1249171 | sliviu | Speedrun (RMI21_speedrun) | C++20 | 13 ms | 596 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 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... | ||||
