oj.uz

Submission #419669

# Submission time Handle Problem Language Result Execution time Memory
419669 2021-06-07T11:13:57 Z amunduzbaev Election Campaign (JOI15_election_campaign) C++14
100 / 100
 569 ms 32656 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
//~ #define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update>;
 
const int N = 1e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res[N], a[N];
int tin[N], tout[N], par[N][20], sz[N], d[N], hh[N];
int in = 0, pos[N], fir[N];
vv<tut<3>> qq[N];
vii edges[N];

void dfs(int u, int p = -1){
	tin[u] = t++, sz[u] = 1;
	for(int i=1;i<20;i++) par[u][i] = par[par[u][i-1]][i-1];
	for(auto x : edges[u]){
		if(x == p) continue;
		par[x][0] = u, d[x] = d[u] + 1, dfs(x, u);
		sz[u] += sz[x];
		if(sz[x] > sz[hh[u]]) hh[u] = x;
	} tout[u] = t-1;
}

void dec(int u, int h){
	fir[u] = h, pos[u] = in++;
	if(hh[u]) dec(hh[u], h);
	for(auto x : edges[u]){
		if(x == par[u][0]) continue;
		if(x != hh[u]) dec(x, x);
	}
}

bool anc(int a, int b){ return (tin[a] <= tin[b] && tout[b] <= tout[a]); }
int LCA(int a, int b){
	if(anc(a, b)) return a;
	if(anc(b, a)) return b;
	for(int i=19;i>=0;i--){
		if(!anc(par[a][i], b)) a = par[a][i];
	} return par[a][0];
} 

struct tree{
	int tree[4*N];
	void sett(int i, int v, int lx = 0, int rx = n, int x = 1){
		if(lx == rx) { tree[x] = v; return; }
		int m = (lx + rx)>>1;
		if(i <= m) sett(i, v, lx, m, x<<1);
		else sett(i, v, m+1, rx, x<<1|1);
		tree[x] = tree[x<<1] + tree[x<<1|1];
	}
	
	int find(int l, int r, int lx = 0, int rx = n, int x = 1){
		if(lx > r || rx < l) return 0;
		if(lx >= l && rx <= r) return tree[x];
		int m = (lx + rx)>>1;
		return find(l, r, lx, m, x<<1) + find(l, r, m+1, rx, x<<1|1);
	}
}tt1, tt2;

int find(tree& tt, int a, int b){
	int res = 0;
	for(; fir[a] != fir[b]; b = par[fir[b]][0]){
		if(d[fir[a]] > d[fir[b]]) swap(a, b);
		res += tt.find(pos[fir[b]], pos[b]);
	} res += tt.find(min(pos[a], pos[b]), max(pos[a], pos[b]));
	return res;
}

void dfs2(int u, int p = -1){
	for(auto x : edges[u]) if(x != p) dfs2(x, u), res[u] += res[x];
	tt1.sett(pos[u], res[u]); 
	for(auto x : qq[u]){
		int sum = find(tt1, x[0], x[1]) - find(tt2, x[0], x[1]);
		umax(res[u], sum + x[2]);
	} tt2.sett(pos[u], res[u]);
}

