oj.uz

답안 #388723

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388723 2021-04-12T16:52:18 Z 1bin Designated Cities (JOI19_designated_cities) C++14
100 / 100
 1182 ms 46312 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll NMAX = 2e5 + 5;
#define all(v) v.begin(), v.end()
ll N, Q, a, b, c, d, W[NMAX], vis[NMAX], dp[NMAX], U[NMAX], D[NMAX], p[NMAX], pp[NMAX], ans[NMAX];
vector<pair<ll, ll>> to[NMAX], v;

void dfs2(int now, int bef) {
	for (auto& e : to[now]) {
		int nxt = e.first;
		if (nxt == bef) {
			U[now] += e.second;
			continue;
		}
		dfs2(nxt, now);
		D[now] += D[nxt] + e.second;
	}
	return;
}

void dfs3(int now, int bef) {
	for (auto& e : to[now]) {
		int nxt = e.first;
		if (nxt == bef) continue;
		U[nxt] += U[now] + D[now] - D[nxt] - e.second;
		dfs3(nxt, now);
	}
	return;
}

void init() {
	dfs2(1, -1); dfs3(1, -1);
	for (int i = 1; i <= N; i++) dp[i] = U[i] + D[i];
	return;
}

int dfs(int now, int bef) {
	W[now] = 1;
	for (auto& e : to[now]) {
		int nxt = e.first;
		if (nxt == bef || vis[nxt]) continue;
		W[now] += dfs(nxt, now);
	}
	return W[now];
}

int centroid(int now, int bef, int lim) {
	for (auto& e : to[now]) {
		int nxt = e.first;
		if (nxt == bef || vis[nxt]) continue;
		if (W[nxt] > lim) return centroid(nxt, now, lim);
	}
	return now;
}

ll go(int now, int bef, int r) {
	ll mx = 0, tmp;
	for (auto& e : to[now]) {
		int nxt = e.first;
		if (nxt == bef || vis[nxt]) continue;
		tmp = go(nxt, now, r) + e.second;
		if (mx < tmp) swap(mx, tmp);
		if (tmp) v.emplace_back(tmp, r);
	}
	return mx;
}

void sol(int r) {
	int lim = dfs(r, -1) / 2;
	int ct = centroid(r, -1, lim);
	vis[ct] = 1;

	v.clear();
	for (auto& e : to[ct]) {
		int nxt = e.first;
		if (vis[nxt]) continue;
		v.emplace_back(go(nxt, ct, nxt) + e.second, nxt);
	}

	sort(all(v));
	reverse(all(v));

	ll x = dp[ct];
	ans[1] = min(ans[1], x);
	for (int i = 1; i <= v.size(); i++) {
		x -= v[i - 1].first;
		ans[i + 1] = min(ans[i + 1], x);
	}


	x = dp[ct];
	int h = v.size();
	for (int i = 0; i < v.size(); i++) {
		if (v[i].second != v[0].second) {
			h = i;
			break;
		}
	}
	if (h != v.size()) {
		x -= v[h].first;
		for (int i = 1; i <= h; i++) {
			if (i > 1) ans[i] = min(ans[i], x);
			x -= v[i - 1].first;
		}
		for (int i = h + 1; i <= v.size(); i++) {
			ans[i] = min(ans[i], x);
			if (i < v.size()) x -= v[i].first;
		}
	}
	
	/*ll a = b = 0, idx, cnt;
	for (int i = 0; i < v.size(); i++) {
		idx = v[i].second;
		if (!a) {
			a = idx; x -= v[i].first;
		}
		else if (a != idx) {
			b = idx; x -= v[i].first; break;
		}
	}

	if (b) {
		ans[2] = min(ans[2], x);
		cnt = 2;
		for (int i = 0; i < v.size(); i++) {
			idx = v[i].second;
			if (idx == a || idx == b) continue;
			cnt++; x -= v[i].first;
			ans[cnt] = min(ans[cnt], x);
		}
	}*/

	for (auto& e : to[ct]) {
		int nxt = e.first;
		if (vis[nxt]) continue;
		sol(nxt);
	}
	return;
}

