oj.uz

Submission #973605

# Submission time Handle Problem Language Result Execution time Memory
973605 2024-05-02T08:26:21 Z steveonalex Speedrun (RMI21_speedrun) C++17
0 / 100
 3500 ms 344 KB 
#include <bits/stdc++.h>
#include "speedrun.h"


using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1001;

namespace Sub1{
    void assignHints (int subtask, int n, int A[], int B[]){
        vector<vector<int>> graph(n+1);
        for(int i = 1; i<=n-1; ++i){
            int u = A[i], v = B[i];
            graph[u].push_back(v);
            graph[v].push_back(u);
        }

        setHintLen(n);
        for(int i = 1; i<=n; ++i){
            for(int j: graph[i]){
                setHint(i, j, 1);
            }
        }
    }

    int hint_length;
    bool visited[N];

    void dfs(int u, int p){
        visited[u] = true;
        for(int j = 1; j <= hint_length; ++j) if (!visited[j] && getHint(j)){
            goTo(j);
            dfs(j, u);
        }
        if (p != u) goTo(p);
    }


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

}

void assignHints (int subtask, int n, int A[], int B[]){
    assignHints(subtask, n, A, B);
    // vector<vector<int>> graph(n+1);
    // for(int i = 1; i<=n-1; ++i){
    //     int u = A[i], v = B[i];
    //     graph[u].push_back(v);
    //     graph[v].push_back(u);
    // }

    // setHintLen(n);
    // for(int i = 1; i<=n; ++i){
    //     for(int j: graph[i]){
    //         setHint(i, j, 1);
    //     }
    // }
}



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

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     return 0;
// }

Subtask #1
0.0 / 21.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 19.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 40.0

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