oj.uz

Submission #484215

# Submission time Handle Problem Language Result Execution time Memory
484215 2021-11-02T14:06:46 Z S2speed Construction of Highway (JOI18_construction) C++17
100 / 100
 466 ms 26596 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#pragma GCC optimize ("Ofast")
 
#define all(x) x.begin() , x.end()
#define sze(x) (ll)(x.size())
#define mp(x , y) make_pair(x , y)
#define wall cerr<<"--------------------------------------"<<endl
typedef long long int ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double db;
typedef pair<pll , ll> plll;
typedef pair<int , pii> piii;
typedef pair<pll , pll> pllll;
 
const ll maxn = 1e5 + 16 , md = 1e9 + 7 , inf = 2e16;
 
ll gcd(ll a , ll b){
	if(a < b) swap(a , b);
	if(b == 0) return a;
	return gcd(b , a % b);
}
 
ll tav(ll n , ll k){
	ll res = 1;
	while(k > 0){
		if(k & 1){
			res *= n; res %= md;
		}
		n *= n; n %= md;
		k >>= 1;
	}
	return res;
}
 
struct fentree {
 
	ll sz;
	vector<ll> val;
 
	void init(ll n){
		sz = n;
		val.assign(sz , 0);
		return;
	}
 
	void add(ll i , ll k){
		ll h = i;
		while(h < sz){
			val[h] += k;
			h |= (h + 1);
		}
		return;
	}
 
	ll cal(ll i){
		ll res = 0 , h = i;
		while(h > -1){
			res += val[h];
			h &= (h + 1); h--;
		}
		return res;
	}
 
	void clear(){
		val.clear();
		return;
	}
 
};
 
vector<pll> res , q;
 
struct segtree {
 
	ll sz = 1;
	vector<ll> val , laz;
	vector<bool> all;
 
	void init(ll n){
		while(sz < n) sz <<= 1;
		val.assign(sz << 1 , -1);
		all.assign(sz << 1 , true);
		laz.assign(sz << 1 , -1);
		return;
	}

	void shift(ll x , ll lx , ll rx){
		ll h = laz[x];
		laz[x] = -1;
		if(h == -1) return;
		val[x] = h; all[x] = true;
		if(rx - lx == 1) return;
		ll ln = (x << 1) + 1 , rn = ln + 1;
		laz[ln] = laz[rn] = h;
		return;
	}
 
	void set(ll l , ll r , ll k , ll x , ll lx , ll rx){
		shift(x , lx , rx);
		if(rx <= l || lx >= r) return;
		if(rx <= r && lx >= l && all[x]){
			res.push_back({val[x] , rx - lx});
			laz[x] = k;
			shift(x , lx , rx);
			return;
		}
		ll m = (rx + lx) >> 1 , ln = (x << 1) + 1 , rn = ln + 1;
		set(l , r , k , rn , m , rx); set(l , r , k , ln , lx , m);
		if(val[ln] == val[rn] && all[ln] && all[rn]){
			val[x] = val[ln]; all[x] = true;
		} else {
			all[x] = false;
		}
		return;
	}
 
	void set(ll l , ll r , ll k){
		set(l , r , k , 0 , 0 , sz);
		return;
	}
 
};
 
fentree ft;
segtree st;
vector<ll> adj[maxn] , v;
ll a[maxn] , pr[maxn] , z[maxn] , hc[maxn] , hp[maxn] , lb[maxn] , cur = 0;
 
void aDFS(ll r , ll par){
	pr[r] = par;
	z[r] = 1;
	ll m = -1 , ind = -1;
	for(auto i : adj[r]){
		if(i == par) continue;
		aDFS(i , r);
		if(z[i] > m){
			m = z[i];
			ind = i;
		}
		z[r] += z[i];
	}
	hc[r] = ind;
	return;
}
 
void lDFS(ll r , ll par){
	lb[r] = cur++;
	if(hc[r] == -1) return;
	hp[hc[r]] = hp[r];
	lDFS(hc[r] , r);
	for(auto i : adj[r]){
		if(i == par || i == hc[r]) continue;
		hp[i] = i;
		lDFS(i , r);
	}
	return;
}
 
ll ans;
 
void upd(ll v){
	res.clear(); q.clear(); ans = 0;
	ll h = v;
	while(h > -1){
		st.set(lb[hp[h]] , lb[h] + 1 , a[v]);
		h = pr[hp[h]];
	}
	ll rs = sze(res);
	q.push_back(res[1]);
	for(ll e = 2 ; e < rs ; e++){
		if(res[e].first == res[e - 1].first){
			q.back().second += res[e].second;
		} else {
			q.push_back(res[e]);
		}
	}
	for(auto p : q){
		ans += 1ll * p.second * ft.cal(p.first - 1);
		ft.add(p.first , p.second);
	}
	for(auto p : q){
		ft.add(p.first , -p.second);
	}
	return;
}
 
