oj.uz

Submission #1051252

# Submission time Handle Problem Language Result Execution time Memory
1051252 2024-08-10T01:59:47 Z Whisper Drivers (BOI24_drivers) C++17
100 / 100
 213 ms 106324 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode, numEdge, numQuery;
#define MAX                 200005
#define LOG                     20

struct Edge{
    int u, v, w;
    Edge(){}
    Edge(int _u, int _v, int _w): u(_u), v(_v), w(_w){}

    int other(int x){
        return (x ^ u ^ v);
    }

    bool operator < (const Edge& oth) const{
        return w < oth.w;
    }
} edge[MAX];

vector<int> G[MAX];

int ID[MAX];

int pa[MAX];

int find(int u){
    return u == pa[u] ? u : pa[u] = find(pa[u]);
}
bool joint(int u, int v){
    u = find(u), v = find(v);
    if(u == v) return false;
    pa[v] = u;
    return true;
}
int cc = 1;
int up[MAX][LOG], mx[MAX][LOG];
int dep[MAX];
void pre_dfs(int u, int p = -1){
    ID[u] = cc;
    for (int&i : G[u]){
        int v = edge[i].other(u);
        if(v ^ p){
            up[v][0] = u;
            mx[v][0] = edge[i].w;
            dep[v] = dep[u] + 1;
            for (int i = 1; i < LOG; ++i){
                up[v][i] = up[up[v][i - 1]][i - 1];
                mx[v][i] = max(mx[v][i - 1], mx[up[v][i - 1]][i - 1]);
            }
            pre_dfs(v, u);
        }
    }
}

int lca(int u, int v){
    if (dep[u] < dep[v]) swap(u, v);
    int dis = dep[u] - dep[v];
    int ans = 0;
    for (int i = 0; MASK(i) <= dis; ++i){
        if (BIT(dis, i)){
            maximize(ans, mx[u][i]);
            u = up[u][i];
        }
    }
    if (u == v) return ans;
    for (int i = LOG - 1; i >= 0; --i) if(up[v][i] != up[u][i]){
        maximize(ans, mx[v][i]);
        maximize(ans, mx[u][i]);
        v = up[v][i], u = up[u][i];
    }
    maximize(ans, mx[v][0]);
    maximize(ans, mx[u][0]);
    return ans;
}
void process(void){
    cin >> numNode >> numEdge >> numQuery;
    for (int i = 1; i <= numEdge; ++i){
        cin >> edge[i].u >> edge[i].v >> edge[i].w;
    }
    for (int i = 1; i <= numNode; ++i) pa[i] = i;
    sort(edge + 1, edge + numEdge + 1);
    for (int i = 1; i <= numEdge; ++i){
        if (joint(edge[i].u, edge[i].v)){
            G[edge[i].u].emplace_back(i);
            G[edge[i].v].emplace_back(i);
        }
    }

    for (int i = 1; i <= numNode; ++i) if(!ID[i]){
        pre_dfs(i); ++cc;
    }
    for (int i = 1; i <= numQuery; ++i){
        int u, v, w; cin >> u >> v >> w;
        if (ID[u] != ID[v]){
            cout << "NE\n";
        }
        else{
            int val = lca(u, v);
            cout << (val <= w ? "TAIP\n" : "NE\n");
        }
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 45 ms 16596 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 17240 KB Output is correct
13 Correct 3 ms 17268 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 1 ms 14820 KB Output is correct
18 Correct 3 ms 16732 KB Output is correct
19 Correct 6 ms 17732 KB Output is correct
20 Correct 1 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 2 ms 16988 KB Output is correct
23 Correct 1 ms 14684 KB Output is correct
24 Correct 6 ms 20060 KB Output is correct
25 Correct 1 ms 14684 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 45 ms 16596 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 16888 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 45 ms 16596 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 3 ms 17240 KB Output is correct
18 Correct 3 ms 17268 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 1 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 1 ms 14820 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 6 ms 17732 KB Output is correct
25 Correct 1 ms 14684 KB Output is correct
26 Correct 1 ms 14684 KB Output is correct
27 Correct 2 ms 16988 KB Output is correct
28 Correct 1 ms 14684 KB Output is correct
29 Correct 6 ms 20060 KB Output is correct
30 Correct 1 ms 14684 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14940 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 3 ms 16888 KB Output is correct
36 Correct 3 ms 16988 KB Output is correct
37 Correct 1 ms 14684 KB Output is correct
38 Correct 1 ms 14684 KB Output is correct
39 Correct 2 ms 14684 KB Output is correct
40 Correct 1 ms 14684 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 45 ms 16596 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 3 ms 17240 KB Output is correct
18 Correct 3 ms 17268 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 1 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 1 ms 14820 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 6 ms 17732 KB Output is correct
25 Correct 1 ms 14684 KB Output is correct
26 Correct 1 ms 14684 KB Output is correct
27 Correct 2 ms 16988 KB Output is correct
28 Correct 1 ms 14684 KB Output is correct
29 Correct 6 ms 20060 KB Output is correct
30 Correct 1 ms 14684 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14940 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 3 ms 16888 KB Output is correct
36 Correct 3 ms 16988 KB Output is correct
37 Correct 1 ms 14684 KB Output is correct
38 Correct 1 ms 14684 KB Output is correct
39 Correct 2 ms 14684 KB Output is correct
40 Correct 1 ms 14684 KB Output is correct
41 Correct 213 ms 91476 KB Output is correct
42 Correct 9 ms 20060 KB Output is correct
43 Correct 8 ms 16480 KB Output is correct
44 Correct 12 ms 16740 KB Output is correct
45 Correct 11 ms 16476 KB Output is correct
46 Correct 8 ms 21852 KB Output is correct
47 Correct 170 ms 90452 KB Output is correct
48 Correct 10 ms 20572 KB Output is correct
49 Correct 123 ms 106324 KB Output is correct