oj.uz

Submission #764875

# Submission time Handle Problem Language Result Execution time Memory
764875 2023-06-24T06:10:21 Z vjudge1 Speedrun (RMI21_speedrun) C++17
0 / 100
 28 ms 47524 KB 
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <bitset>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include "speedrun.h"

// Akhmet Issa

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ent "\n"

const int maxn = 1e6 + 100;
const ll INF = (ll)2e18;
const int inf = (ll)2e9;
const int maxl = 20;
const int MOD = 1e9 + 7;

vector<int> g[maxn];
int used[maxn];

void assignHints(int subtask, int n, int A [], int B []){
    for(int i = 1; i < n; i++){
        g[A[i]].push_back(B[i]);
        g[B[i]].push_back(A[i]);
    }
    setHintLen(n);
    for(int i = 1; i <= n; i++){
        for(int to: g[i]){
            setHint(i, to, 1);
        }
    }
}

void dfs(int v, int n){
    used[v] = 1;
    for(int to = 1; to <= n; to++){
        if(getHint(to) && !used[to]){
            goTo(to);
            dfs(to, n);
        }
    }
}

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

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 47524 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 11 ms 23760 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 12 ms 23800 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 13 ms 23760 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 10 ms 23796 KB The length is too large
2 Halted 0 ms 0 KB -