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>
using namespace std;
const int MAXN = 1e3 + 10;
void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
setHintLen(N);
for(int i = 1; i < N; i++ ){
setHint(A[i], B[i], 1);
setHint(B[i], A[i], 1);
}
}
int l;
void dfs(int x, int p){
for(int i = 1; i <= l; i++){
if(i == p) continue;
if(getHint(i)){
goTo(i);
}
}
goTo(p);
}
void speedrun(int subtask, int N, int start) { /* your solution here */
l = getLength();
dfs(start, start);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |