oj.uz

Submission #619272

# Submission time Handle Problem Language Result Execution time Memory
619272 2022-08-02T10:52:43 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 42444 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
#define debug(x) cout << #x << " = " << x << '\n'

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;

		//debug(d); debug(e);

		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 Subtask4 {
ll initDia[maxN], parent[maxN];
ll timer, tin[maxN], tout[maxN], byTin[maxN];

struct Segtree {
	ll sz;
	vector<ll> seg, lazy;

	Segtree(ll sz) : sz(sz) {
		seg = lazy = vector<ll>((sz << 2) + 1, 0);
	}

	void updateNode(ll pos, ll val) {
		seg[pos] += val;
		lazy[pos] += val;
	}

	void checkLazy(ll pos) {
		if (lazy[pos] != 0) {
			ll lc = pos << 1, rc = lc | 1;
			updateNode(lc, lazy[pos]);
			updateNode(rc, lazy[pos]);
			lazy[pos] = 0;
		}
	}

	void update(ll pos, ll l, ll r, ll ul, ll ur, ll val) {
		if (l > r || ul > ur || l > ur || ul > r) return;
		if (ul <= l && r <= ur) {updateNode(pos, val); return;}

		checkLazy(pos);

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		update(lc, l, m, ul, ur, val);
		update(rc, m+1, r, ul, ur, val);
		seg[pos] = max(seg[lc], seg[rc]);
	}
	void update(ll ul, ll ur, ll val) {update(1, 1, sz, ul, ur, val);}

	ll query(ll pos, ll l, ll r, ll ul, ll ur) {
		if (l > r || ul > ur || l > ur || ul > r) return 0;
		if (ul <= l && r <= ur) return seg[pos];

		checkLazy(pos);

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		return max(query(lc, l, m, ul, ur), query(rc, m+1, r, ul, ur));
	}
	ll query(ll ul, ll ur) {return query(1, 1, sz, ul, ur);}

	void print() {
		for (ll i = 1; i <= sz; i++) {
			cout << query(i, i) << ' ';
		}
		cout << '\n';
	}
} S(1), T(1);

void compute(ll cur) {
	ll cdist = S.query(tin[cur], tin[cur]);
	vector<ll> children(2, cdist);

	for (auto &[nxt, w] : adj[cur]) {
		children.push_back(S.query(tin[nxt], tout[nxt]));
	}
	sort(children.begin(), children.end());
	reverse(children.begin(), children.end());

	//for (auto i : children) {cout << i << ' ';} cout <<'\n';

	//cout << cur << ' ' << -T.query(cur, cur) + children[0] + children[1] - 2ll*cdist << '\n';
	T.update(cur, cur, -T.query(cur, cur) + children[0] + children[1] - 2ll*cdist);
}

#define debug(x) cout << #x << " = " << x << '\n'

void dfs(ll cur, ll par, ll cdist, ll pw) {
	//debug(cur);
	tin[cur] = ++timer;
	byTin[timer] = cur;
	parent[cur] = par;

	dist[cur] = cdist;
	S.update(tin[cur], tin[cur], cdist);

	adj[cur].erase({par, pw});

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

	tout[cur] = timer;
}

void caller() {
	S = T = Segtree(n);
	dfs(1, 0, 0, 0);

	for (auto &[w, p] : edges) {
		if (tin[p.fi] > tin[p.se]) {swap(p.fi, p.se);}
	}

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

	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;

		//debug(d); debug(e);

		auto &[w, p] = edges[d];
		//debug(e-w);

		S.update(tin[p.se], tout[p.se], e-w);

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

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

		for (ll cur = p.fi; cur > 0; cur = parent[cur]) {
			//debug(cur);
			compute(cur);
		}
		//S.print(); T.print();

		last = T.query(1, n);
		printf("%lld\n", last);
	}
}
}

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

	bool Star = 1;
	bool BinTree = 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;}
		int x = min(a, b), y = max(a, b);
		if (y != 2*x && y != (2*x + 1)) {BinTree = 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 if (BinTree) {
		Subtask4::caller();
	} else {
		Subtask12::caller();
	}
	
}

Compilation message

