oj.uz

Submission #841007

# Submission time Handle Problem Language Result Execution time Memory
841007 2023-09-01T04:34:10 Z daoquanglinh2007 Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 437072 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")

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

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

const int NM = 1e5;

int n, q;
ll w, last = 0;
int a[NM+1], b[NM+1];
ll c[NM+1];
vector <pil> adj[NM+1];
int sz[NM+1], parent_cen[NM+1];
bool del[NM+1];
int timer;
unordered_map <int, int> tin[NM+1], tout[NM+1], f[NM+1];
unordered_map <int, ll> d[NM+1];
vector <int> tour[NM+1];
vector <ll> st[NM+1], lazy[NM+1];
multiset <ll, greater <ll> > S[NM+1];
multiset <ll, greater <ll> > diam;
unordered_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;
		ll 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] = 0LL;
	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] = 0LL;
}

void update(int rt, int id, int l, int r, int u, int v, ll 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]);
}

ll 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));
}

ll get_diam(int rt){
	if (S[rt].empty()) return 0LL;
	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] = 0LL;
	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, ll 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);
}

int 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;
		ll e;
		cin >> d >> e;
		d = ((ll)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(int, int)':
diameter.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'int dfs_fc(int, int, int)':
diameter.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void dfs(int, int, int)':
diameter.cpp:53:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void centroid_dec(int, int)':
diameter.cpp:120:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |  for (int i = 2; i < tour[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~~
diameter.cpp:128:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
diameter.cpp:135:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |  for (int i = 0; i < adj[u].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 36308 KB Output is correct
2 Correct 20 ms 36264 KB Output is correct
3 Correct 21 ms 36328 KB Output is correct
4 Correct 19 ms 36308 KB Output is correct
5 Correct 19 ms 36308 KB Output is correct
6 Correct 19 ms 36332 KB Output is correct
7 Correct 20 ms 36340 KB Output is correct
8 Correct 20 ms 36308 KB Output is correct
9 Correct 21 ms 36308 KB Output is correct
10 Correct 20 ms 36308 KB Output is correct
11 Correct 20 ms 36308 KB Output is correct
12 Correct 20 ms 36308 KB Output is correct
13 Correct 20 ms 36436 KB Output is correct
14 Correct 22 ms 36476 KB Output is correct
15 Correct 20 ms 36436 KB Output is correct
16 Correct 20 ms 36436 KB Output is correct
17 Correct 20 ms 36436 KB Output is correct
18 Correct 20 ms 36436 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 36308 KB Output is correct
2 Correct 20 ms 36264 KB Output is correct
3 Correct 21 ms 36328 KB Output is correct
4 Correct 19 ms 36308 KB Output is correct
5 Correct 19 ms 36308 KB Output is correct
6 Correct 19 ms 36332 KB Output is correct
7 Correct 20 ms 36340 KB Output is correct
8 Correct 20 ms 36308 KB Output is correct
9 Correct 21 ms 36308 KB Output is correct
10 Correct 20 ms 36308 KB Output is correct
11 Correct 20 ms 36308 KB Output is correct
12 Correct 20 ms 36308 KB Output is correct
13 Correct 20 ms 36436 KB Output is correct
14 Correct 22 ms 36476 KB Output is correct
15 Correct 20 ms 36436 KB Output is correct
16 Correct 20 ms 36436 KB Output is correct
17 Correct 20 ms 36436 KB Output is correct
18 Correct 20 ms 36436 KB Output is correct
19 Correct 42 ms 38224 KB Output is correct
20 Correct 47 ms 38484 KB Output is correct
21 Correct 50 ms 38632 KB Output is correct
22 Correct 54 ms 39024 KB Output is correct
23 Correct 83 ms 46816 KB Output is correct
24 Correct 101 ms 49356 KB Output is correct
25 Correct 107 ms 51020 KB Output is correct
26 Correct 122 ms 52744 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 36308 KB Output is correct
2 Correct 21 ms 36256 KB Output is correct
3 Correct 21 ms 36308 KB Output is correct
4 Correct 32 ms 36540 KB Output is correct
5 Correct 80 ms 36916 KB Output is correct
6 Correct 19 ms 36308 KB Output is correct
7 Correct 20 ms 36816 KB Output is correct
8 Correct 20 ms 36820 KB Output is correct
9 Correct 21 ms 36820 KB Output is correct
10 Correct 37 ms 37048 KB Output is correct
11 Correct 103 ms 37360 KB Output is correct
12 Correct 31 ms 41044 KB Output is correct
13 Correct 29 ms 41168 KB Output is correct
14 Correct 32 ms 41044 KB Output is correct
15 Correct 56 ms 41172 KB Output is correct
16 Correct 148 ms 41664 KB Output is correct
17 Correct 264 ms 132484 KB Output is correct
18 Correct 261 ms 132320 KB Output is correct
19 Correct 263 ms 132408 KB Output is correct
20 Correct 322 ms 132612 KB Output is correct
21 Correct 547 ms 132944 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 38612 KB Output is correct
2 Correct 57 ms 38820 KB Output is correct
3 Correct 189 ms 39080 KB Output is correct
4 Correct 351 ms 39360 KB Output is correct
5 Correct 106 ms 67536 KB Output is correct
6 Correct 183 ms 67684 KB Output is correct
7 Correct 505 ms 67896 KB Output is correct
8 Correct 916 ms 68208 KB Output is correct
9 Correct 575 ms 220168 KB Output is correct
10 Correct 684 ms 220152 KB Output is correct
11 Correct 1331 ms 220600 KB Output is correct
12 Correct 2076 ms 220680 KB Output is correct
13 Correct 1132 ms 426948 KB Output is correct
14 Correct 1305 ms 427040 KB Output is correct
15 Correct 2152 ms 427172 KB Output is correct
16 Correct 3134 ms 427484 KB Output is correct
17 Execution timed out 5052 ms 427808 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4453 ms 343792 KB Output is correct
2 Correct 4589 ms 355868 KB Output is correct
3 Correct 4583 ms 353612 KB Output is correct
4 Correct 4660 ms 359404 KB Output is correct
5 Correct 4842 ms 338496 KB Output is correct
6 Correct 4051 ms 252748 KB Output is correct
7 Execution timed out 5082 ms 437072 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 36308 KB Output is correct
2 Correct 20 ms 36264 KB Output is correct
3 Correct 21 ms 36328 KB Output is correct
4 Correct 19 ms 36308 KB Output is correct
5 Correct 19 ms 36308 KB Output is correct
6 Correct 19 ms 36332 KB Output is correct
7 Correct 20 ms 36340 KB Output is correct
8 Correct 20 ms 36308 KB Output is correct
9 Correct 21 ms 36308 KB Output is correct
10 Correct 20 ms 36308 KB Output is correct
11 Correct 20 ms 36308 KB Output is correct
12 Correct 20 ms 36308 KB Output is correct
13 Correct 20 ms 36436 KB Output is correct
14 Correct 22 ms 36476 KB Output is correct
15 Correct 20 ms 36436 KB Output is correct
16 Correct 20 ms 36436 KB Output is correct
17 Correct 20 ms 36436 KB Output is correct
18 Correct 20 ms 36436 KB Output is correct
19 Correct 42 ms 38224 KB Output is correct
20 Correct 47 ms 38484 KB Output is correct
21 Correct 50 ms 38632 KB Output is correct
22 Correct 54 ms 39024 KB Output is correct
23 Correct 83 ms 46816 KB Output is correct
24 Correct 101 ms 49356 KB Output is correct
25 Correct 107 ms 51020 KB Output is correct
26 Correct 122 ms 52744 KB Output is correct
27 Correct 19 ms 36308 KB Output is correct
28 Correct 21 ms 36256 KB Output is correct
29 Correct 21 ms 36308 KB Output is correct
30 Correct 32 ms 36540 KB Output is correct
31 Correct 80 ms 36916 KB Output is correct
32 Correct 19 ms 36308 KB Output is correct
33 Correct 20 ms 36816 KB Output is correct
34 Correct 20 ms 36820 KB Output is correct
35 Correct 21 ms 36820 KB Output is correct
36 Correct 37 ms 37048 KB Output is correct
37 Correct 103 ms 37360 KB Output is correct
38 Correct 31 ms 41044 KB Output is correct
39 Correct 29 ms 41168 KB Output is correct
40 Correct 32 ms 41044 KB Output is correct
41 Correct 56 ms 41172 KB Output is correct
42 Correct 148 ms 41664 KB Output is correct
43 Correct 264 ms 132484 KB Output is correct
44 Correct 261 ms 132320 KB Output is correct
45 Correct 263 ms 132408 KB Output is correct
46 Correct 322 ms 132612 KB Output is correct
47 Correct 547 ms 132944 KB Output is correct
48 Correct 28 ms 38612 KB Output is correct
49 Correct 57 ms 38820 KB Output is correct
50 Correct 189 ms 39080 KB Output is correct
51 Correct 351 ms 39360 KB Output is correct
52 Correct 106 ms 67536 KB Output is correct
53 Correct 183 ms 67684 KB Output is correct
54 Correct 505 ms 67896 KB Output is correct
55 Correct 916 ms 68208 KB Output is correct
56 Correct 575 ms 220168 KB Output is correct
57 Correct 684 ms 220152 KB Output is correct
58 Correct 1331 ms 220600 KB Output is correct
59 Correct 2076 ms 220680 KB Output is correct
60 Correct 1132 ms 426948 KB Output is correct
61 Correct 1305 ms 427040 KB Output is correct
62 Correct 2152 ms 427172 KB Output is correct
63 Correct 3134 ms 427484 KB Output is correct
64 Execution timed out 5052 ms 427808 KB Time limit exceeded
65 Halted 0 ms 0 KB -