oj.uz

Submission #676497

# Submission time Handle Problem Language Result Execution time Memory
676497 2022-12-31T03:45:23 Z penguin133 Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 472 ms 73784 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#define getchar_unlocked getchar_nolock

int n, q, w;
int fst[100005], lst[100005], eu[200005], S[100005], dist[100005];
pi par[100005];
int cnt = 1, in = 1;
vector<pi>v[100005];
void dfs(int x, pi p, int cur){
	fst[x] = lst[x] = in;
	S[x] = cnt++;
	eu[in++] = x;
	par[x] = p;
	dist[x] = cur;
	for(auto [i, j] : v[x]){
		if(i == p.fi)continue;
		dfs(i, {x, j}, cur + j);
		lst[x] = in;
		eu[in++] = x;
	}
}

struct node{
	int s, e, m;
	int x, y, z, xy, yz, xyz, lazy;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e)>>1;
		x = y = z = xy = yz = xyz = lazy = 0;
		if(s != e)l = new node(s, m), r= new node(m+1, e);
		else xy = yz = xyz = -1e18;
	}
	void propo(){
		if(lazy){
			x += lazy;
			y += 2 * lazy;
			z += lazy;
			xy -= lazy;
			yz -= lazy;
			if(s != e)l->lazy += lazy, r->lazy += lazy;
			lazy = 0;
		}
	}
	void upd(int a, int b, int c){
		if(s == a && b == e)lazy += c;
		else{
			if(b <= m)l->upd(a, b, c);
			else if(a > m)r->upd(a, b, c);
			else l->upd(a, m, c), r->upd(m+1, b ,c);
			l->propo(), r->propo();
			x = max(l->x, r->x);
			y = min(l->y, r->y);
			z = max(l->z, r->z);
			xy = max({l->xy, r->xy, l->x - r->y});
			yz = max({l->yz, r->yz, -l->y + r->z});
			xyz = max({l->xyz, r->xyz, l->xy + r->z, l->x + r->yz});
		}
	}
	void dbg(){
		cout << s << " " << e << " " << x << " " << y << " " << z << " " << xy << " " << yz << " " << xyz << '\n';
		if(s == e)return;
		l->dbg();
		r->dbg(); 
	}
}*root;

pii A[100005];

