oj.uz

Submission #884735

# Submission time Handle Problem Language Result Execution time Memory
884735 2023-12-08T09:48:41 Z arashMLG Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 338 ms 157012 KB 
#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;

typedef long long     ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;


const int N = 1e6+ 23;
const ll inf = 1e18;

#define F           first
#define S           second
#define pb          push_back
#define kill(x)     cout<<x<<endl, exit(0);
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define lc          (v << 1)
#define rc          ((v<<1) |1)
#define int         ll

struct node {
	int diam;
	int leftMax;
	int rightMax;
	int mxh,mnh;
	int lz;
	
	void set(int h) {
		diam = 0;
		leftMax = -h;
		rightMax = -h;
		mxh = h,mnh = h;
		lz = 0;
	}
	
	
	void merge(node a,node b) {
		mxh = max(a.mxh,b.mxh);
		mnh = min(a.mnh,b.mnh);
		
		leftMax = max({a.leftMax, b.leftMax ,b.mxh - 2*a.mnh});
		rightMax =max({a.rightMax,b.rightMax,a.mxh - 2*b.mnh});
		
		diam = max({ a.diam, b.diam, a.rightMax + b.mxh , b.leftMax+ a.mxh});
	}
} t[N<<2];

int n,q;
int h[N];
int st[N],ft[N];
int what[N];

void build(int v=1,int tl =0,int tr= N) {
	if(tr-tl == 1) {
		t[v].set(h[what[tl]]);
		return;
	}
	int mid=(tl+tr)/2;
	build(lc,tl,mid);
	build(rc,mid,tr);
	t[v].merge(t[lc],t[rc]);
	//debug(tl,tr,t[v].diam,t[v].leftMax,t[v].rightMax);
}

void shift(int v) {
	int x = t[v].lz;
	t[lc].leftMax -= x;
	t[lc].rightMax -= x;
	t[lc].mxh += x;
	t[lc].mnh += x;
	t[lc].lz += x;
	t[rc].leftMax -= x;
	t[rc].rightMax -= x;
	t[rc].mxh += x;
	t[rc].mnh += x;
	t[rc].lz += x;
	t[v].lz = 0;
}

void upd(int l,int r,int x,int v=1,int tl=0,int tr =N) {
	if(l > r) return;
	if(l == tl && r == tr-1) {
		t[v].leftMax -= x;
		t[v].rightMax -= x;
		t[v].mxh += x;
		t[v].mnh += x;
		t[v].lz += x;
		return;
	}
	shift(v);
	int mid=(tl + tr)/2;
	upd(l,min(mid-1,r),x,lc,tl,mid);
	upd(max(l,mid),r,x,rc,mid,tr);
	t[v].merge(t[lc],t[rc]);
}

int W;
int w[N];
int ver[N];
vector<pll> G[N];
int timer;

