제출 #1270608

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1270608		thieunguyenhuy	Election Campaign (JOI15_election_campaign)	C++20	100 / 100	190 ms	32560 KiB

election_campaign

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
    return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
    return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e5 + 5, LG = 18;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n, m;
int up[N][LG], dep[N], pos[N], f[N], sum[N], sum_path[N][LG];
vector<int> adj[N];
vector<tuple<int, int, int>> ve[N];

void dfs(int u, int fa) {
	for (auto v : adj[u]) if (v != fa) {
		up[v][0] = u, dep[v] = dep[u] + 1;
		for (int i = 1; i < LG; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
		dfs(v, u);
	}
}

int lca(int u, int v) {
	if (dep[u] < dep[v]) swap(u, v);
	int delta = dep[u] - dep[v];
	for (int i = 0; MASK(i) <= delta; ++i) if (BIT(delta, i)) {
		u = up[u][i];
	}
	if (u == v) return u;
	for (int i = LOG(dep[u]); i >= 0; --i) if (up[u][i] != up[v][i]) {
		u = up[u][i], v = up[v][i];
	}
	return up[u][0];
}

int get_single(int u, int i) {
	if (pos[u] == 0) sum_path[u][pos[u]++] = sum[up[u][0]] - f[u];
	while (pos[u] <= i) {
		sum_path[u][pos[u]] = sum_path[u][pos[u] - 1] 
							+ get_single(up[u][pos[u] - 1], pos[u] - 1);
		++pos[u];
	}
	return sum_path[u][i];
}

int get(int u, int s) {
	int ans = 0;
	for (int i = 0; MASK(i) <= s; ++i) if (BIT(s, i)) {
		ans += get_single(u, i);
		u = up[u][i];
	}
	return ans;
}

int jump(int u, int s) {
	for (int i = 0; MASK(i) <= s; ++i) if (BIT(s, i)) {
		u = up[u][i];
	}
	return u;
}

void calc(int u, int fa) {
	for (auto v : adj[u]) if (v != fa) {
		calc(v, u);
		sum[u] += f[v];
	}

	f[u] = sum[u];
	for (auto [a, b, c] : ve[u]) {
		if (a == b) {
			maximize(f[u], sum[u] + c);
			continue;
		}
		if (b == u) swap(a, b);

		if (a == u) {
			maximize(f[u], get(b, dep[b] - dep[u]) + sum[b] + c);
		}
		else {
			int la = jump(a, dep[a] - dep[u] - 1);
			int lb = jump(b, dep[b] - dep[u] - 1);
			int tmp = get(a, dep[a] - dep[u] - 1) + sum[a] 
					+ get(b, dep[b] - dep[u] - 1) + sum[b];
			maximize(f[u], tmp + sum[u] - f[la] - f[lb] + c);
		}
	}

	// cerr << u << ' ' << f[u] << ' ' << sum[u] << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> n;

    for (int i = 1; i < n; ++i) {
    	int u, v; cin >> u >> v;
    	adj[u].emplace_back(v), adj[v].emplace_back(u);
    }

    int root = 1;
    dfs(root, -1);

    cin >> m;
    for (int i = 1; i <= m; ++i) {
    	int u, v, c; cin >> u >> v >> c;
    	ve[lca(u, v)].emplace_back(u, v, c);
    }

    calc(root, -1);

    cout << f[root];
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 30 / 30
• Subtask 5: 10 / 10
• Subtask 6: 40 / 40