oj.uz

답안 #465914

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465914 2021-08-17T10:09:30 Z Vladth11 Construction of Highway (JOI18_construction) C++14
16 / 100
 2000 ms 41840 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], mini[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];
        mini[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;
            return;
        }
        ll mid = (st + dr) / 2;
        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]);
        mini[node] = min(mini[node * 2], mini[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;
        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;
    }
    ll minim(ll node, ll st, ll dr, ll a, ll b) {
        propaga(node, st, dr);
        if(a <= st && dr <= b) {
            return mini[node];
        }
        ll mid = (st + dr) / 2;
        ll sol = 2e9;
        if(a <= mid) {
            sol = min(sol, minim(node * 2, st, mid, a, b));
        }
        if(b > mid) {
            sol = min(sol, minim(node * 2 + 1, mid + 1, dr, a, b));
        }
        return sol;
    }
    bool tout(ll node, ll st, ll dr, ll a, ll b, ll col) {
        return (maxim(node, st, dr, a, b) == col) && (minim(node, st, dr, a, b) == col);
    }
} 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];
    }
}

bool tot(ll node, ll nxt, ll col) {
    bool ok = 1;
    while(capat[node] != capat[nxt]) {
        ok = min(ok, st.tout(1, 1, n, poz[capat[node]], poz[node], col));
        node = dp[capat[node]][0];
    }
    ok = min(ok, st.tout(1, 1, n, poz[nxt], poz[node], col));
    return ok;
}

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], c[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 pas = nr_of_bits;
            ll col = st.maxim(1, 1, n, poz[node], poz[node]);
            while(pas >= 0) {
                ll nxt = dp[node][pas];
                if(nxt != 0 && tot(node, nxt, col)) {
                    node = nxt;
                    dist += (1 << pas);
                }
                pas--;
            }
            nr[++nn] = {col, nn, dist};
        }
        calc();
        baga(y, c[y]);
        cout << sol << "\n";
    }
    return 0;
}

Compilation message

construction.cpp: In function 'int main()':
construction.cpp:223:12: warning: unused variable 'x' [-Wunused-variable]
  223 |         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 2764 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 3 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 4 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 5 ms 2940 KB Output is correct
15 Correct 4 ms 2892 KB Output is correct
16 Correct 5 ms 2892 KB Output is correct
17 Correct 5 ms 2892 KB Output is correct
18 Correct 5 ms 2892 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 5 ms 2856 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 4 ms 2892 KB Output is correct
24 Correct 4 ms 2892 KB Output is correct
25 Correct 4 ms 2892 KB Output is correct
26 Correct 3 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 4 ms 2892 KB Output is correct
31 Correct 4 ms 2892 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 3 ms 2892 KB Output is correct
34 Correct 4 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 2920 KB Output is correct
38 Correct 3 ms 2892 KB Output is correct
39 Correct 4 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 2764 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 3 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 4 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 5 ms 2940 KB Output is correct
15 Correct 4 ms 2892 KB Output is correct
16 Correct 5 ms 2892 KB Output is correct
17 Correct 5 ms 2892 KB Output is correct
18 Correct 5 ms 2892 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 5 ms 2856 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 4 ms 2892 KB Output is correct
24 Correct 4 ms 2892 KB Output is correct
25 Correct 4 ms 2892 KB Output is correct
26 Correct 3 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 4 ms 2892 KB Output is correct
31 Correct 4 ms 2892 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 3 ms 2892 KB Output is correct
34 Correct 4 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 2920 KB Output is correct
38 Correct 3 ms 2892 KB Output is correct
39 Correct 4 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 6 ms 3088 KB Output is correct
46 Correct 23 ms 4044 KB Output is correct
47 Correct 24 ms 4044 KB Output is correct
48 Correct 23 ms 4044 KB Output is correct
49 Correct 14 ms 4212 KB Output is correct
50 Correct 14 ms 4248 KB Output is correct
51 Correct 14 ms 4216 KB Output is correct
52 Correct 20 ms 4252 KB Output is correct
53 Correct 18 ms 4176 KB Output is correct
54 Correct 18 ms 4196 KB Output is correct
55 Correct 17 ms 4300 KB Output is correct
56 Correct 25 ms 4144 KB Output is correct
57 Correct 42 ms 4044 KB Output is correct
58 Correct 46 ms 4056 KB Output is correct
59 Correct 47 ms 4048 KB Output is correct
60 Correct 48 ms 4040 KB Output is correct
61 Correct 22 ms 4168 KB Output is correct
62 Correct 25 ms 4172 KB Output is correct
63 Correct 22 ms 4176 KB Output is correct
64 Correct 19 ms 4044 KB Output is correct
65 Correct 26 ms 3916 KB Output is correct
66 Correct 24 ms 4044 KB Output is correct
67 Correct 23 ms 4044 KB Output is correct
68 Correct 13 ms 4252 KB Output is correct
69 Correct 16 ms 4160 KB Output is correct
70 Correct 17 ms 4184 KB Output is correct
71 Correct 17 ms 4192 KB Output is correct
72 Correct 42 ms 4048 KB Output is correct
73 Correct 56 ms 4048 KB Output is correct
74 Correct 21 ms 4096 KB Output is correct
75 Correct 17 ms 4060 KB Output is correct
76 Correct 17 ms 4108 KB Output is correct
77 Correct 17 ms 4060 KB Output is correct
78 Correct 18 ms 4088 KB Output is correct
79 Correct 18 ms 4172 KB Output is correct
80 Correct 16 ms 4072 KB Output is correct
81 Correct 21 ms 4116 KB Output is correct
82 Correct 20 ms 4092 KB Output is correct
83 Correct 20 ms 4092 KB Output is correct
84 Correct 21 ms 4116 KB Output is correct
85 Correct 20 ms 4088 KB Output is correct
86 Correct 20 ms 4044 KB Output is correct

