Submission #869249

#TimeUsernameProblemLanguageResultExecution timeMemory
869249MinaRagy06Speedrun (RMI21_speedrun)C++17
21 / 100
25 ms1708 KiB
#include <bits/stdc++.h> #ifdef MINA #include "grader.cpp" #endif #include "speedrun.h" using namespace std; typedef int64_t ll; void assignHints(int subtask, int n, int a[], int b[]) { if (subtask == 1) { vector<int> adj[n + 1]; for (int i = 1; i < n; i++) { adj[a[i]].push_back(b[i]); adj[b[i]].push_back(a[i]); } setHintLen(n); for (int i = 1; i <= n; i++) { for (auto nxt : adj[i]) { setHint(i, nxt, 1); } } } } void dfs(int i, int par, int n) { for (int nxt = 1; nxt <= n; nxt++) { if (nxt == par) continue; if (getHint(nxt)) { goTo(nxt); dfs(nxt, i, n); } } if (par) goTo(par); } void speedrun(int subtask, int n, int start) { if (subtask == 1) { dfs(start, 0, n); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...