oj.uz

Submission #906732

# Submission time Handle Problem Language Result Execution time Memory
906732 2024-01-14T22:40:46 Z box Election Campaign (JOI15_election_campaign) C++17
100 / 100
 126 ms 31060 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
template <class T, class... U> void bug_h(const T& t, const U&... u) { cerr << t; ((cerr << " | " << u), ...); cerr << endl; }
#define bug(...) cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: ", bug_h(__VA_ARGS__)
#else
#define cerr if (0) cerr
#define bug(...)
#endif

#define ar array
#define all(v) std::begin(v), std::end(v)
#define sz(v) int(std::size(v))
typedef long long i64;
typedef vector<int> vi;
typedef pair<int, int> pi;

const int MAXN = 1e5;

int N;
vi adj[MAXN];
int depth[MAXN], jmp[MAXN][17], tin[MAXN], tout[MAXN], tt;
vector<ar<int, 3>> paths[MAXN];
i64 dp[MAXN], dq[MAXN];

struct {
    i64 t[MAXN];
    void add(int i, i64 x) {
        while (i < MAXN) {
            t[i] += x;
            i |= i+1;
        }
    }
    i64 qry(int i) {
        i64 x = 0;
        while (i >= 0) {
            x += t[i];
            i &= i+1, i--;
        }
        return x;
    }
    void add(int l, int r, i64 x) {
        add(l, x), add(r+1, -x);
    }
} T;

void dfs(int i) {
    tin[i] = tt++;
    for (int l = 1; l < 17; l++) jmp[i][l] = jmp[jmp[i][l-1]][l-1];
    for (int j : adj[i]) if (jmp[i][0]^j) {
        depth[j] = depth[i]+1;
        jmp[j][0] = i;
        dfs(j);
    }
    tout[i] = tt-1;
}

int jump(int i, int d) {
    for (int l = 0; l < 17; l++) if (d>>l&1) i = jmp[i][l];
    return i;
}

int lca(int i, int j) {
    if (depth[i] < depth[j]) swap(i, j);
    i = jump(i, depth[i]-depth[j]);
    if (i == j) return i;
    for (int l = 16; l >= 0; l--) if (jmp[i][l]^jmp[j][l]) i = jmp[i][l], j = jmp[j][l];
    return jmp[i][0];
}

void rec(int i) {
    for (int j : adj[i]) if (jmp[i][0]^j) rec(j);
    for (int j : adj[i]) if (jmp[i][0]^j) {
        T.add(tin[i]+1, tout[i], dp[j]);
        T.add(tin[j], tout[j], -dp[j]);
        dq[i] += dp[j];
    }
    dp[i] = dq[i];
    for (auto [x, y, w] : paths[i])
        if (x^i) dp[i] = max(dp[i], w+T.qry(tin[x])+T.qry(tin[y])-dq[i]+dq[x]+dq[y]);
        else dp[i] = max(dp[i], w+T.qry(tin[y])+dq[y]);
}


