oj.uz

답안 #465920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465920 2021-08-17T10:15:24 Z Vladth11 Construction of Highway (JOI18_construction) C++14
100 / 100
 1570 ms 39928 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:199:12: warning: unused variable 'x' [-Wunused-variable]
  199 |         ll x = edges[i].first;
      |            ^

Subtask #1
7.0 / 7.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 3 ms 2844 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 4 ms 2892 KB Output is correct
7 Correct 3 ms 2892 KB Output is correct
8 Correct 3 ms 2892 KB Output is correct
9 Correct 3 ms 2892 KB Output is correct
10 Correct 3 ms 2892 KB Output is correct
11 Correct 3 ms 2892 KB Output is correct
12 Correct 3 ms 2892 KB Output is correct
13 Correct 3 ms 2892 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 3 ms 2892 KB Output is correct
18 Correct 4 ms 2892 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 3 ms 2892 KB Output is correct
24 Correct 3 ms 2892 KB Output is correct
25 Correct 3 ms 2892 KB Output is correct
26 Correct 2 ms 2892 KB Output is correct
27 Correct 3 ms 2892 KB Output is correct
28 Correct 3 ms 2892 KB Output is correct
29 Correct 3 ms 2892 KB Output is correct
30 Correct 5 ms 2892 KB Output is correct
31 Correct 3 ms 2892 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 3 ms 2880 KB Output is correct
34 Correct 3 ms 2892 KB Output is correct
35 Correct 3 ms 2892 KB Output is correct
36 Correct 3 ms 2892 KB Output is correct
37 Correct 3 ms 2892 KB Output is correct
38 Correct 3 ms 2892 KB Output is correct
39 Correct 3 ms 2892 KB Output is correct
40 Correct 3 ms 2892 KB Output is correct
41 Correct 3 ms 2892 KB Output is correct
42 Correct 3 ms 2892 KB Output is correct
43 Correct 3 ms 2892 KB Output is correct
44 Correct 3 ms 2892 KB Output is correct
45 Correct 5 ms 3028 KB Output is correct
46 Correct 15 ms 3916 KB Output is correct
47 Correct 15 ms 3976 KB Output is correct
48 Correct 14 ms 3916 KB Output is correct
49 Correct 9 ms 4172 KB Output is correct
50 Correct 9 ms 4168 KB Output is correct
51 Correct 9 ms 4172 KB Output is correct
52 Correct 11 ms 4172 KB Output is correct
53 Correct 12 ms 4172 KB Output is correct
54 Correct 12 ms 4096 KB Output is correct
55 Correct 12 ms 4172 KB Output is correct
56 Correct 12 ms 4044 KB Output is correct
57 Correct 25 ms 3972 KB Output is correct
58 Correct 26 ms 3972 KB Output is correct
59 Correct 27 ms 3976 KB Output is correct
60 Correct 26 ms 3976 KB Output is correct
61 Correct 13 ms 4104 KB Output is correct
62 Correct 13 ms 4044 KB Output is correct
63 Correct 13 ms 4104 KB Output is correct
64 Correct 15 ms 3916 KB Output is correct
65 Correct 15 ms 3964 KB Output is correct
66 Correct 15 ms 3972 KB Output is correct
67 Correct 14 ms 3916 KB Output is correct
68 Correct 9 ms 4172 KB Output is correct
69 Correct 16 ms 4172 KB Output is correct
70 Correct 12 ms 4196 KB Output is correct
71 Correct 12 ms 4072 KB Output is correct
72 Correct 24 ms 3916 KB Output is correct
73 Correct 26 ms 3972 KB Output is correct
74 Correct 13 ms 4044 KB Output is correct
75 Correct 12 ms 4028 KB Output is correct
76 Correct 11 ms 4016 KB Output is correct
77 Correct 11 ms 3916 KB Output is correct
78 Correct 12 ms 4044 KB Output is correct
79 Correct 11 ms 3928 KB Output is correct
80 Correct 11 ms 4008 KB Output is correct
81 Correct 13 ms 4040 KB Output is correct
82 Correct 13 ms 3916 KB Output is correct
83 Correct 13 ms 3916 KB Output is correct
84 Correct 13 ms 3996 KB Output is correct
85 Correct 13 ms 3916 KB Output is correct
86 Correct 13 ms 3916 KB Output is correct

