답안 #985312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985312	2024-05-17T14:58:02 Z	yeediot	Election Campaign (JOI15_election_campaign)	C++17	100 / 100	135 ms	30572 KB

election_campaign

#include<bits/stdc++.h>
using namespace std;
#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], sum[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);
    }
    for(auto u:adj[v]){
        if(u==pa)
            continue;
        int val=sum[u]-dp[u];
        sum[v]+=dp[u];
    }
    dp[v]=sum[v];
    for(auto [a,b,c]:as[v]){
        dp[v]=max(dp[v],sum[v]+c+bt.query(in[a])+bt.query(in[b]));
    }
    bt.modify(in[v],out[v],sum[v]-dp[v]);
}
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 calc(int, int)':
election_campaign.cpp:118:13: warning: unused variable 'val' [-Wunused-variable]
  118 |         int val=sum[u]-dp[u];
      |             ^~~
election_campaign.cpp: In function 'void setIO(std::string)':
election_campaign.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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 + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	14936 KB	Output is correct
2	Correct	3 ms	14940 KB	Output is correct
3	Correct	3 ms	14940 KB	Output is correct
4	Correct	3 ms	14940 KB	Output is correct
5	Correct	46 ms	19772 KB	Output is correct
6	Correct	30 ms	27228 KB	Output is correct
7	Correct	39 ms	24668 KB	Output is correct
8	Correct	37 ms	20116 KB	Output is correct
9	Correct	38 ms	23120 KB	Output is correct
10	Correct	31 ms	20060 KB	Output is correct

Subtask #2

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	14940 KB	Output is correct
2	Correct	3 ms	14940 KB	Output is correct
3	Correct	3 ms	15084 KB	Output is correct
4	Correct	67 ms	30388 KB	Output is correct
5	Correct	67 ms	30548 KB	Output is correct
6	Correct	62 ms	30500 KB	Output is correct
7	Correct	68 ms	30496 KB	Output is correct
8	Correct	86 ms	30544 KB	Output is correct
9	Correct	60 ms	30544 KB	Output is correct
10	Correct	70 ms	30480 KB	Output is correct

Subtask #3

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	14940 KB	Output is correct
2	Correct	3 ms	14940 KB	Output is correct
3	Correct	3 ms	15084 KB	Output is correct
4	Correct	67 ms	30388 KB	Output is correct
5	Correct	67 ms	30548 KB	Output is correct
6	Correct	62 ms	30500 KB	Output is correct
7	Correct	68 ms	30496 KB	Output is correct
8	Correct	86 ms	30544 KB	Output is correct
9	Correct	60 ms	30544 KB	Output is correct
10	Correct	70 ms	30480 KB	Output is correct
11	Correct	9 ms	15708 KB	Output is correct
12	Correct	70 ms	30548 KB	Output is correct
13	Correct	73 ms	30544 KB	Output is correct
14	Correct	62 ms	30468 KB	Output is correct
15	Correct	69 ms	30548 KB	Output is correct
16	Correct	64 ms	30556 KB	Output is correct
17	Correct	68 ms	30548 KB	Output is correct
18	Correct	68 ms	30372 KB	Output is correct
19	Correct	61 ms	30476 KB	Output is correct
20	Correct	69 ms	30572 KB	Output is correct

Subtask #4

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	76 ms	22368 KB	Output is correct
2	Correct	61 ms	30544 KB	Output is correct
3	Correct	90 ms	27352 KB	Output is correct
4	Correct	58 ms	22796 KB	Output is correct
5	Correct	79 ms	26804 KB	Output is correct
6	Correct	60 ms	22912 KB	Output is correct
7	Correct	88 ms	26508 KB	Output is correct
8	Correct	91 ms	22608 KB	Output is correct
9	Correct	60 ms	30548 KB	Output is correct
10	Correct	99 ms	25580 KB	Output is correct

Subtask #5

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	14936 KB	Output is correct
2	Correct	3 ms	14940 KB	Output is correct
3	Correct	3 ms	14940 KB	Output is correct
4	Correct	3 ms	14940 KB	Output is correct
5	Correct	46 ms	19772 KB	Output is correct
6	Correct	30 ms	27228 KB	Output is correct
7	Correct	39 ms	24668 KB	Output is correct
8	Correct	37 ms	20116 KB	Output is correct
9	Correct	38 ms	23120 KB	Output is correct
10	Correct	31 ms	20060 KB	Output is correct
11	Correct	3 ms	14936 KB	Output is correct
12	Correct	3 ms	14940 KB	Output is correct
13	Correct	4 ms	15076 KB	Output is correct
14	Correct	3 ms	14940 KB	Output is correct
15	Correct	3 ms	14940 KB	Output is correct
16	Correct	3 ms	14936 KB	Output is correct
17	Correct	3 ms	14940 KB	Output is correct
18	Correct	3 ms	14940 KB	Output is correct
19	Correct	3 ms	14940 KB	Output is correct
20	Correct	3 ms	14940 KB	Output is correct

