oj.uz

Submission #533863

# Submission time Handle Problem Language Result Execution time Memory
533863 2022-03-07T12:55:24 Z Lobo Construction of Highway (JOI18_construction) C++17
100 / 100
 1010 ms 20328 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
// #define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 100100

int n, a[maxn], b[maxn], c[maxn], sz[maxn], pai[maxn], ant[maxn], h[maxn], bit[maxn];
vector<int> g[maxn];
vector<pair<pair<int,int>,int>> bl[maxn];

void att(int pos, int val) {
    for(int i = pos; i <= n; i+= i&-i) {
        bit[i]+= val;
    }
}

int qrr(int pos) {
    int val = 0;
    for(int i = pos; i > 0; i-= i&-i) {
        val+= bit[i];
    }
    return val;
}

void dfshld(int u) {
    pair<int,int> mx;
    for(auto v : g[u]) {
        mx = max(mx,mp(sz[v],v));
    }

    if(mx.sc == 0) return;

    pai[mx.sc] = pai[u];
    ant[mx.sc] = u;
    dfshld(mx.sc);
    for(auto v : g[u]) {
        if(v == mx.sc) continue;
        pai[v] = v;
        ant[v] = u;
        dfshld(v);
    }
}

void dfssz(int u, int ant) {
    sz[u] = 1;
    for(auto v : g[u]) {
        if(v == ant) continue;
        h[v] = h[u]+1;
        dfssz(v,u);
        sz[u]+= sz[v];
    }
}


