제출 #1333685

#제출 시각아이디문제언어결과실행 시간메모리
1333685eri16Speedrun (RMI21_speedrun)C++20
0 / 100
5 ms416 KiB
#include <bits/stdc++.h>
#include "speedrun.h"

using namespace std;

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

void dfs(int node, int parent, int N){
    
    for (int i=1; i<=N; i++){
        if (getHint(i)){
            if (i!=parent){
                goTo(i);
            }
        }
    }
    if (parent!=0){goTo(parent);}
}

void speedrun(int subtask, int N, int start){
    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...