oj.uz

Submission #618853

# Submission time Handle Problem Language Result Execution time Memory
618853 2022-08-02T07:57:29 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 20764 KB 
#include <bits/stdc++.h>
using namespace std;

using ll	= long long;
using pll	= pair<ll, ll>;
using Edge	= pair<ll, pll>;

#define fi	first
#define se	second

const int maxN	= 1e5 + 5;

ll n, q, w;
set<pll> adj[maxN];
vector<Edge> edges;

vector<ll> dist;

void dfs(ll cur, ll par, ll cdist) {
	dist[cur] = cdist;
	for (auto &[nxt, w] : adj[cur]) {
		if (nxt == par) continue;
		dfs(nxt, cur, cdist+w);
	}
}

ll solve() {
	dist.assign(n+1, 0);
	dfs(1, 0, 0);

	ll e1 = -1, mx = -1;
	for (ll i = 1; i <= n; i++) {
		if (dist[i] > mx) {
			mx = dist[i];
			e1 = i;
		}
	}

	dist.assign(n+1, 0);
	dfs(e1, 0, 0);

	ll ret = 0;
	for (ll i = 1; i <= n; i++) {
		ret = max(ret, dist[i]);
	}
	return ret;
}

int main() {
	scanf("%lld %lld %lld", &n, &q, &w);
	for (ll a, b, c, i = 1; i < n; i++) {
		scanf("%lld %lld %lld", &a, &b, &c);
		adj[a].insert({b, c});
		adj[b].insert({a, c});
		edges.push_back({c, {a, b}});
	}
	ll last = 0;
	for (ll d, e, i = 1; i <= q; i++) {
		scanf("%lld %lld", &d, &e);
		d = (d + last) % (n - 1);
		e = (e + last) % w;

		auto &[w, p] = edges[d];

		adj[p.fi].erase({p.se, w});
		adj[p.se].erase({p.fi, w});

		edges[d].fi = e;
		adj[p.fi].insert({p.se, e});
		adj[p.se].insert({p.fi, e});

		/*
		for (ll i = 1; i <= n; i++) {
			cout << i << ": ";
			for (auto &[j, k] : adj[i]) {
				cout << "{" << j << ", " << k << "} ";
			}
			cout << '\n';
		}
		*/

		last = solve();
		printf("%lld\n", last);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |  scanf("%lld %lld %lld", &n, &q, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |   scanf("%lld %lld %lld", &a, &b, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:59:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   scanf("%lld %lld", &d, &e);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4976 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 228 ms 5160 KB Output is correct
20 Correct 257 ms 5204 KB Output is correct
21 Correct 267 ms 5232 KB Output is correct
22 Correct 315 ms 5388 KB Output is correct
23 Correct 1765 ms 5920 KB Output is correct
24 Correct 1976 ms 5936 KB Output is correct
25 Correct 2204 ms 6072 KB Output is correct
26 Correct 2751 ms 6156 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 26 ms 5060 KB Output is correct
5 Correct 117 ms 5416 KB Output is correct
6 Correct 3 ms 4972 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 6 ms 5076 KB Output is correct
9 Correct 53 ms 5080 KB Output is correct
10 Correct 340 ms 5132 KB Output is correct
11 Correct 1803 ms 5624 KB Output is correct
12 Correct 8 ms 5716 KB Output is correct
13 Correct 35 ms 5716 KB Output is correct
14 Correct 354 ms 5780 KB Output is correct
15 Correct 3699 ms 6056 KB Output is correct
16 Execution timed out 5010 ms 6012 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 5076 KB Output is correct
2 Correct 264 ms 5376 KB Output is correct
3 Correct 1381 ms 5588 KB Output is correct
4 Correct 2530 ms 6560 KB Output is correct
5 Correct 287 ms 6704 KB Output is correct
6 Correct 2724 ms 7088 KB Output is correct
7 Execution timed out 5042 ms 7260 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 5075 ms 20764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4976 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 228 ms 5160 KB Output is correct
20 Correct 257 ms 5204 KB Output is correct
21 Correct 267 ms 5232 KB Output is correct
22 Correct 315 ms 5388 KB Output is correct
23 Correct 1765 ms 5920 KB Output is correct
24 Correct 1976 ms 5936 KB Output is correct
25 Correct 2204 ms 6072 KB Output is correct
26 Correct 2751 ms 6156 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 4 ms 4948 KB Output is correct
30 Correct 26 ms 5060 KB Output is correct
31 Correct 117 ms 5416 KB Output is correct
32 Correct 3 ms 4972 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 6 ms 5076 KB Output is correct
35 Correct 53 ms 5080 KB Output is correct
36 Correct 340 ms 5132 KB Output is correct
37 Correct 1803 ms 5624 KB Output is correct
38 Correct 8 ms 5716 KB Output is correct
39 Correct 35 ms 5716 KB Output is correct
40 Correct 354 ms 5780 KB Output is correct
41 Correct 3699 ms 6056 KB Output is correct
42 Execution timed out 5010 ms 6012 KB Time limit exceeded
43 Halted 0 ms 0 KB -