oj.uz

Submission #168206

# Submission time Handle Problem Language Result Execution time Memory
168206 2019-12-12T02:34:02 Z Leonardo_Paes Railway (BOI17_railway) C++17
100 / 100
 669 ms 32256 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

int n, m, k;

int pai[maxn], nivel[maxn], siz[maxn], in[maxn], t;

int chain[maxn], head[maxn], pos[maxn], c, qtd;

int tree[4*maxn], lazy[4*maxn];

map<pair<int,int>,int> edges;

vector<int> grafo[maxn];

void dfs(int u, int p){
    siz[u] = 1, in[u] = ++t;

    for(int i=0; i<grafo[u].size(); i++){
        int v = grafo[u][i];

        if(v==p) continue;

        pai[v] = u, nivel[v] = nivel[u] + 1;

        dfs(v, u);

        siz[v] += siz[u];
    }
}

void flush(int node, int l, int r){
    tree[node] += lazy[node] * (r-l+1);

    if(l!=r){
        lazy[2*node] += lazy[node];
        lazy[2*node+1] += lazy[node];
    }

    lazy[node] = 0;
}

void update_tree(int node, int tl, int tr, int l, int r, int val){
    flush(node, tl, tr);

    if(tl > r or tr < l) return;

    if(tl >= l and tr <= r){
        lazy[node] += val;
        flush(node, tl, tr);
        return;
    }

    int mid = (tl + tr) >> 1;

    update_tree(2*node, tl, mid, l, r, val), update_tree(2*node+1, mid+1, tr, l, r, val);

    tree[node] = tree[2*node] + tree[2*node+1];
}

int query_tree(int node, int tl, int tr, int l, int r){
    flush(node, tl, tr);
    if(tl > r or tr < l) return 0;

    if(tl >= l and tr <= r) return tree[node];

    int mid = (tl + tr) >> 1;

    return query_tree(2*node, tl, mid, l, r) + query_tree(2*node+1, mid+1, tr, l, r);
}

void hld(int u){
    if(!head[c]) head[c] = u;

    chain[u] = c, pos[u] = ++qtd;

    int maior = -1, id = -1;

    for(int i=0; i<grafo[u].size(); i++){
        int v = grafo[u][i];
        if(v!=pai[u] and siz[v] > maior){
            maior = siz[v], id = v;
        }
    }

    if(id!=-1) hld(id);

    for(int i=0; i<grafo[u].size(); i++){
        int v = grafo[u][i];
        if(v!=pai[u] and v!=id){
            c++;
            hld(v);
        }
    }
}

int lca(int u, int v){
    while(chain[u] != chain[v]){
        if(nivel[head[chain[u]]] > nivel[head[chain[v]]]) u = pai[head[chain[u]]];
        else v = pai[head[chain[v]]];
    }

    return (nivel[u] < nivel[v] ? u : v);
}

void update(int u, int v){
    int l = lca(u, v);

    while(chain[u] != chain[l]){
        update_tree(1, 1, n, pos[head[chain[u]]], pos[u], 1);
        u = pai[head[chain[u]]];
    }

    if(u!=l) update_tree(1, 1, n, pos[l]+1, pos[u], 1);
}

int query(int u){
    //cout << query_tree(1, 1, n, pos[u], pos[u]) << endl;
    return (query_tree(1, 1, n, pos[u], pos[u]) >= k);
}

bool compara(int u, int v){
    return in[u] < in[v];
}

