Submission #996979

#	Time	Username	Problem	Language	Result	Execution time	Memory
996979		3omar_ahmed	Speedrun (RMI21_speedrun)	C++17	21 / 100	25 ms	1012 KiB

speedrun

#include "speedrun.h"
// #include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;

void assignHints(int subtask, int n, int A[], int B[]) {
    setHintLen(n); 
    for(int i = 1 ; i < n ; i++) {
        int u = A[i], v = B[i];
        setHint(u, v, true);
        setHint(v, u, true);
    }
}

void solve(int node, int par, int &n) {
    for(int i = 1 ; i <= n ; i++) {
        if(i == par) continue;
        if(getHint(i)) {
            goTo(i);
            solve(i, node, n);
        }
    }
    goTo(par);
}

void speedrun(int subtask, int N, int start) {
    solve(start, start, N);
}

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