void solve() {
    cin >> n;

    vector<int> cc;
    for(int i = 1; i <= n; i++) {
        cin >> c[i];
        c[i] = -c[i];
        cc.pb(c[i]);
    }

    sort(all(cc));
    cc.erase(unique(all(cc)),cc.end());

    for(int i = 1; i <= n; i++) {
        c[i] = upper_bound(all(cc),c[i]) - cc.begin();
    }

    for(int i = 1; i <= n-1; i++) {
        cin >> a[i] >> b[i];
        g[a[i]].pb(b[i]);
    }

    dfssz(1,1);
    ant[1] = 0;
    pai[1] = 1;
    dfshld(1);

    // for(int i = 1; i <= n; i++) {
    //     cout << i << " " << ant[i] << " " << pai[i] << endl;
    // }

    bl[1].pb(mp(mp(0,0),c[1]));
    //mp(mp(altura minima,altura maxima),cor)

    for(int i = 1; i <= n-1; i++) {
        int u = a[i];

        vector<pair<pair<int,int>,int>> cols;
        int v = u;
        while(v != 0) {
            // cout << "- " << v << endl;
            if(pai[v] != v) {
                for(auto x : bl[pai[v]]) {
                    if(x.fr.fr <= h[v]) cols.pb(mp(mp(x.fr.fr,min(h[v],x.fr.sc)),x.sc));
                }
            }
            else {
                cols.pb(mp(mp(h[v],h[v]),bl[v].back().sc));
            }

            v = ant[pai[v]];
        }

        // cout << b[i] << " " << c[b[i]] << endl;
        sort(all(cols));
        int ans = 0;
        for(auto X : cols) {
            int qtd = X.fr.sc-X.fr.fr+1;
            int col = X.sc;
            // cout << " " << X.fr.fr << " " << X.fr.sc << " " << col << endl;

            ans+= qtd*qrr(col-1);
            att(col,qtd);
        }


        cout << ans << endl;

        int ant1 = 0;
        for(auto X : cols) {
            int qtd = X.fr.sc-X.fr.fr+1;
            int col = X.sc;
            att(col,-qtd);
        }

        //atualizacao
        //bl[i] tem que estar em ordem decrescente, com o bloco do pai sendo o ultimo

        v = b[i];
        int newc = c[b[i]];
        while(v != 0) {
            // cout << "   " << v << endl;
            while(bl[pai[v]].size() && bl[pai[v]].back().fr.sc <= h[v]) bl[pai[v]].pop_back();
            if(bl[pai[v]].size() != 0) {
                auto x = bl[pai[v]].back();
                // cout << "    " << x.fr.fr << " " << x.fr.sc << " " << x.sc << " " << h[v] << endl;
                bl[pai[v]].pop_back();
                bl[pai[v]].pb(mp(mp(h[v]+1,x.fr.sc),x.sc));
            }

            
            bl[pai[v]].pb(mp(mp(h[pai[v]],h[v]),newc));
            
            v = ant[pai[v]];
        }


    }


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Compilation message

construction.cpp: In function 'void solve()':
construction.cpp:133:13: warning: unused variable 'ant1' [-Wunused-variable]
  133 |         int ant1 = 0;
      |             ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 3 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 4 ms 5036 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 3 ms 5024 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 3 ms 5068 KB Output is correct
28 Correct 3 ms 5068 KB Output is correct
29 Correct 3 ms 5068 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 3 ms 5068 KB Output is correct
32 Correct 3 ms 5068 KB Output is correct
33 Correct 3 ms 5068 KB Output is correct
34 Correct 3 ms 5032 KB Output is correct
35 Correct 4 ms 5028 KB Output is correct
36 Correct 3 ms 5068 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 3 ms 5068 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 3 ms 5068 KB Output is correct
41 Correct 3 ms 5068 KB Output is correct
42 Correct 4 ms 5068 KB Output is correct
43 Correct 3 ms 5068 KB Output is correct
44 Correct 3 ms 5032 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 3 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 4 ms 5036 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 3 ms 5024 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 3 ms 5068 KB Output is correct
28 Correct 3 ms 5068 KB Output is correct
29 Correct 3 ms 5068 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 3 ms 5068 KB Output is correct
32 Correct 3 ms 5068 KB Output is correct
33 Correct 3 ms 5068 KB Output is correct
34 Correct 3 ms 5032 KB Output is correct
35 Correct 4 ms 5028 KB Output is correct
36 Correct 3 ms 5068 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 3 ms 5068 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 3 ms 5068 KB Output is correct
41 Correct 3 ms 5068 KB Output is correct
42 Correct 4 ms 5068 KB Output is correct
43 Correct 3 ms 5068 KB Output is correct
44 Correct 3 ms 5032 KB Output is correct
45 Correct 4 ms 5068 KB Output is correct
46 Correct 8 ms 5420 KB Output is correct
47 Correct 9 ms 5324 KB Output is correct
48 Correct 8 ms 5324 KB Output is correct
49 Correct 8 ms 5708 KB Output is correct
50 Correct 6 ms 5680 KB Output is correct
51 Correct 5 ms 5708 KB Output is correct
52 Correct 8 ms 5544 KB Output is correct
53 Correct 8 ms 5548 KB Output is correct
54 Correct 7 ms 5632 KB Output is correct
55 Correct 7 ms 5580 KB Output is correct
56 Correct 6 ms 5544 KB Output is correct
57 Correct 8 ms 5288 KB Output is correct
58 Correct 9 ms 5324 KB Output is correct
59 Correct 10 ms 5420 KB Output is correct
60 Correct 9 ms 5324 KB Output is correct
61 Correct 6 ms 5452 KB Output is correct
62 Correct 6 ms 5548 KB Output is correct
63 Correct 7 ms 5544 KB Output is correct
64 Correct 15 ms 5356 KB Output is correct
65 Correct 7 ms 5380 KB Output is correct
66 Correct 7 ms 5328 KB Output is correct
67 Correct 7 ms 5324 KB Output is correct
68 Correct 5 ms 5580 KB Output is correct
69 Correct 7 ms 5580 KB Output is correct
70 Correct 7 ms 5580 KB Output is correct
71 Correct 5 ms 5500 KB Output is correct
72 Correct 8 ms 5324 KB Output is correct
73 Correct 8 ms 5292 KB Output is correct
74 Correct 6 ms 5452 KB Output is correct
75 Correct 6 ms 5360 KB Output is correct
76 Correct 6 ms 5452 KB Output is correct
77 Correct 5 ms 5324 KB Output is correct
78 Correct 6 ms 5424 KB Output is correct
79 Correct 5 ms 5420 KB Output is correct
80 Correct 5 ms 5324 KB Output is correct
81 Correct 6 ms 5452 KB Output is correct
82 Correct 7 ms 5356 KB Output is correct
83 Correct 6 ms 5324 KB Output is correct
84 Correct 5 ms 5452 KB Output is correct
85 Correct 5 ms 5396 KB Output is correct
86 Correct 5 ms 5324 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 3 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 4 ms 5036 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 3 ms 5024 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 3 ms 5068 KB Output is correct
28 Correct 3 ms 5068 KB Output is correct
29 Correct 3 ms 5068 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 3 ms 5068 KB Output is correct
32 Correct 3 ms 5068 KB Output is correct
33 Correct 3 ms 5068 KB Output is correct
34 Correct 3 ms 5032 KB Output is correct
35 Correct 4 ms 5028 KB Output is correct
36 Correct 3 ms 5068 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 3 ms 5068 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 3 ms 5068 KB Output is correct
41 Correct 3 ms 5068 KB Output is correct
42 Correct 4 ms 5068 KB Output is correct
43 Correct 3 ms 5068 KB Output is correct
44 Correct 3 ms 5032 KB Output is correct
45 Correct 4 ms 5068 KB Output is correct
46 Correct 8 ms 5420 KB Output is correct
47 Correct 9 ms 5324 KB Output is correct
48 Correct 8 ms 5324 KB Output is correct
49 Correct 8 ms 5708 KB Output is correct
50 Correct 6 ms 5680 KB Output is correct
51 Correct 5 ms 5708 KB Output is correct
52 Correct 8 ms 5544 KB Output is correct
53 Correct 8 ms 5548 KB Output is correct
54 Correct 7 ms 5632 KB Output is correct
55 Correct 7 ms 5580 KB Output is correct
56 Correct 6 ms 5544 KB Output is correct
57 Correct 8 ms 5288 KB Output is correct
58 Correct 9 ms 5324 KB Output is correct
59 Correct 10 ms 5420 KB Output is correct
60 Correct 9 ms 5324 KB Output is correct
61 Correct 6 ms 5452 KB Output is correct
62 Correct 6 ms 5548 KB Output is correct
63 Correct 7 ms 5544 KB Output is correct
64 Correct 15 ms 5356 KB Output is correct
65 Correct 7 ms 5380 KB Output is correct
66 Correct 7 ms 5328 KB Output is correct
67 Correct 7 ms 5324 KB Output is correct
68 Correct 5 ms 5580 KB Output is correct
69 Correct 7 ms 5580 KB Output is correct
70 Correct 7 ms 5580 KB Output is correct
71 Correct 5 ms 5500 KB Output is correct
72 Correct 8 ms 5324 KB Output is correct
73 Correct 8 ms 5292 KB Output is correct
74 Correct 6 ms 5452 KB Output is correct
75 Correct 6 ms 5360 KB Output is correct
76 Correct 6 ms 5452 KB Output is correct
77 Correct 5 ms 5324 KB Output is correct
78 Correct 6 ms 5424 KB Output is correct
79 Correct 5 ms 5420 KB Output is correct
80 Correct 5 ms 5324 KB Output is correct
81 Correct 6 ms 5452 KB Output is correct
82 Correct 7 ms 5356 KB Output is correct
83 Correct 6 ms 5324 KB Output is correct
84 Correct 5 ms 5452 KB Output is correct
85 Correct 5 ms 5396 KB Output is correct
86 Correct 5 ms 5324 KB Output is correct
87 Correct 16 ms 5828 KB Output is correct
88 Correct 44 ms 7236 KB Output is correct
89 Correct 167 ms 12688 KB Output is correct
90 Correct 190 ms 12208 KB Output is correct
91 Correct 167 ms 12216 KB Output is correct
92 Correct 81 ms 19780 KB Output is correct
93 Correct 82 ms 19776 KB Output is correct
94 Correct 100 ms 20328 KB Output is correct
95 Correct 992 ms 18148 KB Output is correct
96 Correct 1010 ms 18128 KB Output is correct
97 Correct 953 ms 18188 KB Output is correct
98 Correct 948 ms 17572 KB Output is correct
99 Correct 89 ms 16068 KB Output is correct
100 Correct 235 ms 12544 KB Output is correct
101 Correct 246 ms 12484 KB Output is correct
102 Correct 243 ms 12996 KB Output is correct
103 Correct 250 ms 12960 KB Output is correct
104 Correct 105 ms 16456 KB Output is correct
105 Correct 99 ms 16476 KB Output is correct
106 Correct 117 ms 16012 KB Output is correct
107 Correct 148 ms 12272 KB Output is correct
108 Correct 161 ms 12356 KB Output is correct
109 Correct 170 ms 12500 KB Output is correct
110 Correct 87 ms 20056 KB Output is correct
111 Correct 936 ms 18140 KB Output is correct
112 Correct 968 ms 17948 KB Output is correct
113 Correct 80 ms 16196 KB Output is correct
114 Correct 223 ms 13096 KB Output is correct
115 Correct 257 ms 12748 KB Output is correct
116 Correct 89 ms 16192 KB Output is correct
117 Correct 90 ms 14464 KB Output is correct
118 Correct 103 ms 13892 KB Output is correct
119 Correct 98 ms 13496 KB Output is correct
120 Correct 86 ms 13836 KB Output is correct
121 Correct 83 ms 13532 KB Output is correct
122 Correct 93 ms 13208 KB Output is correct
123 Correct 121 ms 14604 KB Output is correct
124 Correct 105 ms 13916 KB Output is correct
125 Correct 104 ms 13560 KB Output is correct
126 Correct 97 ms 14148 KB Output is correct
127 Correct 94 ms 13508 KB Output is correct
128 Correct 98 ms 13340 KB Output is correct