oj.uz

답안 #985229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
985229 2024-05-17T13:20:24 Z yeediot Election Campaign (JOI15_election_campaign) C++17
100 / 100
 199 ms 40392 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;
int n, q, jump[20][mxn], in[mxn], out[mxn], timer, dep[mxn], dp[mxn];
vector<int>adj[mxn];
vector<tuple<int,int,int>>as[mxn];
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;
        }
    }
    void modify(int l,int r,int v){
        modify(l,v);
        modify(r+1,-v);
    }
    int query(int p){
        int res=0;
        for(;p;p-=p&-p){
            res+=bit[p];
        }
        return res;
    }
}bt;
void dfs(int v,int pa){
    in[v]=++timer;
    jump[0][v]=pa;
    dep[v]=dep[pa]+1;
    for(auto u:adj[v]){
        if(u==pa)
            continue;
        dfs(u,v);
    }
    out[v]=timer;
}
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];
}
void calc(int v,int pa){
    for(auto u:adj[v]){
        if(u==pa)
            continue;
        calc(u,v);
    }
    int sum=0;
    for(auto u:adj[v]){
        if(u==pa)
            continue;
        bt.modify(in[v],out[v],dp[u]);
        bt.modify(in[u],out[u],-dp[u]);
        sum+=dp[u];
    }
    dp[v]=sum;
    for(auto [a,b,c]:as[v]){
        dp[v]=max(dp[v],c+(a!=v?bt.query(in[a]):0)+(b!=v?bt.query(in[b]):0)-(b!=v and a!=v)*sum);
    }
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    bt.init();
    dfs(1,1);
    for(int i=1;i<20;i++){
        for(int j=1;j<=n;j++){
            jump[i][j]=jump[i-1][jump[i-1][j]];
        }
    }
    cin>>q;
    for(int i=0;i<q;i++){
        int a,b,c;
        cin>>a>>b>>c;
        as[lca(a,b)].pb({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 3 ms 21080 KB Output is correct
2 Correct 3 ms 21084 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 52 ms 29788 KB Output is correct
6 Correct 33 ms 35164 KB Output is correct
7 Correct 50 ms 33472 KB Output is correct
8 Correct 34 ms 29916 KB Output is correct
9 Correct 42 ms 32232 KB Output is correct
10 Correct 39 ms 29784 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 21080 KB Output is correct
2 Correct 3 ms 21084 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 72 ms 39896 KB Output is correct
5 Correct 69 ms 40020 KB Output is correct
6 Correct 83 ms 40020 KB Output is correct
7 Correct 71 ms 39996 KB Output is correct
8 Correct 70 ms 40020 KB Output is correct
9 Correct 66 ms 40016 KB Output is correct
10 Correct 72 ms 39932 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 21080 KB Output is correct
2 Correct 3 ms 21084 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 72 ms 39896 KB Output is correct
5 Correct 69 ms 40020 KB Output is correct
6 Correct 83 ms 40020 KB Output is correct
7 Correct 71 ms 39996 KB Output is correct
8 Correct 70 ms 40020 KB Output is correct
9 Correct 66 ms 40016 KB Output is correct
10 Correct 72 ms 39932 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 85 ms 40272 KB Output is correct
13 Correct 72 ms 40160 KB Output is correct
14 Correct 68 ms 40392 KB Output is correct
15 Correct 72 ms 40236 KB Output is correct
16 Correct 70 ms 40392 KB Output is correct
17 Correct 76 ms 40300 KB Output is correct
18 Correct 73 ms 40276 KB Output is correct
19 Correct 69 ms 40272 KB Output is correct
20 Correct 72 ms 40276 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 33936 KB Output is correct
2 Correct 81 ms 40168 KB Output is correct
3 Correct 173 ms 37876 KB Output is correct
4 Correct 88 ms 34232 KB Output is correct
5 Correct 114 ms 37372 KB Output is correct
6 Correct 93 ms 34592 KB Output is correct
7 Correct 149 ms 37040 KB Output is correct
8 Correct 107 ms 33904 KB Output is correct
9 Correct 62 ms 40088 KB Output is correct
10 Correct 178 ms 36384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 21080 KB Output is correct
2 Correct 3 ms 21084 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 52 ms 29788 KB Output is correct
6 Correct 33 ms 35164 KB Output is correct
7 Correct 50 ms 33472 KB Output is correct
8 Correct 34 ms 29916 KB Output is correct
9 Correct 42 ms 32232 KB Output is correct
10 Correct 39 ms 29784 KB Output is correct
11 Correct 4 ms 21080 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 4 ms 21084 KB Output is correct
14 Correct 4 ms 21084 KB Output is correct
15 Correct 4 ms 21084 KB Output is correct
16 Correct 4 ms 21084 KB Output is correct
17 Correct 4 ms 21084 KB Output is correct
18 Correct 4 ms 21084 KB Output is correct
19 Correct 4 ms 21084 KB Output is correct
20 Correct 4 ms 21336 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 21080 KB Output is correct
2 Correct 3 ms 21084 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 52 ms 29788 KB Output is correct
6 Correct 33 ms 35164 KB Output is correct
7 Correct 50 ms 33472 KB Output is correct
8 Correct 34 ms 29916 KB Output is correct
9 Correct 42 ms 32232 KB Output is correct
10 Correct 39 ms 29784 KB Output is correct
11 Correct 3 ms 21080 KB Output is correct
12 Correct 3 ms 21084 KB Output is correct
13 Correct 3 ms 21084 KB Output is correct
14 Correct 72 ms 39896 KB Output is correct
15 Correct 69 ms 40020 KB Output is correct
16 Correct 83 ms 40020 KB Output is correct
17 Correct 71 ms 39996 KB Output is correct
18 Correct 70 ms 40020 KB Output is correct
19 Correct 66 ms 40016 KB Output is correct
20 Correct 72 ms 39932 KB Output is correct
21 Correct 9 ms 22364 KB Output is correct
22 Correct 85 ms 40272 KB Output is correct
23 Correct 72 ms 40160 KB Output is correct
24 Correct 68 ms 40392 KB Output is correct
25 Correct 72 ms 40236 KB Output is correct
26 Correct 70 ms 40392 KB Output is correct
27 Correct 76 ms 40300 KB Output is correct
28 Correct 73 ms 40276 KB Output is correct
29 Correct 69 ms 40272 KB Output is correct
30 Correct 72 ms 40276 KB Output is correct
31 Correct 134 ms 33936 KB Output is correct
32 Correct 81 ms 40168 KB Output is correct
33 Correct 173 ms 37876 KB Output is correct
34 Correct 88 ms 34232 KB Output is correct
35 Correct 114 ms 37372 KB Output is correct
36 Correct 93 ms 34592 KB Output is correct
37 Correct 149 ms 37040 KB Output is correct
38 Correct 107 ms 33904 KB Output is correct
39 Correct 62 ms 40088 KB Output is correct
40 Correct 178 ms 36384 KB Output is correct
41 Correct 4 ms 21080 KB Output is correct
42 Correct 4 ms 21084 KB Output is correct
43 Correct 4 ms 21084 KB Output is correct
44 Correct 4 ms 21084 KB Output is correct
45 Correct 4 ms 21084 KB Output is correct
46 Correct 4 ms 21084 KB Output is correct
47 Correct 4 ms 21084 KB Output is correct
48 Correct 4 ms 21084 KB Output is correct
49 Correct 4 ms 21084 KB Output is correct
50 Correct 4 ms 21336 KB Output is correct
51 Correct 114 ms 34192 KB Output is correct
52 Correct 75 ms 40332 KB Output is correct
53 Correct 148 ms 36612 KB Output is correct
54 Correct 71 ms 34432 KB Output is correct
55 Correct 173 ms 34108 KB Output is correct
56 Correct 77 ms 40276 KB Output is correct
57 Correct 120 ms 37132 KB Output is correct
58 Correct 88 ms 34364 KB Output is correct
59 Correct 111 ms 34248 KB Output is correct
60 Correct 72 ms 40140 KB Output is correct
61 Correct 120 ms 37256 KB Output is correct
62 Correct 90 ms 34600 KB Output is correct
63 Correct 151 ms 34300 KB Output is correct
64 Correct 73 ms 40272 KB Output is correct
65 Correct 199 ms 37128 KB Output is correct
66 Correct 78 ms 34180 KB Output is correct
67 Correct 130 ms 34752 KB Output is correct
68 Correct 75 ms 40272 KB Output is correct
69 Correct 128 ms 36496 KB Output is correct
70 Correct 95 ms 34684 KB Output is correct