oj.uz

Submission #72609

# Submission time Handle Problem Language Result Execution time Memory
72609 2018-08-26T11:32:01 Z claudy Election Campaign (JOI15_election_campaign) C++14
100 / 100
 999 ms 141968 KB 
# pragma GCC optimize("O3")
# include <bits/stdc++.h>
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cerr << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
# define int ll
using namespace std;

int tin[1 << 17],tout[1 << 17],p[1 << 17][17];
vector<int>vec[1 << 17];
vector<pair<int,int>>clad[1 << 17];
int timer;
int n,a,b,c;
int depth[1 << 17],s[1 << 17][17];
int dp[1 << 17],sum[1 << 17];

struct data
{
    int a,b,c;
};

vector<data>t[1 << 17];

bool upper(int a,int b)
{
    return (tin[a] <= tin[b] && tout[a] >= tout[b]);
}

int lca(int a,int b)
{
    if(upper(a,b)) return a;
    if(upper(b,a)) return b;
    for(int l = 16;l + 1;l--)
    {
        if(!upper(p[a][l],b)) a = p[a][l];
    }
    return p[a][0];
}

void predfs(int nod,int par)
{
    depth[nod] = depth[par] + 1;
    tin[nod] = timer++;
    p[nod][0] = par;
    clad[par].pb(mp(nod,0));
    for(int l = 1;l <= 16;l++)
    {
        p[nod][l] = p[p[nod][l - 1]][l - 1];
        clad[p[nod][l]].pb(mp(nod,l));
    }
    for(auto it : vec[nod])
    {
        if(it != par)
        {
            predfs(it,nod);
        }
    }
    tout[nod] = timer++;
}

int f(int nod,int len)
{
    len--;
    if(len == -1) return 0;
    int ans = sum[nod] - dp[nod];
    for(int i = 16;i >= 0;i--)
    {
        if(len & (1 << i))
        {
            ans += s[nod][i];
            ans -= sum[nod] - dp[nod];
            nod = p[nod][i];
        }
    }
    return ans;
}

void put(int nod)
{
    int x = sum[nod] - dp[nod];
    for(auto it : clad[nod])
    {
        if(it.second == 0)
        {
            s[it.first][0] = x + sum[it.first] - dp[it.first];
        }
        else
        {
            s[it.first][it.second] = s[it.first][it.second - 1] + s[p[it.first][it.second - 1]][it.second - 1] - sum[p[it.first][it.second - 1]] + dp[p[it.first][it.second - 1]];
        }
    }
}

void dfs(int nod,int par)
{
    for(auto it : vec[nod])
    {
        if(it != par){
            dfs(it,nod);
            sum[nod] += dp[it];
        }
    }
    dp[nod] = sum[nod];
    int mx = sum[nod];
    for(auto it : t[nod])
    {
        mx = max(mx,it.c + sum[nod] + f(it.a,depth[it.a] - depth[nod]) + f(it.b,depth[it.b] - depth[nod]));
    }
    dp[nod] = mx;
    put(nod);
}