Subtask #3
84.0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 3 ms 2844 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 4 ms 2892 KB Output is correct
7 Correct 3 ms 2892 KB Output is correct
8 Correct 3 ms 2892 KB Output is correct
9 Correct 3 ms 2892 KB Output is correct
10 Correct 3 ms 2892 KB Output is correct
11 Correct 3 ms 2892 KB Output is correct
12 Correct 3 ms 2892 KB Output is correct
13 Correct 3 ms 2892 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 3 ms 2892 KB Output is correct
18 Correct 4 ms 2892 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 3 ms 2892 KB Output is correct
24 Correct 3 ms 2892 KB Output is correct
25 Correct 3 ms 2892 KB Output is correct
26 Correct 2 ms 2892 KB Output is correct
27 Correct 3 ms 2892 KB Output is correct
28 Correct 3 ms 2892 KB Output is correct
29 Correct 3 ms 2892 KB Output is correct
30 Correct 5 ms 2892 KB Output is correct
31 Correct 3 ms 2892 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 3 ms 2880 KB Output is correct
34 Correct 3 ms 2892 KB Output is correct
35 Correct 3 ms 2892 KB Output is correct
36 Correct 3 ms 2892 KB Output is correct
37 Correct 3 ms 2892 KB Output is correct
38 Correct 3 ms 2892 KB Output is correct
39 Correct 3 ms 2892 KB Output is correct
40 Correct 3 ms 2892 KB Output is correct
41 Correct 3 ms 2892 KB Output is correct
42 Correct 3 ms 2892 KB Output is correct
43 Correct 3 ms 2892 KB Output is correct
44 Correct 3 ms 2892 KB Output is correct
45 Correct 5 ms 3028 KB Output is correct
46 Correct 15 ms 3916 KB Output is correct
47 Correct 15 ms 3976 KB Output is correct
48 Correct 14 ms 3916 KB Output is correct
49 Correct 9 ms 4172 KB Output is correct
50 Correct 9 ms 4168 KB Output is correct
51 Correct 9 ms 4172 KB Output is correct
52 Correct 11 ms 4172 KB Output is correct
53 Correct 12 ms 4172 KB Output is correct
54 Correct 12 ms 4096 KB Output is correct
55 Correct 12 ms 4172 KB Output is correct
56 Correct 12 ms 4044 KB Output is correct
57 Correct 25 ms 3972 KB Output is correct
58 Correct 26 ms 3972 KB Output is correct
59 Correct 27 ms 3976 KB Output is correct
60 Correct 26 ms 3976 KB Output is correct
61 Correct 13 ms 4104 KB Output is correct
62 Correct 13 ms 4044 KB Output is correct
63 Correct 13 ms 4104 KB Output is correct
64 Correct 15 ms 3916 KB Output is correct
65 Correct 15 ms 3964 KB Output is correct
66 Correct 15 ms 3972 KB Output is correct
67 Correct 14 ms 3916 KB Output is correct
68 Correct 9 ms 4172 KB Output is correct
69 Correct 16 ms 4172 KB Output is correct
70 Correct 12 ms 4196 KB Output is correct
71 Correct 12 ms 4072 KB Output is correct
72 Correct 24 ms 3916 KB Output is correct
73 Correct 26 ms 3972 KB Output is correct
74 Correct 13 ms 4044 KB Output is correct
75 Correct 12 ms 4028 KB Output is correct
76 Correct 11 ms 4016 KB Output is correct
77 Correct 11 ms 3916 KB Output is correct
78 Correct 12 ms 4044 KB Output is correct
79 Correct 11 ms 3928 KB Output is correct
80 Correct 11 ms 4008 KB Output is correct
81 Correct 13 ms 4040 KB Output is correct
82 Correct 13 ms 3916 KB Output is correct
83 Correct 13 ms 3916 KB Output is correct
84 Correct 13 ms 3996 KB Output is correct
85 Correct 13 ms 3916 KB Output is correct
86 Correct 13 ms 3916 KB Output is correct
87 Correct 42 ms 5980 KB Output is correct
88 Correct 161 ms 11948 KB Output is correct
89 Correct 762 ms 34160 KB Output is correct
90 Correct 735 ms 34216 KB Output is correct
91 Correct 736 ms 34308 KB Output is correct
92 Correct 350 ms 39928 KB Output is correct
93 Correct 345 ms 39904 KB Output is correct
94 Correct 370 ms 39808 KB Output is correct
95 Correct 479 ms 39640 KB Output is correct
96 Correct 494 ms 39552 KB Output is correct
97 Correct 465 ms 39620 KB Output is correct
98 Correct 482 ms 39560 KB Output is correct
99 Correct 478 ms 37456 KB Output is correct
100 Correct 1472 ms 34288 KB Output is correct
101 Correct 1527 ms 34216 KB Output is correct
102 Correct 1556 ms 34236 KB Output is correct
103 Correct 1570 ms 34112 KB Output is correct
104 Correct 641 ms 37388 KB Output is correct
105 Correct 723 ms 37396 KB Output is correct
106 Correct 682 ms 37376 KB Output is correct
107 Correct 777 ms 34196 KB Output is correct
108 Correct 780 ms 34272 KB Output is correct
109 Correct 762 ms 34244 KB Output is correct
110 Correct 356 ms 39756 KB Output is correct
111 Correct 509 ms 39592 KB Output is correct
112 Correct 482 ms 39620 KB Output is correct
113 Correct 487 ms 37532 KB Output is correct
114 Correct 1474 ms 34132 KB Output is correct
115 Correct 1527 ms 34272 KB Output is correct
116 Correct 629 ms 37388 KB Output is correct
117 Correct 489 ms 35812 KB Output is correct
118 Correct 505 ms 35416 KB Output is correct
119 Correct 456 ms 34996 KB Output is correct
120 Correct 523 ms 35680 KB Output is correct
121 Correct 478 ms 35248 KB Output is correct
122 Correct 470 ms 35012 KB Output is correct
123 Correct 663 ms 35868 KB Output is correct
124 Correct 666 ms 35428 KB Output is correct
125 Correct 699 ms 35136 KB Output is correct
126 Correct 705 ms 35780 KB Output is correct
127 Correct 592 ms 35368 KB Output is correct
128 Correct 578 ms 35060 KB Output is correct