# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
504698 | SanguineChameleon | Speedrun (RMI21_speedrun) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "speedrun.h"
void dfs1(int u, int N, bool flag[]) {
for (int i = 1; i <= N; i++) {
if (getHint(i) && !flag[i]) {
flag[i] = true;
goTo(i);
dfs1(i, N, flag);
goTo(u);
}
}
}
void ass1(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 speed1(int N, int start) {
bool flag[N];
fill_n(flag, N, false);
dfs1(start, N, flag);
}
void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
if (subtask == 1) {
ass1(N, A, B);
}
}
void speedrun(int subtask, int N, int start) { /* your solution here */
if (subtask == 1) {
speed1(N, start);
}
}