oj.uz

답안 #1109707

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109707 2024-11-07T10:51:54 Z _callmelucian Designated Cities (JOI19_designated_cities) C++14
100 / 100
 302 ms 59400 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;
const auto start = chrono::high_resolution_clock::now();
const double TL = 1.8;

double getTime() {
    auto cur = chrono::high_resolution_clock::now();
    chrono::duration<double> elapsed = cur - start;
    return elapsed.count();
}

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(k << 1, lazy[k]), apply(k << 1 | 1, lazy[k]), lazy[k] = 0;
    }

    void build (int k, int l, int r, vector<pl> &a) {
        if (l == r)
            return tr[k] = a[l], void();
        int mid = (l + r) >> 1;
        build(k << 1, l, mid, a);
        build(k << 1 | 1, mid + 1, r, a);
        tr[k] = max(tr[k << 1], tr[k << 1 | 1]);
    }

    void update (int prf, ll val, int k, int l, int r) {
        for (; l < r;) {
            if (prf == r) break;
            pushDown(k);
            int mid = (l + r) >> 1;
            if (prf <= mid) k <<= 1, r = mid;
            else {
                apply(k << 1, val);
                k <<= 1, k |= 1, l = mid + 1;
            }
        }
        apply(k, val);
        for (k >>= 1; k; k >>= 1)
            tr[k] = max(tr[k << 1], tr[k << 1 | 1]);
    }

    pl getBest() { return tr[1]; }
};

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, int pA, int 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], toP[mn], timeDfs;
    bool colored[mn];
    ll weight[mn];
    IT tree(mn);

    bool dfs (int u, int p, int y, int w) {
        num[u] = ++timeDfs, sz[u] = 1, up[u] = p, toP[u] = w;
        if (u == y) colored[u] = 1;

        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];
        }
        return colored[u];
    }

    void buildTree() {
        vector<pl> a(n + 1);
        for (int i = 1; i <= n; i++)
            a[num[i]] = make_pair(0, i);
        for (int i = 1; i <= n; i++) {
            int u = a[i].second;
            if (!colored[u])
                a[i].first = weight[u] = weight[up[u]] + toP[u];
        }
        tree.build(1, 1, n, a);
    }

    void colorNode (int u) {
        if (!u) return;
        while (!colored[u]) {
            tree.update(num[u] + sz[u] - 1, -toP[u], 1, 1, n);
            tree.update(num[u] - 1, toP[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);
    modifiedTree::buildTree();

    bool leafLeft = 1;
    for (int i = 3; i <= n; i++) {
        if (leafLeft) {
            ll delta; int node; tie(delta, node) = modifiedTree::tree.getBest();
            ans[i] = ans[i - 1] - delta;

            if (!delta) leafLeft = 0;
            modifiedTree::colorNode(node);
        }
        else ans[i] = ans[i - 1];
    }

    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 28752 KB Output is correct
2 Correct 5 ms 28716 KB Output is correct
3 Correct 6 ms 28768 KB Output is correct
4 Correct 6 ms 28752 KB Output is correct
5 Correct 6 ms 28624 KB Output is correct
6 Correct 6 ms 28752 KB Output is correct
7 Correct 6 ms 28764 KB Output is correct
8 Correct 6 ms 28752 KB Output is correct
9 Correct 6 ms 28624 KB Output is correct
10 Correct 6 ms 28752 KB Output is correct
11 Correct 6 ms 28920 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 28752 KB Output is correct
2 Correct 255 ms 46408 KB Output is correct
3 Correct 211 ms 58404 KB Output is correct
4 Correct 254 ms 46276 KB Output is correct
5 Correct 252 ms 46080 KB Output is correct
6 Correct 260 ms 48200 KB Output is correct
7 Correct 251 ms 46028 KB Output is correct
8 Correct 174 ms 59400 KB Output is correct
9 Correct 253 ms 46204 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 28752 KB Output is correct
2 Correct 246 ms 46408 KB Output is correct
3 Correct 179 ms 58440 KB Output is correct
4 Correct 220 ms 46184 KB Output is correct
5 Correct 266 ms 46176 KB Output is correct
6 Correct 282 ms 48968 KB Output is correct
7 Correct 225 ms 46420 KB Output is correct
8 Correct 232 ms 55596 KB Output is correct
9 Correct 187 ms 46312 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 28752 KB Output is correct
2 Correct 5 ms 28716 KB Output is correct
3 Correct 6 ms 28768 KB Output is correct
4 Correct 6 ms 28752 KB Output is correct
5 Correct 6 ms 28624 KB Output is correct
6 Correct 6 ms 28752 KB Output is correct
7 Correct 6 ms 28764 KB Output is correct
8 Correct 6 ms 28752 KB Output is correct
9 Correct 6 ms 28624 KB Output is correct
10 Correct 6 ms 28752 KB Output is correct
11 Correct 6 ms 28920 KB Output is correct
12 Correct 5 ms 28752 KB Output is correct
13 Correct 7 ms 28900 KB Output is correct
14 Correct 8 ms 29008 KB Output is correct
15 Correct 8 ms 28752 KB Output is correct
16 Correct 7 ms 29008 KB Output is correct
17 Correct 7 ms 29008 KB Output is correct
18 Correct 7 ms 28776 KB Output is correct
19 Correct 7 ms 28752 KB Output is correct
20 Correct 7 ms 29008 KB Output is correct
21 Correct 9 ms 29008 KB Output is correct
22 Correct 9 ms 28752 KB Output is correct
23 Correct 8 ms 28752 KB Output is correct
24 Correct 7 ms 29008 KB Output is correct
25 Correct 7 ms 29008 KB Output is correct
26 Correct 8 ms 29008 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 28752 KB Output is correct
2 Correct 255 ms 46408 KB Output is correct
3 Correct 211 ms 58404 KB Output is correct
4 Correct 254 ms 46276 KB Output is correct
5 Correct 252 ms 46080 KB Output is correct
6 Correct 260 ms 48200 KB Output is correct
7 Correct 251 ms 46028 KB Output is correct
8 Correct 174 ms 59400 KB Output is correct
9 Correct 253 ms 46204 KB Output is correct
10 Correct 8 ms 28752 KB Output is correct
11 Correct 246 ms 46408 KB Output is correct
12 Correct 179 ms 58440 KB Output is correct
13 Correct 220 ms 46184 KB Output is correct
14 Correct 266 ms 46176 KB Output is correct
15 Correct 282 ms 48968 KB Output is correct
16 Correct 225 ms 46420 KB Output is correct
17 Correct 232 ms 55596 KB Output is correct
18 Correct 187 ms 46312 KB Output is correct
19 Correct 6 ms 28752 KB Output is correct
20 Correct 236 ms 46412 KB Output is correct
21 Correct 232 ms 58420 KB Output is correct
22 Correct 244 ms 46152 KB Output is correct
23 Correct 257 ms 46468 KB Output is correct
24 Correct 292 ms 46152 KB Output is correct
25 Correct 260 ms 46416 KB Output is correct
26 Correct 273 ms 46236 KB Output is correct
27 Correct 236 ms 46320 KB Output is correct
28 Correct 258 ms 48712 KB Output is correct
29 Correct 254 ms 46412 KB Output is correct
30 Correct 238 ms 46336 KB Output is correct
31 Correct 246 ms 46072 KB Output is correct
32 Correct 203 ms 56136 KB Output is correct
33 Correct 190 ms 46072 KB Output is correct

Subtask #6
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 28752 KB Output is correct
2 Correct 5 ms 28716 KB Output is correct
3 Correct 6 ms 28768 KB Output is correct
4 Correct 6 ms 28752 KB Output is correct
5 Correct 6 ms 28624 KB Output is correct
6 Correct 6 ms 28752 KB Output is correct
7 Correct 6 ms 28764 KB Output is correct
8 Correct 6 ms 28752 KB Output is correct
9 Correct 6 ms 28624 KB Output is correct
10 Correct 6 ms 28752 KB Output is correct
11 Correct 6 ms 28920 KB Output is correct
12 Correct 7 ms 28752 KB Output is correct
13 Correct 255 ms 46408 KB Output is correct
14 Correct 211 ms 58404 KB Output is correct
15 Correct 254 ms 46276 KB Output is correct
16 Correct 252 ms 46080 KB Output is correct
17 Correct 260 ms 48200 KB Output is correct
18 Correct 251 ms 46028 KB Output is correct
19 Correct 174 ms 59400 KB Output is correct
20 Correct 253 ms 46204 KB Output is correct
21 Correct 8 ms 28752 KB Output is correct
22 Correct 246 ms 46408 KB Output is correct
23 Correct 179 ms 58440 KB Output is correct
24 Correct 220 ms 46184 KB Output is correct
25 Correct 266 ms 46176 KB Output is correct
26 Correct 282 ms 48968 KB Output is correct
27 Correct 225 ms 46420 KB Output is correct
28 Correct 232 ms 55596 KB Output is correct
29 Correct 187 ms 46312 KB Output is correct
30 Correct 5 ms 28752 KB Output is correct
31 Correct 7 ms 28900 KB Output is correct
32 Correct 8 ms 29008 KB Output is correct
33 Correct 8 ms 28752 KB Output is correct
34 Correct 7 ms 29008 KB Output is correct
35 Correct 7 ms 29008 KB Output is correct
36 Correct 7 ms 28776 KB Output is correct
37 Correct 7 ms 28752 KB Output is correct
38 Correct 7 ms 29008 KB Output is correct
39 Correct 9 ms 29008 KB Output is correct
40 Correct 9 ms 28752 KB Output is correct
41 Correct 8 ms 28752 KB Output is correct
42 Correct 7 ms 29008 KB Output is correct
43 Correct 7 ms 29008 KB Output is correct
44 Correct 8 ms 29008 KB Output is correct
45 Correct 6 ms 28752 KB Output is correct
46 Correct 236 ms 46412 KB Output is correct
47 Correct 232 ms 58420 KB Output is correct
48 Correct 244 ms 46152 KB Output is correct
49 Correct 257 ms 46468 KB Output is correct
50 Correct 292 ms 46152 KB Output is correct
51 Correct 260 ms 46416 KB Output is correct
52 Correct 273 ms 46236 KB Output is correct
53 Correct 236 ms 46320 KB Output is correct
54 Correct 258 ms 48712 KB Output is correct
55 Correct 254 ms 46412 KB Output is correct
56 Correct 238 ms 46336 KB Output is correct
57 Correct 246 ms 46072 KB Output is correct
58 Correct 203 ms 56136 KB Output is correct
59 Correct 190 ms 46072 KB Output is correct
60 Correct 6 ms 28764 KB Output is correct
61 Correct 302 ms 46236 KB Output is correct
62 Correct 237 ms 58440 KB Output is correct
63 Correct 207 ms 46284 KB Output is correct
64 Correct 240 ms 46408 KB Output is correct
65 Correct 237 ms 46152 KB Output is correct
66 Correct 245 ms 46360 KB Output is correct
67 Correct 241 ms 46152 KB Output is correct
68 Correct 246 ms 46068 KB Output is correct
69 Correct 260 ms 48276 KB Output is correct
70 Correct 259 ms 46192 KB Output is correct
71 Correct 246 ms 46348 KB Output is correct
72 Correct 227 ms 46076 KB Output is correct
73 Correct 217 ms 55892 KB Output is correct
74 Correct 229 ms 46104 KB Output is correct