oj.uz

Submission #830147

# Submission time Handle Problem Language Result Execution time Memory
830147 2023-08-18T20:03:41 Z MohamedAhmed04 Designated Cities (JOI19_designated_cities) C++14
100 / 100
 1433 ms 47572 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std ;
 
const int MAX = 2e5 + 10 ;
 
int arr[MAX] ;
int n , q ;
 
vector< vector< pair<int , int> > >adj(MAX) ;
 
long long ans[MAX] ;
 
int mark[MAX] ;
int sz[MAX] ;
int cursrc , cursz ;
long long curcost ;
 
pair<long long , int>tree[4 * MAX] ;
long long lazy[4 * MAX] ;
 
int id[MAX] ;
long long val3[MAX] ;
 
void build(int node , int l , int r)
{
	lazy[node] = 0 ;
	if(l == r)
	{
		tree[node] = {val3[id[l]] , id[l]} ;
		return ;
	}
	int mid = (l + r) >> 1 ;
	build(node << 1 , l , mid) ;
	build(node << 1 | 1 , mid+1 , r) ;
	tree[node] = max(tree[node << 1] , tree[node << 1 | 1]) ;
}
 
void prop(int node , int l , int r)
{
	tree[node].first += lazy[node] ;
	if(l != r)
	{
		lazy[node << 1] += lazy[node] ;
		lazy[node << 1 | 1] += lazy[node] ;
	}
	lazy[node] = 0 ;
}
 
void update(int node , int l , int r , int from , int to , int val)
{
	if(lazy[node])
		prop(node , l , r) ;
	if(from > r || to < l)
		return ;
	if(l >= from && r <= to)
	{
		lazy[node] += val ;
		prop(node , l , r) ;
		return ;
	}
	int mid = (l + r) >> 1 ;
	update(node << 1 , l , mid , from , to , val) ;
	update(node << 1 | 1 , mid+1 , r , from , to , val) ;
	tree[node] = max(tree[node << 1] , tree[node << 1 | 1]) ;
}
 
pair<long long , int>query(int node , int l , int r , int from , int to)
{
	if(lazy[node])
		prop(node , l , r) ;
	if(from > r || to < l || from > to)
		return {-1e18 , -1e9} ;
	if(l >= from && r <= to)
		return tree[node] ;
	int mid = (l + r) >> 1 ;
	pair<long long , int>a = query(node << 1 , l , mid , from , to) ;
	pair<long long , int>b = query(node << 1 | 1 , mid+1 , r , from , to) ;
	return max(a , b) ;
}
 
void dfs_pre(int node , int par)
{
	sz[node] = 1 ;
	for(auto &childd : adj[node])
	{
		int child = childd.first ;
		if(child == par || mark[child])
			continue ;
		dfs_pre(child , node) ;
		sz[node] += sz[child] ;
	}
}
 
int FindCentroid(int node , int par)
{
	for(auto &childd : adj[node])
	{
		int child = childd.first ;
		if(child == par || mark[child])
			continue ;
		if(sz[child] > cursz / 2)
			return FindCentroid(child , node) ;
	}
	return node ;
}
 
int val[MAX] ;
int in[MAX] , out[MAX] ;
int tim = 0 ;
int sub[MAX] , P[MAX] , erased[MAX] , edgcost[MAX] ;
long long sum[MAX] , Max[MAX] ;
 
void dfs(int node , int par)
{
	in[node] = ++tim , id[tim] = node , P[node] = par ;
	curcost += val[node] , erased[node] = 0 ;
	sum[node] = Max[node] = val[node] ;
	for(auto &childd : adj[node])
	{
		int child = childd.first , w = childd.second ;
		if(child == par)
			edgcost[node] = w ;
		if(child == par || mark[child])
			continue ;
		val[child] = w , val3[child] = val3[node] + w ;
		if(in[node] == 1) //centroid
			sub[child] = child ;
		else
			sub[child] = sub[node] ;
		dfs(child , node) ;
		sum[node] += sum[child] ;
		Max[node] = max(Max[node] , Max[child] + val[node]) ;
	}
	out[node] = tim ;
}
 
void Erase(int node)
{
	while((!erased[node]) && node)
	{
		erased[node] = 1 ;
		update(1 , 1 , cursz , in[node] , out[node] , -1 * val[node]) ;
		node = P[node] ;
	}
}
 
