oj.uz

Submission #991678

# Submission time Handle Problem Language Result Execution time Memory
991678 2024-06-02T19:11:18 Z Abito Speedrun (RMI21_speedrun) C++17
0 / 100
 6 ms 684 KB 
#include "speedrun.h"
#include <bits/stdc++.h>
using namespace std;
const int NN=1005;
bool vis[NN];
int n;
void dfs(int x,int p){
    //cout<<x<<' '<<p<<endl;
    vis[x]=1;
    for (int i=1;i<=n;i++){
        if (vis[i]) continue;
        if (!getHint(i)) continue;
        goTo(i);
        dfs(i,x);
    }
    if (p) goTo(p);
    return;
}
void assignHints(int subtask, int N, int A[], int B[]) {
    n=N;
    setHintLen(n);
    for (int i=1;i<n;i++){
        setHint(A[i],B[i],1);
        setHint(B[i],A[i],1);
    }return;
}

void speedrun(int subtask, int N, int start) {
    dfs(start,0);
    return;
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 684 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -