oj.uz

Submission #985232

# Submission time Handle Problem Language Result Execution time Memory
985232 2024-05-17T13:27:28 Z yeediot Election Campaign (JOI15_election_campaign) C++17
100 / 100
 130 ms 27900 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){
    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: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 3 ms 13144 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 38 ms 18004 KB Output is correct
6 Correct 30 ms 25688 KB Output is correct
7 Correct 39 ms 23124 KB Output is correct
8 Correct 31 ms 18520 KB Output is correct
9 Correct 59 ms 21404 KB Output is correct
10 Correct 31 ms 18348 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 2 ms 12892 KB Output is correct
4 Correct 68 ms 27844 KB Output is correct
5 Correct 67 ms 27792 KB Output is correct
6 Correct 74 ms 27844 KB Output is correct
7 Correct 69 ms 27764 KB Output is correct
8 Correct 67 ms 27684 KB Output is correct
9 Correct 61 ms 27732 KB Output is correct
10 Correct 66 ms 27728 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 2 ms 12892 KB Output is correct
4 Correct 68 ms 27844 KB Output is correct
5 Correct 67 ms 27792 KB Output is correct
6 Correct 74 ms 27844 KB Output is correct
7 Correct 69 ms 27764 KB Output is correct
8 Correct 67 ms 27684 KB Output is correct
9 Correct 61 ms 27732 KB Output is correct
10 Correct 66 ms 27728 KB Output is correct
11 Correct 8 ms 13400 KB Output is correct
12 Correct 69 ms 27796 KB Output is correct
13 Correct 67 ms 27732 KB Output is correct
14 Correct 61 ms 27760 KB Output is correct
15 Correct 83 ms 27720 KB Output is correct
16 Correct 64 ms 27900 KB Output is correct
17 Correct 67 ms 27732 KB Output is correct
18 Correct 75 ms 27868 KB Output is correct
19 Correct 64 ms 27656 KB Output is correct
20 Correct 68 ms 27892 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 19568 KB Output is correct
2 Correct 60 ms 27728 KB Output is correct
3 Correct 101 ms 24612 KB Output is correct
4 Correct 61 ms 19976 KB Output is correct
5 Correct 78 ms 24144 KB Output is correct
6 Correct 61 ms 20084 KB Output is correct
7 Correct 114 ms 23888 KB Output is correct
8 Correct 72 ms 19832 KB Output is correct
9 Correct 59 ms 27732 KB Output is correct
10 Correct 130 ms 22796 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13144 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 38 ms 18004 KB Output is correct
6 Correct 30 ms 25688 KB Output is correct
7 Correct 39 ms 23124 KB Output is correct
8 Correct 31 ms 18520 KB Output is correct
9 Correct 59 ms 21404 KB Output is correct
10 Correct 31 ms 18348 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 12980 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 3 ms 12888 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 3 ms 13064 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13144 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 38 ms 18004 KB Output is correct
6 Correct 30 ms 25688 KB Output is correct
7 Correct 39 ms 23124 KB Output is correct
8 Correct 31 ms 18520 KB Output is correct
9 Correct 59 ms 21404 KB Output is correct
10 Correct 31 ms 18348 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 68 ms 27844 KB Output is correct
15 Correct 67 ms 27792 KB Output is correct
16 Correct 74 ms 27844 KB Output is correct
17 Correct 69 ms 27764 KB Output is correct
18 Correct 67 ms 27684 KB Output is correct
19 Correct 61 ms 27732 KB Output is correct
20 Correct 66 ms 27728 KB Output is correct
21 Correct 8 ms 13400 KB Output is correct
22 Correct 69 ms 27796 KB Output is correct
23 Correct 67 ms 27732 KB Output is correct
24 Correct 61 ms 27760 KB Output is correct
25 Correct 83 ms 27720 KB Output is correct
26 Correct 64 ms 27900 KB Output is correct
27 Correct 67 ms 27732 KB Output is correct
28 Correct 75 ms 27868 KB Output is correct
29 Correct 64 ms 27656 KB Output is correct
30 Correct 68 ms 27892 KB Output is correct
31 Correct 98 ms 19568 KB Output is correct
32 Correct 60 ms 27728 KB Output is correct
33 Correct 101 ms 24612 KB Output is correct
34 Correct 61 ms 19976 KB Output is correct
35 Correct 78 ms 24144 KB Output is correct
36 Correct 61 ms 20084 KB Output is correct
37 Correct 114 ms 23888 KB Output is correct
38 Correct 72 ms 19832 KB Output is correct
39 Correct 59 ms 27732 KB Output is correct
40 Correct 130 ms 22796 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 12980 KB Output is correct
44 Correct 3 ms 12892 KB Output is correct
45 Correct 3 ms 12892 KB Output is correct
46 Correct 3 ms 12888 KB Output is correct
47 Correct 3 ms 12892 KB Output is correct
48 Correct 3 ms 13064 KB Output is correct
49 Correct 2 ms 12892 KB Output is correct
50 Correct 3 ms 12892 KB Output is correct
51 Correct 90 ms 19928 KB Output is correct
52 Correct 67 ms 27640 KB Output is correct
53 Correct 92 ms 23052 KB Output is correct
54 Correct 54 ms 20108 KB Output is correct
55 Correct 73 ms 19504 KB Output is correct
56 Correct 77 ms 27724 KB Output is correct
57 Correct 95 ms 23812 KB Output is correct
58 Correct 58 ms 19976 KB Output is correct
59 Correct 73 ms 19944 KB Output is correct
60 Correct 68 ms 27876 KB Output is correct
61 Correct 79 ms 23800 KB Output is correct
62 Correct 61 ms 20148 KB Output is correct
63 Correct 78 ms 19616 KB Output is correct
64 Correct 68 ms 27744 KB Output is correct
65 Correct 119 ms 23552 KB Output is correct
66 Correct 55 ms 20112 KB Output is correct
67 Correct 75 ms 19796 KB Output is correct
68 Correct 67 ms 27804 KB Output is correct
69 Correct 78 ms 22524 KB Output is correct
70 Correct 59 ms 20024 KB Output is correct