oj.uz

Submission #96682

# Submission time Handle Problem Language Result Execution time Memory
96682 2019-02-10T19:44:37 Z keko37 Transport (COCI19_transport) C++14
117 / 130
 322 ms 17388 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long llint;

const int MAXN = 100005;

llint n, root, cc, sol;
int val[MAXN];
llint par[MAXN], siz[MAXN], dp1[MAXN], dp2[MAXN], curr[MAXN], moze[MAXN];
bool cen[MAXN];
vector < pair <int, int> > v[MAXN];
vector <int> q, t;

void dfs (int x, int rod) {
    par[x] = rod;
    siz[x] = 1;
    for (auto it : v[x]) {
        int sus = it.first;
        if (sus == rod || cen[sus]) continue;
        dfs(sus, x);
        siz[x] += siz[sus];
    }
}

int nadi_centroid (int x) {
    int mx = 0, ind = 0;
    if (par[x] != 0) {
        mx = siz[root] - siz[x];
        ind = par[x];
    }
    for (auto it : v[x]) {
        int sus = it.first;
        if (sus == par[x] || cen[sus]) continue;
        if (siz[sus] > mx) {
            mx = siz[sus];
            ind = sus;
        }
    }
    if (mx * 2 > siz[root]) return nadi_centroid(ind);
    return x;
}

void calc_dp (int x, int rod) {
    if (rod == 0) {
        dp1[x] = 0;
        dp2[x] = 0;
        curr[x] = val[x];
    }
    if (rod != 0 && dp1[x] == 0) sol++;
    q.push_back(dp1[x]);
    for (auto it : v[x]) {
        int sus = it.first;
        int dist = it.second;
        if (sus == rod || cen[sus]) continue;
        dp1[sus] = max(dp1[x], -(curr[x] - dist));
        curr[sus] = curr[x] - dist + val[sus];
        dp2[sus] = max(0LL, dp2[x]-(val[sus] - dist));
        calc_dp(sus, x);
    }
}

void napravi (int x, int rod) {
    t.push_back(dp1[x]);
    for (auto it : v[x]) {
        int sus = it.first;
        if (sus == rod || cen[sus]) continue;
        napravi(sus, x);
    }
}

void upit (int x, int rod) {
    if (dp2[x] == 0) {
        sol += upper_bound(q.begin(), q.end(), curr[x] - val[cc]) - q.begin() - 1;
        sol -= upper_bound(t.begin(), t.end(), curr[x] - val[cc]) - t.begin() - 1;
    }
    for (auto it : v[x]) {
        int sus = it.first;
        if (sus == rod || cen[sus]) continue;
        upit(sus, x);
    }
}

void decompose (int x) {
    root = x;
    dfs(root, 0);
    cc = nadi_centroid(root);
    cen[cc] = 1;
    q.clear();
    calc_dp(cc, 0);
    sort(q.begin(), q.end());
    for (auto it : v[cc]) {
        int sus = it.first;
        if (cen[sus]) continue;
        t.clear();
        napravi(sus, cc);
        sort(t.begin(), t.end());
        upit(sus, cc);
    }
    int cvor = cc;
    for (auto it : v[cvor]) {
        int sus = it.first;
        if (cen[sus]) continue;
        decompose(sus);
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i=1; i<=n; i++) {
        cin >> val[i];
    }
    for (int i=0; i<n-1; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        v[a].push_back(make_pair(b, c));
        v[b].push_back(make_pair(a, c));
    }
    decompose(1);
    cout << sol;
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3064 KB Output is correct
2 Correct 8 ms 3192 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3320 KB Output is correct
2 Correct 10 ms 3448 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 9080 KB Output is correct
2 Correct 66 ms 8464 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 11452 KB Output is correct
2 Correct 137 ms 12608 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 14780 KB Output is correct
2 Incorrect 204 ms 17388 KB Output isn't correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 5240 KB Output is correct
2 Correct 34 ms 4984 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 7032 KB Output is correct
2 Correct 113 ms 6516 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 8052 KB Output is correct
2 Correct 179 ms 8564 KB Output is correct

Subtask #9
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 9840 KB Output is correct
2 Correct 210 ms 10096 KB Output is correct

Subtask #10
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 12212 KB Output is correct
2 Correct 321 ms 11252 KB Output is correct