oj.uz

Submission #321553

# Submission time Handle Problem Language Result Execution time Memory
321553 2020-11-12T18:15:38 Z soroush Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 432 ms 56728 KB 
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma,tune=native")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int  ,int > pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn  = 2e5+100;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , q;
int lim;
vector < int > a;

struct node{
	int mn = 1e18 , mx = -1e18 , pref = -1e18 , suff = -1e18 , ans = -1e18;
	node operator+ (const node &r) const{
		node Ans;
		Ans.mn = min(mn , r.mn);
		Ans.mx = max(mx , r.mx);
		Ans.pref = max({pref , r.pref , mx - 2*r.mn});
		Ans.suff = max({suff , r.suff ,-2*mn + r.mx});
		Ans.ans = max({ans , r.ans , pref + r.mx , mx + r.suff});
		return(Ans);
	}
};

vector < node > seg; //dicaprio
int lazy[maxn*4];

void build(int v = 1 , int l = 1 , int r = 2*n){
	if(r - l == 1){
		seg[v].mx  = seg[v].mn = a[l];
		seg[v].suff = seg[v].pref = -seg[v].mx;
		seg[v].ans = 0;
		return;
	}
	int mid = (l + r) / 2;
	build(2*v , l , mid);
	build(2*v + 1 , mid , r);
	seg[v] = seg[2*v] + seg[2*v + 1];
}

void shift(int v , int l , int r){
	seg[v].mn += lazy[v] , seg[v].mx += lazy[v];
	seg[v].pref-=lazy[v] , seg[v].suff-=lazy[v];
	if(r - l > 1)
		lazy[2*v] += lazy[v] , lazy[2*v + 1] += lazy[v];
	lazy[v] = 0;
}	

void update(int L ,int R , int val , int v = 1 , int l = 1,  int r = 2*n){
	shift(v , l , r);
	if(R <= l or r <= L)
		return;
	if(L <= l and r <= R){
		lazy[v] += val;
		shift(v , l , r);
		return;
	}
	int mid = (l + r)/2;
	update(L , R , val , 2*v , l , mid);
	update(L , R , val , 2*v + 1 , mid , r);
	seg[v] = seg[2*v] + seg[2*v + 1];
}


vector < pii > adj[maxn];

vector < pair < int , pii > > e;

int P[maxn];

int l [maxn] , r[maxn] , t = 1;

void dfs(int v = 1 , int par = 0 , int h = 0){
	P[v] = par;
	a.pb(h);
	r[v] = l[v] = t++;
	for(auto [u , w] : adj[v])	
		if(u!=par){
			dfs(u , v , h+w);
			a.pb(h);
			r[v] = t++;
		}
}

int32_t main(){
    migmig;
	cin >> n >> q >> lim;
	seg.reserve(maxn*4);
	for(int i = 1 ; i < n ; i ++){
		int u , v , w;
		cin >> u >> v >> w;
		adj[u].pb({v , w});
		adj[v].pb({u , w});
		e.pb({w , {u , v}});
	}
	a.pb(177013);
	dfs();
	build();
	int lst = 0;
	while(q -- ){
		int p , w;
		cin >> p >> w;
		p = (p + lst)%(n - 1);
		w = (w + lst)%lim;
		auto &ed = e[p];
		int diff = w - ed.first;
		int par = ed.second.second;
		if(P[par]!=ed.second.first)par = ed.second.first;
		ed.first = w;
		update(l[par] , r[par]+1 , diff);
		cout << (lst = seg[1].ans) << endl;
	}
    return(0);
}

Compilation message

diameter.cpp: In function 'void dfs(ll, ll, ll)':
diameter.cpp:98:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |  for(auto [u , w] : adj[v])
      |           ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 3 ms 5100 KB Output is correct