void solve(int t_case){
	cin>>n;
	tin[0] = 0, tout[0] = mod;
	for(int i=1;i<n;i++){
		int a, b; cin>>a>>b;
		edges[a].pb(b), edges[b].pb(a);
	}
	
	dfs(1);
	cin>>m;
	for(int i=0;i<m;i++){
		int a, b, c; cin>>a>>b>>c;
		int lca = LCA(a, b);
		qq[lca].pb({a, b, c});
	}
	
	//~ cout<<"\n";
	dec(1, 1);
	dfs2(1);
	cout<<res[1]<<"\n";
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

election_campaign.cpp: In function 'void usaco(std::string)':
election_campaign.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
election_campaign.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5224 KB Output is correct
5 Correct 124 ms 21324 KB Output is correct
6 Correct 76 ms 30488 KB Output is correct
7 Correct 134 ms 27204 KB Output is correct
8 Correct 101 ms 20904 KB Output is correct
9 Correct 140 ms 25432 KB Output is correct
10 Correct 100 ms 20932 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 5 ms 5324 KB Output is correct
4 Correct 170 ms 32452 KB Output is correct
5 Correct 196 ms 32560 KB Output is correct
6 Correct 152 ms 32452 KB Output is correct
7 Correct 172 ms 32460 KB Output is correct
8 Correct 195 ms 32504 KB Output is correct
9 Correct 151 ms 32512 KB Output is correct
10 Correct 171 ms 32452 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 5 ms 5324 KB Output is correct
4 Correct 170 ms 32452 KB Output is correct
5 Correct 196 ms 32560 KB Output is correct
6 Correct 152 ms 32452 KB Output is correct
7 Correct 172 ms 32460 KB Output is correct
8 Correct 195 ms 32504 KB Output is correct
9 Correct 151 ms 32512 KB Output is correct
10 Correct 171 ms 32452 KB Output is correct
11 Correct 18 ms 5708 KB Output is correct
12 Correct 172 ms 32516 KB Output is correct
13 Correct 172 ms 32464 KB Output is correct
14 Correct 154 ms 32492 KB Output is correct
15 Correct 175 ms 32516 KB Output is correct
16 Correct 158 ms 32568 KB Output is correct
17 Correct 177 ms 32448 KB Output is correct
18 Correct 186 ms 32472 KB Output is correct
19 Correct 155 ms 32552 KB Output is correct
20 Correct 176 ms 32452 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 523 ms 22696 KB Output is correct
2 Correct 159 ms 32656 KB Output is correct
3 Correct 307 ms 28816 KB Output is correct
4 Correct 285 ms 22536 KB Output is correct
5 Correct 276 ms 28264 KB Output is correct
6 Correct 310 ms 22400 KB Output is correct
7 Correct 324 ms 27896 KB Output is correct
8 Correct 411 ms 22952 KB Output is correct
9 Correct 152 ms 32452 KB Output is correct
10 Correct 344 ms 26840 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5224 KB Output is correct
5 Correct 124 ms 21324 KB Output is correct
6 Correct 76 ms 30488 KB Output is correct
7 Correct 134 ms 27204 KB Output is correct
8 Correct 101 ms 20904 KB Output is correct
9 Correct 140 ms 25432 KB Output is correct
10 Correct 100 ms 20932 KB Output is correct
11 Correct 7 ms 5252 KB Output is correct
12 Correct 5 ms 5324 KB Output is correct
13 Correct 6 ms 5248 KB Output is correct
14 Correct 5 ms 5232 KB Output is correct
15 Correct 5 ms 5196 KB Output is correct
16 Correct 5 ms 5196 KB Output is correct
17 Correct 5 ms 5196 KB Output is correct
18 Correct 6 ms 5196 KB Output is correct
19 Correct 5 ms 5196 KB Output is correct
20 Correct 5 ms 5324 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5224 KB Output is correct
5 Correct 124 ms 21324 KB Output is correct
6 Correct 76 ms 30488 KB Output is correct
7 Correct 134 ms 27204 KB Output is correct
8 Correct 101 ms 20904 KB Output is correct
9 Correct 140 ms 25432 KB Output is correct
10 Correct 100 ms 20932 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 5 ms 5324 KB Output is correct
14 Correct 170 ms 32452 KB Output is correct
15 Correct 196 ms 32560 KB Output is correct
16 Correct 152 ms 32452 KB Output is correct
17 Correct 172 ms 32460 KB Output is correct
18 Correct 195 ms 32504 KB Output is correct
19 Correct 151 ms 32512 KB Output is correct
20 Correct 171 ms 32452 KB Output is correct
21 Correct 18 ms 5708 KB Output is correct
22 Correct 172 ms 32516 KB Output is correct
23 Correct 172 ms 32464 KB Output is correct
24 Correct 154 ms 32492 KB Output is correct
25 Correct 175 ms 32516 KB Output is correct
26 Correct 158 ms 32568 KB Output is correct
27 Correct 177 ms 32448 KB Output is correct
28 Correct 186 ms 32472 KB Output is correct
29 Correct 155 ms 32552 KB Output is correct
30 Correct 176 ms 32452 KB Output is correct
31 Correct 523 ms 22696 KB Output is correct
32 Correct 159 ms 32656 KB Output is correct
33 Correct 307 ms 28816 KB Output is correct
34 Correct 285 ms 22536 KB Output is correct
35 Correct 276 ms 28264 KB Output is correct
36 Correct 310 ms 22400 KB Output is correct
37 Correct 324 ms 27896 KB Output is correct
38 Correct 411 ms 22952 KB Output is correct
39 Correct 152 ms 32452 KB Output is correct
40 Correct 344 ms 26840 KB Output is correct
41 Correct 7 ms 5252 KB Output is correct
42 Correct 5 ms 5324 KB Output is correct
43 Correct 6 ms 5248 KB Output is correct
44 Correct 5 ms 5232 KB Output is correct
45 Correct 5 ms 5196 KB Output is correct
46 Correct 5 ms 5196 KB Output is correct
47 Correct 5 ms 5196 KB Output is correct
48 Correct 6 ms 5196 KB Output is correct
49 Correct 5 ms 5196 KB Output is correct
50 Correct 5 ms 5324 KB Output is correct
51 Correct 331 ms 23136 KB Output is correct
52 Correct 176 ms 32492 KB Output is correct
53 Correct 331 ms 27004 KB Output is correct
54 Correct 257 ms 22392 KB Output is correct
55 Correct 569 ms 22928 KB Output is correct
56 Correct 202 ms 32444 KB Output is correct
57 Correct 278 ms 27624 KB Output is correct
58 Correct 274 ms 22392 KB Output is correct
59 Correct 372 ms 22996 KB Output is correct
60 Correct 177 ms 32480 KB Output is correct
61 Correct 260 ms 27788 KB Output is correct
62 Correct 294 ms 22168 KB Output is correct
63 Correct 540 ms 22576 KB Output is correct
64 Correct 172 ms 32588 KB Output is correct
65 Correct 341 ms 27904 KB Output is correct
66 Correct 226 ms 22420 KB Output is correct
67 Correct 517 ms 22760 KB Output is correct
68 Correct 172 ms 32436 KB Output is correct
69 Correct 277 ms 26296 KB Output is correct
70 Correct 301 ms 22716 KB Output is correct