Submission #871876

#	Time	Username	Problem	Language	Result	Execution time	Memory
871876		Mr_Ph	Speedrun (RMI21_speedrun)	C++14	0 / 100	6 ms	1968 KiB

speedrun

#include "speedrun.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int lol,st;
vector<vector<int>>adj;
void assignHints(int subtask, int n, int a[], int b[]) {
    setHintLen(20);
    adj.resize(n+1);
   // cout<<"HI"<<endl;
    for(int i=1;i<n;i++)
    {
        adj[a[i]].push_back(b[i]);
        setHint(a[i],1,1);
        adj[b[i]].push_back(a[i]);
    }
    lol=n;
}
void dfs(int node,int parent,int start,int n)
{
    //cout<<node<<endl;
    for(auto i:adj[node])
    {
        if(i==parent)continue;
            goTo(i);
            dfs(i,node,start,n);
    }
    if(node!=start)
        goTo(parent);
}
void speedrun(int subtask, int n, int start) { /* your solution here */
    st=start;
    dfs(st,0,st,n);
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 8
• Subtask 3: 0 / 19
• Subtask 4: 0 / 12
• Subtask 5: 0 / 40