oj.uz

Submission #224698

# Submission time Handle Problem Language Result Execution time Memory
224698 2020-04-18T15:50:23 Z DodgeBallMan Election Campaign (JOI15_election_campaign) C++14
30 / 100
 1000 ms 23672 KB 
#include <bits/stdc++.h>
#define iii tuple<int, int, int>

using namespace std;

const int N = 1e5 + 10;

vector<iii> path[N];
vector<int> g[N];
int sz[N], par[N], dp[N], dep[N], rot[N], pos[N], n, q, sum[2][N], key[N];

void dfs( int u, int p ) {
    if( p != 0 ) g[u].erase( find( g[u].begin(), g[u].end(), p ) );
    par[u] = p, sz[u] = 1, dep[u] = dep[p] + 1;
    for( int v : g[u] ) if( v != p ) {
        dfs( v, u );
        if( sz[v] > sz[g[u][0]] ) swap( v, g[u][0] );
    }
}

void hld( int u ) {
    static int idx = 0;
    if( par[u] == 0 || g[par[u]][0] != u ) rot[u] = u;
    else rot[u] = rot[par[u]];
    pos[u] = ++idx;
    key[idx] = u;
    for( int v : g[u] ) hld( v );
}

int queryhld( int ty, int a, int b ) {
    int ret = 0, mi;
    while( rot[a] != rot[b] ) {
        if( dep[rot[a]] < dep[rot[b]] ) swap( a, b );
        if( rot[key[pos[a]+1]] != rot[a] ) mi = 0;
        else mi = sum[ty][pos[a]+1];
        ret += sum[ty][pos[rot[a]]] - mi;
        a = par[rot[a]];
    }
    if( dep[b] < dep[a] ) swap( a, b );
    if( rot[key[pos[b]+1]] != rot[b] ) mi = 0;
    else mi = sum[ty][pos[b]+1];
    ret += sum[ty][pos[a]] - mi;
    return ret;
}

int lca( int a, int b ) {
     while( rot[a] != rot[b] ) {
        if( dep[rot[a]] < dep[rot[b]] ) swap( a, b );
        a = par[rot[a]];
    }
    if( dep[b] < dep[a] ) return b;
    else return a;
}

void updt( int ty, int u, int va ) {
    if( rot[key[pos[u]+1]] != rot[u] ) sum[ty][pos[u]] = va;
    else sum[ty][pos[u]] = sum[ty][pos[u]+1] + va;
}

void solve( int u, int p ) {
    for( int v : g[u] ) if( v != p ) {
        solve( v, u );
        dp[u] += dp[v];
    }   
    updt( 0, u, dp[u] );
    updt( 1, u, 0 );
    for( iii x : path[u] ) {
        int a, b, c;
        tie( a, b, c ) = x;
        dp[u] = max( dp[u], c + queryhld( 0, a, b ) - queryhld( 1, a, b ) );
    }
    updt( 1, u, dp[u] );
}

int main()
{
    scanf("%d",&n);
    for( int i = 1, a, b ; i < n ; i++ ) {
        scanf("%d %d",&a,&b);
        g[a].emplace_back( b ), g[b].emplace_back( a );
    }
    dfs( 1, 0 ), hld( 1 );
    scanf("%d",&q);
    for( int i = 1, a, b, c ; i <= q ; i++ ) {
        scanf("%d %d %d",&a,&b,&c);
        int x = lca( a, b );
        path[x].emplace_back( a, b, c );
    }
    solve( 1, 0 );
    printf("%d",dp[1]);
    return 0;
}

Compilation message

election_campaign.cpp: In function 'int main()':
election_campaign.cpp:77:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
election_campaign.cpp:79:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~~
election_campaign.cpp:83:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
     ~~~~~^~~~~~~~~