void solve(int src , long long cost)
{
	tim = 0 ;
	cursrc = src , curcost = cost ;
	dfs_pre(src , 0) ;
	cursz = sz[src] ;
	int centroid = FindCentroid(src , -1) ;
	val[centroid] = val3[centroid] = 0 ;
	dfs(centroid , 0) ;
	build(1 , 1 , cursz) ;
	ans[1] = min(ans[1] , curcost) ;
	long long Max1 = 0 , Max2 = 0 ;
	for(auto &childd : adj[centroid])
	{
		int child = childd.first , w = childd.second ;
		if(mark[child])
			continue ;
		if(Max[child] > Max1)
			Max2 = Max1 , Max1 = Max[child] ;
		else if(Max[child] > Max2)
			Max2 = Max[child] ;
	}
	bool flag = true ;
	int prv ;
	for(int i = 1 ; i <= cursz ; ++i)
	{
		pair<long long , int>p = query(1 , 1 , cursz , 1 , cursz) ;
		if((!p.first))
		{
			ans[i] = min({ans[i] , curcost , ans[i-1]}) ;
			break ;
		}
		int node = p.second ;
		if(i > 1)
			flag &= (sub[node] == sub[prv]) ;
		curcost -= p.first , Erase(node) ;
		if(!flag)
			ans[i] = min(ans[i] , curcost) ;
		else if(i > 1)
			ans[i] = min(ans[i] , curcost + p.first - Max2) ;
		prv = node ;
	}
	mark[centroid] = 1 ;
	for(auto &childd : adj[centroid])
	{
		int child = childd.first , w = childd.second ;
		if(mark[child])
			continue ;
		solve(child , cost + sum[centroid] - sum[child] + edgcost[child]) ;
	}
}
 
int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 0 ; i < n-1 ; ++i)
	{
		int x , y , c , d ;
		cin>>x>>y>>c>>d ;
		adj[x].emplace_back(y , c) ;
		adj[y].emplace_back(x , d) ;
	}
	for(int i = 0 ; i <= n ; ++i)
		ans[i] = 1e18 ;
	solve(1 , 0) ;
	for(int i = 1 ; i <= n ; ++i)
		ans[i] = min(ans[i] , ans[i-1]) ;
	cin>>q ;
	while(q--)
	{
		int x ;
		cin>>x ;
		cout<<ans[x]<<"\n" ;
	} 
	return 0 ;
}

Compilation message

designated_cities.cpp: In function 'void solve(int, long long int)':
designated_cities.cpp:165:30: warning: unused variable 'w' [-Wunused-variable]
  165 |   int child = childd.first , w = childd.second ;
      |                              ^
designated_cities.cpp:196:30: warning: unused variable 'w' [-Wunused-variable]
  196 |   int child = childd.first , w = childd.second ;
      |                              ^

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 963 ms 38640 KB Output is correct
3 Correct 1184 ms 47176 KB Output is correct
4 Correct 995 ms 38732 KB Output is correct
5 Correct 338 ms 38652 KB Output is correct
6 Correct 1210 ms 39848 KB Output is correct
7 Correct 265 ms 38756 KB Output is correct
8 Correct 1345 ms 46740 KB Output is correct
9 Correct 207 ms 39244 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5008 KB Output is correct
2 Correct 1143 ms 38612 KB Output is correct
3 Correct 1186 ms 47084 KB Output is correct
4 Correct 948 ms 38664 KB Output is correct
5 Correct 371 ms 38648 KB Output is correct
6 Correct 1285 ms 40244 KB Output is correct
7 Correct 251 ms 39120 KB Output is correct
8 Correct 1433 ms 44404 KB Output is correct
9 Correct 210 ms 39224 KB Output is correct