7 Correct 3 ms 5120 KB Output is correct
8 Correct 3 ms 5112 KB Output is correct
9 Correct 3 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 3 ms 5228 KB Output is correct
17 Correct 3 ms 5100 KB Output is correct
18 Correct 3 ms 5100 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 3 ms 5100 KB Output is correct
7 Correct 3 ms 5120 KB Output is correct
8 Correct 3 ms 5112 KB Output is correct
9 Correct 3 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 3 ms 5228 KB Output is correct
17 Correct 3 ms 5100 KB Output is correct
18 Correct 3 ms 5100 KB Output is correct
19 Correct 8 ms 5484 KB Output is correct
20 Correct 9 ms 5484 KB Output is correct
21 Correct 10 ms 5484 KB Output is correct
22 Correct 9 ms 5612 KB Output is correct
23 Correct 13 ms 7532 KB Output is correct
24 Correct 13 ms 7532 KB Output is correct
25 Correct 14 ms 7532 KB Output is correct
26 Correct 15 ms 7916 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 13 ms 5356 KB Output is correct
5 Correct 51 ms 6252 KB Output is correct
6 Correct 3 ms 5100 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 5 ms 5356 KB Output is correct
10 Correct 18 ms 5612 KB Output is correct
11 Correct 78 ms 6636 KB Output is correct
12 Correct 6 ms 7276 KB Output is correct
13 Correct 9 ms 7404 KB Output is correct
14 Correct 9 ms 7404 KB Output is correct
15 Correct 26 ms 7788 KB Output is correct
16 Correct 98 ms 8812 KB Output is correct
17 Correct 58 ms 40272 KB Output is correct
18 Correct 66 ms 41424 KB Output is correct
19 Correct 62 ms 43872 KB Output is correct
20 Correct 92 ms 44372 KB Output is correct
21 Correct 246 ms 45648 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5484 KB Output is correct
2 Correct 14 ms 5612 KB Output is correct
3 Correct 54 ms 6124 KB Output is correct
4 Correct 104 ms 6764 KB Output is correct
5 Correct 12 ms 9768 KB Output is correct
6 Correct 24 ms 9896 KB Output is correct
7 Correct 79 ms 10664 KB Output is correct
8 Correct 143 ms 11304 KB Output is correct
9 Correct 38 ms 24992 KB Output is correct
10 Correct 52 ms 25248 KB Output is correct
11 Correct 127 ms 25888 KB Output is correct
12 Correct 213 ms 26784 KB Output is correct
13 Correct 69 ms 44312 KB Output is correct
14 Correct 87 ms 45208 KB Output is correct
15 Correct 172 ms 45976 KB Output is correct
16 Correct 269 ms 46744 KB Output is correct
17 Correct 260 ms 46488 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 48976 KB Output is correct
2 Correct 352 ms 48992 KB Output is correct
3 Correct 352 ms 49048 KB Output is correct
4 Correct 341 ms 49008 KB Output is correct
5 Correct 346 ms 48536 KB Output is correct
6 Correct 312 ms 46608 KB Output is correct
7 Correct 368 ms 52120 KB Output is correct
8 Correct 366 ms 51992 KB Output is correct
9 Correct 391 ms 52048 KB Output is correct
10 Correct 359 ms 51864 KB Output is correct
11 Correct 355 ms 51480 KB Output is correct
12 Correct 341 ms 48796 KB Output is correct
13 Correct 426 ms 56580 KB Output is correct
14 Correct 414 ms 56728 KB Output is correct
15 Correct 419 ms 56600 KB Output is correct
16 Correct 424 ms 56600 KB Output is correct
17 Correct 432 ms 55576 KB Output is correct
18 Correct 398 ms 50536 KB Output is correct
19 Correct 409 ms 56600 KB Output is correct
20 Correct 428 ms 56600 KB Output is correct
21 Correct 422 ms 56728 KB Output is correct
22 Correct 416 ms 56600 KB Output is correct
23 Correct 426 ms 55576 KB Output is correct
24 Correct 394 ms 50444 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 3 ms 5100 KB Output is correct
7 Correct 3 ms 5120 KB Output is correct
8 Correct 3 ms 5112 KB Output is correct
9 Correct 3 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 3 ms 5228 KB Output is correct
17 Correct 3 ms 5100 KB Output is correct
18 Correct 3 ms 5100 KB Output is correct
19 Correct 8 ms 5484 KB Output is correct
20 Correct 9 ms 5484 KB Output is correct
21 Correct 10 ms 5484 KB Output is correct
22 Correct 9 ms 5612 KB Output is correct
23 Correct 13 ms 7532 KB Output is correct
24 Correct 13 ms 7532 KB Output is correct
25 Correct 14 ms 7532 KB Output is correct
26 Correct 15 ms 7916 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 3 ms 5100 KB Output is correct
29 Correct 4 ms 5100 KB Output is correct
30 Correct 13 ms 5356 KB Output is correct
31 Correct 51 ms 6252 KB Output is correct
32 Correct 3 ms 5100 KB Output is correct
33 Correct 4 ms 5228 KB Output is correct
34 Correct 4 ms 5228 KB Output is correct
35 Correct 5 ms 5356 KB Output is correct
36 Correct 18 ms 5612 KB Output is correct
37 Correct 78 ms 6636 KB Output is correct
38 Correct 6 ms 7276 KB Output is correct
39 Correct 9 ms 7404 KB Output is correct
40 Correct 9 ms 7404 KB Output is correct
41 Correct 26 ms 7788 KB Output is correct
42 Correct 98 ms 8812 KB Output is correct
43 Correct 58 ms 40272 KB Output is correct
44 Correct 66 ms 41424 KB Output is correct
45 Correct 62 ms 43872 KB Output is correct
46 Correct 92 ms 44372 KB Output is correct
47 Correct 246 ms 45648 KB Output is correct
48 Correct 5 ms 5484 KB Output is correct
49 Correct 14 ms 5612 KB Output is correct
50 Correct 54 ms 6124 KB Output is correct
51 Correct 104 ms 6764 KB Output is correct
52 Correct 12 ms 9768 KB Output is correct
53 Correct 24 ms 9896 KB Output is correct
54 Correct 79 ms 10664 KB Output is correct
55 Correct 143 ms 11304 KB Output is correct
56 Correct 38 ms 24992 KB Output is correct
57 Correct 52 ms 25248 KB Output is correct
58 Correct 127 ms 25888 KB Output is correct
59 Correct 213 ms 26784 KB Output is correct
60 Correct 69 ms 44312 KB Output is correct
61 Correct 87 ms 45208 KB Output is correct
62 Correct 172 ms 45976 KB Output is correct
63 Correct 269 ms 46744 KB Output is correct
64 Correct 260 ms 46488 KB Output is correct
65 Correct 344 ms 48976 KB Output is correct
66 Correct 352 ms 48992 KB Output is correct
67 Correct 352 ms 49048 KB Output is correct
68 Correct 341 ms 49008 KB Output is correct
69 Correct 346 ms 48536 KB Output is correct
70 Correct 312 ms 46608 KB Output is correct
71 Correct 368 ms 52120 KB Output is correct
72 Correct 366 ms 51992 KB Output is correct
73 Correct 391 ms 52048 KB Output is correct
74 Correct 359 ms 51864 KB Output is correct
75 Correct 355 ms 51480 KB Output is correct
76 Correct 341 ms 48796 KB Output is correct
77 Correct 426 ms 56580 KB Output is correct
78 Correct 414 ms 56728 KB Output is correct
79 Correct 419 ms 56600 KB Output is correct
80 Correct 424 ms 56600 KB Output is correct
81 Correct 432 ms 55576 KB Output is correct
82 Correct 398 ms 50536 KB Output is correct
83 Correct 409 ms 56600 KB Output is correct
84 Correct 428 ms 56600 KB Output is correct
85 Correct 422 ms 56728 KB Output is correct
86 Correct 416 ms 56600 KB Output is correct
87 Correct 426 ms 55576 KB Output is correct
88 Correct 394 ms 50444 KB Output is correct
89 Correct 338 ms 48024 KB Output is correct
90 Correct 331 ms 48536 KB Output is correct
91 Correct 352 ms 50352 KB Output is correct
92 Correct 363 ms 49996 KB Output is correct
93 Correct 379 ms 52760 KB Output is correct
94 Correct 380 ms 51828 KB Output is correct
95 Correct 407 ms 53688 KB Output is correct
96 Correct 405 ms 52508 KB Output is correct
97 Correct 409 ms 53528 KB Output is correct
98 Correct 408 ms 55960 KB Output is correct
99 Correct 406 ms 53340 KB Output is correct
100 Correct 398 ms 53144 KB Output is correct