oj.uz

답안 #828605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828605 2023-08-17T12:38:54 Z NK_ Roadside Advertisements (NOI17_roadsideadverts) C++17
100 / 100
 44 ms 13772 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using vi = V<int>;
using ll = long long;
using pi = pair<int, int>;
using vpi = V<pi>;
using vl = V<ll>;

const int LG = 16;

int main() {
	cin.tie(0)->sync_with_stdio(0);
 	
	int N; cin >> N;

	V<vpi> adj(N); for(int i = 0; i < N - 1; i++) {
		int u, v, w; cin >> u >> v >> w;
		adj[u].pb(mp(v, w));
		adj[v].pb(mp(u, w));
	}

	vi st(N), en(N), dep(N);
	V<vi> up(N, vi(LG));

	int t = 0;
	function<void(int, int)> gen = [&](int u, int p) {
		up[u][0] = p;
		for(int i = 1; i < LG; i++) up[u][i] = up[up[u][i-1]][i-1];

		st[u] = t++;
		for(auto& e : adj[u]) if (e.f != p) {
			dep[e.f] = dep[u] + e.s; gen(e.f, u);
		}
		en[u] = t - 1;
	};
	
	dep[0] = 0; gen(0, 0);

	auto anc = [&](int a, int b) { return st[a] <= st[b] && en[b] <= en[a]; };

	auto lca = [&](int a, int b) {
		if (anc(a, b)) return a;
		// if (anc(b, a)) return b;

		for(int i = LG - 1; i >= 0; i--) {
			if (!anc(up[a][i], b)) a = up[a][i];
		}

		return up[a][0];
	};

	auto dist = [&](int u, int v) {
		// cout << u << " - " << v << " - " << lca(u, v) << endl;
		return dep[u] + dep[v] - 2 * dep[lca(u, v)];
	};


	int Q; cin >> Q;
	for(int i = 0; i < Q; i++) { 
		vi A(5); for(auto& x : A) cin >> x;

		sort(begin(A), end(A), [&](int x, int y) { return st[x] < st[y]; });

		for(int x = 0; x < 4; x++) A.pb(lca(A[x], A[x+1]));

		sort(begin(A), end(A), [&](int x, int y) { return st[x] < st[y]; });
		A.erase(unique(begin(A), end(A)), end(A));

		vi stk = {-1}; int ans = 0;
		for(auto& x : A) {
			while(stk.back() != -1 && en[stk.back()] < st[x]) stk.pop_back();

			// for(auto& y : stk) cout << y << ", ";
			// cout << endl;

			if (stk.back() != -1) ans += dist(stk.back(), x);
			stk.pb(x);
		}
		// cout << endl;

		cout << ans << nl;
	}

	exit(0-0);
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 11296 KB Output is correct
2 Correct 37 ms 13416 KB Output is correct
3 Correct 39 ms 13400 KB Output is correct
4 Correct 40 ms 13388 KB Output is correct
5 Correct 41 ms 13488 KB Output is correct
6 Correct 43 ms 13424 KB Output is correct
7 Correct 37 ms 13396 KB Output is correct
8 Correct 36 ms 13388 KB Output is correct
9 Correct 36 ms 13432 KB Output is correct
10 Correct 36 ms 13432 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 9056 KB Output is correct
2 Correct 31 ms 13380 KB Output is correct
3 Correct 41 ms 13304 KB Output is correct
4 Correct 31 ms 13396 KB Output is correct
5 Correct 31 ms 13392 KB Output is correct
6 Correct 44 ms 13440 KB Output is correct
7 Correct 31 ms 13344 KB Output is correct
8 Correct 33 ms 13320 KB Output is correct
9 Correct 32 ms 13356 KB Output is correct
10 Correct 33 ms 13352 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 37 ms 11296 KB Output is correct
3 Correct 37 ms 13416 KB Output is correct
4 Correct 39 ms 13400 KB Output is correct
5 Correct 40 ms 13388 KB Output is correct
6 Correct 41 ms 13488 KB Output is correct
7 Correct 43 ms 13424 KB Output is correct
8 Correct 37 ms 13396 KB Output is correct
9 Correct 36 ms 13388 KB Output is correct
10 Correct 36 ms 13432 KB Output is correct
11 Correct 36 ms 13432 KB Output is correct
12 Correct 25 ms 9056 KB Output is correct
13 Correct 31 ms 13380 KB Output is correct
14 Correct 41 ms 13304 KB Output is correct
15 Correct 31 ms 13396 KB Output is correct
16 Correct 31 ms 13392 KB Output is correct
17 Correct 44 ms 13440 KB Output is correct
18 Correct 31 ms 13344 KB Output is correct
19 Correct 33 ms 13320 KB Output is correct
20 Correct 32 ms 13356 KB Output is correct
21 Correct 33 ms 13352 KB Output is correct
22 Correct 36 ms 12308 KB Output is correct
23 Correct 32 ms 10044 KB Output is correct
24 Correct 40 ms 13644 KB Output is correct
25 Correct 39 ms 13656 KB Output is correct
26 Correct 40 ms 13668 KB Output is correct
27 Correct 39 ms 13740 KB Output is correct
28 Correct 40 ms 13772 KB Output is correct
29 Correct 39 ms 13756 KB Output is correct
30 Correct 44 ms 13740 KB Output is correct
31 Correct 39 ms 13676 KB Output is correct