/*
8
5 1 2 2 3 2 1 100
1 2
2 3
3 4
4 7
3 6
1 5
7 8
*/
 
vector<pll> ed;
 
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
	ll n;
	cin>>n;
	for(ll i = 0 ; i < n ; i++){
		cin>>a[i];
		v.push_back(a[i]);
	}
	sort(all(v));
	v.resize(distance(v.begin() , unique(all(v))));
	ft.init(sze(v));
	for(ll i = 0 ; i < n ; i++){
		a[i] = lower_bound(all(v) , a[i]) - v.begin();
	}
	st.init(n);
	st.set(0 , 1 , a[0]);
	for(ll i = 1 ; i < n ; i++){
		ll v , u;
		cin>>v>>u; v--; u--;
		adj[v].push_back(u); adj[u].push_back(v);
		ed.push_back({v , u});
	}
	aDFS(0 , -1);
	hp[0] = 0;
	lDFS(0 , -1);
	for(auto p : ed){
		ll v = p.first , u = p.second , i;
		if(pr[v] == u){
			i = v;
		} else {
			i = u;
		}
		upd(i);
		cout<<ans<<'\n';
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2672 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 2 ms 2676 KB Output is correct
24 Correct 2 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 2 ms 2800 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2804 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 2 ms 2764 KB Output is correct
35 Correct 2 ms 2764 KB Output is correct
36 Correct 2 ms 2764 KB Output is correct
37 Correct 2 ms 2764 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 2 ms 2764 KB Output is correct
41 Correct 2 ms 2764 KB Output is correct
42 Correct 2 ms 2764 KB Output is correct
43 Correct 2 ms 2764 KB Output is correct
44 Correct 2 ms 2764 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2672 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 2 ms 2676 KB Output is correct
24 Correct 2 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 2 ms 2800 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2804 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 2 ms 2764 KB Output is correct
35 Correct 2 ms 2764 KB Output is correct
36 Correct 2 ms 2764 KB Output is correct
37 Correct 2 ms 2764 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 2 ms 2764 KB Output is correct
41 Correct 2 ms 2764 KB Output is correct
42 Correct 2 ms 2764 KB Output is correct
43 Correct 2 ms 2764 KB Output is correct
44 Correct 2 ms 2764 KB Output is correct
45 Correct 3 ms 2764 KB Output is correct
46 Correct 8 ms 3276 KB Output is correct
47 Correct 8 ms 3276 KB Output is correct
48 Correct 8 ms 3320 KB Output is correct
49 Correct 5 ms 3532 KB Output is correct
50 Correct 5 ms 3532 KB Output is correct
51 Correct 5 ms 3572 KB Output is correct
52 Correct 5 ms 3532 KB Output is correct
53 Correct 5 ms 3532 KB Output is correct
54 Correct 5 ms 3532 KB Output is correct
55 Correct 5 ms 3532 KB Output is correct
56 Correct 5 ms 3404 KB Output is correct
57 Correct 10 ms 3352 KB Output is correct
58 Correct 10 ms 3380 KB Output is correct
59 Correct 10 ms 3276 KB Output is correct
60 Correct 11 ms 3388 KB Output is correct
61 Correct 7 ms 3508 KB Output is correct
62 Correct 6 ms 3404 KB Output is correct
63 Correct 6 ms 3408 KB Output is correct
64 Correct 7 ms 3276 KB Output is correct
65 Correct 7 ms 3312 KB Output is correct
66 Correct 7 ms 3276 KB Output is correct
67 Correct 8 ms 3276 KB Output is correct
68 Correct 5 ms 3448 KB Output is correct
69 Correct 5 ms 3532 KB Output is correct
70 Correct 5 ms 3532 KB Output is correct
71 Correct 5 ms 3448 KB Output is correct
72 Correct 10 ms 3316 KB Output is correct
73 Correct 10 ms 3276 KB Output is correct
74 Correct 6 ms 3404 KB Output is correct
75 Correct 5 ms 3404 KB Output is correct
76 Correct 6 ms 3404 KB Output is correct
77 Correct 6 ms 3324 KB Output is correct
78 Correct 6 ms 3276 KB Output is correct
79 Correct 6 ms 3276 KB Output is correct
80 Correct 6 ms 3276 KB Output is correct
81 Correct 9 ms 3404 KB Output is correct
82 Correct 7 ms 3316 KB Output is correct
83 Correct 7 ms 3276 KB Output is correct
84 Correct 6 ms 3276 KB Output is correct
85 Correct 6 ms 3312 KB Output is correct
86 Correct 7 ms 3276 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2672 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 2 ms 2676 KB Output is correct
24 Correct 2 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 2 ms 2800 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 2 ms 2804 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 2 ms 2764 KB Output is correct
35 Correct 2 ms 2764 KB Output is correct
36 Correct 2 ms 2764 KB Output is correct
37 Correct 2 ms 2764 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 2 ms 2764 KB Output is correct
41 Correct 2 ms 2764 KB Output is correct
42 Correct 2 ms 2764 KB Output is correct
43 Correct 2 ms 2764 KB Output is correct
44 Correct 2 ms 2764 KB Output is correct
45 Correct 3 ms 2764 KB Output is correct
46 Correct 8 ms 3276 KB Output is correct
47 Correct 8 ms 3276 KB Output is correct
48 Correct 8 ms 3320 KB Output is correct
49 Correct 5 ms 3532 KB Output is correct
50 Correct 5 ms 3532 KB Output is correct
51 Correct 5 ms 3572 KB Output is correct
52 Correct 5 ms 3532 KB Output is correct
53 Correct 5 ms 3532 KB Output is correct
54 Correct 5 ms 3532 KB Output is correct
55 Correct 5 ms 3532 KB Output is correct
56 Correct 5 ms 3404 KB Output is correct
57 Correct 10 ms 3352 KB Output is correct
58 Correct 10 ms 3380 KB Output is correct
59 Correct 10 ms 3276 KB Output is correct
60 Correct 11 ms 3388 KB Output is correct
61 Correct 7 ms 3508 KB Output is correct
62 Correct 6 ms 3404 KB Output is correct
63 Correct 6 ms 3408 KB Output is correct
64 Correct 7 ms 3276 KB Output is correct
65 Correct 7 ms 3312 KB Output is correct
66 Correct 7 ms 3276 KB Output is correct
67 Correct 8 ms 3276 KB Output is correct
68 Correct 5 ms 3448 KB Output is correct
69 Correct 5 ms 3532 KB Output is correct
70 Correct 5 ms 3532 KB Output is correct
71 Correct 5 ms 3448 KB Output is correct
72 Correct 10 ms 3316 KB Output is correct
73 Correct 10 ms 3276 KB Output is correct
74 Correct 6 ms 3404 KB Output is correct
75 Correct 5 ms 3404 KB Output is correct
76 Correct 6 ms 3404 KB Output is correct
77 Correct 6 ms 3324 KB Output is correct
78 Correct 6 ms 3276 KB Output is correct
79 Correct 6 ms 3276 KB Output is correct
80 Correct 6 ms 3276 KB Output is correct
81 Correct 9 ms 3404 KB Output is correct
82 Correct 7 ms 3316 KB Output is correct
83 Correct 7 ms 3276 KB Output is correct
84 Correct 6 ms 3276 KB Output is correct
85 Correct 6 ms 3312 KB Output is correct
86 Correct 7 ms 3276 KB Output is correct
87 Correct 21 ms 4592 KB Output is correct
88 Correct 71 ms 7784 KB Output is correct
89 Correct 297 ms 20856 KB Output is correct
90 Correct 287 ms 20744 KB Output is correct
91 Correct 292 ms 20720 KB Output is correct
92 Correct 125 ms 26296 KB Output is correct
93 Correct 114 ms 26264 KB Output is correct
94 Correct 114 ms 26244 KB Output is correct
95 Correct 127 ms 26168 KB Output is correct
96 Correct 133 ms 26516 KB Output is correct
97 Correct 150 ms 26596 KB Output is correct
98 Correct 131 ms 26504 KB Output is correct
99 Correct 129 ms 24060 KB Output is correct
100 Correct 399 ms 20408 KB Output is correct
101 Correct 438 ms 20668 KB Output is correct
102 Correct 466 ms 20872 KB Output is correct
103 Correct 450 ms 20608 KB Output is correct
104 Correct 188 ms 24104 KB Output is correct
105 Correct 172 ms 24080 KB Output is correct
106 Correct 171 ms 24124 KB Output is correct
107 Correct 245 ms 19336 KB Output is correct
108 Correct 270 ms 19208 KB Output is correct
109 Correct 287 ms 19772 KB Output is correct
110 Correct 102 ms 24844 KB Output is correct
111 Correct 128 ms 26152 KB Output is correct
112 Correct 114 ms 25092 KB Output is correct
113 Correct 111 ms 22624 KB Output is correct
114 Correct 403 ms 20324 KB Output is correct
115 Correct 448 ms 19428 KB Output is correct
116 Correct 153 ms 22644 KB Output is correct
117 Correct 147 ms 22144 KB Output is correct
118 Correct 154 ms 21640 KB Output is correct
119 Correct 174 ms 21476 KB Output is correct
120 Correct 136 ms 21056 KB Output is correct
121 Correct 138 ms 20544 KB Output is correct
122 Correct 144 ms 20272 KB Output is correct
123 Correct 210 ms 22568 KB Output is correct
124 Correct 197 ms 21692 KB Output is correct
125 Correct 204 ms 21432 KB Output is correct
126 Correct 196 ms 21236 KB Output is correct
127 Correct 187 ms 20664 KB Output is correct
128 Correct 188 ms 20408 KB Output is correct