# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871862 | Mr_Ph | 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 "speedrun.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int lol,st;
void assignHints(int subtask, int n, int a[], int b[]) {
setHintLen(n);
for(int i=0;i<n-1;i++)
{
setHint(a[i],b[i],1);
setHint(b[i],a[i],1);
}
lol=0;
}
void dfs(int node,int parent)
{
for(int i=1;i<=lol;i++)
{
if(i==parent)continue;
if(getHint(node,i))
{
goTo(i);
dfs(i,node);
}
}
if(node!=st)
goTo(parent);
}
void speedrun(int subtask, int n, int start) { /* your solution here */
st=start;
dfs(st,0);
}