제출 #554943

#제출 시각아이디문제언어결과실행 시간메모리
554943biggSpeedrun (RMI21_speedrun)C++14
0 / 100
16 ms584 KiB
#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 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...