oj.uz

답안 #823312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823312 2023-08-12T10:40:01 Z LucaIlie Construction of Highway (JOI18_construction) C++17
100 / 100
 1068 ms 41976 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;
typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> OST;
 
const ll NMAX = 100001;
const ll INF = (1LL << 60);
const ll HALF = (1LL << 59);
const ll MOD = 1000000007;
const ll BLOCK = 318;
const ll base = 31;
const ll nr_of_bits = 21;
 
ll n;
ll dp[NMAX][nr_of_bits + 1];
 
class All {
public:
    ll all[NMAX * 4];
    ll lazy[NMAX * 4];
    void propaga(ll node, ll st, ll dr) {
        if(!lazy[node])
            return;
        if(st != dr) {
            lazy[node * 2] = lazy[node];
            lazy[node * 2 + 1] = lazy[node];
        }
        all[node] = lazy[node];
        lazy[node] = 0;
    }
    void update(ll node, ll st, ll dr, ll a, ll b, ll val) {
        propaga(node, st, dr);
        if(a <= st && dr <= b) {
            lazy[node] = val;
                  propaga(node, st, dr);
 
            return;
        }
        ll mid = (st + dr) / 2;
        propaga(node * 2, st, mid);
        propaga(node * 2 + 1, mid + 1, dr);
        if(a <= mid) {
            update(node * 2, st, mid, a, b, val);
        }
        if(b > mid) {
            update(node * 2 + 1, mid + 1, dr, a, b, val);
        }
        propaga(node * 2, st, mid);
        propaga(node * 2 + 1, mid + 1, dr);
        all[node] = max(all[node * 2], all[node * 2 + 1]);
    }
    ll maxim(ll node, ll st, ll dr, ll a, ll b) {
        propaga(node, st, dr);
        if(a <= st && dr <= b) {
            return all[node];
        }
        ll mid = (st + dr) / 2;
        ll sol = 0;
        propaga(node * 2, st, mid);
        propaga(node * 2 + 1, mid + 1, dr);
        if(a <= mid) {
            sol = max(sol, maxim(node * 2, st, mid, a, b));
        }
        if(b > mid) {
            sol = max(sol, maxim(node * 2 + 1, mid + 1, dr, a, b));
        }
        return sol;
    }
} st;
 
ll poz[NMAX];
ll stamp;
ll sz[NMAX];
ll heavy[NMAX];
ll a[NMAX];
vector <ll> v[NMAX];
 
void getsize(ll node, ll p) {
    sz[node] = 1;
    for(auto x : v[node]) {
        if(x == p)
            continue;
        getsize(x, node);
        if(heavy[node] == 0 || sz[x] > sz[heavy[node]])
            heavy[node] = x;
        sz[node] += sz[x];
    }
}
 
ll capat[NMAX];
 
void DFS(ll node, ll p, ll sf) {
    dp[node][0] = p;
    capat[node] = sf;
    poz[node] = ++stamp;
    a[stamp] = node;
    if(heavy[node])
    DFS(heavy[node], node, sf);
    for(auto x : v[node]) {
        if(x == p || x == heavy[node])
            continue;
        DFS(x, node, x);
    }
}
 
pii edges[NMAX];
ll c[NMAX];
 
void baga(ll node, ll col){
    while(node != 0){
        st.update(1, 1, n, poz[capat[node]], poz[node], col);
        node = dp[capat[node]][0];
    }
}
 
struct ura{
    ll first, second, third;
};
 
ll sol;
ll aib[NMAX];
 
ll nn;
ura nr[NMAX];
ll cv[NMAX];
 
void update(ll x, ll val){
    for(ll i = x; i <= nn; i+=i&(-i))
        aib[i] += val;
}
 
ll query(ll x){
    ll s = 0;
    for(ll i = x; i > 0; i-=i&(-i)){
        s += aib[i];
    }
    return s;
}
 
bool cmp(ura a, ura b){
    return a.first < b.first;
}
 