int main(void) {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	//freopen("input.txt", "r", stdin);
	cin >> N;
	for (int i = 0; i < N - 1; i++) {
		cin >> a >> b >> c >> d;
		to[a].emplace_back(b, c);
		to[b].emplace_back(a, d);
	}

	init();
	/*for (int i = 1; i <= N; i++) cout << dp[i] << ' ';
	return 0;*/

	fill(ans, ans + NMAX, 1e18);
	sol(1);
	for (int i = 2; i <= N; i++) ans[i] = min(ans[i], ans[i - 1]);
	cin >> Q;
	int k;
	while (Q--) {
		cin >> k;
		cout << ans[k] << '\n';
	}
	return 0;
}

Compilation message

designated_cities.cpp: In function 'void sol(int)':
designated_cities.cpp:88:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |  for (int i = 1; i <= v.size(); i++) {
      |                  ~~^~~~~~~~~~~
designated_cities.cpp:96:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
designated_cities.cpp:102:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |  if (h != v.size()) {
      |      ~~^~~~~~~~~~~
designated_cities.cpp:108:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |   for (int i = h + 1; i <= v.size(); i++) {
      |                       ~~^~~~~~~~~~~
designated_cities.cpp:110:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |    if (i < v.size()) x -= v[i].first;
      |        ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 4 ms 6560 KB Output is correct
3 Correct 4 ms 6560 KB Output is correct
4 Correct 5 ms 6608 KB Output is correct
5 Correct 5 ms 6604 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 4 ms 6604 KB Output is correct
8 Correct 5 ms 6604 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 4 ms 6604 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 749 ms 26152 KB Output is correct
3 Correct 1109 ms 37616 KB Output is correct
4 Correct 741 ms 26144 KB Output is correct
5 Correct 407 ms 26160 KB Output is correct
6 Correct 897 ms 28044 KB Output is correct
7 Correct 333 ms 26224 KB Output is correct
8 Correct 1137 ms 38372 KB Output is correct
9 Correct 225 ms 26868 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6604 KB Output is correct
2 Correct 783 ms 25980 KB Output is correct
3 Correct 1125 ms 39660 KB Output is correct
4 Correct 775 ms 26052 KB Output is correct
5 Correct 406 ms 26164 KB Output is correct
6 Correct 931 ms 28280 KB Output is correct
7 Correct 246 ms 28316 KB Output is correct
8 Correct 1078 ms 34180 KB Output is correct
9 Correct 215 ms 26792 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 4 ms 6560 KB Output is correct
3 Correct 4 ms 6560 KB Output is correct
4 Correct 5 ms 6608 KB Output is correct
5 Correct 5 ms 6604 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 4 ms 6604 KB Output is correct
8 Correct 5 ms 6604 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 4 ms 6604 KB Output is correct
12 Correct 4 ms 6604 KB Output is correct
13 Correct 7 ms 6860 KB Output is correct
14 Correct 7 ms 6988 KB Output is correct
15 Correct 8 ms 6788 KB Output is correct
16 Correct 9 ms 6908 KB Output is correct
17 Correct 7 ms 6860 KB Output is correct
18 Correct 7 ms 6828 KB Output is correct
19 Correct 7 ms 6836 KB Output is correct
20 Correct 7 ms 6860 KB Output is correct
21 Correct 7 ms 6860 KB Output is correct
22 Correct 7 ms 6860 KB Output is correct
23 Correct 7 ms 6864 KB Output is correct
24 Correct 6 ms 6860 KB Output is correct
25 Correct 7 ms 6960 KB Output is correct
26 Correct 6 ms 6828 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 749 ms 26152 KB Output is correct
3 Correct 1109 ms 37616 KB Output is correct
4 Correct 741 ms 26144 KB Output is correct
5 Correct 407 ms 26160 KB Output is correct
6 Correct 897 ms 28044 KB Output is correct
7 Correct 333 ms 26224 KB Output is correct
8 Correct 1137 ms 38372 KB Output is correct
9 Correct 225 ms 26868 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 783 ms 25980 KB Output is correct
12 Correct 1125 ms 39660 KB Output is correct
13 Correct 775 ms 26052 KB Output is correct
14 Correct 406 ms 26164 KB Output is correct
15 Correct 931 ms 28280 KB Output is correct
16 Correct 246 ms 28316 KB Output is correct
17 Correct 1078 ms 34180 KB Output is correct
18 Correct 215 ms 26792 KB Output is correct
19 Correct 5 ms 6604 KB Output is correct
20 Correct 761 ms 26036 KB Output is correct
21 Correct 1182 ms 46312 KB Output is correct
22 Correct 747 ms 31032 KB Output is correct
23 Correct 759 ms 32616 KB Output is correct
24 Correct 780 ms 31536 KB Output is correct
25 Correct 732 ms 32688 KB Output is correct
26 Correct 766 ms 31528 KB Output is correct
27 Correct 383 ms 32632 KB Output is correct
28 Correct 969 ms 34276 KB Output is correct
29 Correct 780 ms 32828 KB Output is correct
30 Correct 677 ms 31540 KB Output is correct
31 Correct 293 ms 32988 KB Output is correct
32 Correct 1111 ms 41104 KB Output is correct
33 Correct 236 ms 33372 KB Output is correct

Subtask #6
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 4 ms 6560 KB Output is correct
3 Correct 4 ms 6560 KB Output is correct
4 Correct 5 ms 6608 KB Output is correct
5 Correct 5 ms 6604 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 4 ms 6604 KB Output is correct
8 Correct 5 ms 6604 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 4 ms 6604 KB Output is correct
12 Correct 4 ms 6604 KB Output is correct
13 Correct 749 ms 26152 KB Output is correct
14 Correct 1109 ms 37616 KB Output is correct
15 Correct 741 ms 26144 KB Output is correct
16 Correct 407 ms 26160 KB Output is correct
17 Correct 897 ms 28044 KB Output is correct
18 Correct 333 ms 26224 KB Output is correct
19 Correct 1137 ms 38372 KB Output is correct
20 Correct 225 ms 26868 KB Output is correct
21 Correct 5 ms 6604 KB Output is correct
22 Correct 783 ms 25980 KB Output is correct
23 Correct 1125 ms 39660 KB Output is correct
24 Correct 775 ms 26052 KB Output is correct
25 Correct 406 ms 26164 KB Output is correct
26 Correct 931 ms 28280 KB Output is correct
27 Correct 246 ms 28316 KB Output is correct
28 Correct 1078 ms 34180 KB Output is correct
29 Correct 215 ms 26792 KB Output is correct
30 Correct 4 ms 6604 KB Output is correct
31 Correct 7 ms 6860 KB Output is correct
32 Correct 7 ms 6988 KB Output is correct
33 Correct 8 ms 6788 KB Output is correct
34 Correct 9 ms 6908 KB Output is correct
35 Correct 7 ms 6860 KB Output is correct
36 Correct 7 ms 6828 KB Output is correct
37 Correct 7 ms 6836 KB Output is correct
38 Correct 7 ms 6860 KB Output is correct
39 Correct 7 ms 6860 KB Output is correct
40 Correct 7 ms 6860 KB Output is correct
41 Correct 7 ms 6864 KB Output is correct
42 Correct 6 ms 6860 KB Output is correct
43 Correct 7 ms 6960 KB Output is correct
44 Correct 6 ms 6828 KB Output is correct
45 Correct 5 ms 6604 KB Output is correct
46 Correct 761 ms 26036 KB Output is correct
47 Correct 1182 ms 46312 KB Output is correct
48 Correct 747 ms 31032 KB Output is correct
49 Correct 759 ms 32616 KB Output is correct
50 Correct 780 ms 31536 KB Output is correct
51 Correct 732 ms 32688 KB Output is correct
52 Correct 766 ms 31528 KB Output is correct
53 Correct 383 ms 32632 KB Output is correct
54 Correct 969 ms 34276 KB Output is correct
55 Correct 780 ms 32828 KB Output is correct
56 Correct 677 ms 31540 KB Output is correct
57 Correct 293 ms 32988 KB Output is correct
58 Correct 1111 ms 41104 KB Output is correct
59 Correct 236 ms 33372 KB Output is correct
60 Correct 4 ms 6604 KB Output is correct
61 Correct 770 ms 35100 KB Output is correct
62 Correct 1158 ms 45692 KB Output is correct
63 Correct 765 ms 33668 KB Output is correct
64 Correct 759 ms 35272 KB Output is correct
65 Correct 800 ms 33880 KB Output is correct
66 Correct 793 ms 35376 KB Output is correct
67 Correct 805 ms 33976 KB Output is correct
68 Correct 431 ms 35252 KB Output is correct
69 Correct 972 ms 36708 KB Output is correct
70 Correct 821 ms 35364 KB Output is correct
71 Correct 683 ms 34368 KB Output is correct
72 Correct 348 ms 36024 KB Output is correct
73 Correct 1144 ms 42188 KB Output is correct
74 Correct 262 ms 36192 KB Output is correct