diameter.cpp: In function 'void Subtask12::caller()':
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);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~
diameter.cpp: In function 'void Subtask4::caller()':
diameter.cpp:209:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  209 |   scanf("%lld %lld", &d, &e);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~
diameter.cpp: In function 'int main()':
diameter.cpp:238:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  238 |  scanf("%lld %lld %lld", &n, &q, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:243:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  243 |   scanf("%lld %lld %lld", &a, &b, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:263:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  263 |    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 2 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 2 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 2 ms 4948 KB Output is correct
11 Correct 3 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 4 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 2 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 2 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 2 ms 4948 KB Output is correct
11 Correct 3 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 4 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 5204 KB Output is correct
20 Correct 247 ms 5244 KB Output is correct
21 Correct 265 ms 5360 KB Output is correct
22 Correct 320 ms 5292 KB Output is correct
23 Correct 1876 ms 6240 KB Output is correct
24 Correct 2043 ms 6256 KB Output is correct
25 Correct 2223 ms 6276 KB Output is correct
26 Correct 2722 ms 6368 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 12 ms 5104 KB Output is correct
5 Correct 45 ms 5432 KB Output is correct
6 Correct 4 ms 4944 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 15 ms 5204 KB Output is correct
11 Correct 59 ms 5456 KB Output is correct
12 Correct 7 ms 5972 KB Output is correct
13 Correct 7 ms 5972 KB Output is correct
14 Correct 8 ms 6076 KB Output is correct
15 Correct 23 ms 6136 KB Output is correct
16 Correct 97 ms 6452 KB Output is correct
17 Correct 171 ms 26068 KB Output is correct
18 Correct 147 ms 26116 KB Output is correct
19 Correct 144 ms 26108 KB Output is correct
20 Correct 153 ms 26128 KB Output is correct
21 Correct 329 ms 26704 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5332 KB Output is correct
2 Correct 43 ms 5424 KB Output is correct
3 Correct 231 ms 5636 KB Output is correct
4 Correct 468 ms 6048 KB Output is correct
5 Correct 34 ms 8704 KB Output is correct
6 Correct 93 ms 8724 KB Output is correct
7 Correct 373 ms 8888 KB Output is correct
8 Correct 761 ms 9268 KB Output is correct
9 Correct 125 ms 23364 KB Output is correct
10 Correct 189 ms 23440 KB Output is correct
11 Correct 581 ms 23800 KB Output is correct
12 Correct 1042 ms 24004 KB Output is correct
13 Correct 267 ms 41696 KB Output is correct
14 Correct 360 ms 41800 KB Output is correct
15 Correct 893 ms 41996 KB Output is correct
16 Correct 1314 ms 42376 KB Output is correct
17 Correct 2485 ms 42444 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5037 ms 26916 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 2 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 2 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 2 ms 4948 KB Output is correct
11 Correct 3 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 4 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 5204 KB Output is correct
20 Correct 247 ms 5244 KB Output is correct
21 Correct 265 ms 5360 KB Output is correct
22 Correct 320 ms 5292 KB Output is correct
23 Correct 1876 ms 6240 KB Output is correct
24 Correct 2043 ms 6256 KB Output is correct
25 Correct 2223 ms 6276 KB Output is correct
26 Correct 2722 ms 6368 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 4 ms 4944 KB Output is correct
30 Correct 12 ms 5104 KB Output is correct
31 Correct 45 ms 5432 KB Output is correct
32 Correct 4 ms 4944 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 4 ms 5076 KB Output is correct
35 Correct 5 ms 5076 KB Output is correct
36 Correct 15 ms 5204 KB Output is correct
37 Correct 59 ms 5456 KB Output is correct
38 Correct 7 ms 5972 KB Output is correct
39 Correct 7 ms 5972 KB Output is correct
40 Correct 8 ms 6076 KB Output is correct
41 Correct 23 ms 6136 KB Output is correct
42 Correct 97 ms 6452 KB Output is correct
43 Correct 171 ms 26068 KB Output is correct
44 Correct 147 ms 26116 KB Output is correct
45 Correct 144 ms 26108 KB Output is correct
46 Correct 153 ms 26128 KB Output is correct
47 Correct 329 ms 26704 KB Output is correct
48 Correct 11 ms 5332 KB Output is correct
49 Correct 43 ms 5424 KB Output is correct
50 Correct 231 ms 5636 KB Output is correct
51 Correct 468 ms 6048 KB Output is correct
52 Correct 34 ms 8704 KB Output is correct
53 Correct 93 ms 8724 KB Output is correct
54 Correct 373 ms 8888 KB Output is correct
55 Correct 761 ms 9268 KB Output is correct
56 Correct 125 ms 23364 KB Output is correct
57 Correct 189 ms 23440 KB Output is correct
58 Correct 581 ms 23800 KB Output is correct
59 Correct 1042 ms 24004 KB Output is correct
60 Correct 267 ms 41696 KB Output is correct
61 Correct 360 ms 41800 KB Output is correct
62 Correct 893 ms 41996 KB Output is correct
63 Correct 1314 ms 42376 KB Output is correct
64 Correct 2485 ms 42444 KB Output is correct
65 Execution timed out 5037 ms 26916 KB Time limit exceeded
66 Halted 0 ms 0 KB -