oj.uz

답안 #110044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110044 2019-05-09T03:17:38 Z qkxwsm Election Campaign (JOI15_election_campaign) C++14
100 / 100
 525 ms 28784 KB 
//clever
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M, T;
vi edge[MAXN];
vector<pair<int, pii> > choice[MAXN];
int parent[MAXN], st[MAXN], ft[MAXN], depth[MAXN];
int ancestor[25][MAXN];
int dp[MAXN], sdp[MAXN];
vi ord;

int fen[MAXN];
void upd(int idx, int v)
{
	for (int e = idx + 1; e <= N + 1; e += e & (-e))
	{
		fen[e] += v;
	}
	return;
}
void rangeupdate(int l, int r, int v)
{
	upd(l, v);
	upd(r + 1, -v);
}
int query(int idx)
{
	int res = 0;
	for (int e = idx + 1; e; e -= e & (-e))
	{
		res += fen[e];
	}
	return res;
}
void dfs(int u)
{
	st[u] = T; ft[u] = T;
	T++;
	for (int v : edge[u])
	{
		if (v == parent[u]) continue;
		parent[v] = u;
		// cerr << "parent " << v << " = " << u << endl;
		depth[v] = depth[u] + 1;
		dfs(v);
		ft[u] = ft[v];
	}
	ord.PB(u);
}
bool insubt(int u, int v)
{
	if (u == N) return true;
	if (st[u] <= st[v] && st[v] <= ft[u]) return true;
	return false;
}
int lca(int u, int v)
{
	//how far does v need to go up to?
	if (insubt(v, u)) return -1;
	// cerr << "solver " << u << ' ' << v << " is ";
	FORD(i, 20, 0)
	{
		if (!insubt(ancestor[i][v], u)) v = ancestor[i][v];
	}
	// cerr << v << endl;
	return v;
}
void solve(int u)
{
	for (int v : edge[u])
	{
		if (v == parent[u]) continue;
		sdp[u] += dp[v];
	}
	int res = 0;
	for (auto p : choice[u])
	{
		int cur = p.fi;
		cur += query(st[p.se.fi]);
		cur += query(st[p.se.se]);
		// int v = p.se.fi;
		// while(v != u)
		// {
		// 	cur += (sdp[v] - dp[v]);
		// 	v = parent[v];
		// }
		// v = p.se.se;
		// while(v != u)
		// {
		// 	cur += (sdp[v] - dp[v]);
		// 	v = parent[v];
		// }
		ckmax(res, cur);
	}
	res += sdp[u];
	dp[u] = res;
	rangeupdate(st[u], ft[u], sdp[u] - dp[u]);
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N;
	FOR(i, 0, N - 1)
	{
		int u, v;
		cin >> u >> v; u--; v--;
		edge[u].PB(v);
		edge[v].PB(u);
	}
	parent[0] = N;
	dfs(0);
	FOR(i, 0, 25) ancestor[i][N] = N;
	FOR(i, 0, N) ancestor[0][i] = parent[i];
	// FOR(i, 0, N)
	// {
	// 	cerr << "ancestor " << 0 << ' ' << i << " = " << parent[i] << endl;
	// }
	FOR(i, 1, 24)
	{
		FOR(j, 0, N)
		{
			ancestor[i][j] = ancestor[i - 1][ancestor[i - 1][j]];
		}
	}
	// DBG(ancestor[1][1]);
	cin >> M;
	FOR(i, 0, M)
	{
		int u, v, c;
		cin >> u >> v >> c; u--; v--;
		if (depth[u] > depth[v]) swap(u, v);
		int w = lca(u, v); w = parent[w];
		choice[w].PB({c, {u, v}});
		// cerr << w << " gets " << c << " with " << u << " -> " << v << endl;
	}
	for (int u : ord)
	{
		solve(u);
	}
	cout << dp[0] << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5248 KB Output is correct
2 Correct 7 ms 5248 KB Output is correct
3 Correct 7 ms 5248 KB Output is correct
4 Correct 8 ms 5376 KB Output is correct
5 Correct 174 ms 21108 KB Output is correct
6 Correct 59 ms 24048 KB Output is correct
7 Correct 108 ms 22896 KB Output is correct
8 Correct 96 ms 20976 KB Output is correct
9 Correct 124 ms 22288 KB Output is correct
10 Correct 106 ms 21004 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5248 KB Output is correct
2 Correct 7 ms 5248 KB Output is correct
3 Correct 8 ms 5376 KB Output is correct
4 Correct 267 ms 25964 KB Output is correct
5 Correct 339 ms 28500 KB Output is correct
6 Correct 264 ms 28300 KB Output is correct
7 Correct 229 ms 28268 KB Output is correct
8 Correct 285 ms 28316 KB Output is correct
9 Correct 307 ms 28380 KB Output is correct
10 Correct 339 ms 28272 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5248 KB Output is correct
2 Correct 7 ms 5248 KB Output is correct
3 Correct 8 ms 5376 KB Output is correct
4 Correct 267 ms 25964 KB Output is correct
5 Correct 339 ms 28500 KB Output is correct
6 Correct 264 ms 28300 KB Output is correct
7 Correct 229 ms 28268 KB Output is correct
8 Correct 285 ms 28316 KB Output is correct
9 Correct 307 ms 28380 KB Output is correct
10 Correct 339 ms 28272 KB Output is correct
11 Correct 20 ms 6144 KB Output is correct
12 Correct 306 ms 28652 KB Output is correct
13 Correct 276 ms 28652 KB Output is correct
14 Correct 336 ms 28660 KB Output is correct
15 Correct 289 ms 28784 KB Output is correct
16 Correct 292 ms 28520 KB Output is correct
17 Correct 293 ms 28524 KB Output is correct
18 Correct 242 ms 28656 KB Output is correct
19 Correct 288 ms 28556 KB Output is correct
20 Correct 287 ms 28528 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 22460 KB Output is correct
2 Correct 229 ms 25944 KB Output is correct
3 Correct 512 ms 27088 KB Output is correct
4 Correct 200 ms 24812 KB Output is correct
5 Correct 478 ms 27028 KB Output is correct
6 Correct 174 ms 25068 KB Output is correct
7 Correct 450 ms 26728 KB Output is correct
8 Correct 320 ms 25100 KB Output is correct
9 Correct 278 ms 28400 KB Output is correct
10 Correct 390 ms 26172 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5248 KB Output is correct
2 Correct 7 ms 5248 KB Output is correct
3 Correct 7 ms 5248 KB Output is correct
4 Correct 8 ms 5376 KB Output is correct
5 Correct 174 ms 21108 KB Output is correct
6 Correct 59 ms 24048 KB Output is correct
7 Correct 108 ms 22896 KB Output is correct
8 Correct 96 ms 20976 KB Output is correct
9 Correct 124 ms 22288 KB Output is correct
10 Correct 106 ms 21004 KB Output is correct
11 Correct 9 ms 5376 KB Output is correct
12 Correct 8 ms 5376 KB Output is correct
13 Correct 8 ms 5376 KB Output is correct
14 Correct 8 ms 5504 KB Output is correct
15 Correct 8 ms 5376 KB Output is correct
16 Correct 8 ms 5376 KB Output is correct
17 Correct 8 ms 5376 KB Output is correct
18 Correct 9 ms 5376 KB Output is correct
19 Correct 7 ms 5376 KB Output is correct
20 Correct 10 ms 5376 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5248 KB Output is correct
2 Correct 7 ms 5248 KB Output is correct
3 Correct 7 ms 5248 KB Output is correct
4 Correct 8 ms 5376 KB Output is correct
5 Correct 174 ms 21108 KB Output is correct
6 Correct 59 ms 24048 KB Output is correct
7 Correct 108 ms 22896 KB Output is correct
8 Correct 96 ms 20976 KB Output is correct
9 Correct 124 ms 22288 KB Output is correct
10 Correct 106 ms 21004 KB Output is correct
11 Correct 8 ms 5248 KB Output is correct
12 Correct 7 ms 5248 KB Output is correct
13 Correct 8 ms 5376 KB Output is correct
14 Correct 267 ms 25964 KB Output is correct
15 Correct 339 ms 28500 KB Output is correct
16 Correct 264 ms 28300 KB Output is correct
17 Correct 229 ms 28268 KB Output is correct
18 Correct 285 ms 28316 KB Output is correct
19 Correct 307 ms 28380 KB Output is correct
20 Correct 339 ms 28272 KB Output is correct
21 Correct 20 ms 6144 KB Output is correct
22 Correct 306 ms 28652 KB Output is correct
23 Correct 276 ms 28652 KB Output is correct
24 Correct 336 ms 28660 KB Output is correct
25 Correct 289 ms 28784 KB Output is correct
26 Correct 292 ms 28520 KB Output is correct
27 Correct 293 ms 28524 KB Output is correct
28 Correct 242 ms 28656 KB Output is correct
29 Correct 288 ms 28556 KB Output is correct
30 Correct 287 ms 28528 KB Output is correct
31 Correct 234 ms 22460 KB Output is correct
32 Correct 229 ms 25944 KB Output is correct
33 Correct 512 ms 27088 KB Output is correct
34 Correct 200 ms 24812 KB Output is correct
35 Correct 478 ms 27028 KB Output is correct
36 Correct 174 ms 25068 KB Output is correct
37 Correct 450 ms 26728 KB Output is correct
38 Correct 320 ms 25100 KB Output is correct
39 Correct 278 ms 28400 KB Output is correct
40 Correct 390 ms 26172 KB Output is correct
41 Correct 9 ms 5376 KB Output is correct
42 Correct 8 ms 5376 KB Output is correct
43 Correct 8 ms 5376 KB Output is correct
44 Correct 8 ms 5504 KB Output is correct
45 Correct 8 ms 5376 KB Output is correct
46 Correct 8 ms 5376 KB Output is correct
47 Correct 8 ms 5376 KB Output is correct
48 Correct 9 ms 5376 KB Output is correct
49 Correct 7 ms 5376 KB Output is correct
50 Correct 10 ms 5376 KB Output is correct
51 Correct 314 ms 25404 KB Output is correct
52 Correct 252 ms 28612 KB Output is correct
53 Correct 391 ms 26648 KB Output is correct
54 Correct 187 ms 25392 KB Output is correct
55 Correct 195 ms 25124 KB Output is correct
56 Correct 271 ms 28532 KB Output is correct
57 Correct 525 ms 27008 KB Output is correct
58 Correct 149 ms 25072 KB Output is correct
59 Correct 251 ms 25416 KB Output is correct
60 Correct 195 ms 28524 KB Output is correct
61 Correct 452 ms 27076 KB Output is correct
62 Correct 186 ms 24888 KB Output is correct
63 Correct 171 ms 24952 KB Output is correct
64 Correct 249 ms 28668 KB Output is correct
65 Correct 386 ms 26792 KB Output is correct
66 Correct 211 ms 25464 KB Output is correct
67 Correct 229 ms 25180 KB Output is correct
68 Correct 261 ms 28656 KB Output is correct
69 Correct 443 ms 26648 KB Output is correct
70 Correct 156 ms 25332 KB Output is correct