oj.uz

Submission #168209

# Submission time Handle Problem Language Result Execution time Memory
168209 2019-12-12T02:39:07 Z Leonardo_Paes Railway (BOI17_railway) C++11
100 / 100
 504 ms 30196 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){
    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() << "\n";
 
    for(int i=0; i<ans.size(); i++){
        cout << ans[i] << " ";
    }
 
    cout << "\n";
 
    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:173:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<atuais.size(); j++){
                      ~^~~~~~~~~~~~~~
railway.cpp:191:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<ans.size(); i++){
                  ~^~~~~~~~~~~
railway.cpp:158: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 19 ms 4856 KB Output is correct
3 Correct 19 ms 4856 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 19 ms 5240 KB Output is correct
7 Correct 19 ms 4856 KB Output is correct
8 Correct 16 ms 4856 KB Output is correct
9 Correct 19 ms 4860 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2684 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 19 ms 4856 KB Output is correct
3 Correct 19 ms 4856 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 19 ms 5240 KB Output is correct
7 Correct 19 ms 4856 KB Output is correct
8 Correct 16 ms 4856 KB Output is correct
9 Correct 19 ms 4860 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 70 ms 4856 KB Output is correct
16 Correct 72 ms 4856 KB Output is correct
17 Correct 72 ms 4856 KB Output is correct
18 Correct 19 ms 5240 KB Output is correct
19 Correct 20 ms 4856 KB Output is correct
20 Correct 62 ms 5036 KB Output is correct
21 Correct 64 ms 4916 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 19 ms 4856 KB Output is correct
24 Correct 19 ms 4728 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 18 ms 5240 KB Output is correct
28 Correct 19 ms 4856 KB Output is correct
29 Correct 16 ms 4856 KB Output is correct
30 Correct 19 ms 4856 KB Output is correct
31 Correct 4 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 4 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 29876 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 231 ms 29684 KB Output is correct
4 Correct 219 ms 29048 KB Output is correct
5 Correct 271 ms 30052 KB Output is correct
6 Correct 300 ms 30064 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 26096 KB Output is correct
2 Correct 317 ms 23336 KB Output is correct
3 Correct 372 ms 23164 KB Output is correct
4 Correct 415 ms 23008 KB Output is correct
5 Correct 399 ms 23032 KB Output is correct
6 Correct 250 ms 26236 KB Output is correct
7 Correct 247 ms 26104 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 26096 KB Output is correct
2 Correct 317 ms 23336 KB Output is correct
3 Correct 372 ms 23164 KB Output is correct
4 Correct 415 ms 23008 KB Output is correct
5 Correct 399 ms 23032 KB Output is correct
6 Correct 250 ms 26236 KB Output is correct
7 Correct 247 ms 26104 KB Output is correct
8 Correct 267 ms 26264 KB Output is correct
9 Correct 257 ms 26232 KB Output is correct
10 Correct 266 ms 30192 KB Output is correct
11 Correct 258 ms 30192 KB Output is correct
12 Correct 219 ms 23600 KB Output is correct
13 Correct 209 ms 23672 KB Output is correct
14 Correct 365 ms 23044 KB Output is correct
15 Correct 364 ms 23032 KB Output is correct
16 Correct 454 ms 23160 KB Output is correct
17 Correct 431 ms 23160 KB Output is correct
18 Correct 474 ms 23160 KB Output is correct
19 Correct 320 ms 23416 KB Output is correct
20 Correct 248 ms 26524 KB Output is correct
21 Correct 256 ms 26612 KB Output is correct
22 Correct 251 ms 26544 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 19 ms 4856 KB Output is correct
3 Correct 19 ms 4856 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 19 ms 5240 KB Output is correct
7 Correct 19 ms 4856 KB Output is correct
8 Correct 16 ms 4856 KB Output is correct
9 Correct 19 ms 4860 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 70 ms 4856 KB Output is correct
16 Correct 72 ms 4856 KB Output is correct
17 Correct 72 ms 4856 KB Output is correct
18 Correct 19 ms 5240 KB Output is correct
19 Correct 20 ms 4856 KB Output is correct
20 Correct 62 ms 5036 KB Output is correct
21 Correct 64 ms 4916 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 19 ms 4856 KB Output is correct
24 Correct 19 ms 4728 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 18 ms 5240 KB Output is correct
28 Correct 19 ms 4856 KB Output is correct
29 Correct 16 ms 4856 KB Output is correct
30 Correct 19 ms 4856 KB Output is correct
31 Correct 4 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 4 ms 2680 KB Output is correct
36 Correct 250 ms 29876 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 231 ms 29684 KB Output is correct
39 Correct 219 ms 29048 KB Output is correct
40 Correct 271 ms 30052 KB Output is correct
41 Correct 300 ms 30064 KB Output is correct
42 Correct 247 ms 26096 KB Output is correct
43 Correct 317 ms 23336 KB Output is correct
44 Correct 372 ms 23164 KB Output is correct
45 Correct 415 ms 23008 KB Output is correct
46 Correct 399 ms 23032 KB Output is correct
47 Correct 250 ms 26236 KB Output is correct
48 Correct 247 ms 26104 KB Output is correct
49 Correct 267 ms 26264 KB Output is correct
50 Correct 257 ms 26232 KB Output is correct
51 Correct 266 ms 30192 KB Output is correct
52 Correct 258 ms 30192 KB Output is correct
53 Correct 219 ms 23600 KB Output is correct
54 Correct 209 ms 23672 KB Output is correct
55 Correct 365 ms 23044 KB Output is correct
56 Correct 364 ms 23032 KB Output is correct
57 Correct 454 ms 23160 KB Output is correct
58 Correct 431 ms 23160 KB Output is correct
59 Correct 474 ms 23160 KB Output is correct
60 Correct 320 ms 23416 KB Output is correct
61 Correct 248 ms 26524 KB Output is correct
62 Correct 256 ms 26612 KB Output is correct
63 Correct 251 ms 26544 KB Output is correct
64 Correct 250 ms 26396 KB Output is correct
65 Correct 484 ms 23232 KB Output is correct
66 Correct 440 ms 23032 KB Output is correct
67 Correct 391 ms 23288 KB Output is correct
68 Correct 245 ms 23772 KB Output is correct
69 Correct 234 ms 23676 KB Output is correct
70 Correct 275 ms 26740 KB Output is correct
71 Correct 261 ms 26148 KB Output is correct
72 Correct 4 ms 2808 KB Output is correct
73 Correct 20 ms 4856 KB Output is correct
74 Correct 19 ms 4728 KB Output is correct
75 Correct 4 ms 2680 KB Output is correct
76 Correct 4 ms 2808 KB Output is correct
77 Correct 18 ms 5240 KB Output is correct
78 Correct 18 ms 4856 KB Output is correct
79 Correct 16 ms 4856 KB Output is correct
80 Correct 19 ms 4856 KB Output is correct
81 Correct 4 ms 2808 KB Output is correct
82 Correct 4 ms 2808 KB Output is correct
83 Correct 4 ms 2812 KB Output is correct
84 Correct 4 ms 2808 KB Output is correct
85 Correct 4 ms 2808 KB Output is correct
86 Correct 69 ms 4856 KB Output is correct
87 Correct 72 ms 4984 KB Output is correct
88 Correct 70 ms 4984 KB Output is correct
89 Correct 19 ms 5112 KB Output is correct
90 Correct 19 ms 4856 KB Output is correct
91 Correct 62 ms 4984 KB Output is correct
92 Correct 65 ms 4856 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 247 ms 29940 KB Output is correct
95 Correct 227 ms 29684 KB Output is correct
96 Correct 226 ms 29052 KB Output is correct
97 Correct 273 ms 30064 KB Output is correct
98 Correct 276 ms 30188 KB Output is correct
99 Correct 456 ms 23032 KB Output is correct
100 Correct 504 ms 23124 KB Output is correct
101 Correct 459 ms 23032 KB Output is correct
102 Correct 342 ms 23364 KB Output is correct
103 Correct 245 ms 26232 KB Output is correct
104 Correct 254 ms 26568 KB Output is correct
105 Correct 247 ms 26232 KB Output is correct
106 Correct 256 ms 26488 KB Output is correct
107 Correct 249 ms 26300 KB Output is correct
108 Correct 264 ms 30196 KB Output is correct
109 Correct 266 ms 30196 KB Output is correct
110 Correct 258 ms 23672 KB Output is correct
111 Correct 225 ms 23672 KB Output is correct
112 Correct 360 ms 23152 KB Output is correct
113 Correct 367 ms 23156 KB Output is correct