oj.uz

Submission #503655

# Submission time Handle Problem Language Result Execution time Memory
503655 2022-01-08T14:25:46 Z blue Speedrun (RMI21_speedrun) C++17
0 / 100
 3500 ms 4168 KB 
#include "speedrun.h"
#include <vector>
#include <algorithm>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
const int maxN = 1'000;

void assignHints(int subtask, int N, int A[], int B[])
{
    setHintLen(N);
    vvi edg(1+N, vi(1+N, 0));
    for(int e = 1; e <= N-1; e++)
        edg[A[e]][B[e]] = edg[B[e]][A[e]] = 1;

    for(int u = 1; u <= N; u++)
        for(int v = 1; v <= N; v++)
            setHint(u, v, edg[u][v]);
}

int N;
vi visit(1+maxN, 0);

void dfs(int u)
{
    visit[u] = 1;

    for(int v = 1; v <= N; v++)
    {
        if(visit[v]) continue;
        if(getHint(v))
        {
            goTo(v);
            dfs(v);
            goTo(u);
        }
    }
}

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

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3532 ms 4168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 328 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 320 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 336 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 200 KB The length is too large
2 Halted 0 ms 0 KB -