Subtask #3
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 2764 KB Output is correct
5 Correct 3 ms 2892 KB Output is correct
6 Correct 3 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 4 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 5 ms 2940 KB Output is correct
15 Correct 4 ms 2892 KB Output is correct
16 Correct 5 ms 2892 KB Output is correct
17 Correct 5 ms 2892 KB Output is correct
18 Correct 5 ms 2892 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 5 ms 2856 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 4 ms 2892 KB Output is correct
24 Correct 4 ms 2892 KB Output is correct
25 Correct 4 ms 2892 KB Output is correct
26 Correct 3 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 4 ms 2892 KB Output is correct
31 Correct 4 ms 2892 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 3 ms 2892 KB Output is correct
34 Correct 4 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 2920 KB Output is correct
38 Correct 3 ms 2892 KB Output is correct
39 Correct 4 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 6 ms 3088 KB Output is correct
46 Correct 23 ms 4044 KB Output is correct
47 Correct 24 ms 4044 KB Output is correct
48 Correct 23 ms 4044 KB Output is correct
49 Correct 14 ms 4212 KB Output is correct
50 Correct 14 ms 4248 KB Output is correct
51 Correct 14 ms 4216 KB Output is correct
52 Correct 20 ms 4252 KB Output is correct
53 Correct 18 ms 4176 KB Output is correct
54 Correct 18 ms 4196 KB Output is correct
55 Correct 17 ms 4300 KB Output is correct
56 Correct 25 ms 4144 KB Output is correct
57 Correct 42 ms 4044 KB Output is correct
58 Correct 46 ms 4056 KB Output is correct
59 Correct 47 ms 4048 KB Output is correct
60 Correct 48 ms 4040 KB Output is correct
61 Correct 22 ms 4168 KB Output is correct
62 Correct 25 ms 4172 KB Output is correct
63 Correct 22 ms 4176 KB Output is correct
64 Correct 19 ms 4044 KB Output is correct
65 Correct 26 ms 3916 KB Output is correct
66 Correct 24 ms 4044 KB Output is correct
67 Correct 23 ms 4044 KB Output is correct
68 Correct 13 ms 4252 KB Output is correct
69 Correct 16 ms 4160 KB Output is correct
70 Correct 17 ms 4184 KB Output is correct
71 Correct 17 ms 4192 KB Output is correct
72 Correct 42 ms 4048 KB Output is correct
73 Correct 56 ms 4048 KB Output is correct
74 Correct 21 ms 4096 KB Output is correct
75 Correct 17 ms 4060 KB Output is correct
76 Correct 17 ms 4108 KB Output is correct
77 Correct 17 ms 4060 KB Output is correct
78 Correct 18 ms 4088 KB Output is correct
79 Correct 18 ms 4172 KB Output is correct
80 Correct 16 ms 4072 KB Output is correct
81 Correct 21 ms 4116 KB Output is correct
82 Correct 20 ms 4092 KB Output is correct
83 Correct 20 ms 4092 KB Output is correct
84 Correct 21 ms 4116 KB Output is correct
85 Correct 20 ms 4088 KB Output is correct
86 Correct 20 ms 4044 KB Output is correct
87 Correct 69 ms 6240 KB Output is correct
88 Correct 262 ms 12596 KB Output is correct
89 Correct 1260 ms 36428 KB Output is correct
90 Correct 1210 ms 36464 KB Output is correct
91 Correct 1302 ms 36448 KB Output is correct
92 Correct 577 ms 41796 KB Output is correct
93 Correct 584 ms 41800 KB Output is correct
94 Correct 623 ms 41828 KB Output is correct
95 Correct 703 ms 41660 KB Output is correct
96 Correct 724 ms 41628 KB Output is correct
97 Correct 755 ms 41680 KB Output is correct
98 Correct 758 ms 41840 KB Output is correct
99 Correct 754 ms 39444 KB Output is correct
100 Execution timed out 2075 ms 36160 KB Time limit exceeded
101 Halted 0 ms 0 KB -