oj.uz

답안 #1109675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109675 2024-11-07T09:28:24 Z _callmelucian Designated Cities (JOI19_designated_cities) C++14
39 / 100
 2000 ms 65684 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tpl;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

const int mn = 2e5 + 5;

struct IT {
    vector<pl> tr;
    vector<ll> lazy;

    IT (int sz) : tr(4 * sz), lazy(4 * sz) {}

    void apply (int k, ll val) {
        tr[k].first += val, lazy[k] += val;
    }

    void pushDown (int k) {
        if (lazy[k])
            apply(2 * k, lazy[k]), apply(2 * k + 1, lazy[k]), lazy[k] = 0;
    }

    void indexing (int pos, int val, int k, int l, int r) {
        for (; l < r;) {
            int mid = (l + r) >> 1;
            if (pos <= mid) k <<= 1, r = mid;
            else k <<= 1, k |= 1, l = mid + 1;
        }
        tr[k] = make_pair(0, val);
        for (k /= 2; k; k /= 2)
            tr[k] = max(tr[2 * k], tr[2 * k + 1]);
    }

    void update (int a, int b, ll val, int k, int l, int r) {
        if (b < l || r < a) return;
        if (l == r)
            return apply(k, val), void();
        pushDown(k);
        int mid = (l + r) >> 1;
        update(a, b, val, 2 * k, l, mid);
        update(a, b, val, 2 * k + 1, mid + 1, r);
        tr[k] = max(tr[2 * k], tr[2 * k + 1]);
    }

    pl query (int a, int b, int k, int l, int r) {
        if (b < l || r < a) return make_pair(0, 0);
        if (a <= l && r <= b) return tr[k];
        pushDown(k);
        int mid = (l + r) >> 1;
        return max(query(a, b, 2 * k, l, mid), query(a, b, 2 * k + 1, mid + 1, r));
    }
};

vector<tpl> adj[mn];
ll ans[mn], n;

namespace originalTree {
    int bestLeaf[mn], secLeaf[mn];
    ll downPath[mn], upPath[mn], sumDown;

    void dfs (int u, int p, ll pA, ll pH) {
        // construct costs on paths
        downPath[u] = downPath[p] + pA;
        upPath[u] = upPath[p] + pH;
        bestLeaf[u] = u;

        // run dfs down
        for (tpl item : adj[u]) {
            int v, away, home; tie(v, away, home) = item;
            if (v == p) continue;
            dfs(v, u, away, home);

            sumDown += away;
            if (downPath[bestLeaf[v]] > downPath[bestLeaf[u]])
                secLeaf[u] = bestLeaf[u], bestLeaf[u] = bestLeaf[v];
            else if (downPath[bestLeaf[v]] > downPath[secLeaf[u]]) secLeaf[u] = bestLeaf[v];
        }
    }

    ll tryNode (int u) {
        ll pathOne = downPath[bestLeaf[u]] - (bestLeaf[u] ? downPath[u] : 0);
        ll pathTwo = downPath[secLeaf[u]] - (secLeaf[u] ? downPath[u] : 0);
        return sumDown - pathOne - pathTwo - downPath[u] + upPath[u];
    }

    ll chooseNode (int u) {
        return sumDown - downPath[u] + upPath[u];
    }
}

namespace modifiedTree {
    int num[mn], sz[mn], up[mn], timeDfs;
    bool colored[mn];
    ll weight[mn];
    IT tree(mn);

    bool dfs (int u, int p, int y, ll w) {
        num[u] = ++timeDfs, sz[u] = 1, up[u] = p, weight[u] = w;
        if (u == y) colored[u] = 1;
        tree.indexing(num[u], u, 1, 1, n);

        for (tpl item : adj[u]) {
            int v, away, home; tie(v, away, home) = item;
            if (v == p) continue;
            if (dfs(v, u, y, away)) colored[u] = 1;
            sz[u] += sz[v];
        }

        if (!colored[u])
            tree.update(num[u], num[u] + sz[u] - 1, w, 1, 1, n);
        return colored[u];
    }

    pl pickCand() {
        return tree.query(1, n, 1, 1, n);
    }

