oj.uz

Submission #619195

# Submission time Handle Problem Language Result Execution time Memory
619195 2022-08-02T10:29:51 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 28636 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;

ll id[maxN], dist[maxN];
multiset<ll> dpq;

namespace Subtask12 {

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

void caller() {
	ll last = 0;
	//cout << solve() << '\n';
	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);
	}
}

}

int main() {
	scanf("%lld %lld %lld", &n, &q, &w);

	bool Star = 1;
	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}});

		if (a != 1 && b != 1) {Star = 0;}

		if (b == 1) swap(a, b);

		id[i-1] = b;
		dist[b] = c;
		dpq.insert(c);
	}

	if (Star) {
		dpq.insert(0);
		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;
	
			ll change = id[d];
	
			dpq.erase(dpq.lower_bound(dist[change]));
			dist[change] = e;
			dpq.insert(e);
	
			auto it = dpq.rbegin();
			last = *it;
			it++;
			last += *it;
	
			printf("%lld\n", last);
		}
	} else {
		Subtask12::caller();
	}
	
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 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 4 ms 4948 KB Output is correct
9 Correct 4 ms 5000 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 5 ms 4948 KB Output is correct
13 Correct 3 ms 5004 KB Output is correct
14 Correct 5 ms 5008 KB Output is correct
15 Correct 4 ms 5016 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 5 ms 5004 KB Output is correct
18 Correct 4 ms 5056 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 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 4 ms 4948 KB Output is correct
9 Correct 4 ms 5000 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 5 ms 4948 KB Output is correct
13 Correct 3 ms 5004 KB Output is correct
14 Correct 5 ms 5008 KB Output is correct
15 Correct 4 ms 5016 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 5 ms 5004 KB Output is correct
18 Correct 4 ms 5056 KB Output is correct
19 Correct 273 ms 5288 KB Output is correct
20 Correct 284 ms 5324 KB Output is correct
21 Correct 272 ms 5276 KB Output is correct
22 Correct 330 ms 5336 KB Output is correct
23 Correct 2095 ms 6240 KB Output is correct
24 Correct 2487 ms 6256 KB Output is correct
25 Correct 2416 ms 6296 KB Output is correct
26 Correct 2857 ms 6480 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 13 ms 5228 KB Output is correct
5 Correct 66 ms 5904 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 5 ms 5076 KB Output is correct
8 Correct 4 ms 5008 KB Output is correct
9 Correct 6 ms 5076 KB Output is correct
10 Correct 15 ms 5272 KB Output is correct
11 Correct 50 ms 6364 KB Output is correct
12 Correct 8 ms 6100 KB Output is correct
13 Correct 7 ms 6100 KB Output is correct
14 Correct 10 ms 6036 KB Output is correct
15 Correct 20 ms 6400 KB Output is correct
16 Correct 76 ms 7280 KB Output is correct
17 Correct 183 ms 26852 KB Output is correct
18 Correct 145 ms 26884 KB Output is correct
19 Correct 133 ms 26932 KB Output is correct
20 Correct 174 ms 27272 KB Output is correct
21 Correct 320 ms 28156 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 5204 KB Output is correct
2 Correct 318 ms 5324 KB Output is correct
3 Correct 1579 ms 5896 KB Output is correct
4 Correct 3054 ms 6360 KB Output is correct
5 Correct 281 ms 7352 KB Output is correct
6 Correct 2806 ms 7428 KB Output is correct
7 Execution timed out 5095 ms 7724 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 5069 ms 28636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 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 4 ms 4948 KB Output is correct
9 Correct 4 ms 5000 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 5 ms 4948 KB Output is correct
13 Correct 3 ms 5004 KB Output is correct
14 Correct 5 ms 5008 KB Output is correct
15 Correct 4 ms 5016 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 5 ms 5004 KB Output is correct
18 Correct 4 ms 5056 KB Output is correct
19 Correct 273 ms 5288 KB Output is correct
20 Correct 284 ms 5324 KB Output is correct
21 Correct 272 ms 5276 KB Output is correct
22 Correct 330 ms 5336 KB Output is correct
23 Correct 2095 ms 6240 KB Output is correct
24 Correct 2487 ms 6256 KB Output is correct
25 Correct 2416 ms 6296 KB Output is correct
26 Correct 2857 ms 6480 KB Output is correct
27 Correct 3 ms 5004 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 4 ms 4948 KB Output is correct
30 Correct 13 ms 5228 KB Output is correct
31 Correct 66 ms 5904 KB Output is correct
32 Correct 4 ms 4948 KB Output is correct
33 Correct 5 ms 5076 KB Output is correct
34 Correct 4 ms 5008 KB Output is correct
35 Correct 6 ms 5076 KB Output is correct
36 Correct 15 ms 5272 KB Output is correct
37 Correct 50 ms 6364 KB Output is correct
38 Correct 8 ms 6100 KB Output is correct
39 Correct 7 ms 6100 KB Output is correct
40 Correct 10 ms 6036 KB Output is correct
41 Correct 20 ms 6400 KB Output is correct
42 Correct 76 ms 7280 KB Output is correct
43 Correct 183 ms 26852 KB Output is correct
44 Correct 145 ms 26884 KB Output is correct
45 Correct 133 ms 26932 KB Output is correct
46 Correct 174 ms 27272 KB Output is correct
47 Correct 320 ms 28156 KB Output is correct
48 Correct 41 ms 5204 KB Output is correct
49 Correct 318 ms 5324 KB Output is correct
50 Correct 1579 ms 5896 KB Output is correct
51 Correct 3054 ms 6360 KB Output is correct
52 Correct 281 ms 7352 KB Output is correct
53 Correct 2806 ms 7428 KB Output is correct
54 Execution timed out 5095 ms 7724 KB Time limit exceeded
55 Halted 0 ms 0 KB -