oj.uz

Submission #575593

# Submission time Handle Problem Language Result Execution time Memory
575593 2022-06-11T06:09:43 Z andrei_boaca Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 937 ms 56980 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pll;
typedef priority_queue <ll> pql;

struct node{
	ll v, l, r, s;
	
	node() : v(0), l(0), r(0), s(0) {}	
	node(ll v, ll d, ll c) : v(v), l(d + c), r(d), s(c) {}
	
	node operator + (node n)
	{
		node ret;
		
		ret.s = s + n.s;
		ret.l = max(l, s + n.l);
		ret.r = max(n.r, n.s + r);
		ret.v = max(max(v, n.v), r + n.l);
		
		return ret;
	}
};

struct segtree{
	node T[303030];
	ll sz = 1 << 17;
	
	void update(ll p, ll v, ll d, ll c)
	{
		p += sz; T[p] = node(v, d, c);
		
		for(p>>=1; p; p>>=1){
			T[p] = T[p << 1] + T[p << 1 | 1];
		}
	}
	
	node getval(ll l, ll r)
	{
		node vl, vr;
		bool fl = 0, fr = 0;
		
		l += sz; r += sz;
		
		for(; l<=r; ){
			if(l & 1){
				if(fl) vl = vl + T[l];
				else vl = T[l], fl = 1;
			}
			if(~r & 1){
				if(fr) vr = T[r] + vr;
				else vr = T[r], fr = 1;
			}
			l = l + 1 >> 1;
			r = r - 1 >> 1;
		}
		
		if(fl && fr) return vl + vr;
		else if(fl) return vl;
		else if(fr) return vr;
		else 1 / 0;
	}
};

segtree T;
vector <ll> V[101010];
pql PV[101010], QV[101010], PL[101010], QL[101010];
ll P[101010], C[101010], N[101010];
ll A[101010], B[101010], E[101010], _C[101010], Z[101010];
ll H[101010], G[101010], S[101010];
vector <ll> X;
ll n, q, w, g, cnt, ans;

void dfs1(ll p, ll r)
{
	Z[p] = 1;
	
	for(ll &t: V[p]){
		if(t != r){
			dfs1(t, p);
			Z[p] += Z[t]; P[t] = p;
		}
	}
}

void dfs2(ll p, ll r, ll c)
{
	ll m = -1;
	
	N[p] = ++cnt;
	X.push_back(p);
	
	for(ll &t: V[p]){
		if(t == r) continue;
		if(m == -1 || Z[t] > Z[m]){
			m = t;
		}
	}
	
	if(m != -1){
		G[m] = c; S[c] ++;
		dfs2(m, p, c);
	}
	
	for(ll &t: V[p]){
		if(t != r && t != m){
			H[++g] = t; G[t] = g; S[g] ++;
			dfs2(t, p, g);
			
			PV[p].push(0); PL[p].push(0);
		}
	}
}

void sync(pql &P, pql &Q) { for(; !P.empty() && !Q.empty() && P.top() == Q.top(); P.pop(), Q.pop()); }

pll nodeval(ll p)
{
	ll v, v1, v2;
	
	sync(PL[p], QL[p]);
	if(PL[p].empty()) v1 = -1;
	else v1 = PL[p].top(), PL[p].pop();
	
	sync(PL[p], QL[p]);
	if(PL[p].empty()) v2 = 0;
	else v2 = PL[p].top();
	
	if(v1 != -1) PL[p].push(v1);
	
	sync(PV[p], QV[p]);
	if(PV[p].empty()) v = 0;
	else v = PV[p].top();
	
	if(v1 == -1) v1 = 0;
	
	v = max(v, v1 + v2);
	
	return pll(v, v1);
}

void query(ll p)
{
	if(!p) return;
	
	node _n;
	ll h, v, d;
	
	h = H[G[p]];
	
	_n = T.getval(N[h], N[h] + S[G[p]] - 1);
	v = _n.v; d = _n.l;
	QV[P[h]].push(v); QL[P[h]].push(d);
	
	tie(v, d) = nodeval(p); v = max(v, d + C[p]);
	T.update(N[p], v, d, C[p]);
	
	_n = T.getval(N[h], N[h] + S[G[p]] - 1);
	v = _n.v; d = _n.l;
	PV[P[h]].push(v); PL[P[h]].push(d);
	
	query(P[h]);
}

ll getans() { return nodeval(0).first; }