ll cc[NMAX];
 
void calc(){
    ll i;
    for(i = 0; i <= nn; i++)
        aib[i] = 0, cv[i] = 0, cc[i] = 0;
    sort(nr + 1, nr + nn + 1, cmp);
    ll cnt = 0;
    for(i = 1; i <= nn; i++){
        if(i == 1 || nr[i].first != nr[i - 1].first){
            cnt++;
        }
        cv[nr[i].second] = cnt;
        cc[nr[i].second] = nr[i].third;
    }
    for(i = 1; i <= nn; i++){
        sol +=  query(cv[i] - 1) * cc[i];
        update(cv[i], cc[i]);
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll i, j;
    cin >> n;
    for(i = 1; i <= n; i++) {
        cin >> c[i];
    }
    for(i = 1; i < n; i++) {
        ll x, y;
        cin >> x >> y;
        edges[i] = {x, y};
        v[x].push_back(y);
        v[y].push_back(x);
    }
    getsize(1, 0);
    DFS(1, 0, 1);
 
    for(j = 1; j <= nr_of_bits; j++)
        for(i = 1; i <= n; i++)
            dp[i][j] = dp[dp[i][j - 1]][j - 1];
 
    st.update(1, 1, n, poz[1], poz[1], 1);
    for(i = 1; i < n; i++) {
        ll x = edges[i].first;
        ll y = edges[i].second;
        ll node = y;
        sol = 0;
        nn = 0;
        while(node != 1){
            ll dist = 1;
            node = dp[node][0];
            ll col = st.maxim(1, 1, n, poz[node], poz[node]);
            ll pas = nr_of_bits;
            while(pas >= 0){
                ll nxt = dp[node][pas];
                if(nxt != 0 && st.maxim(1, 1, n, poz[nxt], poz[nxt]) == col){
                    node = nxt;
                    dist += (1 << pas);
                }
                pas--;
            }
            nr[++nn] = {c[col], nn, dist};
        }
        calc();
        baga(y, y);
        cout << sol << "\n";
    }
    return 0;
}

Compilation message

construction.cpp: In function 'int main()':
construction.cpp:200:12: warning: unused variable 'x' [-Wunused-variable]
  200 |         ll x = edges[i].first;
      |            ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 2 ms 2780 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 2 ms 2900 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2900 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 2 ms 2920 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 2 ms 2900 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 3 ms 2900 KB Output is correct
17 Correct 3 ms 2912 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 ms 2904 KB Output is correct
21 Correct 3 ms 2916 KB Output is correct
22 Correct 3 ms 2904 KB Output is correct
23 Correct 2 ms 2904 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 2 ms 2788 KB Output is correct
26 Correct 2 ms 2900 KB Output is correct
27 Correct 2 ms 2900 KB Output is correct
28 Correct 2 ms 2900 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 2 ms 2900 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 2 ms 2900 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 2 ms 2900 KB Output is correct
36 Correct 2 ms 2900 KB Output is correct
37 Correct 2 ms 2900 KB Output is correct
38 Correct 2 ms 2900 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 2 ms 2900 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 2 ms 2900 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 2 ms 2780 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 2 ms 2900 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2900 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 2 ms 2920 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 2 ms 2900 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 3 ms 2900 KB Output is correct
17 Correct 3 ms 2912 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 ms 2904 KB Output is correct
21 Correct 3 ms 2916 KB Output is correct
22 Correct 3 ms 2904 KB Output is correct
23 Correct 2 ms 2904 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 2 ms 2788 KB Output is correct
26 Correct 2 ms 2900 KB Output is correct
27 Correct 2 ms 2900 KB Output is correct
28 Correct 2 ms 2900 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 2 ms 2900 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 2 ms 2900 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 2 ms 2900 KB Output is correct
36 Correct 2 ms 2900 KB Output is correct
37 Correct 2 ms 2900 KB Output is correct
38 Correct 2 ms 2900 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 2 ms 2900 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 2 ms 2900 KB Output is correct
45 Correct 3 ms 3028 KB Output is correct
46 Correct 10 ms 3924 KB Output is correct
47 Correct 14 ms 3972 KB Output is correct
48 Correct 10 ms 3924 KB Output is correct
49 Correct 8 ms 4180 KB Output is correct
50 Correct 10 ms 4160 KB Output is correct
51 Correct 6 ms 4180 KB Output is correct
52 Correct 10 ms 4196 KB Output is correct
53 Correct 10 ms 4132 KB Output is correct
54 Correct 8 ms 4180 KB Output is correct
55 Correct 8 ms 4180 KB Output is correct
56 Correct 8 ms 4048 KB Output is correct
57 Correct 17 ms 3980 KB Output is correct
58 Correct 18 ms 4064 KB Output is correct
59 Correct 19 ms 4068 KB Output is correct
60 Correct 19 ms 4060 KB Output is correct
61 Correct 9 ms 4100 KB Output is correct
62 Correct 9 ms 4180 KB Output is correct
63 Correct 10 ms 4192 KB Output is correct
64 Correct 10 ms 3924 KB Output is correct
65 Correct 10 ms 4024 KB Output is correct
66 Correct 10 ms 4028 KB Output is correct
67 Correct 10 ms 4032 KB Output is correct
68 Correct 6 ms 4180 KB Output is correct
69 Correct 8 ms 4180 KB Output is correct
70 Correct 8 ms 4168 KB Output is correct
71 Correct 8 ms 4052 KB Output is correct
72 Correct 17 ms 4040 KB Output is correct
73 Correct 18 ms 4040 KB Output is correct
74 Correct 11 ms 4180 KB Output is correct
75 Correct 8 ms 4104 KB Output is correct
76 Correct 8 ms 4048 KB Output is correct
77 Correct 8 ms 4052 KB Output is correct
78 Correct 8 ms 4052 KB Output is correct
79 Correct 8 ms 3980 KB Output is correct
80 Correct 12 ms 3984 KB Output is correct
81 Correct 9 ms 4108 KB Output is correct
82 Correct 9 ms 4096 KB Output is correct
83 Correct 9 ms 4052 KB Output is correct
84 Correct 9 ms 4100 KB Output is correct
85 Correct 9 ms 4052 KB Output is correct
86 Correct 10 ms 4068 KB Output is correct

Subtask #3
84.0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 2 ms 2780 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 2 ms 2900 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2900 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 2 ms 2920 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 2 ms 2900 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 3 ms 2900 KB Output is correct
17 Correct 3 ms 2912 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 ms 2904 KB Output is correct
21 Correct 3 ms 2916 KB Output is correct
22 Correct 3 ms 2904 KB Output is correct
23 Correct 2 ms 2904 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 2 ms 2788 KB Output is correct
26 Correct 2 ms 2900 KB Output is correct
27 Correct 2 ms 2900 KB Output is correct
28 Correct 2 ms 2900 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 2 ms 2900 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 2 ms 2900 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 2 ms 2900 KB Output is correct
36 Correct 2 ms 2900 KB Output is correct
37 Correct 2 ms 2900 KB Output is correct
38 Correct 2 ms 2900 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 2 ms 2900 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 2 ms 2900 KB Output is correct
45 Correct 3 ms 3028 KB Output is correct
46 Correct 10 ms 3924 KB Output is correct
47 Correct 14 ms 3972 KB Output is correct
48 Correct 10 ms 3924 KB Output is correct
49 Correct 8 ms 4180 KB Output is correct
50 Correct 10 ms 4160 KB Output is correct
51 Correct 6 ms 4180 KB Output is correct
52 Correct 10 ms 4196 KB Output is correct
53 Correct 10 ms 4132 KB Output is correct
54 Correct 8 ms 4180 KB Output is correct
55 Correct 8 ms 4180 KB Output is correct
56 Correct 8 ms 4048 KB Output is correct
57 Correct 17 ms 3980 KB Output is correct
58 Correct 18 ms 4064 KB Output is correct
59 Correct 19 ms 4068 KB Output is correct
60 Correct 19 ms 4060 KB Output is correct
61 Correct 9 ms 4100 KB Output is correct
62 Correct 9 ms 4180 KB Output is correct
63 Correct 10 ms 4192 KB Output is correct
64 Correct 10 ms 3924 KB Output is correct
65 Correct 10 ms 4024 KB Output is correct
66 Correct 10 ms 4028 KB Output is correct
67 Correct 10 ms 4032 KB Output is correct
68 Correct 6 ms 4180 KB Output is correct
69 Correct 8 ms 4180 KB Output is correct
70 Correct 8 ms 4168 KB Output is correct
71 Correct 8 ms 4052 KB Output is correct
72 Correct 17 ms 4040 KB Output is correct
73 Correct 18 ms 4040 KB Output is correct
74 Correct 11 ms 4180 KB Output is correct
75 Correct 8 ms 4104 KB Output is correct
76 Correct 8 ms 4048 KB Output is correct
77 Correct 8 ms 4052 KB Output is correct
78 Correct 8 ms 4052 KB Output is correct
79 Correct 8 ms 3980 KB Output is correct
80 Correct 12 ms 3984 KB Output is correct
81 Correct 9 ms 4108 KB Output is correct
82 Correct 9 ms 4096 KB Output is correct
83 Correct 9 ms 4052 KB Output is correct
84 Correct 9 ms 4100 KB Output is correct
85 Correct 9 ms 4052 KB Output is correct
86 Correct 10 ms 4068 KB Output is correct
87 Correct 37 ms 6180 KB Output is correct
88 Correct 114 ms 12648 KB Output is correct
89 Correct 472 ms 36308 KB Output is correct
90 Correct 488 ms 36412 KB Output is correct
91 Correct 478 ms 36252 KB Output is correct
92 Correct 210 ms 41872 KB Output is correct
93 Correct 209 ms 41976 KB Output is correct
94 Correct 236 ms 41932 KB Output is correct
95 Correct 311 ms 41308 KB Output is correct
96 Correct 300 ms 41708 KB Output is correct
97 Correct 325 ms 41720 KB Output is correct
98 Correct 324 ms 41732 KB Output is correct
99 Correct 347 ms 39500 KB Output is correct
100 Correct 938 ms 35948 KB Output is correct
101 Correct 975 ms 36280 KB Output is correct
102 Correct 1020 ms 36224 KB Output is correct
103 Correct 1068 ms 36296 KB Output is correct
104 Correct 404 ms 39536 KB Output is correct
105 Correct 463 ms 39472 KB Output is correct
106 Correct 417 ms 39492 KB Output is correct
107 Correct 494 ms 35664 KB Output is correct
108 Correct 449 ms 35592 KB Output is correct
109 Correct 527 ms 35872 KB Output is correct
110 Correct 229 ms 41308 KB Output is correct
111 Correct 317 ms 41272 KB Output is correct
112 Correct 297 ms 41032 KB Output is correct
113 Correct 344 ms 38936 KB Output is correct
114 Correct 958 ms 36040 KB Output is correct
115 Correct 975 ms 35616 KB Output is correct
116 Correct 388 ms 38868 KB Output is correct
117 Correct 322 ms 37624 KB Output is correct
118 Correct 327 ms 37120 KB Output is correct
119 Correct 311 ms 36844 KB Output is correct
120 Correct 312 ms 37180 KB Output is correct
121 Correct 277 ms 36728 KB Output is correct
122 Correct 336 ms 36552 KB Output is correct
123 Correct 382 ms 37712 KB Output is correct
124 Correct 417 ms 37220 KB Output is correct
125 Correct 458 ms 36968 KB Output is correct
126 Correct 436 ms 37412 KB Output is correct
127 Correct 466 ms 36796 KB Output is correct
128 Correct 472 ms 36608 KB Output is correct