oj.uz

Submission #960458

# Submission time Handle Problem Language Result Execution time Memory
960458 2024-04-10T13:33:56 Z starchan Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 214400 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define int long long
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
struct seg_tree
{
	//range add range max.
	vector<int> tree, lazy;
	void init(int n)
	{
		tree.assign(4*n+6, 0);
		lazy.assign(4*n+6, 0);
		return;
	}
	void push(int id)
	{
		tree[2*id]+=lazy[id];
		tree[2*id+1]+=lazy[id];
		lazy[2*id]+=lazy[id];
		lazy[2*id+1]+=lazy[id];
		lazy[id] = 0;
		return;
	}
	void upd(int val, int ql, int qr, int id, int l, int r)
	{
		if(qr < l || r < ql)
			return;
		if(ql <= l && r <= qr)
		{
			tree[id]+=val;
			lazy[id]+=val;
			return;
		}
		push(id);
		int m = (l+r)/2;
		upd(val, ql, qr, 2*id, l, m);
		upd(val, ql, qr, 2*id+1, m+1, r);
		tree[id] = max(tree[2*id], tree[2*id+1]);
		return;
	}
	int query(int ql, int qr, int id, int l, int r)
	{
		if(qr < l || r < ql)
			return 0;
		if(ql <= l && r <= qr)
			return tree[id];
		int m = (l+r)/2;
		push(id);
		int s1 = query(ql, qr, 2*id, l, m);
		int s2 = query(ql, qr, 2*id+1, m+1, r);
		return max(s1, s2);
	}
};
const int MX = 1e5+5;
const int LOGM = 17;
 
vector<in> adj[MX];
vector<seg_tree> work;
int pa[LOGM][MX], tin[LOGM][MX], tout[LOGM][MX], just[LOGM][MX];
vector<pair<in, int>> edge;
vector<bool> cut(MX);
vector<int> sz(MX);
int centh[MX], ctin[MX], ctout[MX];
 
int ans[MX];//ans[i] stores max path through vertex i, where i has least centh[i]
set<in> ANS;//stores the above in a pair format (for efficient updates etc)
set<in> help[MX];//stores the neighbour set per centroid vertex with maximum weights enabled.
 
void dfs(int u, int p)
{
	sz[u] = 1;
	for(auto [v, w]: adj[u])
	{
		if(cut[v])
			continue;
		if(v==p)
			continue;
		dfs(v, u);
		sz[u]+=sz[v];
	}
	return;
}
 
int centroid(int u, int p, int SZ)
{
	for(auto [v, w]: adj[u])
	{
		if(cut[v])
			continue;
		if(v==p)
			continue;
		if(2*sz[v] > SZ)
			return centroid(v, u, SZ);
	}
	return u;
}
int centimer;
int centroid_decomposition(int u, int lvl)
{
	dfs(u, 0);
	int root = centroid(u, 0, sz[u]);
	work[root].init(sz[u]);
	cut[root] = 1; centh[root] = lvl; ctin[root] = ++centimer; sz[root] = sz[u];
	for(auto [v, w]: adj[root])
	{
		if(cut[v])
			continue;
		int X = centroid_decomposition(v, lvl+1);
		pa[0][X] = root;
	}
	ctout[root] = centimer;
	return root;
}
void cendfs(int u, int p, int root, int &timer)
{
	tin[centh[u]-centh[root]][u] = ++timer; 
	if((p != 0) && (p != root))
		just[centh[u]-centh[root]][u] = just[centh[p]-centh[root]][p];
	else
	{
		help[root].insert({0, u});
		just[centh[u]-centh[root]][u] = u;
	}
	for(auto [v, w]: adj[u])
	{
		if(v==p)
			continue;
		if((ctin[v] < ctin[root]) || (ctout[v] > ctout[root]))
			continue;
		cendfs(v, u, root, timer);
	}
	tout[centh[u]-centh[root]][u] = timer;
	return;
}
void update(int root, int u, int val)
{
	int D = centh[u]-centh[root];
	int J = just[D][u];
	int D_p = centh[J]-centh[root];
	int NUM = work[root].query(tin[D_p][J], tout[D_p][J], 1, 1, sz[root]);
	help[root].erase({NUM, J});
	work[root].upd(val, tin[D][u], tout[D][u], 1, 1, sz[root]);
	NUM = work[root].query(tin[D_p][J], tout[D_p][J], 1, 1, sz[root]);
	help[root].insert({NUM, J});
	return;
}
 
