oj.uz

Submission #840998

# Submission time Handle Problem Language Result Execution time Memory
840998 2023-09-01T03:54:15 Z daoquanglinh2007 Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 525584 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair

const int NM = 1e5;

int n, q, w, last = 0;
int a[NM+5], b[NM+5], c[NM+5];
vector <pii> adj[NM+5];
int sz[NM+5], parent_cen[NM+5];
bool del[NM+5];
int timer;
map <int, int> tin[NM+5], tout[NM+5], d[NM+5], f[NM+5];
vector <int> tour[NM+5], st[NM+5], lazy[NM+5];
multiset <int, greater <int> > S[NM+5];
multiset <int, greater <int> > diam;
map <int, bool> modified;

void dfs_sz(int u, int par){
	sz[u] = 1;
	for (int i = 0; i < adj[u].size(); i++){
		int v = adj[u][i].fi;
		if (v == par || del[v]) continue;
		dfs_sz(v, u);
		sz[u] += sz[v];
	}
}

int dfs_fc(int rt, int u, int par){
	for (int i = 0; i < adj[u].size(); i++){
		int v = adj[u][i].fi;
		if (v == par || del[v]) continue;
		if (sz[v] > sz[rt]/2) return dfs_fc(rt, v, u);
	}
	return u;
}

void dfs(int rt, int u, int par){
	tin[rt][u] = ++timer;
	tour[rt].push_back(u);
	for (int i = 0; i < adj[u].size(); i++){
		int v = adj[u][i].fi, c = adj[u][i].se;
		if (v == par || del[v]) continue;
		d[rt][v] = d[rt][u]+c;
		dfs(rt, v, u);
	}
	tout[rt][u] = timer;
}

void build(int rt, int id, int l, int r){
	lazy[rt][id] = 0;
	if (l == r){
		st[rt][id] = d[rt][tour[rt][l]];
		return;
	}
	int mid = (l+r)/2;
	build(rt, 2*id, l, mid);
	build(rt, 2*id+1, mid+1, r);
	st[rt][id] = max(st[rt][2*id], st[rt][2*id+1]);
}

void down(int rt, int id){
	st[rt][2*id] += lazy[rt][id], st[rt][2*id+1] += lazy[rt][id];
	lazy[rt][2*id] += lazy[rt][id], lazy[rt][2*id+1] += lazy[rt][id];
	lazy[rt][id] = 0;
}

void update(int rt, int id, int l, int r, int u, int v, int val){
	if (v < l || u > r) return;
	if (l >= u && r <= v){
		st[rt][id] += val;
		lazy[rt][id] += val;
		return;
	}
	down(rt, id);
	int mid = (l+r)/2;
	update(rt, 2*id, l, mid, u, v, val);
	update(rt, 2*id+1, mid+1, r, u, v, val);
	st[rt][id] = max(st[rt][2*id], st[rt][2*id+1]);
}

int get(int rt, int id, int l, int r, int u, int v){
	if (v < l || u > r) return 0LL;
	if (l >= u && r <= v) return st[rt][id];
	down(rt, id);
	int mid = (l+r)/2;
	return max(get(rt, 2*id, l, mid, u, v), get(rt, 2*id+1, mid+1, r, u, v));
}

int get_diam(int rt){
	if (S[rt].empty()) return 0;
	if (S[rt].size() == 1) return *S[rt].begin();
	return *S[rt].begin() + *(++S[rt].begin());
}

void centroid_dec(int u, int par){
	dfs_sz(u, -1);
	u = dfs_fc(u, u, -1);
	parent_cen[u] = par;
	del[u] = 1;
	
	d[u][u] = 0;
	timer = 0;
	tour[u].push_back(0);
	dfs(u, u, -1);
	int cur = tour[u][2];
	for (int i = 2; i < tour[u].size(); i++){
		if (i > tout[u][cur]) cur = tour[u][i];
		f[u][tour[u][i]] = cur;
	}
	
	st[u].resize(4*(tour[u].size()-1));
	lazy[u].resize(4*(tour[u].size()-1));
	build(u, 1, 1, tour[u].size()-1);
	for (int i = 0; i < adj[u].size(); i++){
		int v = adj[u][i].fi;
		if (del[v]) continue;
		S[u].insert(get(u, 1, 1, tour[u].size()-1, tin[u][v], tout[u][v]));
	}
	diam.insert(get_diam(u));
	
	for (int i = 0; i < adj[u].size(); i++){
		int v = adj[u][i].fi;
		if (del[v]) continue;
		centroid_dec(v, u);
	}
}