int32_t main(){_
    //freopen("input","r",stdin);
    cin >> n;
    for(int i = 1;i < n;i++)
    {
        cin >> a >> b;
        a--;
        b--;
        vec[a].pb(b);
        vec[b].pb(a);
    }
    predfs(0,0);
    int q;
    cin >> q;
    while(q--)
    {
        cin >> a >> b >> c;
        a--;
        b--;
        t[lca(a,b)].pb({a,b,c});
    }
    dfs(0,0);
    rc(dp[0]);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9592 KB Output is correct
2 Correct 14 ms 9700 KB Output is correct
3 Correct 14 ms 9776 KB Output is correct
4 Correct 15 ms 10488 KB Output is correct
5 Correct 412 ms 73316 KB Output is correct
6 Correct 374 ms 88628 KB Output is correct
7 Correct 707 ms 88628 KB Output is correct
8 Correct 337 ms 88628 KB Output is correct
9 Correct 682 ms 88628 KB Output is correct
10 Correct 356 ms 88628 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 88628 KB Output is correct
2 Correct 13 ms 88628 KB Output is correct
3 Correct 15 ms 88628 KB Output is correct
4 Correct 548 ms 92192 KB Output is correct
5 Correct 500 ms 92264 KB Output is correct
6 Correct 490 ms 92264 KB Output is correct
7 Correct 454 ms 92300 KB Output is correct
8 Correct 536 ms 92300 KB Output is correct
9 Correct 467 ms 92300 KB Output is correct
10 Correct 482 ms 92308 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 88628 KB Output is correct
2 Correct 13 ms 88628 KB Output is correct
3 Correct 15 ms 88628 KB Output is correct
4 Correct 548 ms 92192 KB Output is correct
5 Correct 500 ms 92264 KB Output is correct
6 Correct 490 ms 92264 KB Output is correct
7 Correct 454 ms 92300 KB Output is correct
8 Correct 536 ms 92300 KB Output is correct
9 Correct 467 ms 92300 KB Output is correct
10 Correct 482 ms 92308 KB Output is correct
11 Correct 31 ms 92308 KB Output is correct
12 Correct 491 ms 92308 KB Output is correct
13 Correct 508 ms 92308 KB Output is correct
14 Correct 469 ms 92360 KB Output is correct
15 Correct 485 ms 92384 KB Output is correct
16 Correct 509 ms 92384 KB Output is correct
17 Correct 536 ms 92384 KB Output is correct
18 Correct 555 ms 92384 KB Output is correct
19 Correct 518 ms 92384 KB Output is correct
20 Correct 510 ms 92384 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 92384 KB Output is correct
2 Correct 447 ms 92384 KB Output is correct
3 Correct 913 ms 92384 KB Output is correct
4 Correct 477 ms 92384 KB Output is correct
5 Correct 799 ms 92384 KB Output is correct
6 Correct 429 ms 92384 KB Output is correct
7 Correct 890 ms 92384 KB Output is correct
8 Correct 555 ms 92384 KB Output is correct
9 Correct 520 ms 92384 KB Output is correct
10 Correct 999 ms 92384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9592 KB Output is correct
2 Correct 14 ms 9700 KB Output is correct
3 Correct 14 ms 9776 KB Output is correct
4 Correct 15 ms 10488 KB Output is correct
5 Correct 412 ms 73316 KB Output is correct
6 Correct 374 ms 88628 KB Output is correct
7 Correct 707 ms 88628 KB Output is correct
8 Correct 337 ms 88628 KB Output is correct
9 Correct 682 ms 88628 KB Output is correct
10 Correct 356 ms 88628 KB Output is correct
11 Correct 17 ms 92384 KB Output is correct
12 Correct 15 ms 92384 KB Output is correct
13 Correct 16 ms 92384 KB Output is correct
14 Correct 15 ms 92384 KB Output is correct
15 Correct 16 ms 92384 KB Output is correct
16 Correct 17 ms 92384 KB Output is correct
17 Correct 16 ms 92384 KB Output is correct
18 Correct 17 ms 92384 KB Output is correct
19 Correct 17 ms 92384 KB Output is correct
20 Correct 16 ms 92384 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9592 KB Output is correct
2 Correct 14 ms 9700 KB Output is correct
3 Correct 14 ms 9776 KB Output is correct
4 Correct 15 ms 10488 KB Output is correct
5 Correct 412 ms 73316 KB Output is correct
6 Correct 374 ms 88628 KB Output is correct
7 Correct 707 ms 88628 KB Output is correct
8 Correct 337 ms 88628 KB Output is correct
9 Correct 682 ms 88628 KB Output is correct
10 Correct 356 ms 88628 KB Output is correct
11 Correct 14 ms 88628 KB Output is correct
12 Correct 13 ms 88628 KB Output is correct
13 Correct 15 ms 88628 KB Output is correct
14 Correct 548 ms 92192 KB Output is correct
15 Correct 500 ms 92264 KB Output is correct
16 Correct 490 ms 92264 KB Output is correct
17 Correct 454 ms 92300 KB Output is correct
18 Correct 536 ms 92300 KB Output is correct
19 Correct 467 ms 92300 KB Output is correct
20 Correct 482 ms 92308 KB Output is correct
21 Correct 31 ms 92308 KB Output is correct
22 Correct 491 ms 92308 KB Output is correct
23 Correct 508 ms 92308 KB Output is correct
24 Correct 469 ms 92360 KB Output is correct
25 Correct 485 ms 92384 KB Output is correct
26 Correct 509 ms 92384 KB Output is correct
27 Correct 536 ms 92384 KB Output is correct
28 Correct 555 ms 92384 KB Output is correct
29 Correct 518 ms 92384 KB Output is correct
30 Correct 510 ms 92384 KB Output is correct
31 Correct 545 ms 92384 KB Output is correct
32 Correct 447 ms 92384 KB Output is correct
33 Correct 913 ms 92384 KB Output is correct
34 Correct 477 ms 92384 KB Output is correct
35 Correct 799 ms 92384 KB Output is correct
36 Correct 429 ms 92384 KB Output is correct
37 Correct 890 ms 92384 KB Output is correct
38 Correct 555 ms 92384 KB Output is correct
39 Correct 520 ms 92384 KB Output is correct
40 Correct 999 ms 92384 KB Output is correct
41 Correct 17 ms 92384 KB Output is correct
42 Correct 15 ms 92384 KB Output is correct
43 Correct 16 ms 92384 KB Output is correct
44 Correct 15 ms 92384 KB Output is correct
45 Correct 16 ms 92384 KB Output is correct
46 Correct 17 ms 92384 KB Output is correct
47 Correct 16 ms 92384 KB Output is correct
48 Correct 17 ms 92384 KB Output is correct
49 Correct 17 ms 92384 KB Output is correct
50 Correct 16 ms 92384 KB Output is correct
51 Correct 530 ms 92384 KB Output is correct
52 Correct 430 ms 97808 KB Output is correct
53 Correct 617 ms 97808 KB Output is correct
54 Correct 314 ms 97808 KB Output is correct
55 Correct 384 ms 97808 KB Output is correct
56 Correct 397 ms 108808 KB Output is correct
57 Correct 591 ms 108808 KB Output is correct
58 Correct 382 ms 108808 KB Output is correct
59 Correct 394 ms 108808 KB Output is correct
60 Correct 359 ms 119824 KB Output is correct
61 Correct 652 ms 119952 KB Output is correct
62 Correct 402 ms 119952 KB Output is correct
63 Correct 403 ms 119952 KB Output is correct
64 Correct 324 ms 130908 KB Output is correct
65 Correct 715 ms 131372 KB Output is correct
66 Correct 324 ms 131372 KB Output is correct
67 Correct 484 ms 131372 KB Output is correct
68 Correct 432 ms 141968 KB Output is correct
69 Correct 660 ms 141968 KB Output is correct
70 Correct 350 ms 141968 KB Output is correct