oj.uz

Submission #619190

# Submission time Handle Problem Language Result Execution time Memory
619190 2022-08-02T10:28:45 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 26996 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) {
		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:110:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |    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 3 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 4 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 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 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 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 4 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 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 232 ms 5240 KB Output is correct
20 Correct 254 ms 5232 KB Output is correct
21 Correct 338 ms 5356 KB Output is correct
22 Correct 320 ms 5288 KB Output is correct
23 Correct 1958 ms 6240 KB Output is correct
24 Correct 2258 ms 6140 KB Output is correct
25 Correct 2267 ms 6284 KB Output is correct
26 Correct 2992 ms 6364 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 17 ms 5072 KB Output is correct
5 Correct 41 ms 5352 KB Output is correct
6 Incorrect 4 ms 4948 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5204 KB Output is correct
2 Correct 364 ms 5220 KB Output is correct
3 Correct 1389 ms 5448 KB Output is correct
4 Correct 2682 ms 5804 KB Output is correct
5 Correct 284 ms 7200 KB Output is correct
6 Correct 2860 ms 7336 KB Output is correct
7 Execution timed out 5039 ms 7508 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 5037 ms 26996 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 3 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 4 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 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 232 ms 5240 KB Output is correct
20 Correct 254 ms 5232 KB Output is correct
21 Correct 338 ms 5356 KB Output is correct
22 Correct 320 ms 5288 KB Output is correct
23 Correct 1958 ms 6240 KB Output is correct
24 Correct 2258 ms 6140 KB Output is correct
25 Correct 2267 ms 6284 KB Output is correct
26 Correct 2992 ms 6364 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 5 ms 4948 KB Output is correct
30 Correct 17 ms 5072 KB Output is correct
31 Correct 41 ms 5352 KB Output is correct
32 Incorrect 4 ms 4948 KB Output isn't correct
33 Halted 0 ms 0 KB -