답안 #92052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92052 2019-01-01T10:00:27 Z Kamisama Election Campaign (JOI15_election_campaign) C++14
100 / 100
409 ms 27768 KB
#include <iostream>
#include <vector>

using namespace std;
const int maxn=1e5+7;

int n,m;
int par[maxn],lv[maxn],f[maxn][18];
int in[maxn],out[maxn],bit[maxn],dp[maxn];
vector<int> adj[maxn],road[maxn];
struct Query{int a,b,c;}q[maxn];

inline void Dfs(const int &u,const int &p){
    static int nVisit=0;
    in[u]=++nVisit;
    par[u]=p;
    lv[u]=lv[p]+1;
    f[u][0]=p;
    for(int i=1;i<18;i++) f[u][i]=f[f[u][i-1]][i-1];
    for(int v: adj[u]) if(v!=p) Dfs(v,u);
    out[u]=nVisit;
}

inline int Jump(int u,int k){
    for(int cur=0;k;k>>=1,cur++) if(k&1) u=f[u][cur];
    return u;
}

inline int Lca(int u,int v){
    if(lv[u]>lv[v]) swap(u,v);
    v=Jump(v,lv[v]-lv[u]);
    if(u==v) return u;
    for(int i=17;i>=0;i--) if(f[u][i]!=f[v][i]) u=f[u][i],v=f[v][i];
    return par[u];
}

inline void Update(int x,const int &val){
    for(;x<=n;x+=x&-x) bit[x]+=val;
}
inline int Get(int x){
    int res=0;
    for(;x;x-=x&-x) res+=bit[x];
    return res;
}

inline void Solve(const int &u,const int &p){
    int sumChild=0;
    for(int v: adj[u]) if(v!=p){
        Solve(v,u);
        sumChild+=dp[v];
    }
    dp[u]=sumChild;
    for(int i: road[u]){
        int a=q[i].a,b=q[i].b,c=q[i].c;
        dp[u]=max(dp[u],sumChild+Get(in[a])+Get(in[b])+c);
    }
    Update(in[u],sumChild-dp[u]); Update(out[u]+1,dp[u]-sumChild);
}