int upd(int i, int val)
{
	auto [u, v] = edge[i].f;
	int delta = val-edge[i].s;
	edge[i] = {{u, v}, val};
	int root = (centh[u] < centh[v])? u : v;
	while(root)
	{
		if(tin[centh[u]-centh[root]][u] < tin[centh[v]-centh[root]][v])
			swap(u, v);
		update(root, u, delta);
		ANS.erase({ans[root], root});
		ans[root] = 0; auto it = help[root].end(); it--;
		ans[root]+=((*it).f); it--; ans[root]+=((*it).f);
		ANS.insert({ans[root], root});
		root = pa[0][root];
	}
	auto itt = ANS.end(); itt--;
	return (*itt).f;
}
signed main()
{
	fast();
	int n, q, W;
	cin >> n >> q >> W;
	work.resize(n+1);
	int m = n-1;
	edge.resize(m);
	vector<int> www(m);
	for(int i = 0; i < m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		adj[u].pb({v, w}); adj[v].pb({u, w});
		edge[i] = {{u, v}, 0};
		www[i] = w;
	}
	int root = centroid_decomposition(1, 1);
	pa[0][0] = pa[0][root] = 0;
	for(int i = 1; i < LOGM; i++)
	{
		for(int u = 0; u <= n; u++)
			pa[i][u] = pa[0][pa[i-1][u]];
	}
	for(int i = 1; i <= n; i++)
	{
		ANS.insert({0, i});
		help[i].insert({0, 0});//ensuring there's always two elements: itself and fake zero.
	}
	for(int u = 1; u <= n; u++)
	{
		int timer = 0;
		cendfs(u, 0, u, timer);
	}
	for(int i = 0; i < m; i++)
		upd(i, www[i]);
	int lst = 0;
	while(q--)
	{
		int d, val;
		cin >> d >> val;
		d+=lst; d%=m; val+=lst; val%=W; lst = upd(d, val);
		cout << lst << "\n";
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35928 KB Output is correct
2 Correct 6 ms 35932 KB Output is correct
3 Correct 6 ms 35916 KB Output is correct
4 Correct 7 ms 35932 KB Output is correct
5 Correct 6 ms 35860 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 6 ms 39992 KB Output is correct
8 Correct 6 ms 42076 KB Output is correct
9 Correct 6 ms 42076 KB Output is correct
10 Correct 7 ms 42072 KB Output is correct
11 Correct 8 ms 42072 KB Output is correct
12 Correct 7 ms 42100 KB Output is correct
13 Correct 7 ms 42072 KB Output is correct
14 Correct 7 ms 42072 KB Output is correct
15 Correct 7 ms 42076 KB Output is correct
16 Correct 7 ms 42156 KB Output is correct
17 Correct 8 ms 44124 KB Output is correct
18 Correct 7 ms 44208 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35928 KB Output is correct
2 Correct 6 ms 35932 KB Output is correct
3 Correct 6 ms 35916 KB Output is correct
4 Correct 7 ms 35932 KB Output is correct
5 Correct 6 ms 35860 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 6 ms 39992 KB Output is correct
8 Correct 6 ms 42076 KB Output is correct
9 Correct 6 ms 42076 KB Output is correct
10 Correct 7 ms 42072 KB Output is correct
11 Correct 8 ms 42072 KB Output is correct
12 Correct 7 ms 42100 KB Output is correct
13 Correct 7 ms 42072 KB Output is correct
14 Correct 7 ms 42072 KB Output is correct
15 Correct 7 ms 42076 KB Output is correct
16 Correct 7 ms 42156 KB Output is correct
17 Correct 8 ms 44124 KB Output is correct
18 Correct 7 ms 44208 KB Output is correct
19 Correct 25 ms 48964 KB Output is correct
20 Correct 29 ms 53364 KB Output is correct
21 Correct 35 ms 53416 KB Output is correct
22 Correct 32 ms 53544 KB Output is correct
23 Correct 68 ms 56932 KB Output is correct
24 Correct 68 ms 59852 KB Output is correct
25 Correct 81 ms 64596 KB Output is correct
26 Correct 83 ms 65148 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 33884 KB Output is correct
2 Correct 6 ms 33884 KB Output is correct
3 Correct 6 ms 33884 KB Output is correct
4 Correct 16 ms 33884 KB Output is correct
5 Correct 55 ms 34808 KB Output is correct
6 Correct 6 ms 33880 KB Output is correct
7 Correct 6 ms 34136 KB Output is correct
8 Correct 7 ms 34140 KB Output is correct
9 Correct 8 ms 34140 KB Output is correct
10 Correct 22 ms 34408 KB Output is correct
11 Correct 84 ms 35456 KB Output is correct
12 Correct 13 ms 36952 KB Output is correct
13 Correct 14 ms 36956 KB Output is correct
14 Correct 18 ms 36956 KB Output is correct
15 Correct 39 ms 37212 KB Output is correct
16 Correct 125 ms 38300 KB Output is correct
17 Correct 213 ms 97712 KB Output is correct
18 Correct 224 ms 97620 KB Output is correct
19 Correct 225 ms 97732 KB Output is correct
20 Correct 246 ms 97900 KB Output is correct
21 Correct 459 ms 99324 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 49268 KB Output is correct
2 Correct 34 ms 49200 KB Output is correct
3 Correct 124 ms 49732 KB Output is correct
4 Correct 232 ms 50560 KB Output is correct
5 Correct 79 ms 70880 KB Output is correct
6 Correct 122 ms 70968 KB Output is correct
7 Correct 316 ms 71624 KB Output is correct
8 Correct 456 ms 72416 KB Output is correct
9 Correct 511 ms 134108 KB Output is correct
10 Correct 571 ms 134204 KB Output is correct
11 Correct 825 ms 135104 KB Output is correct
12 Correct 1206 ms 135748 KB Output is correct
13 Correct 1064 ms 209900 KB Output is correct
14 Correct 1216 ms 210112 KB Output is correct
15 Correct 1554 ms 210684 KB Output is correct
16 Correct 2056 ms 211752 KB Output is correct
17 Correct 3310 ms 211224 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4436 ms 184732 KB Output is correct
2 Correct 4339 ms 191312 KB Output is correct
3 Correct 4473 ms 190724 KB Output is correct
4 Correct 4347 ms 191460 KB Output is correct
5 Correct 4220 ms 186844 KB Output is correct
6 Correct 3266 ms 163272 KB Output is correct
7 Execution timed out 5056 ms 214400 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35928 KB Output is correct
2 Correct 6 ms 35932 KB Output is correct
3 Correct 6 ms 35916 KB Output is correct
4 Correct 7 ms 35932 KB Output is correct
5 Correct 6 ms 35860 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 6 ms 39992 KB Output is correct
8 Correct 6 ms 42076 KB Output is correct
9 Correct 6 ms 42076 KB Output is correct
10 Correct 7 ms 42072 KB Output is correct
11 Correct 8 ms 42072 KB Output is correct
12 Correct 7 ms 42100 KB Output is correct
13 Correct 7 ms 42072 KB Output is correct
14 Correct 7 ms 42072 KB Output is correct
15 Correct 7 ms 42076 KB Output is correct
16 Correct 7 ms 42156 KB Output is correct
17 Correct 8 ms 44124 KB Output is correct
18 Correct 7 ms 44208 KB Output is correct
19 Correct 25 ms 48964 KB Output is correct
20 Correct 29 ms 53364 KB Output is correct
21 Correct 35 ms 53416 KB Output is correct
22 Correct 32 ms 53544 KB Output is correct
23 Correct 68 ms 56932 KB Output is correct
24 Correct 68 ms 59852 KB Output is correct
25 Correct 81 ms 64596 KB Output is correct
26 Correct 83 ms 65148 KB Output is correct
27 Correct 6 ms 33884 KB Output is correct
28 Correct 6 ms 33884 KB Output is correct
29 Correct 6 ms 33884 KB Output is correct
30 Correct 16 ms 33884 KB Output is correct
31 Correct 55 ms 34808 KB Output is correct
32 Correct 6 ms 33880 KB Output is correct
33 Correct 6 ms 34136 KB Output is correct
34 Correct 7 ms 34140 KB Output is correct
35 Correct 8 ms 34140 KB Output is correct
36 Correct 22 ms 34408 KB Output is correct
37 Correct 84 ms 35456 KB Output is correct
38 Correct 13 ms 36952 KB Output is correct
39 Correct 14 ms 36956 KB Output is correct
40 Correct 18 ms 36956 KB Output is correct
41 Correct 39 ms 37212 KB Output is correct
42 Correct 125 ms 38300 KB Output is correct
43 Correct 213 ms 97712 KB Output is correct
44 Correct 224 ms 97620 KB Output is correct
45 Correct 225 ms 97732 KB Output is correct
46 Correct 246 ms 97900 KB Output is correct
47 Correct 459 ms 99324 KB Output is correct
48 Correct 13 ms 49268 KB Output is correct
49 Correct 34 ms 49200 KB Output is correct
50 Correct 124 ms 49732 KB Output is correct
51 Correct 232 ms 50560 KB Output is correct
52 Correct 79 ms 70880 KB Output is correct
53 Correct 122 ms 70968 KB Output is correct
54 Correct 316 ms 71624 KB Output is correct
55 Correct 456 ms 72416 KB Output is correct
56 Correct 511 ms 134108 KB Output is correct
57 Correct 571 ms 134204 KB Output is correct
58 Correct 825 ms 135104 KB Output is correct
59 Correct 1206 ms 135748 KB Output is correct
60 Correct 1064 ms 209900 KB Output is correct
61 Correct 1216 ms 210112 KB Output is correct
62 Correct 1554 ms 210684 KB Output is correct
63 Correct 2056 ms 211752 KB Output is correct
64 Correct 3310 ms 211224 KB Output is correct
65 Correct 4436 ms 184732 KB Output is correct
66 Correct 4339 ms 191312 KB Output is correct
67 Correct 4473 ms 190724 KB Output is correct
68 Correct 4347 ms 191460 KB Output is correct
69 Correct 4220 ms 186844 KB Output is correct
70 Correct 3266 ms 163272 KB Output is correct
71 Execution timed out 5056 ms 214400 KB Time limit exceeded
72 Halted 0 ms 0 KB -