int main()
{
	ll i, c;
	
	scanf("%lld%lld%lld", &n, &q, &w);
	
	for(i=1; i<n; i++){
		scanf("%lld%lld%lld", A + i, B + i, _C + i);
		V[A[i]].push_back(B[i]);
		V[B[i]].push_back(A[i]);
	}
	
	dfs1(1, 0);
	H[++g] = 1; G[1] = g; S[g] ++;
	dfs2(1, 0, g);
	PV[0].push(0); PL[0].push(0);
	
	reverse(X.begin(), X.end());
	
	for(i=1; i<n; i++){
		if(P[A[i]] != B[i]) swap(A[i], B[i]);
		E[A[i]] = i;
	}
	
	for(ll &t: X){
		C[t] = _C[E[t]];
		query(t);
	}
	
	for(i=1; i<=n; i++){
		ll v, d;
		tie(v, d) = nodeval(i);
	}
	
	for(; q--; ){
		scanf("%lld%lld", &i, &c);
		i = A[(i + ans) % (n - 1) + 1];
		c = (c + ans) % w;
		C[i] = c; query(i);
		ans = getans();
		printf("%lld\n", ans);
	}
		
	return 0;
}

Compilation message

diameter.cpp: In member function 'node segtree::getval(ll, ll)':
diameter.cpp:57:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |    l = l + 1 >> 1;
      |        ~~^~~
diameter.cpp:58:10: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   58 |    r = r - 1 >> 1;
      |        ~~^~~
diameter.cpp:64:10: warning: division by zero [-Wdiv-by-zero]
   64 |   else 1 / 0;
      |        ~~^~~
diameter.cpp:64:10: warning: statement has no effect [-Wunused-value]
diameter.cpp:65:2: warning: control reaches end of non-void function [-Wreturn-type]
   65 |  }
      |  ^