void dfs(int v,int p =-1) {
	what[timer] = v;
	st[v] = timer ++;
	for(auto [u,id] : G[v]) if(u != p) {
		ver[id] = u;
		h[u] = h[v] + w[id];
		dfs(u,v);
		what[timer] = v;
		ft[v]= timer ++;
	}
	
	what[timer] = v;
	ft[v]= timer ++;
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>q>>W;
	int last= 0;
	for(int i = 0; i<n-1 ; i ++) {
		int v,u; cin>>v>>u>>w[i];
		G[v].pb({u,i});
		G[u].pb({v,i});
	}
	dfs(1);
	build();
	debug(t[1].diam);
	while(q--) {
		int e,d; cin>>e>>d;
		e= (e + last) % (n-1);
		d= (d +last) % W;
		int v= ver[e];
		//debug(st[v],ft[v]);
		upd(st[v],ft[v],-w[e]);
		w[e] = d;
		upd(st[v],ft[v],w[e]);
		last = t[1].diam;
		cout<<last << '\n';
	}
	
	return 0;
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:5:20: warning: statement has no effect [-Wunused-value]
    5 | #define debug(...) 69
      |                    ^~
diameter.cpp:135:2: note: in expansion of macro 'debug'
  135 |  debug(t[1].diam);
      |  ^~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 133980 KB Output is correct
2 Correct 27 ms 133980 KB Output is correct
3 Correct 28 ms 133856 KB Output is correct
4 Correct 27 ms 133980 KB Output is correct
5 Correct 27 ms 133968 KB Output is correct
6 Correct 32 ms 133952 KB Output is correct
7 Correct 27 ms 133980 KB Output is correct
8 Correct 27 ms 133984 KB Output is correct
9 Correct 28 ms 133972 KB Output is correct
10 Correct 28 ms 133980 KB Output is correct
11 Correct 28 ms 133968 KB Output is correct
12 Correct 27 ms 133980 KB Output is correct
13 Correct 27 ms 133980 KB Output is correct
14 Correct 28 ms 133972 KB Output is correct
15 Correct 27 ms 133976 KB Output is correct
16 Correct 27 ms 133972 KB Output is correct
17 Correct 30 ms 134004 KB Output is correct
18 Correct 30 ms 133972 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 133980 KB Output is correct
2 Correct 27 ms 133980 KB Output is correct
3 Correct 28 ms 133856 KB Output is correct
4 Correct 27 ms 133980 KB Output is correct
5 Correct 27 ms 133968 KB Output is correct
6 Correct 32 ms 133952 KB Output is correct
7 Correct 27 ms 133980 KB Output is correct
8 Correct 27 ms 133984 KB Output is correct
9 Correct 28 ms 133972 KB Output is correct
10 Correct 28 ms 133980 KB Output is correct
11 Correct 28 ms 133968 KB Output is correct
12 Correct 27 ms 133980 KB Output is correct
13 Correct 27 ms 133980 KB Output is correct
14 Correct 28 ms 133972 KB Output is correct
15 Correct 27 ms 133976 KB Output is correct
16 Correct 27 ms 133972 KB Output is correct
17 Correct 30 ms 134004 KB Output is correct
18 Correct 30 ms 133972 KB Output is correct
19 Correct 36 ms 133968 KB Output is correct
20 Correct 37 ms 133968 KB Output is correct
21 Correct 34 ms 134224 KB Output is correct
22 Correct 33 ms 134160 KB Output is correct
23 Correct 35 ms 136280 KB Output is correct
24 Correct 35 ms 136284 KB Output is correct
25 Correct 35 ms 136280 KB Output is correct
26 Correct 35 ms 136548 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 133980 KB Output is correct
2 Correct 30 ms 134224 KB Output is correct
3 Correct 30 ms 133976 KB Output is correct
4 Correct 42 ms 133976 KB Output is correct
5 Correct 104 ms 134440 KB Output is correct
6 Correct 27 ms 133880 KB Output is correct
7 Correct 33 ms 133976 KB Output is correct
8 Correct 30 ms 133968 KB Output is correct
9 Correct 29 ms 134028 KB Output is correct
10 Correct 50 ms 133976 KB Output is correct
11 Correct 104 ms 134384 KB Output is correct
12 Correct 29 ms 136284 KB Output is correct
13 Correct 28 ms 136284 KB Output is correct
14 Correct 31 ms 136348 KB Output is correct
15 Correct 45 ms 136280 KB Output is correct
16 Correct 109 ms 136888 KB Output is correct
17 Correct 59 ms 145600 KB Output is correct
18 Correct 50 ms 145548 KB Output is correct
19 Correct 52 ms 145564 KB Output is correct
20 Correct 71 ms 145752 KB Output is correct
21 Correct 161 ms 147348 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 133968 KB Output is correct
2 Correct 37 ms 133980 KB Output is correct
3 Correct 76 ms 134264 KB Output is correct
4 Correct 125 ms 134576 KB Output is correct
5 Correct 31 ms 136528 KB Output is correct
6 Correct 41 ms 136528 KB Output is correct
7 Correct 82 ms 136904 KB Output is correct
8 Correct 133 ms 138324 KB Output is correct
9 Correct 42 ms 139860 KB Output is correct
10 Correct 53 ms 140116 KB Output is correct
11 Correct 104 ms 140624 KB Output is correct
12 Correct 160 ms 141496 KB Output is correct
13 Correct 64 ms 147800 KB Output is correct
14 Correct 69 ms 148160 KB Output is correct
15 Correct 122 ms 148796 KB Output is correct
16 Correct 177 ms 149632 KB Output is correct
17 Correct 168 ms 149584 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 147584 KB Output is correct
2 Correct 199 ms 149844 KB Output is correct
3 Correct 198 ms 149840 KB Output is correct
4 Correct 204 ms 149844 KB Output is correct
5 Correct 222 ms 149704 KB Output is correct
6 Correct 185 ms 149704 KB Output is correct
7 Correct 226 ms 152352 KB Output is correct
8 Correct 238 ms 152476 KB Output is correct
9 Correct 287 ms 152276 KB Output is correct
10 Correct 217 ms 152392 KB Output is correct
11 Correct 225 ms 152184 KB Output is correct
12 Correct 208 ms 151328 KB Output is correct
13 Correct 274 ms 156212 KB Output is correct
14 Correct 281 ms 156240 KB Output is correct
15 Correct 282 ms 156036 KB Output is correct
16 Correct 331 ms 155984 KB Output is correct
17 Correct 268 ms 155480 KB Output is correct
18 Correct 228 ms 152516 KB Output is correct
19 Correct 259 ms 156248 KB Output is correct
20 Correct 338 ms 156240 KB Output is correct
21 Correct 262 ms 156240 KB Output is correct
22 Correct 291 ms 156072 KB Output is correct
23 Correct 263 ms 155420 KB Output is correct
24 Correct 269 ms 152668 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 133980 KB Output is correct
2 Correct 27 ms 133980 KB Output is correct
3 Correct 28 ms 133856 KB Output is correct
4 Correct 27 ms 133980 KB Output is correct
5 Correct 27 ms 133968 KB Output is correct
6 Correct 32 ms 133952 KB Output is correct
7 Correct 27 ms 133980 KB Output is correct
8 Correct 27 ms 133984 KB Output is correct
9 Correct 28 ms 133972 KB Output is correct
10 Correct 28 ms 133980 KB Output is correct
11 Correct 28 ms 133968 KB Output is correct
12 Correct 27 ms 133980 KB Output is correct
13 Correct 27 ms 133980 KB Output is correct
14 Correct 28 ms 133972 KB Output is correct
15 Correct 27 ms 133976 KB Output is correct
16 Correct 27 ms 133972 KB Output is correct
17 Correct 30 ms 134004 KB Output is correct
18 Correct 30 ms 133972 KB Output is correct
19 Correct 36 ms 133968 KB Output is correct
20 Correct 37 ms 133968 KB Output is correct
21 Correct 34 ms 134224 KB Output is correct
22 Correct 33 ms 134160 KB Output is correct
23 Correct 35 ms 136280 KB Output is correct
24 Correct 35 ms 136284 KB Output is correct
25 Correct 35 ms 136280 KB Output is correct
26 Correct 35 ms 136548 KB Output is correct
27 Correct 27 ms 133980 KB Output is correct
28 Correct 30 ms 134224 KB Output is correct
29 Correct 30 ms 133976 KB Output is correct
30 Correct 42 ms 133976 KB Output is correct
31 Correct 104 ms 134440 KB Output is correct
32 Correct 27 ms 133880 KB Output is correct
33 Correct 33 ms 133976 KB Output is correct
34 Correct 30 ms 133968 KB Output is correct
35 Correct 29 ms 134028 KB Output is correct
36 Correct 50 ms 133976 KB Output is correct
37 Correct 104 ms 134384 KB Output is correct
38 Correct 29 ms 136284 KB Output is correct
39 Correct 28 ms 136284 KB Output is correct
40 Correct 31 ms 136348 KB Output is correct
41 Correct 45 ms 136280 KB Output is correct
42 Correct 109 ms 136888 KB Output is correct
43 Correct 59 ms 145600 KB Output is correct
44 Correct 50 ms 145548 KB Output is correct
45 Correct 52 ms 145564 KB Output is correct
46 Correct 71 ms 145752 KB Output is correct
47 Correct 161 ms 147348 KB Output is correct
48 Correct 28 ms 133968 KB Output is correct
49 Correct 37 ms 133980 KB Output is correct
50 Correct 76 ms 134264 KB Output is correct
51 Correct 125 ms 134576 KB Output is correct
52 Correct 31 ms 136528 KB Output is correct
53 Correct 41 ms 136528 KB Output is correct
54 Correct 82 ms 136904 KB Output is correct
55 Correct 133 ms 138324 KB Output is correct
56 Correct 42 ms 139860 KB Output is correct
57 Correct 53 ms 140116 KB Output is correct
58 Correct 104 ms 140624 KB Output is correct
59 Correct 160 ms 141496 KB Output is correct
60 Correct 64 ms 147800 KB Output is correct
61 Correct 69 ms 148160 KB Output is correct
62 Correct 122 ms 148796 KB Output is correct
63 Correct 177 ms 149632 KB Output is correct
64 Correct 168 ms 149584 KB Output is correct
65 Correct 202 ms 147584 KB Output is correct
66 Correct 199 ms 149844 KB Output is correct
67 Correct 198 ms 149840 KB Output is correct
68 Correct 204 ms 149844 KB Output is correct
69 Correct 222 ms 149704 KB Output is correct
70 Correct 185 ms 149704 KB Output is correct
71 Correct 226 ms 152352 KB Output is correct
72 Correct 238 ms 152476 KB Output is correct
73 Correct 287 ms 152276 KB Output is correct
74 Correct 217 ms 152392 KB Output is correct
75 Correct 225 ms 152184 KB Output is correct
76 Correct 208 ms 151328 KB Output is correct
77 Correct 274 ms 156212 KB Output is correct
78 Correct 281 ms 156240 KB Output is correct
79 Correct 282 ms 156036 KB Output is correct
80 Correct 331 ms 155984 KB Output is correct
81 Correct 268 ms 155480 KB Output is correct
82 Correct 228 ms 152516 KB Output is correct
83 Correct 259 ms 156248 KB Output is correct
84 Correct 338 ms 156240 KB Output is correct
85 Correct 262 ms 156240 KB Output is correct
86 Correct 291 ms 156072 KB Output is correct
87 Correct 263 ms 155420 KB Output is correct
88 Correct 269 ms 152668 KB Output is correct
89 Correct 205 ms 150832 KB Output is correct
90 Correct 214 ms 151112 KB Output is correct
91 Correct 251 ms 152340 KB Output is correct
92 Correct 225 ms 152308 KB Output is correct
93 Correct 309 ms 154652 KB Output is correct
94 Correct 236 ms 153892 KB Output is correct
95 Correct 323 ms 155328 KB Output is correct
96 Correct 277 ms 154452 KB Output is correct
97 Correct 298 ms 155476 KB Output is correct
98 Correct 270 ms 157012 KB Output is correct
99 Correct 298 ms 154952 KB Output is correct
100 Correct 252 ms 155008 KB Output is correct