oj.uz

Submission #619180

# Submission time Handle Problem Language Result Execution time Memory
619180 2022-08-02T10:25:28 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 20628 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;

namespace Subtask12 {

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

}

namespace Subtask3 {
ll id[maxN], sdist[maxN];
multiset<ll> dpq;

void caller() {
	dpq.insert(0);

	for (ll i = 0; i < n-1; i++) {
		#define a (edges[i].se.fi)
		#define b (edges[i].se.se)
		#define c (edges[i].fi)

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

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

		#undef a
		#undef b
		#undef c
	}

	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(sdist[change]));
		sdist[change] = e;
		dpq.insert(e);

		auto it = dpq.rbegin();
		last = *it;
		it++;
		last += *it;

		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 (Star) {
		Subtask3::caller();
	} else {
		Subtask12::caller();
	}
	
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4976 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 5016 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 4992 KB Output is correct
18 Correct 5 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 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4976 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 5016 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 4992 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 240 ms 5156 KB Output is correct
20 Correct 237 ms 5288 KB Output is correct
21 Correct 260 ms 5296 KB Output is correct
22 Correct 313 ms 5192 KB Output is correct
23 Correct 1805 ms 5928 KB Output is correct
24 Correct 1933 ms 5976 KB Output is correct
25 Correct 2099 ms 5964 KB Output is correct
26 Correct 2593 ms 6044 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5140 KB Output is correct
2 Correct 330 ms 5176 KB Output is correct
3 Correct 1378 ms 5408 KB Output is correct
4 Correct 2859 ms 5640 KB Output is correct
5 Correct 306 ms 6564 KB Output is correct
6 Correct 2888 ms 6732 KB Output is correct
7 Execution timed out 5031 ms 6868 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 5044 ms 20628 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 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4976 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 5016 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 4992 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 240 ms 5156 KB Output is correct
20 Correct 237 ms 5288 KB Output is correct
21 Correct 260 ms 5296 KB Output is correct
22 Correct 313 ms 5192 KB Output is correct
23 Correct 1805 ms 5928 KB Output is correct
24 Correct 1933 ms 5976 KB Output is correct
25 Correct 2099 ms 5964 KB Output is correct
26 Correct 2593 ms 6044 KB Output is correct
27 Incorrect 3 ms 4948 KB Output isn't correct
28 Halted 0 ms 0 KB -