oj.uz

Submission #359301

# Submission time Handle Problem Language Result Execution time Memory
359301 2021-01-26T17:12:26 Z jesus_coconut Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 17516 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<set<ll>::iterator> v(n - 1);
	set<ll, greater<>> s;
	for (int i = 0; i < n - 1; ++i) {
		v[i] = s.insert(adj[edges[i].first][edges[i].second]).first;
	}
	ll last = 0;
	while (q--) {
		int dd;
		ll ee;
		cin >> dd >> ee;
		int d = (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).first;
		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 512 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 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 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 512 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 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 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 257 ms 620 KB Output is correct
20 Correct 263 ms 724 KB Output is correct
21 Correct 271 ms 748 KB Output is correct
22 Correct 319 ms 748 KB Output is correct
23 Correct 1902 ms 1388 KB Output is correct
24 Correct 2021 ms 1644 KB Output is correct
25 Correct 2171 ms 1424 KB Output is correct
26 Correct 2662 ms 1644 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 492 KB Output is correct
2 Correct 295 ms 620 KB Output is correct
3 Correct 1482 ms 1516 KB Output is correct
4 Correct 2942 ms 2284 KB Output is correct
5 Correct 327 ms 2028 KB Output is correct
6 Correct 3096 ms 2412 KB Output is correct
7 Execution timed out 5034 ms 2796 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 5057 ms 17516 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 512 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 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 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 257 ms 620 KB Output is correct
20 Correct 263 ms 724 KB Output is correct
21 Correct 271 ms 748 KB Output is correct
22 Correct 319 ms 748 KB Output is correct
23 Correct 1902 ms 1388 KB Output is correct
24 Correct 2021 ms 1644 KB Output is correct
25 Correct 2171 ms 1424 KB Output is correct
26 Correct 2662 ms 1644 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Incorrect 1 ms 364 KB Output isn't correct
29 Halted 0 ms 0 KB -