oj.uz

Submission #165063

# Submission time Handle Problem Language Result Execution time Memory
165063 2019-11-25T03:18:32 Z EntityIT Designated Cities (JOI19_designated_cities) C++14
7 / 100
 686 ms 73868 KB 
#include<bits/stdc++.h>

using namespace std;

#define sz(x) ( (int)(x).size() )
#define fi first
#define se second
using LL = long long;

int n, q;
LL sumCost = 0;
vector<int> par;
vector<vector<int> > gr;
vector<multiset<pair<LL, int> > > mx;
vector<LL> down, up, ans, val;
vector<pair<int, int> > query;
struct Edge {
    int to, cost;
    Edge(int _to = 0, int _cost = 0) : to(_to), cost(_cost) {}
};
vector<Edge> edge;

void calDown(int u, int pr) {
    for (int i : gr[u]) {
        int v = edge[i].to, cost = edge[i ^ 1].cost;
        if (v == pr) continue ;
        calDown(v, u);
        down[u] += down[v] + cost;
    }
}

void calUp(int u, int pr) {
    for (int i : gr[u]) {
        int v = edge[i].to, cost = edge[i ^ 1].cost;
        if (v == pr) continue ;
        up[v] = up[u] + down[u] - down[v] - cost + edge[i].cost;
        calUp(v, u);
    }
}

void calVal(int u, int pr) {
    for (int i : gr[u]) {
        int v = edge[i].to;
        if (v == pr) continue ;
        val[v] = val[u] + edge[i].cost + edge[i ^ 1].cost;
    }
}

void dfs(int u, int pr) {
    for (int i : gr[u]) {
        int v = edge[i].to, cost = edge[i].cost;
        if (v == pr) continue ;
        par[v] = u;
        down[v] = down[u] + cost;
        up[v] = up[u] + edge[i ^ 1].cost;
        dfs(v, u);
        mx[u].emplace(*mx[v].rbegin() );
    }
    mx[u].emplace(down[u], u);
}

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

//    freopen("input", "r", stdin);
//    freopen("output", "w", stdout);

    cin >> n;

    gr.assign(n + 5, vector<int>() );
    for (int i = 0; i < n - 1; ++i) {
        int u, v, c, d; cin >> u >> v >> c >> d;
        sumCost += c; sumCost += d;
        gr[u].emplace_back(sz(edge) ); edge.emplace_back(v, c);
        gr[v].emplace_back(sz(edge) ); edge.emplace_back(u, d);
    }

    down.assign(n + 5, 0);
    up.assign(n + 5, 0);
    calDown(1, 1);
    calUp(1, 1);

//    for (int u = 1; u <= n; ++u) cerr << up[u] << ' ' << down[u] << '\n';

    LL ans1 = 0;
    for (int u = 1; u <= n; ++u) ans1 = max(ans1, up[u] + down[u]);

    cin >> q;
    query.reserve(q);
    ans.assign(q, 0);
    for (int i = 0; i < q; ++i) {
        int e; cin >> e;
        if (e == 1) ans[i] = ans1;
        else query.emplace_back(e, i);
    }
    sort(query.begin(), query.end() );

    val.assign(n + 5, 0);
    calVal(1, 1);

    int root = 0;
    for (int u = 1; u <= n; ++u) if (val[root] < val[u]) root = u;

    par.assign(n + 5, 0);
    mx.assign(n + 5, {} );
    dfs(root, root);

    priority_queue<pair<LL, int> > pq;
    pq.emplace(*mx[root].rbegin() );

    int nMark = 1;
    LL curAns = up[root];
    for (auto _ : query) {
        int e = _.fi, id = _.se;
        while (nMark < e) {
            assert(sz(pq) );
            int u = pq.top().se;
            LL cost = pq.top().fi;
            curAns += cost;

            while (u) {
                int pr = par[u];
                par[u] = 0;
                mx[u].erase(prev(mx[u].end() ) );
                if (sz(mx[u]) ) pq.emplace(mx[u].rbegin()->fi - down[u], mx[u].rbegin()->se);

                u = pr;
            }

            ++nMark;
        }
        ans[id] = curAns;
    }

    for (int i = 0; i < q; ++i) cout << sumCost - ans[i] << '\n';

    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 541 ms 60788 KB Output is correct
3 Correct 657 ms 73516 KB Output is correct
4 Correct 536 ms 59488 KB Output is correct
5 Correct 621 ms 61024 KB Output is correct
6 Correct 686 ms 62560 KB Output is correct
7 Correct 636 ms 61292 KB Output is correct
8 Correct 681 ms 73868 KB Output is correct
9 Correct 591 ms 61664 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 575 ms 61068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 541 ms 60788 KB Output is correct
3 Correct 657 ms 73516 KB Output is correct
4 Correct 536 ms 59488 KB Output is correct
5 Correct 621 ms 61024 KB Output is correct
6 Correct 686 ms 62560 KB Output is correct
7 Correct 636 ms 61292 KB Output is correct
8 Correct 681 ms 73868 KB Output is correct
9 Correct 591 ms 61664 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Incorrect 575 ms 61068 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -