oj.uz

Submission #1038150

# Submission time Handle Problem Language Result Execution time Memory
1038150 2024-07-29T13:32:39 Z Whisper Rigged Roads (NOI19_riggedroads) C++17
100 / 100
 353 ms 92940 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;
#define MAX             300005
#define LOG             20

bool in[MAX];
struct Edge{
    int u, v;
    Edge(){}
    Edge(int _u, int _v):u(_u), v(_v){}

    int other(int x){
        return (x ^ u ^ v);
    }
} edge[MAX];

vector<int> G[MAX];

int up[MAX][21], to[MAX], dep[MAX];
void dfs(int u, int p = -1){
    for (int&i : G[u]){
        int v = edge[i].other(u);
        if(v ^ p){
            up[v][0] = u;
            dep[v] = dep[u] + 1;
            to[v] = i;
            for (int i = 1; i < LOG; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
            dfs(v, u);
        }
    }
}

int lca(int u, int v){
    if (dep[u] < dep[v]) swap(u, v);
    int dis = dep[u] - dep[v];
    for (int i = 0; MASK(i) <= dis; ++i) if(BIT(dis, i)){
        u = up[u][i];
    }
    if(u == v) return u;
    int k = __lg(dep[u]);
    for (int i = k; i >= 0; --i) if(up[u][i] != up[v][i]){
        u = up[u][i], v = up[v][i];
    }
    return up[u][0];
}


bool assigned[MAX];

int ans[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;
}

void process(void){
    cin >> numNode >> numEdge;

    for (int i = 1; i <= numEdge; ++i){
        cin >> edge[i].u >> edge[i].v;
    }

    for (int i = 1; i < numNode; ++i){
        int id; cin >> id;
        G[edge[id].u].emplace_back(id);
        G[edge[id].v].emplace_back(id);
        in[id] = true;
    }

    dfs(1);
    int label = 0;
    for (int i = 1; i <= numNode; ++i) pa[i] = i;
    for (int i = 1; i <= numEdge; ++i){
        if(assigned[i]) continue;
        assigned[i] = true;
        if(in[i]){
            ans[i] = ++label;
            if (dep[edge[i].u] < dep[edge[i].v]) swap(edge[i].u, edge[i].v);
            joint(edge[i].v, edge[i].u);
            continue;
        }

        vector<int> target;

        int anc = lca(edge[i].u, edge[i].v);
        for (int node : {edge[i].u, edge[i].v}){
            while(node != anc && dep[find(node)] >= dep[anc]){
                node = find(node);
                if(node == anc) break;

                if (to[node]) target.push_back(to[node]);
                joint(up[node][0], node);
                node = up[node][0];
            }
        }
        sort(target.begin(), target.end());

        for (int &id : target){
            if(assigned[id]) continue;
            ans[id] = ++label;
            assigned[id] = true;
        }
        ans[i] = ++label;
    }
    for (int i = 1; i <= numEdge; ++i){
        cout << ans[i] << " ";
    }
}
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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16728 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 2 ms 16732 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 41164 KB Output is correct
2 Correct 56 ms 49096 KB Output is correct
3 Correct 54 ms 26972 KB Output is correct
4 Correct 95 ms 82612 KB Output is correct
5 Correct 91 ms 85944 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 49464 KB Output is correct
2 Correct 39 ms 33512 KB Output is correct
3 Correct 21 ms 24404 KB Output is correct
4 Correct 48 ms 41820 KB Output is correct
5 Correct 23 ms 29412 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 79784 KB Output is correct
2 Correct 154 ms 88712 KB Output is correct
3 Correct 34 ms 37136 KB Output is correct
4 Correct 59 ms 48268 KB Output is correct
5 Correct 212 ms 92940 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 60108 KB Output is correct
2 Correct 74 ms 47240 KB Output is correct
3 Correct 251 ms 90448 KB Output is correct
4 Correct 285 ms 86344 KB Output is correct
5 Correct 14 ms 23668 KB Output is correct

Subtask #7
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16728 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 2 ms 16732 KB Output is correct
9 Correct 32 ms 41164 KB Output is correct
10 Correct 56 ms 49096 KB Output is correct
11 Correct 54 ms 26972 KB Output is correct
12 Correct 95 ms 82612 KB Output is correct
13 Correct 91 ms 85944 KB Output is correct
14 Correct 61 ms 49464 KB Output is correct
15 Correct 39 ms 33512 KB Output is correct
16 Correct 21 ms 24404 KB Output is correct
17 Correct 48 ms 41820 KB Output is correct
18 Correct 23 ms 29412 KB Output is correct
19 Correct 135 ms 79784 KB Output is correct
20 Correct 154 ms 88712 KB Output is correct
21 Correct 34 ms 37136 KB Output is correct
22 Correct 59 ms 48268 KB Output is correct
23 Correct 212 ms 92940 KB Output is correct
24 Correct 135 ms 60108 KB Output is correct
25 Correct 74 ms 47240 KB Output is correct
26 Correct 251 ms 90448 KB Output is correct
27 Correct 285 ms 86344 KB Output is correct
28 Correct 14 ms 23668 KB Output is correct
29 Correct 351 ms 83852 KB Output is correct
30 Correct 353 ms 86628 KB Output is correct
31 Correct 258 ms 87836 KB Output is correct
32 Correct 93 ms 28540 KB Output is correct
33 Correct 258 ms 88480 KB Output is correct