#include "speedrun.h"
#include <bits/stdc++.h>
using namespace std;
int arr[1005][1005];
void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
if (subtask == 1){
for (int i = 1; i < N; i++){
arr[A[i]][B[i]] = arr[B[i]][A[i]] = 0;
}
setHintLen(N);
for (int i = 1; i <= N; i++){
for (int j = 1; j <= N; j++){
if (arr[i][j]) setHint(i,j,arr[i][j]);
}
}
}
}
int n;
int vis[1005];
vector<int> G[1005];
void getG(int u){
for (int i = 1; i <= n; i++){
if (getHint(i)){
G[u].push_back(i);
}
}
}
void dfs(int u, int p){
getG(u);
for (auto v : G[u]){
if (v == p) continue;
goTo(v);
dfs(v, u);
}
goTo(p);
}
void speedrun(int subtask, int N, int start) { /* your solution here */
n = N;
if (subtask == 1){
dfs(start, -1);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
4468 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
setHintLen was never called |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
setHintLen was never called |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
setHintLen was never called |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
336 KB |
setHintLen was never called |
2 |
Halted |
0 ms |
0 KB |
- |