int main(){
    //ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

    cin >> n >> m >> k;

    int tempo = 0;

    for(int i=1; i<n; i++){
        int u, v;

        cin >> u >> v;

        grafo[u].push_back(v);
        grafo[v].push_back(u);

        edges[{u, v}] = ++tempo;
        edges[{v, u}] = tempo;
    }

    dfs(1, 0);

    hld(1);

    for(int i=1; i<=m; i++){
        int s;

        cin >> s;

        vector<int> atuais;

        int last;

        for(int j=1; j<=s; j++){
            int u;

            cin >> u;

            atuais.push_back(u);

            if(j==2) last = lca(atuais[j-1], atuais[j-2]);
            else if(j>=3) last = lca(last, atuais[j-1]);
        }

        sort(atuais.begin(), atuais.end(), compara);

        for(int j=0; j<atuais.size(); j++){
            update(atuais[j], last);
            last = atuais[j];
        }
    }

    vector<int> ans;

    for(int i=2; i<=n; i++){
        if(query(i)){
            ans.push_back(edges[{i, pai[i]}]);
        }
    }

    sort(ans.begin(), ans.end());

    cout << ans.size() << endl;

    for(int i=0; i<ans.size(); i++){
        cout << ans[i] << " ";
    }

    cout << endl;

    return 0;
}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<grafo[u].size(); i++){
                  ~^~~~~~~~~~~~~~~~
railway.cpp: In function 'void hld(int)':
railway.cpp:82:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<grafo[u].size(); i++){
                  ~^~~~~~~~~~~~~~~~
railway.cpp:91:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<grafo[u].size(); i++){
                  ~^~~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:174:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<atuais.size(); j++){
                      ~^~~~~~~~~~~~~~
railway.cpp:192:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<ans.size(); i++){
                  ~^~~~~~~~~~~
railway.cpp:159:13: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
         int last;
             ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 26 ms 4728 KB Output is correct
3 Correct 26 ms 4856 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 25 ms 5244 KB Output is correct
7 Correct 26 ms 4984 KB Output is correct
8 Correct 23 ms 4908 KB Output is correct
9 Correct 26 ms 4908 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 26 ms 4728 KB Output is correct
3 Correct 26 ms 4856 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 25 ms 5244 KB Output is correct
7 Correct 26 ms 4984 KB Output is correct
8 Correct 23 ms 4908 KB Output is correct
9 Correct 26 ms 4908 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 103 ms 5240 KB Output is correct
16 Correct 103 ms 5368 KB Output is correct
17 Correct 105 ms 5428 KB Output is correct
18 Correct 28 ms 5240 KB Output is correct
19 Correct 27 ms 4984 KB Output is correct
20 Correct 99 ms 5496 KB Output is correct
21 Correct 100 ms 5468 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 26 ms 4856 KB Output is correct
24 Correct 26 ms 4856 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 26 ms 5340 KB Output is correct
28 Correct 26 ms 4992 KB Output is correct
29 Correct 23 ms 4984 KB Output is correct
30 Correct 26 ms 4984 KB Output is correct
31 Correct 5 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 5 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 393 ms 29936 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 357 ms 29580 KB Output is correct
4 Correct 343 ms 29016 KB Output is correct
5 Correct 380 ms 29976 KB Output is correct
6 Correct 407 ms 30060 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 26100 KB Output is correct
2 Correct 466 ms 23388 KB Output is correct
3 Correct 514 ms 23224 KB Output is correct
4 Correct 535 ms 23260 KB Output is correct
5 Correct 517 ms 23040 KB Output is correct
6 Correct 377 ms 26264 KB Output is correct
7 Correct 370 ms 26240 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 26100 KB Output is correct
2 Correct 466 ms 23388 KB Output is correct
3 Correct 514 ms 23224 KB Output is correct
4 Correct 535 ms 23260 KB Output is correct
5 Correct 517 ms 23040 KB Output is correct
6 Correct 377 ms 26264 KB Output is correct
7 Correct 370 ms 26240 KB Output is correct
8 Correct 383 ms 26268 KB Output is correct
9 Correct 381 ms 26284 KB Output is correct
10 Correct 391 ms 30076 KB Output is correct
11 Correct 374 ms 30160 KB Output is correct
12 Correct 310 ms 23544 KB Output is correct
13 Correct 310 ms 24952 KB Output is correct
14 Correct 473 ms 24888 KB Output is correct
15 Correct 565 ms 24936 KB Output is correct
16 Correct 595 ms 25080 KB Output is correct
17 Correct 565 ms 24952 KB Output is correct
18 Correct 607 ms 25084 KB Output is correct
19 Correct 443 ms 25208 KB Output is correct
20 Correct 386 ms 28232 KB Output is correct
21 Correct 392 ms 28280 KB Output is correct
22 Correct 392 ms 28464 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 26 ms 4728 KB Output is correct
3 Correct 26 ms 4856 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 25 ms 5244 KB Output is correct
7 Correct 26 ms 4984 KB Output is correct
8 Correct 23 ms 4908 KB Output is correct
9 Correct 26 ms 4908 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 103 ms 5240 KB Output is correct
16 Correct 103 ms 5368 KB Output is correct
17 Correct 105 ms 5428 KB Output is correct
18 Correct 28 ms 5240 KB Output is correct
19 Correct 27 ms 4984 KB Output is correct
20 Correct 99 ms 5496 KB Output is correct
21 Correct 100 ms 5468 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 26 ms 4856 KB Output is correct
24 Correct 26 ms 4856 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 26 ms 5340 KB Output is correct
28 Correct 26 ms 4992 KB Output is correct
29 Correct 23 ms 4984 KB Output is correct
30 Correct 26 ms 4984 KB Output is correct
31 Correct 5 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 5 ms 2680 KB Output is correct
36 Correct 393 ms 29936 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 357 ms 29580 KB Output is correct
39 Correct 343 ms 29016 KB Output is correct
40 Correct 380 ms 29976 KB Output is correct
41 Correct 407 ms 30060 KB Output is correct
42 Correct 372 ms 26100 KB Output is correct
43 Correct 466 ms 23388 KB Output is correct
44 Correct 514 ms 23224 KB Output is correct
45 Correct 535 ms 23260 KB Output is correct
46 Correct 517 ms 23040 KB Output is correct
47 Correct 377 ms 26264 KB Output is correct
48 Correct 370 ms 26240 KB Output is correct
49 Correct 383 ms 26268 KB Output is correct
50 Correct 381 ms 26284 KB Output is correct
51 Correct 391 ms 30076 KB Output is correct
52 Correct 374 ms 30160 KB Output is correct
53 Correct 310 ms 23544 KB Output is correct
54 Correct 310 ms 24952 KB Output is correct
55 Correct 473 ms 24888 KB Output is correct
56 Correct 565 ms 24936 KB Output is correct
57 Correct 595 ms 25080 KB Output is correct
58 Correct 565 ms 24952 KB Output is correct
59 Correct 607 ms 25084 KB Output is correct
60 Correct 443 ms 25208 KB Output is correct
61 Correct 386 ms 28232 KB Output is correct
62 Correct 392 ms 28280 KB Output is correct
63 Correct 392 ms 28464 KB Output is correct
64 Correct 387 ms 28232 KB Output is correct
65 Correct 653 ms 24952 KB Output is correct
66 Correct 669 ms 24820 KB Output is correct
67 Correct 528 ms 24796 KB Output is correct
68 Correct 330 ms 24888 KB Output is correct
69 Correct 337 ms 24872 KB Output is correct
70 Correct 443 ms 28496 KB Output is correct
71 Correct 445 ms 28024 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 30 ms 4856 KB Output is correct
74 Correct 31 ms 4856 KB Output is correct
75 Correct 5 ms 2680 KB Output is correct
76 Correct 4 ms 2680 KB Output is correct
77 Correct 29 ms 5240 KB Output is correct
78 Correct 28 ms 4984 KB Output is correct
79 Correct 23 ms 4984 KB Output is correct
80 Correct 26 ms 4984 KB Output is correct
81 Correct 4 ms 2680 KB Output is correct
82 Correct 4 ms 2680 KB Output is correct
83 Correct 4 ms 2680 KB Output is correct
84 Correct 4 ms 2680 KB Output is correct
85 Correct 4 ms 2680 KB Output is correct
86 Correct 103 ms 5320 KB Output is correct
87 Correct 104 ms 5368 KB Output is correct
88 Correct 103 ms 5368 KB Output is correct
89 Correct 28 ms 5240 KB Output is correct
90 Correct 27 ms 4984 KB Output is correct
91 Correct 100 ms 5496 KB Output is correct
92 Correct 103 ms 5496 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 367 ms 31812 KB Output is correct
95 Correct 360 ms 31540 KB Output is correct
96 Correct 341 ms 30908 KB Output is correct
97 Correct 388 ms 31984 KB Output is correct
98 Correct 410 ms 32256 KB Output is correct
99 Correct 600 ms 24824 KB Output is correct
100 Correct 598 ms 24900 KB Output is correct
101 Correct 614 ms 24856 KB Output is correct
102 Correct 465 ms 25080 KB Output is correct
103 Correct 375 ms 28056 KB Output is correct
104 Correct 425 ms 28408 KB Output is correct
105 Correct 384 ms 27940 KB Output is correct
106 Correct 382 ms 28260 KB Output is correct
107 Correct 386 ms 28148 KB Output is correct
108 Correct 385 ms 31900 KB Output is correct
109 Correct 379 ms 31856 KB Output is correct
110 Correct 336 ms 25072 KB Output is correct
111 Correct 324 ms 24916 KB Output is correct
112 Correct 493 ms 24952 KB Output is correct
113 Correct 498 ms 25044 KB Output is correct