oj.uz

답안 #770644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770644 2023-07-01T14:57:44 Z bachhoangxuan Election Campaign (JOI15_election_campaign) C++17
100 / 100
 173 ms 69276 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=18;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
namespace BIT{
    int n;
    vector<int> bit;
    void init(int N){
        n=N;
        bit.assign(n+1,0);
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
        return res;
    }
    void update(int x,int val){
        for(int i=x;i<=n;i+=(i&(-i))) bit[i]+=val;
    }
    void update_range(int l,int r,int val){
        update(l,val);update(r+1,-val);
    }
}
namespace Tree{
    vector<vector<int>> edge,Min;
    vector<int> lg2,dep,L,R;
    int pos;
    int cmp(int u,int v){
        return (dep[u]<dep[v]?u:v);
    }
    int lca(int u,int v){
        u=L[u];v=L[v];
        if(u>v) swap(u,v);
        int p=lg2[v-u+1];
        return cmp(Min[u][p],Min[v-(1<<p)+1][p]);
    }
    int dist(int u,int v){
        return dep[u]+dep[v]-2*dep[lca(u,v)];
    }
    void dfs(int u,int p){
        L[u]=++pos;Min[pos][0]=u;
        dep[u]=dep[p]+1;
        for(int v:edge[u]){
            if(v==p) continue;
            dfs(v,u);Min[++pos][0]=u;
        }
        R[u]=pos;
    }
    void init(int n){
        lg2.assign(2*n+1,0);
        dep.assign(n+1,0);
        L.assign(n+1,0);
        R.assign(n+1,0);
        edge.resize(n+1);
        Min.assign(2*n+1,vector<int>(maxl,0));
    }
    void build(int n){
        init(n);
        for(int i=1;i<n;i++){
            int u,v;cin >> u >> v;
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        dfs(1,0);
        for(int i=2;i<=pos;i++) lg2[i]=lg2[i/2]+1;
        for(int i=1;i<maxl;i++){
            for(int j=1;j<=(pos-(1<<i)+1);j++) Min[j][i]=cmp(Min[j][i-1],Min[j+(1<<(i-1))][i-1]);
        }
    }
}
void solve(){
    int n;cin >> n;
    vector<vector<tuple<int,int,int>>> ss(n+1);
    vector<int> dp(n+1,0LL);
    Tree::build(n);
    BIT::init(2*n);
    int m;cin >> m;
    for(int i=1;i<=m;i++){
        int u,v,w;cin >> u >> v >> w;
        ss[Tree::lca(u,v)].push_back({u,v,w});
    }
    function<void(int,int)> dfs = [&](int u,int p){
        int sum=0;
        for(int v:Tree::edge[u]){
            if(v==p) continue;
            dfs(v,u);sum+=dp[v];
            //cout << u << ' ' << v << ' ' << dp[v] << ' ' << sum << '\n';
        }
        dp[u]=sum;
        //cout << sum << '\n';
        //cout << u << ' ' << sum << '\n';
        for(auto &[x,y,w]:ss[u]){
            //cout << x << ' ' << y << ' ' << w << '\n';
            int cur=sum+w+BIT::query(Tree::L[x])+BIT::query(Tree::L[y]);
            //cout << cur << '\n';
            dp[u]=max(dp[u],cur);
        }
        BIT::update_range(Tree::L[u],Tree::R[u],sum-dp[u]);
        //cout << u << ' ' << sum << ' ' << dp[u] << '\n';
    };
    dfs(1,0);
    cout << dp[1] << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 115 ms 52368 KB Output is correct
6 Correct 93 ms 64004 KB Output is correct
7 Correct 121 ms 60076 KB Output is correct
8 Correct 96 ms 52480 KB Output is correct
9 Correct 116 ms 57676 KB Output is correct
10 Correct 120 ms 52416 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 132 ms 68892 KB Output is correct
5 Correct 155 ms 68940 KB Output is correct
6 Correct 138 ms 68972 KB Output is correct
7 Correct 136 ms 68904 KB Output is correct
8 Correct 134 ms 68908 KB Output is correct
9 Correct 137 ms 68936 KB Output is correct
10 Correct 135 ms 68924 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 132 ms 68892 KB Output is correct
5 Correct 155 ms 68940 KB Output is correct
6 Correct 138 ms 68972 KB Output is correct
7 Correct 136 ms 68904 KB Output is correct
8 Correct 134 ms 68908 KB Output is correct
9 Correct 137 ms 68936 KB Output is correct
10 Correct 135 ms 68924 KB Output is correct
11 Correct 7 ms 2188 KB Output is correct
12 Correct 137 ms 69196 KB Output is correct
13 Correct 138 ms 69164 KB Output is correct
14 Correct 137 ms 69208 KB Output is correct
15 Correct 133 ms 69156 KB Output is correct
16 Correct 130 ms 69172 KB Output is correct
17 Correct 136 ms 69204 KB Output is correct
18 Correct 138 ms 69160 KB Output is correct
19 Correct 152 ms 69276 KB Output is correct
20 Correct 134 ms 69152 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 56496 KB Output is correct
2 Correct 136 ms 68964 KB Output is correct
3 Correct 163 ms 64408 KB Output is correct
4 Correct 143 ms 56960 KB Output is correct
5 Correct 162 ms 63432 KB Output is correct
6 Correct 136 ms 56988 KB Output is correct
7 Correct 165 ms 63116 KB Output is correct
8 Correct 169 ms 56556 KB Output is correct
9 Correct 137 ms 68900 KB Output is correct
10 Correct 173 ms 61508 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 115 ms 52368 KB Output is correct
6 Correct 93 ms 64004 KB Output is correct
7 Correct 121 ms 60076 KB Output is correct
8 Correct 96 ms 52480 KB Output is correct
9 Correct 116 ms 57676 KB Output is correct
10 Correct 120 ms 52416 KB Output is correct
11 Correct 1 ms 848 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 1 ms 864 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 1 ms 980 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 115 ms 52368 KB Output is correct
6 Correct 93 ms 64004 KB Output is correct
7 Correct 121 ms 60076 KB Output is correct
8 Correct 96 ms 52480 KB Output is correct
9 Correct 116 ms 57676 KB Output is correct
10 Correct 120 ms 52416 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 132 ms 68892 KB Output is correct
15 Correct 155 ms 68940 KB Output is correct
16 Correct 138 ms 68972 KB Output is correct
17 Correct 136 ms 68904 KB Output is correct
18 Correct 134 ms 68908 KB Output is correct
19 Correct 137 ms 68936 KB Output is correct
20 Correct 135 ms 68924 KB Output is correct
21 Correct 7 ms 2188 KB Output is correct
22 Correct 137 ms 69196 KB Output is correct
23 Correct 138 ms 69164 KB Output is correct
24 Correct 137 ms 69208 KB Output is correct
25 Correct 133 ms 69156 KB Output is correct
26 Correct 130 ms 69172 KB Output is correct
27 Correct 136 ms 69204 KB Output is correct
28 Correct 138 ms 69160 KB Output is correct
29 Correct 152 ms 69276 KB Output is correct
30 Correct 134 ms 69152 KB Output is correct
31 Correct 167 ms 56496 KB Output is correct
32 Correct 136 ms 68964 KB Output is correct
33 Correct 163 ms 64408 KB Output is correct
34 Correct 143 ms 56960 KB Output is correct
35 Correct 162 ms 63432 KB Output is correct
36 Correct 136 ms 56988 KB Output is correct
37 Correct 165 ms 63116 KB Output is correct
38 Correct 169 ms 56556 KB Output is correct
39 Correct 137 ms 68900 KB Output is correct
40 Correct 173 ms 61508 KB Output is correct
41 Correct 1 ms 848 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 1 ms 852 KB Output is correct
44 Correct 1 ms 852 KB Output is correct
45 Correct 1 ms 852 KB Output is correct
46 Correct 1 ms 844 KB Output is correct
47 Correct 1 ms 864 KB Output is correct
48 Correct 1 ms 852 KB Output is correct
49 Correct 1 ms 852 KB Output is correct
50 Correct 1 ms 980 KB Output is correct
51 Correct 169 ms 56968 KB Output is correct
52 Correct 134 ms 69204 KB Output is correct
53 Correct 162 ms 62000 KB Output is correct
54 Correct 143 ms 57000 KB Output is correct
55 Correct 157 ms 56832 KB Output is correct
56 Correct 137 ms 69240 KB Output is correct
57 Correct 167 ms 63052 KB Output is correct
58 Correct 137 ms 57100 KB Output is correct
59 Correct 171 ms 56956 KB Output is correct
60 Correct 155 ms 69176 KB Output is correct
61 Correct 160 ms 63140 KB Output is correct
62 Correct 139 ms 57272 KB Output is correct
63 Correct 164 ms 56860 KB Output is correct
64 Correct 131 ms 69160 KB Output is correct
65 Correct 167 ms 63032 KB Output is correct
66 Correct 136 ms 56896 KB Output is correct
67 Correct 167 ms 57692 KB Output is correct
68 Correct 132 ms 69168 KB Output is correct
69 Correct 161 ms 61192 KB Output is correct
70 Correct 147 ms 57220 KB Output is correct