Subtask #4
17.0 / 17.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 963 ms 38640 KB Output is correct
3 Correct 1184 ms 47176 KB Output is correct
4 Correct 995 ms 38732 KB Output is correct
5 Correct 338 ms 38652 KB Output is correct
6 Correct 1210 ms 39848 KB Output is correct
7 Correct 265 ms 38756 KB Output is correct
8 Correct 1345 ms 46740 KB Output is correct
9 Correct 207 ms 39244 KB Output is correct
10 Correct 2 ms 5008 KB Output is correct
11 Correct 1143 ms 38612 KB Output is correct
12 Correct 1186 ms 47084 KB Output is correct
13 Correct 948 ms 38664 KB Output is correct
14 Correct 371 ms 38648 KB Output is correct
15 Correct 1285 ms 40244 KB Output is correct
16 Correct 251 ms 39120 KB Output is correct
17 Correct 1433 ms 44404 KB Output is correct
18 Correct 210 ms 39224 KB Output is correct
19 Correct 2 ms 5076 KB Output is correct
20 Correct 999 ms 38612 KB Output is correct
21 Correct 1187 ms 47052 KB Output is correct
22 Correct 1008 ms 38640 KB Output is correct
23 Correct 1008 ms 38780 KB Output is correct
24 Correct 1041 ms 38732 KB Output is correct
25 Correct 986 ms 38760 KB Output is correct
26 Correct 1004 ms 38900 KB Output is correct
27 Correct 320 ms 38696 KB Output is correct
28 Correct 1248 ms 39892 KB Output is correct
29 Correct 967 ms 38804 KB Output is correct
30 Correct 889 ms 38832 KB Output is correct
31 Correct 253 ms 38868 KB Output is correct
32 Correct 1412 ms 44664 KB Output is correct
33 Correct 217 ms 39268 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 2 ms 5076 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 2 ms 5076 KB Output is correct
7 Correct 2 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 2 ms 5076 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 2 ms 5076 KB Output is correct
13 Correct 963 ms 38640 KB Output is correct
14 Correct 1184 ms 47176 KB Output is correct
15 Correct 995 ms 38732 KB Output is correct
16 Correct 338 ms 38652 KB Output is correct
17 Correct 1210 ms 39848 KB Output is correct
18 Correct 265 ms 38756 KB Output is correct
19 Correct 1345 ms 46740 KB Output is correct
20 Correct 207 ms 39244 KB Output is correct
21 Correct 2 ms 5008 KB Output is correct
22 Correct 1143 ms 38612 KB Output is correct
23 Correct 1186 ms 47084 KB Output is correct
24 Correct 948 ms 38664 KB Output is correct
25 Correct 371 ms 38648 KB Output is correct
26 Correct 1285 ms 40244 KB Output is correct
27 Correct 251 ms 39120 KB Output is correct
28 Correct 1433 ms 44404 KB Output is correct
29 Correct 210 ms 39224 KB Output is correct
30 Correct 2 ms 5076 KB Output is correct
31 Correct 6 ms 5332 KB Output is correct
32 Correct 5 ms 5460 KB Output is correct
33 Correct 6 ms 5460 KB Output is correct
34 Correct 6 ms 5332 KB Output is correct
35 Correct 7 ms 5460 KB Output is correct
36 Correct 5 ms 5332 KB Output is correct
37 Correct 5 ms 5332 KB Output is correct
38 Correct 4 ms 5460 KB Output is correct
39 Correct 6 ms 5460 KB Output is correct
40 Correct 6 ms 5332 KB Output is correct
41 Correct 6 ms 5332 KB Output is correct
42 Correct 3 ms 5472 KB Output is correct
43 Correct 6 ms 5512 KB Output is correct
44 Correct 3 ms 5460 KB Output is correct
45 Correct 2 ms 5076 KB Output is correct
46 Correct 999 ms 38612 KB Output is correct
47 Correct 1187 ms 47052 KB Output is correct
48 Correct 1008 ms 38640 KB Output is correct
49 Correct 1008 ms 38780 KB Output is correct
50 Correct 1041 ms 38732 KB Output is correct
51 Correct 986 ms 38760 KB Output is correct
52 Correct 1004 ms 38900 KB Output is correct
53 Correct 320 ms 38696 KB Output is correct
54 Correct 1248 ms 39892 KB Output is correct
55 Correct 967 ms 38804 KB Output is correct
56 Correct 889 ms 38832 KB Output is correct
57 Correct 253 ms 38868 KB Output is correct
58 Correct 1412 ms 44664 KB Output is correct
59 Correct 217 ms 39268 KB Output is correct
60 Correct 3 ms 5076 KB Output is correct
61 Correct 1030 ms 40148 KB Output is correct
62 Correct 1236 ms 47572 KB Output is correct
63 Correct 991 ms 40152 KB Output is correct
64 Correct 1022 ms 40192 KB Output is correct
65 Correct 977 ms 39932 KB Output is correct
66 Correct 1016 ms 40048 KB Output is correct
67 Correct 1010 ms 39896 KB Output is correct
68 Correct 391 ms 40200 KB Output is correct
69 Correct 1240 ms 41384 KB Output is correct
70 Correct 991 ms 39976 KB Output is correct
71 Correct 831 ms 40324 KB Output is correct
72 Correct 315 ms 40992 KB Output is correct
73 Correct 1387 ms 45576 KB Output is correct
74 Correct 257 ms 42148 KB Output is correct