oj.uz

답안 #533405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533405 2022-03-05T23:41:00 Z Lobo Construction of Highway (JOI18_construction) C++17
16 / 100
 1285 ms 34468 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)
    int cnt = 0;
 
    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);
 
            cnt++;
        }
 
 
        cout << ans << endl;
 
        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]];
        }
 
 
    }
    
    assert(cnt <= n*10);
 
 
}
 
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();
 
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5048 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 5068 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 3 ms 5104 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 4 ms 5068 KB Output is correct
17 Correct 4 ms 5028 KB Output is correct
18 Correct 3 ms 5032 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 5028 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 5 ms 5068 KB Output is correct
25 Correct 4 ms 5028 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 4 ms 5152 KB Output is correct
28 Correct 3 ms 5028 KB Output is correct
29 Correct 3 ms 5068 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 4 ms 5008 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 3 ms 5068 KB Output is correct
34 Correct 3 ms 5068 KB Output is correct
35 Correct 3 ms 5068 KB Output is correct
36 Correct 4 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5028 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 3 ms 5028 KB Output is correct
41 Correct 3 ms 5028 KB Output is correct
42 Correct 3 ms 5028 KB Output is correct
43 Correct 3 ms 5068 KB Output is correct
44 Correct 3 ms 5068 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5048 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 5068 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 3 ms 5104 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 4 ms 5068 KB Output is correct
17 Correct 4 ms 5028 KB Output is correct
18 Correct 3 ms 5032 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 5028 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 5 ms 5068 KB Output is correct
25 Correct 4 ms 5028 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 4 ms 5152 KB Output is correct
28 Correct 3 ms 5028 KB Output is correct
29 Correct 3 ms 5068 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 4 ms 5008 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 3 ms 5068 KB Output is correct
34 Correct 3 ms 5068 KB Output is correct
35 Correct 3 ms 5068 KB Output is correct
36 Correct 4 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5028 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 3 ms 5028 KB Output is correct
41 Correct 3 ms 5028 KB Output is correct
42 Correct 3 ms 5028 KB Output is correct
43 Correct 3 ms 5068 KB Output is correct
44 Correct 3 ms 5068 KB Output is correct
45 Correct 5 ms 5160 KB Output is correct
46 Correct 9 ms 5580 KB Output is correct
47 Correct 8 ms 5516 KB Output is correct
48 Correct 8 ms 5580 KB Output is correct
49 Correct 7 ms 5828 KB Output is correct
50 Correct 6 ms 5836 KB Output is correct
51 Correct 6 ms 5836 KB Output is correct
52 Correct 9 ms 5836 KB Output is correct
53 Correct 8 ms 5768 KB Output is correct
54 Correct 7 ms 5796 KB Output is correct
55 Correct 7 ms 5836 KB Output is correct
56 Correct 6 ms 5640 KB Output is correct
57 Correct 9 ms 5536 KB Output is correct
58 Correct 9 ms 5544 KB Output is correct
59 Correct 9 ms 5580 KB Output is correct
60 Correct 11 ms 5548 KB Output is correct
61 Correct 7 ms 5668 KB Output is correct
62 Correct 9 ms 5708 KB Output is correct
63 Correct 8 ms 5708 KB Output is correct
64 Correct 7 ms 5452 KB Output is correct
65 Correct 10 ms 5548 KB Output is correct
66 Correct 7 ms 5452 KB Output is correct
67 Correct 7 ms 5452 KB Output is correct
68 Correct 5 ms 5804 KB Output is correct
69 Correct 7 ms 5736 KB Output is correct
70 Correct 7 ms 5800 KB Output is correct
71 Correct 7 ms 5552 KB Output is correct
72 Correct 11 ms 5520 KB Output is correct
73 Correct 11 ms 5548 KB Output is correct
74 Correct 6 ms 5580 KB Output is correct
75 Correct 5 ms 5544 KB Output is correct
76 Correct 6 ms 5572 KB Output is correct
77 Correct 7 ms 5572 KB Output is correct
78 Correct 6 ms 5544 KB Output is correct
79 Correct 6 ms 5452 KB Output is correct
80 Correct 5 ms 5452 KB Output is correct
81 Correct 8 ms 5548 KB Output is correct
82 Correct 7 ms 5540 KB Output is correct
83 Correct 6 ms 5580 KB Output is correct
84 Correct 6 ms 5580 KB Output is correct
85 Correct 6 ms 5452 KB Output is correct
86 Correct 6 ms 5452 KB Output is correct

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5048 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 5068 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 3 ms 5104 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 4 ms 5068 KB Output is correct
17 Correct 4 ms 5028 KB Output is correct
18 Correct 3 ms 5032 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 5028 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 5 ms 5068 KB Output is correct
25 Correct 4 ms 5028 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 4 ms 5152 KB Output is correct
28 Correct 3 ms 5028 KB Output is correct
29 Correct 3 ms 5068 KB Output is correct
30 Correct 3 ms 5068 KB Output is correct
31 Correct 4 ms 5008 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 3 ms 5068 KB Output is correct
34 Correct 3 ms 5068 KB Output is correct
35 Correct 3 ms 5068 KB Output is correct
36 Correct 4 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5028 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 3 ms 5028 KB Output is correct
41 Correct 3 ms 5028 KB Output is correct
42 Correct 3 ms 5028 KB Output is correct
43 Correct 3 ms 5068 KB Output is correct
44 Correct 3 ms 5068 KB Output is correct
45 Correct 5 ms 5160 KB Output is correct
46 Correct 9 ms 5580 KB Output is correct
47 Correct 8 ms 5516 KB Output is correct
48 Correct 8 ms 5580 KB Output is correct
49 Correct 7 ms 5828 KB Output is correct
50 Correct 6 ms 5836 KB Output is correct
51 Correct 6 ms 5836 KB Output is correct
52 Correct 9 ms 5836 KB Output is correct
53 Correct 8 ms 5768 KB Output is correct
54 Correct 7 ms 5796 KB Output is correct
55 Correct 7 ms 5836 KB Output is correct
56 Correct 6 ms 5640 KB Output is correct
57 Correct 9 ms 5536 KB Output is correct
58 Correct 9 ms 5544 KB Output is correct
59 Correct 9 ms 5580 KB Output is correct
60 Correct 11 ms 5548 KB Output is correct
61 Correct 7 ms 5668 KB Output is correct
62 Correct 9 ms 5708 KB Output is correct
63 Correct 8 ms 5708 KB Output is correct
64 Correct 7 ms 5452 KB Output is correct
65 Correct 10 ms 5548 KB Output is correct
66 Correct 7 ms 5452 KB Output is correct
67 Correct 7 ms 5452 KB Output is correct
68 Correct 5 ms 5804 KB Output is correct
69 Correct 7 ms 5736 KB Output is correct
70 Correct 7 ms 5800 KB Output is correct
71 Correct 7 ms 5552 KB Output is correct
72 Correct 11 ms 5520 KB Output is correct
73 Correct 11 ms 5548 KB Output is correct
74 Correct 6 ms 5580 KB Output is correct
75 Correct 5 ms 5544 KB Output is correct
76 Correct 6 ms 5572 KB Output is correct
77 Correct 7 ms 5572 KB Output is correct
78 Correct 6 ms 5544 KB Output is correct
79 Correct 6 ms 5452 KB Output is correct
80 Correct 5 ms 5452 KB Output is correct
81 Correct 8 ms 5548 KB Output is correct
82 Correct 7 ms 5540 KB Output is correct
83 Correct 6 ms 5580 KB Output is correct
84 Correct 6 ms 5580 KB Output is correct
85 Correct 6 ms 5452 KB Output is correct
86 Correct 6 ms 5452 KB Output is correct
87 Correct 16 ms 6280 KB Output is correct
88 Correct 53 ms 8988 KB Output is correct
89 Correct 233 ms 17236 KB Output is correct
90 Correct 189 ms 17300 KB Output is correct
91 Correct 241 ms 17412 KB Output is correct
92 Correct 90 ms 24196 KB Output is correct
93 Correct 100 ms 24220 KB Output is correct
94 Correct 99 ms 24140 KB Output is correct
95 Correct 1014 ms 23744 KB Output is correct
96 Correct 1091 ms 23720 KB Output is correct
97 Correct 1285 ms 23904 KB Output is correct
98 Correct 1222 ms 23816 KB Output is correct
99 Correct 100 ms 20452 KB Output is correct
100 Runtime error 252 ms 34468 KB Execution killed with signal 6
101 Halted 0 ms 0 KB -