oj.uz

Submission #383725

# Submission time Handle Problem Language Result Execution time Memory
383725 2021-03-30T17:38:28 Z rqi Designated Cities (JOI19_designated_cities) C++14
56 / 100
 2000 ms 53724 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;

#define f first
#define s second
#define mp make_pair
#define pb push_back

#define sz(x) (int)(x).size()

void ckmax(ll&a, ll b){
	a = max(a, b);
}

const int mx = 200005;
int N;
int A[mx];
int B[mx];
ll C[mx];
ll D[mx];
int E[mx];

vector<pair<int, ll>> adj[mx];
ll tot_cost;
ll ans[mx];

bool done[mx];

int sub[mx];
vi cen_nodes;

void genSub(int node, int p = -1){
	cen_nodes.pb(node);
	sub[node] = 1;
	for(auto u: adj[node]){
		if(u.f == p || done[u.f]) continue;
		genSub(u.f, node);
		sub[node]+=sub[u.f];
	}
}

int getCen(int node, int tot_sz, int p = -1){
	for(auto u: adj[node]){
		if(u.f == p || done[u.f]) continue;
		if(sub[u.f] > tot_sz/2) return getCen(u.f, tot_sz, node);
	}
	return node;
}



int genCen(int node){
	cen_nodes.clear();
	genSub(node);
	return getCen(node, sub[node]);
}

pair<int, ll> par[mx];
ll sum_up[mx];
pair<ll, int> best_down[mx];
bool active[mx];

void genUpDown(int node, int p = -1){
	sum_up[node] = 0;
	best_down[node] = mp(0, node);

	for(auto u: adj[node]){
		if(u.f == p || done[u.f]) continue;
		ll bedge = 0;
		for(auto x: adj[u.f]){
			if(done[x.f]) continue;
			if(x.f == node){
				bedge = x.s;
				break;
			}
		}
		par[u.f] = mp(node, u.s);
		sum_up[node]+=bedge;
		genUpDown(u.f, node);
		sum_up[node]+=sum_up[u.f];
		best_down[node] = max(best_down[node], mp(best_down[u.f].f+u.s, best_down[u.f].s));
	}
}

bool taken[mx];

void genAns(int cen, ll offset){
	cen = genCen(cen);

	//process cen

	genUpDown(cen);

	//update ans - remember done/offset

	//cout << "cen, offset, sumup[cen]: " << cen << " " << offset << " " << sum_up[cen] << "\n";

	ckmax(ans[1], sum_up[cen]+offset);

	for(auto u: cen_nodes){
		taken[u] = 0;
		active[u] = 0;
	}
	taken[cen] = 1;

	priority_queue<pair<ll, int>> pq;
	for(auto u: adj[cen]){
		if(done[u.f]) continue;
		active[u.f] = 1;
	}

	vector<pair<ll, pi>> paths;
	for(auto u: cen_nodes){
		if(u == cen) continue;
		paths.pb(mp(best_down[u].f+par[u].s, mp(best_down[u].s, u)));
	}
	sort(paths.rbegin(), paths.rend());

	// cout << "paths:" << "\n";
	// for(auto u: paths){
	// 	cout << u.f << " " << u.s.f << " " << u.s.s << "\n";
	// }

	ll cur_sum = 0;
	ll best_outside = 0;
	bool good = 0;
	int cur_path_ind = 0;
	for(int i = 1; i <= sz(cen_nodes); i++){
		int take_node = -1;
		while(cur_path_ind < sz(paths)){
			if(!active[paths[cur_path_ind].s.s]){
				cur_path_ind++;
				continue;
			}
			take_node = paths[cur_path_ind].s.f;
			cur_path_ind++;
			break;
		}
		//cout << "i, take_node: " << i << " " << take_node << "\n";

		if(take_node == -1){
			ckmax(ans[i], cur_sum+sum_up[cen]+offset);
			//cout << "ckmax(ans[]: " << i << " " << cur_sum+sum_up[cen]+offset << "\n";
			continue;
		}
		assert(take_node != -1);
		//cout << "take_node: " << i << " " << take_node << "\n";
		while(true){
			cur_sum+=par[take_node].s;
			taken[take_node] = 1;
			//cout << "add: " << take_node << " " << par[take_node].s << " " << cur_sum << "\n";
			for(auto u: adj[take_node]){
				if(u.f == par[take_node].f || done[u.f] || taken[u.f]) continue;
				active[u.f] = 1;
				//cout << "push: " << best_down[u.f].s << "\n";
			}
			if(taken[par[take_node].f]) break;
			take_node = par[take_node].f;
		}
		
		if(i == 1){
			for(auto u: adj[cen]){
				if(done[u.f]) continue;
				if(u.f != take_node){
					ckmax(best_outside, u.s+best_down[u.f].f);
				}
			}
		}

		if(i != 1 && par[take_node].f == cen){
			good = 1;
		}

		if(good){
			ckmax(ans[i], cur_sum+sum_up[cen]+offset);
			//cout << "ckmax(ans[]: " << i << " " << cur_sum+sum_up[cen]+offset << "\n";
		}
		else{
			ckmax(ans[i+1], cur_sum+best_outside+sum_up[cen]+offset);
			//cout << "ckmax(ans[]: " << i+1 << " " << cur_sum+best_outside+sum_up[cen]+offset << "\n";
		}
	}

	//recurse

	done[cen] = 1;

	vector<pair<int, ll>> recurse;
	for(auto u: adj[cen]){
		if(done[u.f]) continue;
		ll new_offset = offset+sum_up[cen]-sum_up[u.f]+u.s;
		for(auto x: adj[u.f]){
			if(x.f == cen){
				new_offset-=x.s;
				break;
			}
		}
		recurse.pb(mp(u.f, new_offset));
	}

	for(auto u: recurse){
		genAns(u.f, u.s);
	}
}