    void colorNode (int u) {
        while (!colored[u]) {
            tree.update(num[u], num[u] + sz[u] - 1, -weight[u], 1, 1, n);
            colored[u] = 1, u = up[u];
        }
    }
};

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

    cin >> n;
    for (int i = 1; i < n; i++) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        adj[a].emplace_back(b, c, d);
        adj[b].emplace_back(a, d, c);
    }
    originalTree::dfs(1, 1, 0, 0);

    for (int i = 1; i <= n; i++) ans[i] = LLONG_MAX;

    int optX = 0, optY = 0;
    for (int i = 1; i <= n; i++) {
        ll cur = originalTree::tryNode(i);
        if (cur < ans[2])
            ans[2] = cur, optX = originalTree::bestLeaf[i], optY = originalTree::secLeaf[i];

        ans[1] = min(ans[1], originalTree::chooseNode(i));
    }
    modifiedTree::dfs(optX, optX, optY, 0);

    for (int i = 3; i <= n; i++) {
        ll delta; int node; tie(delta, node) = modifiedTree::pickCand();
        ans[i] = ans[i - 1] - delta;
        modifiedTree::colorNode(node);
    }

    int q; cin >> q;
    while (q--) {
        int E; cin >> E;
        cout << ans[E] << "\n";
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27984 KB Output is correct
2 Correct 5 ms 27984 KB Output is correct
3 Correct 5 ms 27984 KB Output is correct
4 Correct 5 ms 27984 KB Output is correct
5 Correct 5 ms 27984 KB Output is correct
6 Correct 5 ms 27984 KB Output is correct
7 Correct 5 ms 27984 KB Output is correct
8 Correct 5 ms 27984 KB Output is correct
9 Correct 5 ms 27984 KB Output is correct
10 Correct 5 ms 27984 KB Output is correct
11 Correct 5 ms 27984 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27984 KB Output is correct
2 Correct 454 ms 48936 KB Output is correct
3 Correct 166 ms 65636 KB Output is correct
4 Correct 1053 ms 47400 KB Output is correct
5 Correct 287 ms 48640 KB Output is correct
6 Correct 256 ms 51132 KB Output is correct
7 Correct 271 ms 48636 KB Output is correct
8 Correct 186 ms 64860 KB Output is correct
9 Correct 237 ms 49396 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27984 KB Output is correct
2 Correct 534 ms 48824 KB Output is correct
3 Correct 173 ms 65684 KB Output is correct
4 Correct 947 ms 47424 KB Output is correct
5 Correct 285 ms 48640 KB Output is correct
6 Correct 285 ms 51872 KB Output is correct
7 Correct 233 ms 48884 KB Output is correct
8 Correct 225 ms 59956 KB Output is correct
9 Correct 239 ms 48900 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27984 KB Output is correct
2 Correct 5 ms 27984 KB Output is correct
3 Correct 5 ms 27984 KB Output is correct
4 Correct 5 ms 27984 KB Output is correct
5 Correct 5 ms 27984 KB Output is correct
6 Correct 5 ms 27984 KB Output is correct
7 Correct 5 ms 27984 KB Output is correct
8 Correct 5 ms 27984 KB Output is correct
9 Correct 5 ms 27984 KB Output is correct
10 Correct 5 ms 27984 KB Output is correct
11 Correct 5 ms 27984 KB Output is correct
12 Correct 5 ms 27984 KB Output is correct
13 Correct 7 ms 28240 KB Output is correct
14 Correct 8 ms 28240 KB Output is correct
15 Correct 7 ms 28240 KB Output is correct
16 Correct 7 ms 28240 KB Output is correct
17 Correct 7 ms 28240 KB Output is correct
18 Correct 7 ms 28096 KB Output is correct
19 Correct 7 ms 28240 KB Output is correct
20 Correct 8 ms 28240 KB Output is correct
21 Correct 6 ms 28240 KB Output is correct
22 Correct 7 ms 28240 KB Output is correct
23 Correct 7 ms 28240 KB Output is correct
24 Correct 8 ms 28424 KB Output is correct
25 Correct 6 ms 28240 KB Output is correct
26 Correct 6 ms 28264 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27984 KB Output is correct
2 Correct 454 ms 48936 KB Output is correct
3 Correct 166 ms 65636 KB Output is correct
4 Correct 1053 ms 47400 KB Output is correct
5 Correct 287 ms 48640 KB Output is correct
6 Correct 256 ms 51132 KB Output is correct
7 Correct 271 ms 48636 KB Output is correct
8 Correct 186 ms 64860 KB Output is correct
9 Correct 237 ms 49396 KB Output is correct
10 Correct 5 ms 27984 KB Output is correct
11 Correct 534 ms 48824 KB Output is correct
12 Correct 173 ms 65684 KB Output is correct
13 Correct 947 ms 47424 KB Output is correct
14 Correct 285 ms 48640 KB Output is correct
15 Correct 285 ms 51872 KB Output is correct
16 Correct 233 ms 48884 KB Output is correct
17 Correct 225 ms 59956 KB Output is correct
18 Correct 239 ms 48900 KB Output is correct
19 Correct 5 ms 27984 KB Output is correct
20 Correct 476 ms 48872 KB Output is correct
21 Correct 151 ms 65612 KB Output is correct
22 Correct 1068 ms 47600 KB Output is correct
23 Correct 460 ms 48984 KB Output is correct
24 Correct 904 ms 47688 KB Output is correct
25 Correct 561 ms 48948 KB Output is correct
26 Correct 1184 ms 47704 KB Output is correct
27 Correct 278 ms 48632 KB Output is correct
28 Correct 274 ms 51320 KB Output is correct
29 Execution timed out 2070 ms 48744 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27984 KB Output is correct
2 Correct 5 ms 27984 KB Output is correct
3 Correct 5 ms 27984 KB Output is correct
4 Correct 5 ms 27984 KB Output is correct
5 Correct 5 ms 27984 KB Output is correct
6 Correct 5 ms 27984 KB Output is correct
7 Correct 5 ms 27984 KB Output is correct
8 Correct 5 ms 27984 KB Output is correct
9 Correct 5 ms 27984 KB Output is correct
10 Correct 5 ms 27984 KB Output is correct
11 Correct 5 ms 27984 KB Output is correct
12 Correct 5 ms 27984 KB Output is correct
13 Correct 454 ms 48936 KB Output is correct
14 Correct 166 ms 65636 KB Output is correct
15 Correct 1053 ms 47400 KB Output is correct
16 Correct 287 ms 48640 KB Output is correct
17 Correct 256 ms 51132 KB Output is correct
18 Correct 271 ms 48636 KB Output is correct
19 Correct 186 ms 64860 KB Output is correct
20 Correct 237 ms 49396 KB Output is correct
21 Correct 5 ms 27984 KB Output is correct
22 Correct 534 ms 48824 KB Output is correct
23 Correct 173 ms 65684 KB Output is correct
24 Correct 947 ms 47424 KB Output is correct
25 Correct 285 ms 48640 KB Output is correct
26 Correct 285 ms 51872 KB Output is correct
27 Correct 233 ms 48884 KB Output is correct
28 Correct 225 ms 59956 KB Output is correct
29 Correct 239 ms 48900 KB Output is correct
30 Correct 5 ms 27984 KB Output is correct
31 Correct 7 ms 28240 KB Output is correct
32 Correct 8 ms 28240 KB Output is correct
33 Correct 7 ms 28240 KB Output is correct
34 Correct 7 ms 28240 KB Output is correct
35 Correct 7 ms 28240 KB Output is correct
36 Correct 7 ms 28096 KB Output is correct
37 Correct 7 ms 28240 KB Output is correct
38 Correct 8 ms 28240 KB Output is correct
39 Correct 6 ms 28240 KB Output is correct
40 Correct 7 ms 28240 KB Output is correct
41 Correct 7 ms 28240 KB Output is correct
42 Correct 8 ms 28424 KB Output is correct
43 Correct 6 ms 28240 KB Output is correct
44 Correct 6 ms 28264 KB Output is correct
45 Correct 5 ms 27984 KB Output is correct
46 Correct 476 ms 48872 KB Output is correct
47 Correct 151 ms 65612 KB Output is correct
48 Correct 1068 ms 47600 KB Output is correct
49 Correct 460 ms 48984 KB Output is correct
50 Correct 904 ms 47688 KB Output is correct
51 Correct 561 ms 48948 KB Output is correct
52 Correct 1184 ms 47704 KB Output is correct
53 Correct 278 ms 48632 KB Output is correct
54 Correct 274 ms 51320 KB Output is correct
55 Execution timed out 2070 ms 48744 KB Time limit exceeded
56 Halted 0 ms 0 KB -