oj.uz

Submission #359303

# Submission time Handle Problem Language Result Execution time Memory
359303 2021-01-26T17:18:06 Z jesus_coconut Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 23660 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int n, q;
ll w;
vector<map<int, int>> adj;
vector<pair<int, int>> edges;
bool s3 = true;

void read() {
	cin >> n >> q >> w;
	adj.resize(n);
	edges.resize(n - 1);
	for (int i = 0; i < n - 1; ++i) {
		int a, b;
		ll c;
		cin >> a >> b >> c;
		--a; --b;
		if (a != 0) s3 = false;
		edges[i] = {a, b};
		adj[a][b] = c;
		adj[b][a] = c;
	}
}

void solve3() {
	vector<multiset<ll>::iterator> v(n - 1);
	multiset<ll, greater<>> s;
	for (int i = 0; i < n - 1; ++i) {
		v[i] = s.insert(adj[edges[i].first][edges[i].second]);
	}
	ll last = 0;
	while (q--) {
		int dd;
		ll ee;
		cin >> dd >> ee;
		int d = ((ll)dd + last) % (n - 1);
		ll e = (ee + last) % w;
		adj[edges[d].first][edges[d].second] = e;
		adj[edges[d].second][edges[d].first] = e;
		s.erase(v[d]);
		v[d] = s.insert(e);
		if (n == 2) {
			last = *s.begin();
		} else {
			last = *s.begin() + *(++s.begin());
		}
		cout << last << '\n';
	}
}

ll mxcost;
int far;

void dfs(int ver, int par, ll cost) {
	if (cost > mxcost) {
		mxcost = cost;
		far = ver;
	}
	for (auto &[u, c] : adj[ver]) if (u != par) {
		dfs(u, ver, cost + c);
	}
}

ll diameter() {
	mxcost = 0;
	far = 0;
	dfs(0, -1, 0);
	mxcost = 0;
	dfs(far, -1, 0);
	return mxcost;
}

void solve() {
	ll last = 0;
	while (q--) {
		int dd;
		ll ee;
		cin >> dd >> ee;
		int d = ((ll)dd + last) % (n - 1);
		ll e = (ee + last) % w;
		adj[edges[d].first][edges[d].second] = e;
		adj[edges[d].second][edges[d].first] = e;
		last = diameter();
		cout << last << '\n';
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	read();
	if (s3) {
		solve3();
	} else {
		solve();
	}

	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 246 ms 492 KB Output is correct
20 Correct 266 ms 652 KB Output is correct
21 Correct 270 ms 620 KB Output is correct
22 Correct 318 ms 620 KB Output is correct
23 Correct 1899 ms 1400 KB Output is correct
24 Correct 2086 ms 1260 KB Output is correct
25 Correct 2127 ms 1260 KB Output is correct
26 Correct 2638 ms 1644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 9 ms 364 KB Output is correct
5 Correct 40 ms 748 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 15 ms 748 KB Output is correct
11 Correct 51 ms 1772 KB Output is correct
12 Correct 5 ms 1388 KB Output is correct
13 Correct 5 ms 1388 KB Output is correct
14 Correct 8 ms 1516 KB Output is correct
15 Correct 24 ms 1772 KB Output is correct
16 Correct 71 ms 2924 KB Output is correct
17 Correct 118 ms 21996 KB Output is correct
18 Correct 118 ms 21996 KB Output is correct
19 Correct 118 ms 21996 KB Output is correct
20 Correct 146 ms 22252 KB Output is correct
21 Correct 350 ms 23660 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 492 KB Output is correct
2 Correct 289 ms 492 KB Output is correct
3 Correct 1346 ms 748 KB Output is correct
4 Correct 2690 ms 1656 KB Output is correct
5 Correct 290 ms 1884 KB Output is correct
6 Correct 2843 ms 2176 KB Output is correct
7 Execution timed out 5022 ms 2208 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 246 ms 492 KB Output is correct
20 Correct 266 ms 652 KB Output is correct
21 Correct 270 ms 620 KB Output is correct
22 Correct 318 ms 620 KB Output is correct
23 Correct 1899 ms 1400 KB Output is correct
24 Correct 2086 ms 1260 KB Output is correct
25 Correct 2127 ms 1260 KB Output is correct
26 Correct 2638 ms 1644 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 9 ms 364 KB Output is correct
31 Correct 40 ms 748 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 15 ms 748 KB Output is correct
37 Correct 51 ms 1772 KB Output is correct
38 Correct 5 ms 1388 KB Output is correct
39 Correct 5 ms 1388 KB Output is correct
40 Correct 8 ms 1516 KB Output is correct
41 Correct 24 ms 1772 KB Output is correct
42 Correct 71 ms 2924 KB Output is correct
43 Correct 118 ms 21996 KB Output is correct
44 Correct 118 ms 21996 KB Output is correct
45 Correct 118 ms 21996 KB Output is correct
46 Correct 146 ms 22252 KB Output is correct
47 Correct 350 ms 23660 KB Output is correct
48 Correct 28 ms 492 KB Output is correct
49 Correct 289 ms 492 KB Output is correct
50 Correct 1346 ms 748 KB Output is correct
51 Correct 2690 ms 1656 KB Output is correct
52 Correct 290 ms 1884 KB Output is correct
53 Correct 2843 ms 2176 KB Output is correct
54 Execution timed out 5022 ms 2208 KB Time limit exceeded
55 Halted 0 ms 0 KB -