oj.uz

답안 #972572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972572 2024-04-30T16:08:13 Z yeediot Election Campaign (JOI15_election_campaign) C++17
100 / 100
 270 ms 45600 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e5+5;
vector<int>adj[mxn];
int cnt[mxn],t[mxn],in[mxn],out[mxn],pa[mxn],tmr,jump[20][mxn],dep[mxn];
void dfs(int v,int p){
    cnt[v]=1;
    pa[v]=p;
    jump[0][v]=p;
    dep[v]=dep[p]+1;
    for(auto u:adj[v]){
        if(u==p)
            continue;
        dfs(u,v);
        cnt[v]+=cnt[u];
    }
}
void hld(int v,int top,int p){
    in[v]=++tmr;
    t[v]=top;
    int mx=-1;
    for(auto u:adj[v]){
        if(u==p)
            continue;
        if(mx==-1 or cnt[u]>cnt[mx]){
            mx=u;
        }
    }
    if(mx!=-1){
        hld(mx,top,v);
    }
    for(auto u:adj[v]){
        if(u==p or u==mx)
            continue;
        hld(u,u,v);
    }
    out[v]=tmr;
}
int lca(int a,int b){
    if(dep[a]<dep[b]){
        swap(a,b);
    }
    int dif=dep[a]-dep[b];
    for(int i=0;i<20;i++){
        if(dif>>i&1){
            a=jump[i][a];
        }
    }
    if(a==b){
        return a;
    }
    for(int i=19;i>=0;i--){
        if(jump[i][a]!=jump[i][b]){
            a=jump[i][a];
            b=jump[i][b];
        }
    }
    return jump[0][a];
}
struct BIT{
    int bit[mxn];
    void init(){
        for(int i=0;i<mxn;i++){
            bit[i]=0;
        }
    }
    void modify(int p,int v){
        for(;p<mxn;p+=p&-p){
            bit[p]+=v;;
        }
    }
    int query(int p){
        int res=0;
        for(;p;p-=p&-p){
            res+=bit[p];
        }
        return res;
    }
    int query(int l,int r){
        return query(r)-query(l-1);
    }
}bt;
int path(int a,int b){
    int res=0;
    int ta=t[a],tb=t[b];
    while(ta!=tb){
        if(dep[ta]<dep[tb]){
            swap(a,b);
            swap(ta,tb);
        }
        res+=bt.query(in[ta],in[a]);
        a=pa[ta],ta=t[a];
    }
    if(in[a]>in[b])
        swap(a,b);
    res+=bt.query(in[a],in[b]);
    return res;
}
int dp[mxn];
vector<tuple<int,int,int,int>>ck[mxn];
void calc(int v,int p){
    int sum=0;
    for(auto u:adj[v]){
        if(u==p)
            continue;
        calc(u,v);
        sum+=dp[u];
    }
    dp[v]=sum;
    for(auto [x,a,b,c]:ck[v]){
        dp[v]=max(dp[v],sum+path(a,b)+c);
    }
    bt.modify(in[v],sum-dp[v]);
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    dfs(1,1);
    hld(1,1,1);
    bt.init();
    for(int i=1;i<20;i++){
        for(int j=1;j<=n;j++){
            jump[i][j]=jump[i-1][jump[i-1][j]];
        }
    }
    int q;
    cin>>q;
    for(int i=1;i<=q;i++){
        int a,b,c;
        cin>>a>>b>>c;
        int x=lca(a,b);
        ck[x].pb({x,a,b,c});
    }
    calc(1,1);
    cout<<dp[1]<<'\n';
}
 /*
 input:
 
 */

Compilation message