int main(){
    cin>>n;
    for(int i=1;i<n;i++){
        int u,v;
        cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    Dfs(1,0);
    cin>>m;
    for(int i=1;i<=m;i++){
        cin>>q[i].a>>q[i].b>>q[i].c;
        road[Lca(q[i].a,q[i].b)].push_back(i);
    }
    Solve(1,0);
    cout<<dp[1];
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5240 KB Output is correct
5 Correct 152 ms 18928 KB Output is correct
6 Correct 103 ms 23672 KB Output is correct
7 Correct 174 ms 22024 KB Output is correct
8 Correct 109 ms 19192 KB Output is correct
9 Correct 161 ms 21104 KB Output is correct
10 Correct 142 ms 19192 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 6 ms 5244 KB Output is correct
4 Correct 215 ms 27332 KB Output is correct
5 Correct 229 ms 27384 KB Output is correct
6 Correct 241 ms 27404 KB Output is correct
7 Correct 234 ms 27432 KB Output is correct
8 Correct 269 ms 27256 KB Output is correct
9 Correct 202 ms 27448 KB Output is correct
10 Correct 252 ms 27384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 6 ms 5244 KB Output is correct
4 Correct 215 ms 27332 KB Output is correct
5 Correct 229 ms 27384 KB Output is correct
6 Correct 241 ms 27404 KB Output is correct
7 Correct 234 ms 27432 KB Output is correct
8 Correct 269 ms 27256 KB Output is correct
9 Correct 202 ms 27448 KB Output is correct
10 Correct 252 ms 27384 KB Output is correct
11 Correct 24 ms 6008 KB Output is correct
12 Correct 271 ms 27572 KB Output is correct
13 Correct 288 ms 27512 KB Output is correct
14 Correct 214 ms 27712 KB Output is correct
15 Correct 229 ms 27540 KB Output is correct
16 Correct 225 ms 27640 KB Output is correct
17 Correct 223 ms 27512 KB Output is correct
18 Correct 271 ms 27612 KB Output is correct
19 Correct 231 ms 27640 KB Output is correct
20 Correct 267 ms 27644 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 21880 KB Output is correct
2 Correct 223 ms 27256 KB Output is correct
3 Correct 301 ms 25324 KB Output is correct
4 Correct 257 ms 22292 KB Output is correct
5 Correct 342 ms 25080 KB Output is correct
6 Correct 225 ms 22260 KB Output is correct
7 Correct 402 ms 24952 KB Output is correct
8 Correct 279 ms 22392 KB Output is correct
9 Correct 253 ms 27368 KB Output is correct
10 Correct 399 ms 24180 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5240 KB Output is correct
5 Correct 152 ms 18928 KB Output is correct
6 Correct 103 ms 23672 KB Output is correct
7 Correct 174 ms 22024 KB Output is correct
8 Correct 109 ms 19192 KB Output is correct
9 Correct 161 ms 21104 KB Output is correct
10 Correct 142 ms 19192 KB Output is correct
11 Correct 8 ms 5240 KB Output is correct
12 Correct 7 ms 5244 KB Output is correct
13 Correct 8 ms 5240 KB Output is correct
14 Correct 7 ms 5240 KB Output is correct
15 Correct 6 ms 5240 KB Output is correct
16 Correct 9 ms 5240 KB Output is correct
17 Correct 8 ms 5240 KB Output is correct
18 Correct 8 ms 5240 KB Output is correct
19 Correct 7 ms 5240 KB Output is correct
20 Correct 8 ms 5244 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5240 KB Output is correct
5 Correct 152 ms 18928 KB Output is correct
6 Correct 103 ms 23672 KB Output is correct
7 Correct 174 ms 22024 KB Output is correct
8 Correct 109 ms 19192 KB Output is correct
9 Correct 161 ms 21104 KB Output is correct
10 Correct 142 ms 19192 KB Output is correct
11 Correct 5 ms 4984 KB Output is correct
12 Correct 5 ms 5112 KB Output is correct
13 Correct 6 ms 5244 KB Output is correct
14 Correct 215 ms 27332 KB Output is correct
15 Correct 229 ms 27384 KB Output is correct
16 Correct 241 ms 27404 KB Output is correct
17 Correct 234 ms 27432 KB Output is correct
18 Correct 269 ms 27256 KB Output is correct
19 Correct 202 ms 27448 KB Output is correct
20 Correct 252 ms 27384 KB Output is correct
21 Correct 24 ms 6008 KB Output is correct
22 Correct 271 ms 27572 KB Output is correct
23 Correct 288 ms 27512 KB Output is correct
24 Correct 214 ms 27712 KB Output is correct
25 Correct 229 ms 27540 KB Output is correct
26 Correct 225 ms 27640 KB Output is correct
27 Correct 223 ms 27512 KB Output is correct
28 Correct 271 ms 27612 KB Output is correct
29 Correct 231 ms 27640 KB Output is correct
30 Correct 267 ms 27644 KB Output is correct
31 Correct 240 ms 21880 KB Output is correct
32 Correct 223 ms 27256 KB Output is correct
33 Correct 301 ms 25324 KB Output is correct
34 Correct 257 ms 22292 KB Output is correct
35 Correct 342 ms 25080 KB Output is correct
36 Correct 225 ms 22260 KB Output is correct
37 Correct 402 ms 24952 KB Output is correct
38 Correct 279 ms 22392 KB Output is correct
39 Correct 253 ms 27368 KB Output is correct
40 Correct 399 ms 24180 KB Output is correct
41 Correct 8 ms 5240 KB Output is correct
42 Correct 7 ms 5244 KB Output is correct
43 Correct 8 ms 5240 KB Output is correct
44 Correct 7 ms 5240 KB Output is correct
45 Correct 6 ms 5240 KB Output is correct
46 Correct 9 ms 5240 KB Output is correct
47 Correct 8 ms 5240 KB Output is correct
48 Correct 8 ms 5240 KB Output is correct
49 Correct 7 ms 5240 KB Output is correct
50 Correct 8 ms 5244 KB Output is correct
51 Correct 318 ms 22716 KB Output is correct
52 Correct 286 ms 27640 KB Output is correct
53 Correct 402 ms 24692 KB Output is correct
54 Correct 262 ms 22520 KB Output is correct
55 Correct 293 ms 22328 KB Output is correct
56 Correct 259 ms 27768 KB Output is correct
57 Correct 323 ms 25208 KB Output is correct
58 Correct 261 ms 22516 KB Output is correct
59 Correct 337 ms 22620 KB Output is correct
60 Correct 276 ms 27768 KB Output is correct
61 Correct 358 ms 25336 KB Output is correct
62 Correct 271 ms 22492 KB Output is correct
63 Correct 331 ms 22284 KB Output is correct
64 Correct 284 ms 27548 KB Output is correct
65 Correct 409 ms 25004 KB Output is correct
66 Correct 274 ms 22600 KB Output is correct
67 Correct 329 ms 22240 KB Output is correct
68 Correct 240 ms 27512 KB Output is correct
69 Correct 333 ms 24400 KB Output is correct
70 Correct 262 ms 22648 KB Output is correct