# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
736976 |
2023-05-06T11:59:27 Z |
jk410 |
Speedrun (RMI21_speedrun) |
C++17 |
|
43 ms |
688 KB |
#include "speedrun.h"
void assignHints(int subtask, int N, int A[], int B[]) {
setHintLen(N);
for (int i = 1; i < N; i++) {
setHint(A[i], B[i], 1);
setHint(B[i], A[i], 1);
}
}
void dfs(int v, int par, int n) {
for (int i = 1; i <= n; i++) {
if (i == par)
continue;
if (getHint(i)) {
goTo(i);
dfs(i, v, n);
}
}
if (par)
goTo(par);
}
void speedrun(int subtask, int N, int start) {
dfs(start, 0, N);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
636 KB |
Output is correct |
2 |
Correct |
39 ms |
688 KB |
Output is correct |
3 |
Correct |
43 ms |
632 KB |
Output is correct |
4 |
Correct |
32 ms |
544 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
The length is too large |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
The length is too large |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
The length is too large |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
The length is too large |
2 |
Halted |
0 ms |
0 KB |
- |