int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    for (int i = 0; i < N-1; i++) {
        int x, y; cin >> x >> y, x--, y--;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    jmp[0][0] = 0;
    dfs(0);
    int M; cin >> M;
    while (M--) {
        int x, y, w; cin >> x >> y >> w, x--, y--;
        if (depth[x] > depth[y]) swap(x, y);
        int z = lca(x, y);
        paths[z].push_back({x, y, w});
    }
    rec(0);
    cout << dp[0] << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 74 ms 19704 KB Output is correct
6 Correct 37 ms 27224 KB Output is correct
7 Correct 82 ms 24656 KB Output is correct
8 Correct 71 ms 19876 KB Output is correct
9 Correct 62 ms 23120 KB Output is correct
10 Correct 50 ms 19796 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 3 ms 10840 KB Output is correct
4 Correct 83 ms 30548 KB Output is correct
5 Correct 78 ms 30652 KB Output is correct
6 Correct 79 ms 30544 KB Output is correct
7 Correct 81 ms 30600 KB Output is correct
8 Correct 79 ms 30580 KB Output is correct
9 Correct 76 ms 30544 KB Output is correct
10 Correct 81 ms 30548 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 3 ms 10840 KB Output is correct
4 Correct 83 ms 30548 KB Output is correct
5 Correct 78 ms 30652 KB Output is correct
6 Correct 79 ms 30544 KB Output is correct
7 Correct 81 ms 30600 KB Output is correct
8 Correct 79 ms 30580 KB Output is correct
9 Correct 76 ms 30544 KB Output is correct
10 Correct 81 ms 30548 KB Output is correct
11 Correct 8 ms 11612 KB Output is correct
12 Correct 90 ms 31060 KB Output is correct
13 Correct 87 ms 30924 KB Output is correct
14 Correct 78 ms 30800 KB Output is correct
15 Correct 82 ms 30932 KB Output is correct
16 Correct 77 ms 30804 KB Output is correct
17 Correct 83 ms 30800 KB Output is correct
18 Correct 81 ms 30804 KB Output is correct
19 Correct 74 ms 30800 KB Output is correct
20 Correct 86 ms 30796 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 19980 KB Output is correct
2 Correct 76 ms 28172 KB Output is correct
3 Correct 118 ms 27520 KB Output is correct
4 Correct 84 ms 22628 KB Output is correct
5 Correct 111 ms 27132 KB Output is correct
6 Correct 77 ms 22576 KB Output is correct
7 Correct 120 ms 26760 KB Output is correct
8 Correct 96 ms 22652 KB Output is correct
9 Correct 75 ms 30640 KB Output is correct
10 Correct 119 ms 25752 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 74 ms 19704 KB Output is correct
6 Correct 37 ms 27224 KB Output is correct
7 Correct 82 ms 24656 KB Output is correct
8 Correct 71 ms 19876 KB Output is correct
9 Correct 62 ms 23120 KB Output is correct
10 Correct 50 ms 19796 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 3 ms 10800 KB Output is correct
13 Correct 3 ms 10844 KB Output is correct
14 Correct 3 ms 10732 KB Output is correct
15 Correct 3 ms 10732 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 4 ms 10588 KB Output is correct
18 Correct 3 ms 10840 KB Output is correct
19 Correct 3 ms 10588 KB Output is correct
20 Correct 3 ms 10844 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 74 ms 19704 KB Output is correct
6 Correct 37 ms 27224 KB Output is correct
7 Correct 82 ms 24656 KB Output is correct
8 Correct 71 ms 19876 KB Output is correct
9 Correct 62 ms 23120 KB Output is correct
10 Correct 50 ms 19796 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 3 ms 10840 KB Output is correct
14 Correct 83 ms 30548 KB Output is correct
15 Correct 78 ms 30652 KB Output is correct
16 Correct 79 ms 30544 KB Output is correct
17 Correct 81 ms 30600 KB Output is correct
18 Correct 79 ms 30580 KB Output is correct
19 Correct 76 ms 30544 KB Output is correct
20 Correct 81 ms 30548 KB Output is correct
21 Correct 8 ms 11612 KB Output is correct
22 Correct 90 ms 31060 KB Output is correct
23 Correct 87 ms 30924 KB Output is correct
24 Correct 78 ms 30800 KB Output is correct
25 Correct 82 ms 30932 KB Output is correct
26 Correct 77 ms 30804 KB Output is correct
27 Correct 83 ms 30800 KB Output is correct
28 Correct 81 ms 30804 KB Output is correct
29 Correct 74 ms 30800 KB Output is correct
30 Correct 86 ms 30796 KB Output is correct
31 Correct 94 ms 19980 KB Output is correct
32 Correct 76 ms 28172 KB Output is correct
33 Correct 118 ms 27520 KB Output is correct
34 Correct 84 ms 22628 KB Output is correct
35 Correct 111 ms 27132 KB Output is correct
36 Correct 77 ms 22576 KB Output is correct
37 Correct 120 ms 26760 KB Output is correct
38 Correct 96 ms 22652 KB Output is correct
39 Correct 75 ms 30640 KB Output is correct
40 Correct 119 ms 25752 KB Output is correct
41 Correct 3 ms 10588 KB Output is correct
42 Correct 3 ms 10800 KB Output is correct
43 Correct 3 ms 10844 KB Output is correct
44 Correct 3 ms 10732 KB Output is correct
45 Correct 3 ms 10732 KB Output is correct
46 Correct 3 ms 10588 KB Output is correct
47 Correct 4 ms 10588 KB Output is correct
48 Correct 3 ms 10840 KB Output is correct
49 Correct 3 ms 10588 KB Output is correct
50 Correct 3 ms 10844 KB Output is correct
51 Correct 122 ms 22980 KB Output is correct
52 Correct 82 ms 30968 KB Output is correct
53 Correct 126 ms 26268 KB Output is correct
54 Correct 98 ms 23096 KB Output is correct
55 Correct 93 ms 22772 KB Output is correct
56 Correct 82 ms 31024 KB Output is correct
57 Correct 110 ms 26956 KB Output is correct
58 Correct 86 ms 22980 KB Output is correct
59 Correct 105 ms 22848 KB Output is correct
60 Correct 89 ms 31000 KB Output is correct
61 Correct 116 ms 26960 KB Output is correct
62 Correct 77 ms 22732 KB Output is correct
63 Correct 102 ms 22664 KB Output is correct
64 Correct 90 ms 30780 KB Output is correct
65 Correct 125 ms 26776 KB Output is correct
66 Correct 94 ms 22864 KB Output is correct
67 Correct 112 ms 22708 KB Output is correct
68 Correct 81 ms 30936 KB Output is correct
69 Correct 109 ms 25604 KB Output is correct
70 Correct 79 ms 23068 KB Output is correct