oj.uz

Submission #985314

# Submission time Handle Problem Language Result Execution time Memory
985314 2024-05-17T14:59:45 Z yeediot Election Campaign (JOI15_election_campaign) C++17
100 / 100
 110 ms 27912 KB 
#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];
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){
    int sum=0;
    for(auto u:adj[v]){
        if(u==pa)
            continue;
        calc(u,v);
        sum+=dp[u];
    }
    dp[v]=sum;
    for(auto [a,b,c]:as[v]){
        dp[v]=max(dp[v],sum+c+bt.query(in[a])+bt.query(in[b]));
    }
    bt.modify(in[v],out[v],sum-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 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 39 ms 18224 KB Output is correct
6 Correct 28 ms 25708 KB Output is correct
7 Correct 38 ms 23124 KB Output is correct
8 Correct 29 ms 18524 KB Output is correct
9 Correct 37 ms 21732 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 66 ms 27896 KB Output is correct
5 Correct 67 ms 27728 KB Output is correct
6 Correct 60 ms 27732 KB Output is correct
7 Correct 69 ms 27740 KB Output is correct
8 Correct 66 ms 27732 KB Output is correct
9 Correct 61 ms 27912 KB Output is correct
10 Correct 68 ms 27852 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 66 ms 27896 KB Output is correct
5 Correct 67 ms 27728 KB Output is correct
6 Correct 60 ms 27732 KB Output is correct
7 Correct 69 ms 27740 KB Output is correct
8 Correct 66 ms 27732 KB Output is correct
9 Correct 61 ms 27912 KB Output is correct
10 Correct 68 ms 27852 KB Output is correct
11 Correct 8 ms 13404 KB Output is correct
12 Correct 71 ms 27768 KB Output is correct
13 Correct 73 ms 27636 KB Output is correct
14 Correct 61 ms 27732 KB Output is correct
15 Correct 73 ms 27804 KB Output is correct
16 Correct 61 ms 27728 KB Output is correct
17 Correct 69 ms 27816 KB Output is correct
18 Correct 69 ms 27728 KB Output is correct
19 Correct 69 ms 27872 KB Output is correct
20 Correct 68 ms 27728 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 19464 KB Output is correct
2 Correct 66 ms 27892 KB Output is correct
3 Correct 103 ms 24628 KB Output is correct
4 Correct 57 ms 19980 KB Output is correct
5 Correct 92 ms 24144 KB Output is correct
6 Correct 58 ms 20176 KB Output is correct
7 Correct 100 ms 23788 KB Output is correct
8 Correct 74 ms 19796 KB Output is correct
9 Correct 61 ms 27868 KB Output is correct
10 Correct 110 ms 23048 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 39 ms 18224 KB Output is correct
6 Correct 28 ms 25708 KB Output is correct
7 Correct 38 ms 23124 KB Output is correct
8 Correct 29 ms 18524 KB Output is correct
9 Correct 37 ms 21732 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 4 ms 12892 KB Output is correct
15 Correct 2 ms 12888 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 3 ms 12980 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 39 ms 18224 KB Output is correct
6 Correct 28 ms 25708 KB Output is correct
7 Correct 38 ms 23124 KB Output is correct
8 Correct 29 ms 18524 KB Output is correct
9 Correct 37 ms 21732 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 66 ms 27896 KB Output is correct
15 Correct 67 ms 27728 KB Output is correct
16 Correct 60 ms 27732 KB Output is correct
17 Correct 69 ms 27740 KB Output is correct
18 Correct 66 ms 27732 KB Output is correct
19 Correct 61 ms 27912 KB Output is correct
20 Correct 68 ms 27852 KB Output is correct
21 Correct 8 ms 13404 KB Output is correct
22 Correct 71 ms 27768 KB Output is correct
23 Correct 73 ms 27636 KB Output is correct
24 Correct 61 ms 27732 KB Output is correct
25 Correct 73 ms 27804 KB Output is correct
26 Correct 61 ms 27728 KB Output is correct
27 Correct 69 ms 27816 KB Output is correct
28 Correct 69 ms 27728 KB Output is correct
29 Correct 69 ms 27872 KB Output is correct
30 Correct 68 ms 27728 KB Output is correct
31 Correct 102 ms 19464 KB Output is correct
32 Correct 66 ms 27892 KB Output is correct
33 Correct 103 ms 24628 KB Output is correct
34 Correct 57 ms 19980 KB Output is correct
35 Correct 92 ms 24144 KB Output is correct
36 Correct 58 ms 20176 KB Output is correct
37 Correct 100 ms 23788 KB Output is correct
38 Correct 74 ms 19796 KB Output is correct
39 Correct 61 ms 27868 KB Output is correct
40 Correct 110 ms 23048 KB Output is correct
41 Correct 3 ms 12892 KB Output is correct
42 Correct 3 ms 12892 KB Output is correct
43 Correct 3 ms 12892 KB Output is correct
44 Correct 4 ms 12892 KB Output is correct
45 Correct 2 ms 12888 KB Output is correct
46 Correct 3 ms 12892 KB Output is correct
47 Correct 3 ms 12892 KB Output is correct
48 Correct 3 ms 12892 KB Output is correct
49 Correct 2 ms 12892 KB Output is correct
50 Correct 3 ms 12980 KB Output is correct
51 Correct 86 ms 19824 KB Output is correct
52 Correct 69 ms 27676 KB Output is correct
53 Correct 96 ms 23048 KB Output is correct
54 Correct 57 ms 19856 KB Output is correct
55 Correct 79 ms 19724 KB Output is correct
56 Correct 68 ms 27732 KB Output is correct
57 Correct 110 ms 23796 KB Output is correct
58 Correct 62 ms 19828 KB Output is correct
59 Correct 76 ms 19908 KB Output is correct
60 Correct 68 ms 27732 KB Output is correct
61 Correct 84 ms 23864 KB Output is correct
62 Correct 69 ms 20284 KB Output is correct
63 Correct 82 ms 19688 KB Output is correct
64 Correct 78 ms 27728 KB Output is correct
65 Correct 94 ms 23560 KB Output is correct
66 Correct 61 ms 20368 KB Output is correct
67 Correct 77 ms 19916 KB Output is correct
68 Correct 71 ms 27732 KB Output is correct
69 Correct 82 ms 22612 KB Output is correct
70 Correct 62 ms 20024 KB Output is correct