int main(){
	cin >> N;
	for(int i = 1; i <= N-1; i++){
		cin >> A[i] >> B[i] >> C[i] >> D[i];
		adj[A[i]].pb(mp(B[i], C[i]));
		adj[B[i]].pb(mp(A[i], D[i]));
		tot_cost+=C[i]+D[i];
	}

	genAns(1, 0);

	// cout << "tot: " << tot_cost << "\n";
	// for(int i = 1; i <= N; i++){
	// 	cout << "i, ans[i]: " << i << " " << ans[i] << "\n";
	// }

	for(int i = 1; i <= N; i++){
		ans[i] = tot_cost-ans[i];
	}

	//cout << ans[N] << "\n";

	assert(ans[N] == 0);

	int Q;
	cin >> Q;
	for(int i = 1; i <= Q; i++){
		cin >> E[i];
		cout << ans[E[i]] << "\n";
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 6 ms 5100 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 1316 ms 38148 KB Output is correct
3 Correct 1745 ms 51248 KB Output is correct
4 Correct 1311 ms 39064 KB Output is correct
5 Correct 642 ms 36308 KB Output is correct
6 Correct 1606 ms 41048 KB Output is correct
7 Correct 570 ms 37868 KB Output is correct
8 Correct 1727 ms 51672 KB Output is correct
9 Correct 473 ms 41176 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 1366 ms 38888 KB Output is correct
3 Correct 1750 ms 53680 KB Output is correct
4 Correct 1349 ms 38360 KB Output is correct
5 Correct 649 ms 36264 KB Output is correct
6 Correct 1656 ms 41348 KB Output is correct
7 Correct 489 ms 40928 KB Output is correct
8 Correct 1717 ms 47644 KB Output is correct
9 Correct 475 ms 41056 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 6 ms 5100 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 14 ms 5484 KB Output is correct
14 Correct 15 ms 5484 KB Output is correct
15 Correct 14 ms 5484 KB Output is correct
16 Correct 15 ms 5484 KB Output is correct
17 Correct 14 ms 5484 KB Output is correct
18 Correct 15 ms 5484 KB Output is correct
19 Correct 14 ms 5484 KB Output is correct
20 Correct 13 ms 5484 KB Output is correct
21 Correct 15 ms 5632 KB Output is correct
22 Correct 15 ms 5484 KB Output is correct
23 Correct 14 ms 5484 KB Output is correct
24 Correct 13 ms 5484 KB Output is correct
25 Correct 15 ms 5612 KB Output is correct
26 Correct 12 ms 5484 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 1316 ms 38148 KB Output is correct
3 Correct 1745 ms 51248 KB Output is correct
4 Correct 1311 ms 39064 KB Output is correct
5 Correct 642 ms 36308 KB Output is correct
6 Correct 1606 ms 41048 KB Output is correct
7 Correct 570 ms 37868 KB Output is correct
8 Correct 1727 ms 51672 KB Output is correct
9 Correct 473 ms 41176 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 1366 ms 38888 KB Output is correct
12 Correct 1750 ms 53680 KB Output is correct
13 Correct 1349 ms 38360 KB Output is correct
14 Correct 649 ms 36264 KB Output is correct
15 Correct 1656 ms 41348 KB Output is correct
16 Correct 489 ms 40928 KB Output is correct
17 Correct 1717 ms 47644 KB Output is correct
18 Correct 475 ms 41056 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 1334 ms 38520 KB Output is correct
21 Correct 1748 ms 53724 KB Output is correct
22 Correct 1353 ms 39132 KB Output is correct
23 Correct 1378 ms 38744 KB Output is correct
24 Correct 1340 ms 39256 KB Output is correct
25 Correct 1337 ms 39284 KB Output is correct
26 Correct 1302 ms 38744 KB Output is correct
27 Correct 647 ms 35852 KB Output is correct
28 Correct 1595 ms 41120 KB Output is correct
29 Correct 1287 ms 38684 KB Output is correct
30 Correct 1163 ms 38612 KB Output is correct
31 Correct 553 ms 38148 KB Output is correct
32 Correct 1748 ms 48188 KB Output is correct
33 Correct 486 ms 41180 KB Output is correct

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 6 ms 5100 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 1316 ms 38148 KB Output is correct
14 Correct 1745 ms 51248 KB Output is correct
15 Correct 1311 ms 39064 KB Output is correct
16 Correct 642 ms 36308 KB Output is correct
17 Correct 1606 ms 41048 KB Output is correct
18 Correct 570 ms 37868 KB Output is correct
19 Correct 1727 ms 51672 KB Output is correct
20 Correct 473 ms 41176 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 1366 ms 38888 KB Output is correct
23 Correct 1750 ms 53680 KB Output is correct
24 Correct 1349 ms 38360 KB Output is correct
25 Correct 649 ms 36264 KB Output is correct
26 Correct 1656 ms 41348 KB Output is correct
27 Correct 489 ms 40928 KB Output is correct
28 Correct 1717 ms 47644 KB Output is correct
29 Correct 475 ms 41056 KB Output is correct
30 Correct 4 ms 5100 KB Output is correct
31 Correct 14 ms 5484 KB Output is correct
32 Correct 15 ms 5484 KB Output is correct
33 Correct 14 ms 5484 KB Output is correct
34 Correct 15 ms 5484 KB Output is correct
35 Correct 14 ms 5484 KB Output is correct
36 Correct 15 ms 5484 KB Output is correct
37 Correct 14 ms 5484 KB Output is correct
38 Correct 13 ms 5484 KB Output is correct
39 Correct 15 ms 5632 KB Output is correct
40 Correct 15 ms 5484 KB Output is correct
41 Correct 14 ms 5484 KB Output is correct
42 Correct 13 ms 5484 KB Output is correct
43 Correct 15 ms 5612 KB Output is correct
44 Correct 12 ms 5484 KB Output is correct
45 Correct 4 ms 5100 KB Output is correct
46 Correct 1334 ms 38520 KB Output is correct
47 Correct 1748 ms 53724 KB Output is correct
48 Correct 1353 ms 39132 KB Output is correct
49 Correct 1378 ms 38744 KB Output is correct
50 Correct 1340 ms 39256 KB Output is correct
51 Correct 1337 ms 39284 KB Output is correct
52 Correct 1302 ms 38744 KB Output is correct
53 Correct 647 ms 35852 KB Output is correct
54 Correct 1595 ms 41120 KB Output is correct
55 Correct 1287 ms 38684 KB Output is correct
56 Correct 1163 ms 38612 KB Output is correct
57 Correct 553 ms 38148 KB Output is correct
58 Correct 1748 ms 48188 KB Output is correct
59 Correct 486 ms 41180 KB Output is correct
60 Correct 4 ms 5100 KB Output is correct
61 Correct 1835 ms 38308 KB Output is correct
62 Execution timed out 2076 ms 51516 KB Time limit exceeded
63 Halted 0 ms 0 KB -