oj.uz

Submission #153831

# Submission time Handle Problem Language Result Execution time Memory
153831 2019-09-16T16:47:31 Z karma Election Campaign (JOI15_election_campaign) C++14
0 / 100
 191 ms 26356 KB 
#include<bits/stdc++.h>
#define pb      emplace_back

using namespace std;

const int N = int(2e5) + 7;
const int logN = 17;

int n, m, u, v, cur, res, fr[N], to[N], c[N], f[N], g[N];
int h[N], p[N][logN], Time = 0, in[N], out[N], t[N];
vector<int> q[N], a[N];

void BuildTree(int u, int par) {
     p[u][0] = par; in[u] = ++Time;
     for(int i = 1; i < logN; ++i) p[u][i] = p[p[u][i - 1]][i - 1];
     for(int v: a[u]) {
        if(v == par) continue;
        h[v] = h[u] + 1;
        BuildTree(v, u);
     }
     out[u] = Time;
}

int LCA(int u, int v) {
    if(h[u] < h[v]) swap(u, v);
    for(int i = logN - 1; i >= 0; --i)
        if(h[u] - (1 << i) >= h[v]) u = p[u][i];
    if(u == v) return u;
    for(int i = logN - 1; i >= 0; --i)
       if(p[u][i] != p[v][i]) u = p[u][i], v = p[v][i];
    return p[u][0];
}

void Update(int x, int val) {for(; x <= n; x += (x & -x)) t[x] += val;}
int Query(int x) {int res = 0; for(; x > 0; x -= (x & -x)) res += t[x]; return res;}

void GetAns(int u) {
     for(int v: a[u]) {
        if(v == p[u][0]) continue;
        GetAns(v); g[u] += f[v];
     }
     for(int v: a[u]) {
        if(v == p[u][0]) continue;
        Update(in[v], g[u] - f[v]);
        Update(out[v] + 1, f[v] - g[u]);
     }
     for(int i: q[u]) {
        cur = g[fr[i]] + g[to[i]] - g[u] + Query(in[fr[i]]) + Query(in[to[i]]) + c[i];
        f[u] = max(f[u], cur);
     }
     res = max(res, f[u]);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen("test.inp", "r")) {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    cin >> n;
    for(int i = 1; i < n; ++i) {
        cin >> u >> v;
        a[u].pb(v), a[v].pb(u);
    }
    BuildTree(1, 1);
    cin >> m;
    for(int i = 0; i < m; ++i) {
        cin >> fr[i] >> to[i] >> c[i];
        q[LCA(fr[i], to[i])].pb(i);
    }
    res = 0;
    GetAns(1);
    cout << res;
}

Compilation message

election_campaign.cpp: In function 'int main()':
election_campaign.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("test.inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
election_campaign.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("test.out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 11 ms 9848 KB Output is correct
3 Incorrect 11 ms 9852 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 191 ms 26356 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 11 ms 9848 KB Output is correct
3 Incorrect 11 ms 9852 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 11 ms 9848 KB Output is correct
3 Incorrect 11 ms 9852 KB Output isn't correct
4 Halted 0 ms 0 KB -