Subtask #6

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	14936 KB	Output is correct
2	Correct	3 ms	14940 KB	Output is correct
3	Correct	3 ms	14940 KB	Output is correct
4	Correct	3 ms	14940 KB	Output is correct
5	Correct	46 ms	19772 KB	Output is correct
6	Correct	30 ms	27228 KB	Output is correct
7	Correct	39 ms	24668 KB	Output is correct
8	Correct	37 ms	20116 KB	Output is correct
9	Correct	38 ms	23120 KB	Output is correct
10	Correct	31 ms	20060 KB	Output is correct
11	Correct	3 ms	14940 KB	Output is correct
12	Correct	3 ms	14940 KB	Output is correct
13	Correct	3 ms	15084 KB	Output is correct
14	Correct	67 ms	30388 KB	Output is correct
15	Correct	67 ms	30548 KB	Output is correct
16	Correct	62 ms	30500 KB	Output is correct
17	Correct	68 ms	30496 KB	Output is correct
18	Correct	86 ms	30544 KB	Output is correct
19	Correct	60 ms	30544 KB	Output is correct
20	Correct	70 ms	30480 KB	Output is correct
21	Correct	9 ms	15708 KB	Output is correct
22	Correct	70 ms	30548 KB	Output is correct
23	Correct	73 ms	30544 KB	Output is correct
24	Correct	62 ms	30468 KB	Output is correct
25	Correct	69 ms	30548 KB	Output is correct
26	Correct	64 ms	30556 KB	Output is correct
27	Correct	68 ms	30548 KB	Output is correct
28	Correct	68 ms	30372 KB	Output is correct
29	Correct	61 ms	30476 KB	Output is correct
30	Correct	69 ms	30572 KB	Output is correct
31	Correct	76 ms	22368 KB	Output is correct
32	Correct	61 ms	30544 KB	Output is correct
33	Correct	90 ms	27352 KB	Output is correct
34	Correct	58 ms	22796 KB	Output is correct
35	Correct	79 ms	26804 KB	Output is correct
36	Correct	60 ms	22912 KB	Output is correct
37	Correct	88 ms	26508 KB	Output is correct
38	Correct	91 ms	22608 KB	Output is correct
39	Correct	60 ms	30548 KB	Output is correct
40	Correct	99 ms	25580 KB	Output is correct
41	Correct	3 ms	14936 KB	Output is correct
42	Correct	3 ms	14940 KB	Output is correct
43	Correct	4 ms	15076 KB	Output is correct
44	Correct	3 ms	14940 KB	Output is correct
45	Correct	3 ms	14940 KB	Output is correct
46	Correct	3 ms	14936 KB	Output is correct
47	Correct	3 ms	14940 KB	Output is correct
48	Correct	3 ms	14940 KB	Output is correct
49	Correct	3 ms	14940 KB	Output is correct
50	Correct	3 ms	14940 KB	Output is correct
51	Correct	78 ms	22612 KB	Output is correct
52	Correct	70 ms	30544 KB	Output is correct
53	Correct	89 ms	25864 KB	Output is correct
54	Correct	60 ms	22668 KB	Output is correct
55	Correct	90 ms	22552 KB	Output is correct
56	Correct	69 ms	30544 KB	Output is correct
57	Correct	85 ms	26452 KB	Output is correct
58	Correct	60 ms	22736 KB	Output is correct
59	Correct	86 ms	22524 KB	Output is correct
60	Correct	67 ms	30544 KB	Output is correct
61	Correct	85 ms	26552 KB	Output is correct
62	Correct	61 ms	22668 KB	Output is correct
63	Correct	80 ms	22200 KB	Output is correct
64	Correct	68 ms	30560 KB	Output is correct
65	Correct	135 ms	26308 KB	Output is correct
66	Correct	57 ms	22932 KB	Output is correct
67	Correct	88 ms	22572 KB	Output is correct
68	Correct	69 ms	30352 KB	Output is correct
69	Correct	84 ms	25308 KB	Output is correct
70	Correct	62 ms	22924 KB	Output is correct