void solve(){
	cin >> n >> q >> w;
	for(int i=1;i<n;i++){
		int a, b, c;
		cin >> a >> b >> c;
		v[a].push_back({b, c});
		v[b].push_back({a, c});
		A[i] = {a, {b, c}};
	}
	
	dfs(1, {-1, -1}, 0);
	root = new node(1, in);
	for(int i=1;i<in;i++)root->upd(i, i, dist[eu[i]]);
	//cout << root->xyz << '\n';
	//root->dbg();
	//for(int i=1;i<in;i++)cout << eu[i] << ' ' << dist[eu[i]] << '\n';
	int lastans = 0;
	while(q--){
		int x, y;
		cin >> x >> y;
		x = (x + lastans)%(n - 1);
		y = (y + lastans)%w;
		int tmp = A[x+1].fi;
		if(par[tmp].fi != A[x+1].se.fi)tmp = A[x+1].se.fi;
		//cerr << tmp << " " << fst[tmp] << " " << lst[tmp] << " " << par[tmp].fi << " " << par[tmp].se << '\n';
		root->upd(fst[tmp], lst[tmp], y - par[tmp].se);
		//cerr << "died\n";
		par[tmp].se = y;
		root->propo();
		lastans = root->xyz;
		cout << lastans << '\n';
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

diameter.cpp:110:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  110 | main(){
      | ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2684 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2684 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 6 ms 3360 KB Output is correct
20 Correct 5 ms 3284 KB Output is correct
21 Correct 6 ms 3284 KB Output is correct
22 Correct 7 ms 3412 KB Output is correct
23 Correct 13 ms 5716 KB Output is correct
24 Correct 10 ms 5716 KB Output is correct
25 Correct 11 ms 5716 KB Output is correct
26 Correct 12 ms 6028 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2696 KB Output is correct
4 Correct 7 ms 2956 KB Output is correct
5 Correct 28 ms 3796 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2944 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 9 ms 3256 KB Output is correct
11 Correct 40 ms 4312 KB Output is correct
12 Correct 6 ms 5640 KB Output is correct
13 Correct 6 ms 5588 KB Output is correct
14 Correct 7 ms 5640 KB Output is correct
15 Correct 16 ms 5888 KB Output is correct
16 Correct 50 ms 7084 KB Output is correct
17 Correct 99 ms 60932 KB Output is correct
18 Correct 98 ms 60912 KB Output is correct
19 Correct 99 ms 61040 KB Output is correct
20 Correct 126 ms 61300 KB Output is correct
21 Correct 215 ms 62560 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3284 KB Output is correct
2 Correct 11 ms 3412 KB Output is correct
3 Correct 37 ms 3980 KB Output is correct
4 Correct 61 ms 4668 KB Output is correct
5 Correct 15 ms 8660 KB Output is correct
6 Correct 21 ms 8736 KB Output is correct
7 Correct 53 ms 9288 KB Output is correct
8 Correct 94 ms 10116 KB Output is correct
9 Correct 51 ms 32436 KB Output is correct
10 Correct 68 ms 32536 KB Output is correct
11 Correct 122 ms 33300 KB Output is correct
12 Correct 182 ms 33980 KB Output is correct
13 Correct 110 ms 62172 KB Output is correct
14 Correct 119 ms 62388 KB Output is correct
15 Correct 180 ms 62992 KB Output is correct
16 Correct 248 ms 63820 KB Output is correct
17 Correct 223 ms 63540 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 65996 KB Output is correct
2 Correct 314 ms 65912 KB Output is correct
3 Correct 319 ms 66044 KB Output is correct
4 Correct 321 ms 65992 KB Output is correct
5 Correct 312 ms 65812 KB Output is correct
6 Correct 288 ms 65792 KB Output is correct
7 Correct 360 ms 69064 KB Output is correct
8 Correct 393 ms 68980 KB Output is correct
9 Correct 395 ms 69036 KB Output is correct
10 Correct 352 ms 69004 KB Output is correct
11 Correct 359 ms 68740 KB Output is correct
12 Correct 344 ms 67844 KB Output is correct
13 Correct 423 ms 73772 KB Output is correct
14 Correct 433 ms 73680 KB Output is correct
15 Correct 472 ms 73740 KB Output is correct
16 Correct 465 ms 73704 KB Output is correct
17 Correct 402 ms 72984 KB Output is correct
18 Correct 386 ms 69500 KB Output is correct
19 Correct 443 ms 73584 KB Output is correct
20 Correct 435 ms 73688 KB Output is correct
21 Correct 434 ms 73784 KB Output is correct
22 Correct 416 ms 73676 KB Output is correct
23 Correct 429 ms 72904 KB Output is correct
24 Correct 373 ms 69588 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2684 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 6 ms 3360 KB Output is correct
20 Correct 5 ms 3284 KB Output is correct
21 Correct 6 ms 3284 KB Output is correct
22 Correct 7 ms 3412 KB Output is correct
23 Correct 13 ms 5716 KB Output is correct
24 Correct 10 ms 5716 KB Output is correct
25 Correct 11 ms 5716 KB Output is correct
26 Correct 12 ms 6028 KB Output is correct
27 Correct 1 ms 2644 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2696 KB Output is correct
30 Correct 7 ms 2956 KB Output is correct
31 Correct 28 ms 3796 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2944 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 3 ms 3028 KB Output is correct
36 Correct 9 ms 3256 KB Output is correct
37 Correct 40 ms 4312 KB Output is correct
38 Correct 6 ms 5640 KB Output is correct
39 Correct 6 ms 5588 KB Output is correct
40 Correct 7 ms 5640 KB Output is correct
41 Correct 16 ms 5888 KB Output is correct
42 Correct 50 ms 7084 KB Output is correct
43 Correct 99 ms 60932 KB Output is correct
44 Correct 98 ms 60912 KB Output is correct
45 Correct 99 ms 61040 KB Output is correct
46 Correct 126 ms 61300 KB Output is correct
47 Correct 215 ms 62560 KB Output is correct
48 Correct 3 ms 3284 KB Output is correct
49 Correct 11 ms 3412 KB Output is correct
50 Correct 37 ms 3980 KB Output is correct
51 Correct 61 ms 4668 KB Output is correct
52 Correct 15 ms 8660 KB Output is correct
53 Correct 21 ms 8736 KB Output is correct
54 Correct 53 ms 9288 KB Output is correct
55 Correct 94 ms 10116 KB Output is correct
56 Correct 51 ms 32436 KB Output is correct
57 Correct 68 ms 32536 KB Output is correct
58 Correct 122 ms 33300 KB Output is correct
59 Correct 182 ms 33980 KB Output is correct
60 Correct 110 ms 62172 KB Output is correct
61 Correct 119 ms 62388 KB Output is correct
62 Correct 180 ms 62992 KB Output is correct
63 Correct 248 ms 63820 KB Output is correct
64 Correct 223 ms 63540 KB Output is correct
65 Correct 322 ms 65996 KB Output is correct
66 Correct 314 ms 65912 KB Output is correct
67 Correct 319 ms 66044 KB Output is correct
68 Correct 321 ms 65992 KB Output is correct
69 Correct 312 ms 65812 KB Output is correct
70 Correct 288 ms 65792 KB Output is correct
71 Correct 360 ms 69064 KB Output is correct
72 Correct 393 ms 68980 KB Output is correct
73 Correct 395 ms 69036 KB Output is correct
74 Correct 352 ms 69004 KB Output is correct
75 Correct 359 ms 68740 KB Output is correct
76 Correct 344 ms 67844 KB Output is correct
77 Correct 423 ms 73772 KB Output is correct
78 Correct 433 ms 73680 KB Output is correct
79 Correct 472 ms 73740 KB Output is correct
80 Correct 465 ms 73704 KB Output is correct
81 Correct 402 ms 72984 KB Output is correct
82 Correct 386 ms 69500 KB Output is correct
83 Correct 443 ms 73584 KB Output is correct
84 Correct 435 ms 73688 KB Output is correct
85 Correct 434 ms 73784 KB Output is correct
86 Correct 416 ms 73676 KB Output is correct
87 Correct 429 ms 72904 KB Output is correct
88 Correct 373 ms 69588 KB Output is correct
89 Correct 346 ms 64988 KB Output is correct
90 Correct 355 ms 65408 KB Output is correct
91 Correct 366 ms 67012 KB Output is correct
92 Correct 355 ms 67032 KB Output is correct
93 Correct 399 ms 69728 KB Output is correct
94 Correct 408 ms 68720 KB Output is correct
95 Correct 456 ms 70660 KB Output is correct
96 Correct 442 ms 69412 KB Output is correct
97 Correct 410 ms 70548 KB Output is correct
98 Correct 442 ms 72788 KB Output is correct
99 Correct 426 ms 70368 KB Output is correct
100 Correct 419 ms 70228 KB Output is correct