void modify(int rt, int u, int v, int x){
	if (rt == -1 || modified[rt]) return;
	if (tin[rt].count(u) && tin[rt].count(v)){
		modified[rt] = 1;
		if (tin[rt][u] > tin[rt][v]) swap(u, v);
		diam.erase(diam.find(get_diam(rt)));
		S[rt].erase(S[rt].find(get(rt, 1, 1, tour[rt].size()-1, tin[rt][f[rt][v]], tout[rt][f[rt][v]])));
		update(rt, 1, 1, tour[rt].size()-1, tin[rt][v], tout[rt][v], x);
		S[rt].insert(get(rt, 1, 1, tour[rt].size()-1, tin[rt][f[rt][v]], tout[rt][f[rt][v]]));
		diam.insert(get_diam(rt));
	}
	modify(parent_cen[rt], u, v, x);
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> q >> w;
	for (int i = 1; i < n; i++){
		cin >> a[i] >> b[i] >> c[i];
		adj[a[i]].push_back(mp(b[i], c[i]));
		adj[b[i]].push_back(mp(a[i], c[i]));
	}
	centroid_dec(1, -1);
	while (q--){
		int d, e;
		cin >> d >> e;
		d = (d+last) % (n-1);
		e = (e+last) % w;
		modified.clear();
		modify(a[d+1], a[d+1], b[d+1], e-c[d+1]);
		modify(b[d+1], a[d+1], b[d+1], e-c[d+1]);
		c[d+1] = e;
		last = *diam.begin();
		cout << last << '\n';
	}
	return 0;
}

Compilation message

diameter.cpp: In function 'void dfs_sz(long long int, long long int)':
diameter.cpp:29:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'long long int dfs_fc(long long int, long long int, long long int)':
diameter.cpp:38:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void dfs(long long int, long long int, long long int)':
diameter.cpp:49:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void centroid_dec(long long int, long long int)':
diameter.cpp:115:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |  for (int i = 2; i < tour[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~~
diameter.cpp:123:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp:130:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 33108 KB Output is correct
2 Correct 16 ms 33108 KB Output is correct
3 Correct 16 ms 33108 KB Output is correct
4 Correct 16 ms 33232 KB Output is correct
5 Correct 15 ms 33108 KB Output is correct
6 Correct 16 ms 33108 KB Output is correct
7 Correct 20 ms 33236 KB Output is correct
8 Correct 17 ms 33236 KB Output is correct
9 Correct 16 ms 33236 KB Output is correct
10 Correct 16 ms 33236 KB Output is correct
11 Correct 15 ms 33236 KB Output is correct
12 Correct 16 ms 33236 KB Output is correct
13 Correct 17 ms 33364 KB Output is correct
14 Correct 17 ms 33364 KB Output is correct
15 Correct 15 ms 33364 KB Output is correct
16 Correct 16 ms 33364 KB Output is correct
17 Correct 17 ms 33364 KB Output is correct
18 Correct 16 ms 33364 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 33108 KB Output is correct
2 Correct 16 ms 33108 KB Output is correct
3 Correct 16 ms 33108 KB Output is correct
4 Correct 16 ms 33232 KB Output is correct
5 Correct 15 ms 33108 KB Output is correct
6 Correct 16 ms 33108 KB Output is correct
7 Correct 20 ms 33236 KB Output is correct
8 Correct 17 ms 33236 KB Output is correct
9 Correct 16 ms 33236 KB Output is correct
10 Correct 16 ms 33236 KB Output is correct
11 Correct 15 ms 33236 KB Output is correct
12 Correct 16 ms 33236 KB Output is correct
13 Correct 17 ms 33364 KB Output is correct
14 Correct 17 ms 33364 KB Output is correct
15 Correct 15 ms 33364 KB Output is correct
16 Correct 16 ms 33364 KB Output is correct
17 Correct 17 ms 33364 KB Output is correct
18 Correct 16 ms 33364 KB Output is correct
19 Correct 61 ms 35308 KB Output is correct
20 Correct 57 ms 35532 KB Output is correct
21 Correct 66 ms 35884 KB Output is correct
22 Correct 76 ms 36348 KB Output is correct
23 Correct 108 ms 45088 KB Output is correct
24 Correct 139 ms 48352 KB Output is correct
25 Correct 162 ms 50344 KB Output is correct
26 Correct 184 ms 52888 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33236 KB Output is correct
2 Correct 16 ms 33236 KB Output is correct
3 Correct 18 ms 33236 KB Output is correct
4 Correct 30 ms 33416 KB Output is correct
5 Correct 80 ms 33612 KB Output is correct
6 Correct 16 ms 33108 KB Output is correct
7 Correct 17 ms 33628 KB Output is correct
8 Correct 17 ms 33620 KB Output is correct
9 Correct 20 ms 33620 KB Output is correct
10 Correct 44 ms 33716 KB Output is correct
11 Correct 143 ms 34112 KB Output is correct
12 Correct 33 ms 37332 KB Output is correct
13 Correct 24 ms 37204 KB Output is correct
14 Correct 27 ms 37256 KB Output is correct
15 Correct 62 ms 37332 KB Output is correct
16 Correct 223 ms 37788 KB Output is correct
17 Correct 333 ms 114632 KB Output is correct
18 Correct 309 ms 114716 KB Output is correct
19 Correct 328 ms 114640 KB Output is correct
20 Correct 381 ms 114792 KB Output is correct
21 Correct 972 ms 115304 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 35992 KB Output is correct
2 Correct 101 ms 35964 KB Output is correct
3 Correct 297 ms 36284 KB Output is correct
4 Correct 514 ms 36428 KB Output is correct
5 Correct 115 ms 71588 KB Output is correct
6 Correct 234 ms 71648 KB Output is correct
7 Correct 751 ms 71884 KB Output is correct
8 Correct 1455 ms 72216 KB Output is correct
9 Correct 618 ms 263120 KB Output is correct
10 Correct 864 ms 263144 KB Output is correct
11 Correct 1922 ms 263412 KB Output is correct
12 Correct 3304 ms 263752 KB Output is correct
13 Correct 1348 ms 525056 KB Output is correct
14 Correct 1639 ms 525096 KB Output is correct
15 Correct 3070 ms 525456 KB Output is correct
16 Correct 4891 ms 525584 KB Output is correct
17 Execution timed out 5043 ms 525260 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5042 ms 402096 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 33108 KB Output is correct
2 Correct 16 ms 33108 KB Output is correct
3 Correct 16 ms 33108 KB Output is correct
4 Correct 16 ms 33232 KB Output is correct
5 Correct 15 ms 33108 KB Output is correct
6 Correct 16 ms 33108 KB Output is correct
7 Correct 20 ms 33236 KB Output is correct
8 Correct 17 ms 33236 KB Output is correct
9 Correct 16 ms 33236 KB Output is correct
10 Correct 16 ms 33236 KB Output is correct
11 Correct 15 ms 33236 KB Output is correct
12 Correct 16 ms 33236 KB Output is correct
13 Correct 17 ms 33364 KB Output is correct
14 Correct 17 ms 33364 KB Output is correct
15 Correct 15 ms 33364 KB Output is correct
16 Correct 16 ms 33364 KB Output is correct
17 Correct 17 ms 33364 KB Output is correct
18 Correct 16 ms 33364 KB Output is correct
19 Correct 61 ms 35308 KB Output is correct
20 Correct 57 ms 35532 KB Output is correct
21 Correct 66 ms 35884 KB Output is correct
22 Correct 76 ms 36348 KB Output is correct
23 Correct 108 ms 45088 KB Output is correct
24 Correct 139 ms 48352 KB Output is correct
25 Correct 162 ms 50344 KB Output is correct
26 Correct 184 ms 52888 KB Output is correct
27 Correct 19 ms 33236 KB Output is correct
28 Correct 16 ms 33236 KB Output is correct
29 Correct 18 ms 33236 KB Output is correct
30 Correct 30 ms 33416 KB Output is correct
31 Correct 80 ms 33612 KB Output is correct
32 Correct 16 ms 33108 KB Output is correct
33 Correct 17 ms 33628 KB Output is correct
34 Correct 17 ms 33620 KB Output is correct
35 Correct 20 ms 33620 KB Output is correct
36 Correct 44 ms 33716 KB Output is correct
37 Correct 143 ms 34112 KB Output is correct
38 Correct 33 ms 37332 KB Output is correct
39 Correct 24 ms 37204 KB Output is correct
40 Correct 27 ms 37256 KB Output is correct
41 Correct 62 ms 37332 KB Output is correct
42 Correct 223 ms 37788 KB Output is correct
43 Correct 333 ms 114632 KB Output is correct
44 Correct 309 ms 114716 KB Output is correct
45 Correct 328 ms 114640 KB Output is correct
46 Correct 381 ms 114792 KB Output is correct
47 Correct 972 ms 115304 KB Output is correct
48 Correct 36 ms 35992 KB Output is correct
49 Correct 101 ms 35964 KB Output is correct
50 Correct 297 ms 36284 KB Output is correct
51 Correct 514 ms 36428 KB Output is correct
52 Correct 115 ms 71588 KB Output is correct
53 Correct 234 ms 71648 KB Output is correct
54 Correct 751 ms 71884 KB Output is correct
55 Correct 1455 ms 72216 KB Output is correct
56 Correct 618 ms 263120 KB Output is correct
57 Correct 864 ms 263144 KB Output is correct
58 Correct 1922 ms 263412 KB Output is correct
59 Correct 3304 ms 263752 KB Output is correct
60 Correct 1348 ms 525056 KB Output is correct
61 Correct 1639 ms 525096 KB Output is correct
62 Correct 3070 ms 525456 KB Output is correct
63 Correct 4891 ms 525584 KB Output is correct
64 Execution timed out 5043 ms 525260 KB Time limit exceeded
65 Halted 0 ms 0 KB -