# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699827 | 2023-02-18T05:24:11 Z | Nursik | Speedrun (RMI21_speedrun) | C++14 | 20 ms | 696 KB |
#include "speedrun.h" #include <iostream> #include <fstream> #include <iomanip> #include <vector> #include <set> #include <map> #include <cstring> #include <string> #include <cmath> #include <cassert> #include <ctime> #include <algorithm> #include <sstream> #include <list> #include <queue> #include <deque> #include <stack> #include <cstdlib> #include <cstdio> #include <iterator> #include <functional> #include <unordered_set> #include <unordered_map> #include <stdio.h> #include <bitset> using namespace std; void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */ setHintLen(N); for (int i = 1; i < N; ++i){ int x = A[i], y = B[i]; // setHint(x, y - 1, 1); // setHint(y, x - 1, 1); } } void dfs(int v, int p, int sz){ for (int j = 1; j <= sz; ++j){ if (j != p){ int z = goTo(j); if (z == 1){ dfs(j, v, sz); } } } if (p){ goTo(p); } } void speedrun(int subtask, int N, int start) { /* your solution here */ dfs(start, 0, N); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 696 KB | Used too many wrong interactions |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 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 | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | The length is too large |
2 | Halted | 0 ms | 0 KB | - |