oj.uz

Submission #996972

# Submission time Handle Problem Language Result Execution time Memory
996972 2024-06-11T14:22:34 Z 3omar_ahmed Speedrun (RMI21_speedrun) C++17
21 / 100
 24 ms 1152 KB 
#include "speedrun.h"
// #include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;

void assignHints(int subtask, int n, int A[], int B[]) {
    setHintLen(n); 
    for(int i = 1 ; i < n ; i++) {
        int u = A[i], v = B[i];
        setHint(u, v, true);
        setHint(v, u, true);
    }
}

void solve(int node, int par, int &n) {
    for(int i = 1 ; i <= n ; i++) {
        if(i == par) continue;
        if(getHint(i)) {
            goTo(i);
            solve(i, node, n);
            goTo(node);
        }
    }
}

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1020 KB Output is correct
2 Correct 24 ms 928 KB Output is correct
3 Correct 22 ms 1152 KB Output is correct
4 Correct 20 ms 904 KB Output is correct

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 1 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 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -