oj.uz

Submission #968542

# Submission time Handle Problem Language Result Execution time Memory
968542 2024-04-23T15:13:56 Z Neco_arc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 143 ms 42524 KB 
#include <bits/stdc++.h>

#define ll long long
#define all(x) x.begin(), x.end()
#define Neco "Election Campaign"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 2e5 + 7

using namespace std;

const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll GetRandom(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rng);
}

int n, m;
int cha[maxn][20];
ll dp[maxn], Sum[maxn];
struct dl { int x, y, w; } a[maxn];
vector<int> edges[maxn], store[maxn];

/// PRE DFS
int In[maxn], Out[maxn];
void pre_dfs(int u, int par) {
    static int Time = 0;
    In[u] = ++Time;
    for(int v : edges[u]) if(v != par) {
        cha[v][0] = u;
        fi(i, 1, 17) cha[v][i] = cha[cha[v][i - 1]][i - 1];
        pre_dfs(v, u);
    }
    Out[u] = Time;
}

bool insubtree(int u, int p) {
    return p == 0 || In[p] <= In[u] && In[u] <= Out[p];
}

int lca(int u, int v) {
    if(insubtree(u, v)) return v;
    if(insubtree(v, u)) return u;
    fid(i, 17, 0) if(!insubtree(v, cha[u][i])) u = cha[u][i];
    return cha[u][0];
}

/*-------------------------------------*/

/// DS
struct BIT {
    ll bit[maxn];
    void update(int l, int r, ll val) {
        for(; l < maxn; l += (l & -l)) bit[l] += val;
        for(++r; r < maxn; r += (r & -r)) bit[r] -= val;
    }
    ll get(int x, ll ans = 0) {
        for(; x > 0; x -= (x & -x)) ans += bit[x];
        return ans;
    }
} Bit;
/*------------------------*/

void dfs(int u, int par)
{
    for(int v : edges[u]) if(v != par) {
        dfs(v, u);
        Sum[u] += dp[v];
    }

    dp[u] = Sum[u];
    for(int id : store[u]) {
        ll val = a[id].w;

        if(a[id].x != u) val += Bit.get(In[a[id].x]);
        if(a[id].y != u) val += Bit.get(In[a[id].y]);

        dp[u] = max(dp[u], Sum[u] + val);
    }

    Bit.update(In[u], Out[u], Sum[u] - dp[u]);
}

void solve()
{

    cin >> n;

    fi(i, 1, n - 1) {
        int x, y; cin >> x >> y;
        edges[x].push_back(y), edges[y].push_back(x);
    }

    pre_dfs(1, 0);

    cin >> m;

    fi(i, 1, m) {
        int x, y, w; cin >> x >> y >> w;
        store[lca(x, y)].push_back(i);
        a[i] = {x, y, w};
    }

    dfs(1, 0);

    cout << dp[1];

}


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(fopen(Neco".inp", "r")) {
        freopen(Neco".inp", "r", stdin);
        freopen(Neco".out", "w", stdout);
    }


    int nTest = 1;
//    cin >> nTest;


    while(nTest--)
    {
        solve();
    }


    return 0;
}

Compilation message

election_campaign.cpp: In function 'bool insubtree(int, int)':
election_campaign.cpp:47:37: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   47 |     return p == 0 || In[p] <= In[u] && In[u] <= Out[p];
      |                      ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
election_campaign.cpp: In function 'int main()':
election_campaign.cpp:128:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  128 |         freopen(Neco".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
election_campaign.cpp:129:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  129 |         freopen(Neco".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 5 ms 16732 KB Output is correct
5 Correct 54 ms 29852 KB Output is correct
6 Correct 39 ms 39856 KB Output is correct
7 Correct 56 ms 36432 KB Output is correct
8 Correct 44 ms 29272 KB Output is correct
9 Correct 57 ms 33724 KB Output is correct
10 Correct 45 ms 29268 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16876 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 4 ms 16920 KB Output is correct
4 Correct 68 ms 42224 KB Output is correct
5 Correct 66 ms 42060 KB Output is correct
6 Correct 66 ms 42260 KB Output is correct
7 Correct 74 ms 42144 KB Output is correct
8 Correct 64 ms 42220 KB Output is correct
9 Correct 63 ms 42068 KB Output is correct
10 Correct 80 ms 42240 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16876 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 4 ms 16920 KB Output is correct
4 Correct 68 ms 42224 KB Output is correct
5 Correct 66 ms 42060 KB Output is correct
6 Correct 66 ms 42260 KB Output is correct
7 Correct 74 ms 42144 KB Output is correct
8 Correct 64 ms 42220 KB Output is correct
9 Correct 63 ms 42068 KB Output is correct
10 Correct 80 ms 42240 KB Output is correct
11 Correct 8 ms 17500 KB Output is correct
12 Correct 82 ms 42524 KB Output is correct
13 Correct 67 ms 42424 KB Output is correct
14 Correct 68 ms 42416 KB Output is correct
15 Correct 65 ms 42320 KB Output is correct
16 Correct 65 ms 42436 KB Output is correct
17 Correct 73 ms 42352 KB Output is correct
18 Correct 68 ms 42284 KB Output is correct
19 Correct 69 ms 42328 KB Output is correct
20 Correct 66 ms 42320 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 31620 KB Output is correct
2 Correct 67 ms 42092 KB Output is correct
3 Correct 105 ms 37656 KB Output is correct
4 Correct 102 ms 31088 KB Output is correct
5 Correct 120 ms 37356 KB Output is correct
6 Correct 109 ms 31328 KB Output is correct
7 Correct 120 ms 37084 KB Output is correct
8 Correct 102 ms 32336 KB Output is correct
9 Correct 70 ms 42064 KB Output is correct
10 Correct 102 ms 36556 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 5 ms 16732 KB Output is correct
5 Correct 54 ms 29852 KB Output is correct
6 Correct 39 ms 39856 KB Output is correct
7 Correct 56 ms 36432 KB Output is correct
8 Correct 44 ms 29272 KB Output is correct
9 Correct 57 ms 33724 KB Output is correct
10 Correct 45 ms 29268 KB Output is correct
11 Correct 4 ms 16988 KB Output is correct
12 Correct 4 ms 16984 KB Output is correct
13 Correct 4 ms 16988 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 5 ms 16988 KB Output is correct
18 Correct 5 ms 16988 KB Output is correct
19 Correct 4 ms 16984 KB Output is correct
20 Correct 4 ms 17084 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 5 ms 16732 KB Output is correct
5 Correct 54 ms 29852 KB Output is correct
6 Correct 39 ms 39856 KB Output is correct
7 Correct 56 ms 36432 KB Output is correct
8 Correct 44 ms 29272 KB Output is correct
9 Correct 57 ms 33724 KB Output is correct
10 Correct 45 ms 29268 KB Output is correct
11 Correct 3 ms 16876 KB Output is correct
12 Correct 3 ms 16732 KB Output is correct
13 Correct 4 ms 16920 KB Output is correct
14 Correct 68 ms 42224 KB Output is correct
15 Correct 66 ms 42060 KB Output is correct
16 Correct 66 ms 42260 KB Output is correct
17 Correct 74 ms 42144 KB Output is correct
18 Correct 64 ms 42220 KB Output is correct
19 Correct 63 ms 42068 KB Output is correct
20 Correct 80 ms 42240 KB Output is correct
21 Correct 8 ms 17500 KB Output is correct
22 Correct 82 ms 42524 KB Output is correct
23 Correct 67 ms 42424 KB Output is correct
24 Correct 68 ms 42416 KB Output is correct
25 Correct 65 ms 42320 KB Output is correct
26 Correct 65 ms 42436 KB Output is correct
27 Correct 73 ms 42352 KB Output is correct
28 Correct 68 ms 42284 KB Output is correct
29 Correct 69 ms 42328 KB Output is correct
30 Correct 66 ms 42320 KB Output is correct
31 Correct 100 ms 31620 KB Output is correct
32 Correct 67 ms 42092 KB Output is correct
33 Correct 105 ms 37656 KB Output is correct
34 Correct 102 ms 31088 KB Output is correct
35 Correct 120 ms 37356 KB Output is correct
36 Correct 109 ms 31328 KB Output is correct
37 Correct 120 ms 37084 KB Output is correct
38 Correct 102 ms 32336 KB Output is correct
39 Correct 70 ms 42064 KB Output is correct
40 Correct 102 ms 36556 KB Output is correct
41 Correct 4 ms 16988 KB Output is correct
42 Correct 4 ms 16984 KB Output is correct
43 Correct 4 ms 16988 KB Output is correct
44 Correct 4 ms 16988 KB Output is correct
45 Correct 4 ms 16988 KB Output is correct
46 Correct 4 ms 16988 KB Output is correct
47 Correct 5 ms 16988 KB Output is correct
48 Correct 5 ms 16988 KB Output is correct
49 Correct 4 ms 16984 KB Output is correct
50 Correct 4 ms 17084 KB Output is correct
51 Correct 141 ms 32400 KB Output is correct
52 Correct 88 ms 42396 KB Output is correct
53 Correct 121 ms 36244 KB Output is correct
54 Correct 77 ms 31312 KB Output is correct
55 Correct 91 ms 31948 KB Output is correct
56 Correct 67 ms 42324 KB Output is correct
57 Correct 139 ms 36944 KB Output is correct
58 Correct 78 ms 31568 KB Output is correct
59 Correct 91 ms 32140 KB Output is correct
60 Correct 100 ms 42388 KB Output is correct
61 Correct 126 ms 37204 KB Output is correct
62 Correct 71 ms 31304 KB Output is correct
63 Correct 84 ms 32804 KB Output is correct
64 Correct 88 ms 42320 KB Output is correct
65 Correct 143 ms 36920 KB Output is correct
66 Correct 92 ms 32404 KB Output is correct
67 Correct 96 ms 32848 KB Output is correct
68 Correct 80 ms 42400 KB Output is correct
69 Correct 116 ms 35508 KB Output is correct
70 Correct 102 ms 31568 KB Output is correct