diameter.cpp: In function 'int main()':
diameter.cpp:174:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  174 |  scanf("%lld%lld%lld", &n, &q, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:177:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  177 |   scanf("%lld%lld%lld", A + i, B + i, _C + i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:205:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  205 |   scanf("%lld%lld", &i, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24788 KB Output is correct
2 Correct 12 ms 24788 KB Output is correct
3 Correct 12 ms 24816 KB Output is correct
4 Correct 11 ms 24788 KB Output is correct
5 Correct 12 ms 24820 KB Output is correct
6 Correct 12 ms 24868 KB Output is correct
7 Correct 11 ms 24788 KB Output is correct
8 Correct 12 ms 24788 KB Output is correct
9 Correct 10 ms 24788 KB Output is correct
10 Correct 12 ms 24824 KB Output is correct
11 Correct 12 ms 24820 KB Output is correct
12 Correct 12 ms 24788 KB Output is correct
13 Correct 12 ms 24860 KB Output is correct
14 Correct 12 ms 24852 KB Output is correct
15 Correct 12 ms 24788 KB Output is correct
16 Correct 12 ms 24916 KB Output is correct
17 Correct 13 ms 24788 KB Output is correct
18 Correct 12 ms 24820 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24788 KB Output is correct
2 Correct 12 ms 24788 KB Output is correct
3 Correct 12 ms 24816 KB Output is correct
4 Correct 11 ms 24788 KB Output is correct
5 Correct 12 ms 24820 KB Output is correct
6 Correct 12 ms 24868 KB Output is correct
7 Correct 11 ms 24788 KB Output is correct
8 Correct 12 ms 24788 KB Output is correct
9 Correct 10 ms 24788 KB Output is correct
10 Correct 12 ms 24824 KB Output is correct
11 Correct 12 ms 24820 KB Output is correct
12 Correct 12 ms 24788 KB Output is correct
13 Correct 12 ms 24860 KB Output is correct
14 Correct 12 ms 24852 KB Output is correct
15 Correct 12 ms 24788 KB Output is correct
16 Correct 12 ms 24916 KB Output is correct
17 Correct 13 ms 24788 KB Output is correct
18 Correct 12 ms 24820 KB Output is correct
19 Correct 23 ms 25156 KB Output is correct
20 Correct 20 ms 25216 KB Output is correct
21 Correct 21 ms 25172 KB Output is correct
22 Correct 20 ms 25172 KB Output is correct
23 Correct 38 ms 26420 KB Output is correct
24 Correct 40 ms 26120 KB Output is correct
25 Correct 29 ms 26180 KB Output is correct
26 Correct 22 ms 26312 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24788 KB Output is correct
2 Correct 14 ms 24816 KB Output is correct
3 Correct 13 ms 24936 KB Output is correct
4 Correct 32 ms 25172 KB Output is correct
5 Correct 127 ms 26676 KB Output is correct
6 Correct 14 ms 24872 KB Output is correct
7 Correct 16 ms 24952 KB Output is correct
8 Correct 18 ms 24972 KB Output is correct
9 Correct 17 ms 25084 KB Output is correct
10 Correct 39 ms 25828 KB Output is correct
11 Correct 120 ms 27712 KB Output is correct
12 Correct 19 ms 26196 KB Output is correct
13 Correct 18 ms 26132 KB Output is correct
14 Correct 18 ms 26292 KB Output is correct
15 Correct 38 ms 26740 KB Output is correct
16 Correct 129 ms 29128 KB Output is correct
17 Correct 113 ms 49588 KB Output is correct
18 Correct 116 ms 49676 KB Output is correct
19 Correct 133 ms 49724 KB Output is correct
20 Correct 149 ms 50212 KB Output is correct
21 Correct 248 ms 56668 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25044 KB Output is correct
2 Correct 27 ms 25200 KB Output is correct
3 Correct 77 ms 25776 KB Output is correct
4 Correct 143 ms 26600 KB Output is correct
5 Correct 39 ms 27512 KB Output is correct
6 Correct 54 ms 27652 KB Output is correct
7 Correct 115 ms 28416 KB Output is correct
8 Correct 205 ms 29284 KB Output is correct
9 Correct 155 ms 37968 KB Output is correct
10 Correct 176 ms 38216 KB Output is correct
11 Correct 266 ms 38992 KB Output is correct
12 Correct 372 ms 40008 KB Output is correct
13 Correct 337 ms 51304 KB Output is correct
14 Correct 331 ms 51388 KB Output is correct
15 Correct 440 ms 52468 KB Output is correct
16 Correct 584 ms 53368 KB Output is correct
17 Correct 937 ms 56980 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 733 ms 53940 KB Output is correct
2 Correct 772 ms 55356 KB Output is correct
3 Correct 748 ms 55440 KB Output is correct
4 Correct 734 ms 55856 KB Output is correct
5 Correct 741 ms 55392 KB Output is correct
6 Correct 600 ms 54568 KB Output is correct
7 Correct 477 ms 55284 KB Output is correct
8 Correct 449 ms 54956 KB Output is correct
9 Correct 464 ms 55080 KB Output is correct
10 Correct 456 ms 55092 KB Output is correct
11 Correct 421 ms 54896 KB Output is correct
12 Correct 368 ms 54840 KB Output is correct
13 Correct 268 ms 55284 KB Output is correct
14 Correct 278 ms 55320 KB Output is correct
15 Correct 268 ms 55228 KB Output is correct
16 Correct 256 ms 55440 KB Output is correct
17 Correct 271 ms 54400 KB Output is correct
18 Correct 252 ms 54856 KB Output is correct
19 Correct 282 ms 55276 KB Output is correct
20 Correct 259 ms 55192 KB Output is correct
21 Correct 271 ms 55524 KB Output is correct
22 Correct 263 ms 55336 KB Output is correct
23 Correct 281 ms 54520 KB Output is correct
24 Correct 267 ms 54828 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24788 KB Output is correct
2 Correct 12 ms 24788 KB Output is correct
3 Correct 12 ms 24816 KB Output is correct
4 Correct 11 ms 24788 KB Output is correct
5 Correct 12 ms 24820 KB Output is correct
6 Correct 12 ms 24868 KB Output is correct
7 Correct 11 ms 24788 KB Output is correct
8 Correct 12 ms 24788 KB Output is correct
9 Correct 10 ms 24788 KB Output is correct
10 Correct 12 ms 24824 KB Output is correct
11 Correct 12 ms 24820 KB Output is correct
12 Correct 12 ms 24788 KB Output is correct
13 Correct 12 ms 24860 KB Output is correct
14 Correct 12 ms 24852 KB Output is correct
15 Correct 12 ms 24788 KB Output is correct
16 Correct 12 ms 24916 KB Output is correct
17 Correct 13 ms 24788 KB Output is correct
18 Correct 12 ms 24820 KB Output is correct
19 Correct 23 ms 25156 KB Output is correct
20 Correct 20 ms 25216 KB Output is correct
21 Correct 21 ms 25172 KB Output is correct
22 Correct 20 ms 25172 KB Output is correct
23 Correct 38 ms 26420 KB Output is correct
24 Correct 40 ms 26120 KB Output is correct
25 Correct 29 ms 26180 KB Output is correct
26 Correct 22 ms 26312 KB Output is correct
27 Correct 14 ms 24788 KB Output is correct
28 Correct 14 ms 24816 KB Output is correct
29 Correct 13 ms 24936 KB Output is correct
30 Correct 32 ms 25172 KB Output is correct
31 Correct 127 ms 26676 KB Output is correct
32 Correct 14 ms 24872 KB Output is correct
33 Correct 16 ms 24952 KB Output is correct
34 Correct 18 ms 24972 KB Output is correct
35 Correct 17 ms 25084 KB Output is correct
36 Correct 39 ms 25828 KB Output is correct
37 Correct 120 ms 27712 KB Output is correct
38 Correct 19 ms 26196 KB Output is correct
39 Correct 18 ms 26132 KB Output is correct
40 Correct 18 ms 26292 KB Output is correct
41 Correct 38 ms 26740 KB Output is correct
42 Correct 129 ms 29128 KB Output is correct
43 Correct 113 ms 49588 KB Output is correct
44 Correct 116 ms 49676 KB Output is correct
45 Correct 133 ms 49724 KB Output is correct
46 Correct 149 ms 50212 KB Output is correct
47 Correct 248 ms 56668 KB Output is correct
48 Correct 15 ms 25044 KB Output is correct
49 Correct 27 ms 25200 KB Output is correct
50 Correct 77 ms 25776 KB Output is correct
51 Correct 143 ms 26600 KB Output is correct
52 Correct 39 ms 27512 KB Output is correct
53 Correct 54 ms 27652 KB Output is correct
54 Correct 115 ms 28416 KB Output is correct
55 Correct 205 ms 29284 KB Output is correct
56 Correct 155 ms 37968 KB Output is correct
57 Correct 176 ms 38216 KB Output is correct
58 Correct 266 ms 38992 KB Output is correct
59 Correct 372 ms 40008 KB Output is correct
60 Correct 337 ms 51304 KB Output is correct
61 Correct 331 ms 51388 KB Output is correct
62 Correct 440 ms 52468 KB Output is correct
63 Correct 584 ms 53368 KB Output is correct
64 Correct 937 ms 56980 KB Output is correct
65 Correct 733 ms 53940 KB Output is correct
66 Correct 772 ms 55356 KB Output is correct
67 Correct 748 ms 55440 KB Output is correct
68 Correct 734 ms 55856 KB Output is correct
69 Correct 741 ms 55392 KB Output is correct
70 Correct 600 ms 54568 KB Output is correct
71 Correct 477 ms 55284 KB Output is correct
72 Correct 449 ms 54956 KB Output is correct
73 Correct 464 ms 55080 KB Output is correct
74 Correct 456 ms 55092 KB Output is correct
75 Correct 421 ms 54896 KB Output is correct
76 Correct 368 ms 54840 KB Output is correct
77 Correct 268 ms 55284 KB Output is correct
78 Correct 278 ms 55320 KB Output is correct
79 Correct 268 ms 55228 KB Output is correct
80 Correct 256 ms 55440 KB Output is correct
81 Correct 271 ms 54400 KB Output is correct
82 Correct 252 ms 54856 KB Output is correct
83 Correct 282 ms 55276 KB Output is correct
84 Correct 259 ms 55192 KB Output is correct
85 Correct 271 ms 55524 KB Output is correct
86 Correct 263 ms 55336 KB Output is correct
87 Correct 281 ms 54520 KB Output is correct
88 Correct 267 ms 54828 KB Output is correct
89 Correct 760 ms 54952 KB Output is correct
90 Correct 671 ms 54020 KB Output is correct
91 Correct 542 ms 53816 KB Output is correct
92 Correct 468 ms 52804 KB Output is correct
93 Correct 386 ms 54336 KB Output is correct
94 Correct 384 ms 52076 KB Output is correct
95 Correct 292 ms 53068 KB Output is correct
96 Correct 304 ms 51844 KB Output is correct
97 Correct 305 ms 52900 KB Output is correct
98 Correct 297 ms 54476 KB Output is correct
99 Correct 332 ms 52632 KB Output is correct
100 Correct 307 ms 52776 KB Output is correct