# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856769 | iulia_morariu | Speedrun (RMI21_speedrun) | C++14 | 0 ms | 0 KiB |
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>
void assignHints (int subtask , int N, int A[], int B[]){
vector <vector <int>> v[N + 1];
setHintLen( N );
for(int i = 1; i < N; i++){
setHint( A[i], B[i], 1);
setHint( B[i], A[i], 1);
}
}
int vis[1001];
void dfs(int nd, int n){
vis[nd] = 1;
//cout << "Suntem la " << nd << endl;
for(int i = 1; i <= n; i++){
if( vis[i] || getHint(i) == 0 ) continue;
//cout << " -- > i = " << i << " getHint = " << getHint(i) << endl;
goTo(i);
vis[i] = 1;
dfs(i, n);
goTo(nd);
}
}
void speedrun(int subtask , int N, int start ){
for(int i = 0; i <= N; i++) vis[i] = 0;
vis[start] = 1;
stack<int> s;
s.push(start);
dfs(start, N);
}