election_campaign.cpp:85:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&a,&b,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 84 ms 12408 KB Output is correct
6 Correct 67 ms 21624 KB Output is correct
7 Correct 72 ms 18424 KB Output is correct
8 Correct 66 ms 12664 KB Output is correct
9 Correct 79 ms 16504 KB Output is correct
10 Correct 57 ms 12408 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 8 ms 5248 KB Output is correct
4 Correct 106 ms 23672 KB Output is correct
5 Correct 103 ms 23672 KB Output is correct
6 Correct 104 ms 23672 KB Output is correct
7 Correct 103 ms 23672 KB Output is correct
8 Correct 103 ms 23672 KB Output is correct
9 Correct 107 ms 23672 KB Output is correct
10 Correct 103 ms 23672 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 8 ms 5248 KB Output is correct
4 Correct 106 ms 23672 KB Output is correct
5 Correct 103 ms 23672 KB Output is correct
6 Correct 104 ms 23672 KB Output is correct
7 Correct 103 ms 23672 KB Output is correct
8 Correct 103 ms 23672 KB Output is correct
9 Correct 107 ms 23672 KB Output is correct
10 Correct 103 ms 23672 KB Output is correct
11 Correct 17 ms 6016 KB Output is correct
12 Correct 108 ms 23672 KB Output is correct
13 Correct 109 ms 23672 KB Output is correct
14 Correct 103 ms 23672 KB Output is correct
15 Correct 106 ms 23672 KB Output is correct
16 Correct 106 ms 23672 KB Output is correct
17 Correct 104 ms 23672 KB Output is correct
18 Correct 106 ms 23672 KB Output is correct
19 Correct 108 ms 23672 KB Output is correct
20 Correct 111 ms 23672 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 13872 KB Output is correct
2 Correct 101 ms 23672 KB Output is correct
3 Execution timed out 1097 ms 15224 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 84 ms 12408 KB Output is correct
6 Correct 67 ms 21624 KB Output is correct
7 Correct 72 ms 18424 KB Output is correct
8 Correct 66 ms 12664 KB Output is correct
9 Correct 79 ms 16504 KB Output is correct
10 Correct 57 ms 12408 KB Output is correct
11 Correct 8 ms 5120 KB Output is correct
12 Correct 8 ms 5248 KB Output is correct
13 Correct 8 ms 5248 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct
15 Correct 9 ms 5120 KB Output is correct
16 Correct 8 ms 5248 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 11 ms 5248 KB Output is correct
19 Correct 8 ms 5120 KB Output is correct
20 Correct 8 ms 5248 KB Output is correct

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 84 ms 12408 KB Output is correct
6 Correct 67 ms 21624 KB Output is correct
7 Correct 72 ms 18424 KB Output is correct
8 Correct 66 ms 12664 KB Output is correct
9 Correct 79 ms 16504 KB Output is correct
10 Correct 57 ms 12408 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 8 ms 5248 KB Output is correct
14 Correct 106 ms 23672 KB Output is correct
15 Correct 103 ms 23672 KB Output is correct
16 Correct 104 ms 23672 KB Output is correct
17 Correct 103 ms 23672 KB Output is correct
18 Correct 103 ms 23672 KB Output is correct
19 Correct 107 ms 23672 KB Output is correct
20 Correct 103 ms 23672 KB Output is correct
21 Correct 17 ms 6016 KB Output is correct
22 Correct 108 ms 23672 KB Output is correct
23 Correct 109 ms 23672 KB Output is correct
24 Correct 103 ms 23672 KB Output is correct
25 Correct 106 ms 23672 KB Output is correct
26 Correct 106 ms 23672 KB Output is correct
27 Correct 104 ms 23672 KB Output is correct
28 Correct 106 ms 23672 KB Output is correct
29 Correct 108 ms 23672 KB Output is correct
30 Correct 111 ms 23672 KB Output is correct
31 Correct 213 ms 13872 KB Output is correct
32 Correct 101 ms 23672 KB Output is correct
33 Execution timed out 1097 ms 15224 KB Time limit exceeded
34 Halted 0 ms 0 KB -