Submission #871869

#TimeUsernameProblemLanguageResultExecution timeMemory
871869Mr_PhSpeedrun (RMI21_speedrun)C++14
0 / 100
10 ms744 KiB
#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); // cout<<"HI"<<endl; for(int i=1;i<n;i++) { setHint(a[i],b[i],1); setHint(b[i],a[i],1); } lol=n; } void dfs(int node,int parent) { for(int i=1;i<=lol;i++) { if(i==parent)continue; if(getHint(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); }
#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...