election_campaign.cpp: In function 'void setIO(std::string)':
election_campaign.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
election_campaign.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26972 KB Output is correct
2 Correct 4 ms 27172 KB Output is correct
3 Correct 6 ms 26972 KB Output is correct
4 Correct 5 ms 26972 KB Output is correct
5 Correct 49 ms 32088 KB Output is correct
6 Correct 36 ms 39004 KB Output is correct
7 Correct 46 ms 36700 KB Output is correct
8 Correct 32 ms 32200 KB Output is correct
9 Correct 43 ms 35152 KB Output is correct
10 Correct 41 ms 32080 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26972 KB Output is correct
2 Correct 4 ms 26972 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 76 ms 44888 KB Output is correct
5 Correct 88 ms 44996 KB Output is correct
6 Correct 81 ms 45008 KB Output is correct
7 Correct 75 ms 44884 KB Output is correct
8 Correct 75 ms 45068 KB Output is correct
9 Correct 67 ms 44964 KB Output is correct
10 Correct 97 ms 44884 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26972 KB Output is correct
2 Correct 4 ms 26972 KB Output is correct
3 Correct 5 ms 26972 KB Output is correct
4 Correct 76 ms 44888 KB Output is correct
5 Correct 88 ms 44996 KB Output is correct
6 Correct 81 ms 45008 KB Output is correct
7 Correct 75 ms 44884 KB Output is correct
8 Correct 75 ms 45068 KB Output is correct
9 Correct 67 ms 44964 KB Output is correct
10 Correct 97 ms 44884 KB Output is correct
11 Correct 14 ms 28756 KB Output is correct
12 Correct 78 ms 45140 KB Output is correct
13 Correct 83 ms 45328 KB Output is correct
14 Correct 72 ms 45248 KB Output is correct
15 Correct 87 ms 45352 KB Output is correct
16 Correct 82 ms 45188 KB Output is correct
17 Correct 75 ms 45204 KB Output is correct
18 Correct 89 ms 45280 KB Output is correct
19 Correct 82 ms 45460 KB Output is correct
20 Correct 87 ms 45396 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 37288 KB Output is correct
2 Correct 73 ms 44884 KB Output is correct
3 Correct 190 ms 42440 KB Output is correct
4 Correct 99 ms 37824 KB Output is correct
5 Correct 129 ms 41672 KB Output is correct
6 Correct 95 ms 37944 KB Output is correct
7 Correct 187 ms 41360 KB Output is correct
8 Correct 184 ms 37432 KB Output is correct
9 Correct 67 ms 44884 KB Output is correct
10 Correct 223 ms 40060 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26972 KB Output is correct
2 Correct 4 ms 27172 KB Output is correct
3 Correct 6 ms 26972 KB Output is correct
4 Correct 5 ms 26972 KB Output is correct
5 Correct 49 ms 32088 KB Output is correct
6 Correct 36 ms 39004 KB Output is correct
7 Correct 46 ms 36700 KB Output is correct
8 Correct 32 ms 32200 KB Output is correct
9 Correct 43 ms 35152 KB Output is correct
10 Correct 41 ms 32080 KB Output is correct
11 Correct 5 ms 26972 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 6 ms 26972 KB Output is correct
14 Correct 5 ms 26972 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 5 ms 26972 KB Output is correct
17 Correct 5 ms 26972 KB Output is correct
18 Correct 6 ms 27228 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26972 KB Output is correct
2 Correct 4 ms 27172 KB Output is correct
3 Correct 6 ms 26972 KB Output is correct
4 Correct 5 ms 26972 KB Output is correct
5 Correct 49 ms 32088 KB Output is correct
6 Correct 36 ms 39004 KB Output is correct
7 Correct 46 ms 36700 KB Output is correct
8 Correct 32 ms 32200 KB Output is correct
9 Correct 43 ms 35152 KB Output is correct
10 Correct 41 ms 32080 KB Output is correct
11 Correct 4 ms 26972 KB Output is correct
12 Correct 4 ms 26972 KB Output is correct
13 Correct 5 ms 26972 KB Output is correct
14 Correct 76 ms 44888 KB Output is correct
15 Correct 88 ms 44996 KB Output is correct
16 Correct 81 ms 45008 KB Output is correct
17 Correct 75 ms 44884 KB Output is correct
18 Correct 75 ms 45068 KB Output is correct
19 Correct 67 ms 44964 KB Output is correct
20 Correct 97 ms 44884 KB Output is correct
21 Correct 14 ms 28756 KB Output is correct
22 Correct 78 ms 45140 KB Output is correct
23 Correct 83 ms 45328 KB Output is correct
24 Correct 72 ms 45248 KB Output is correct
25 Correct 87 ms 45352 KB Output is correct
26 Correct 82 ms 45188 KB Output is correct
27 Correct 75 ms 45204 KB Output is correct
28 Correct 89 ms 45280 KB Output is correct
29 Correct 82 ms 45460 KB Output is correct
30 Correct 87 ms 45396 KB Output is correct
31 Correct 247 ms 37288 KB Output is correct
32 Correct 73 ms 44884 KB Output is correct
33 Correct 190 ms 42440 KB Output is correct
34 Correct 99 ms 37824 KB Output is correct
35 Correct 129 ms 41672 KB Output is correct
36 Correct 95 ms 37944 KB Output is correct
37 Correct 187 ms 41360 KB Output is correct
38 Correct 184 ms 37432 KB Output is correct
39 Correct 67 ms 44884 KB Output is correct
40 Correct 223 ms 40060 KB Output is correct
41 Correct 5 ms 26972 KB Output is correct
42 Correct 5 ms 27228 KB Output is correct
43 Correct 6 ms 26972 KB Output is correct
44 Correct 5 ms 26972 KB Output is correct
45 Correct 5 ms 26972 KB Output is correct
46 Correct 5 ms 26972 KB Output is correct
47 Correct 5 ms 26972 KB Output is correct
48 Correct 6 ms 27228 KB Output is correct
49 Correct 5 ms 26972 KB Output is correct
50 Correct 6 ms 27228 KB Output is correct
51 Correct 156 ms 37792 KB Output is correct
52 Correct 77 ms 45188 KB Output is correct
53 Correct 245 ms 40636 KB Output is correct
54 Correct 75 ms 37692 KB Output is correct
55 Correct 270 ms 37312 KB Output is correct
56 Correct 79 ms 45600 KB Output is correct
57 Correct 151 ms 41448 KB Output is correct
58 Correct 104 ms 37724 KB Output is correct
59 Correct 164 ms 37696 KB Output is correct
60 Correct 82 ms 45248 KB Output is correct
61 Correct 136 ms 41420 KB Output is correct
62 Correct 122 ms 38008 KB Output is correct
63 Correct 183 ms 37588 KB Output is correct
64 Correct 96 ms 45404 KB Output is correct
65 Correct 182 ms 41188 KB Output is correct
66 Correct 77 ms 37556 KB Output is correct
67 Correct 183 ms 38300 KB Output is correct
68 Correct 75 ms 45136 KB Output is correct
69 Correct 144 ms 40136 KB Output is correct
70 Correct 101 ms 37656 KB Output is correct