oj.uz

Submission #933595

# Submission time Handle Problem Language Result Execution time Memory
933595 2024-02-26T00:54:00 Z vjudge1 Speedrun (RMI21_speedrun) C++17
21 / 100
 23 ms 1692 KB 
#include <bits/stdc++.h>
#include "speedrun.h"
using namespace std;

bool vis[10000];

void dfs(int x, int p, int N) {

    vis[x] = true;

    for(int i=1; i<=N; i++) {
       
        if(getHint(i) && !vis[i]) {
            goTo(i);
            dfs(i, x, N);
        }
    }

    goTo(p);

}

void assignHints(int subtask, int N, int A[], int B[]) {

    setHintLen(N);

    for(int i=1; i<N; i++) {
        setHint(A[i], B[i], true);
        setHint(B[i], A[i], true);
    }

}

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1212 KB Output is correct
2 Correct 23 ms 1288 KB Output is correct
3 Correct 22 ms 1288 KB Output is correct
4 Correct 21 ms 1692 KB Output is correct

Subtask #2
0.0 / 8.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 #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 1 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 -