Submission #286459

# Submission time Handle Problem Language Result Execution time Memory
286459 2020-08-30T12:29:31 Z errorgorn Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
814 ms 57852 KB
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

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

struct node{
	int s,e,m;
	ll a=0,b=0,c=0,ab=0,bc=0,abc=0,lazy=0;
	node *l,*r;
	
	node (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		
		if (s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	
	void propo(){
		if (lazy){
			a+=lazy;
			b-=lazy*2;
			c+=lazy;
			ab-=lazy;
			bc-=lazy;
			
			if (s!=e){
				l->lazy+=lazy;
				r->lazy+=lazy;
			}
			
			lazy=0;
		}
	}
	
	void update(int i,int j,ll k){
		if (s==i && e==j) lazy+=k;
		else{
			if (j<=m) l->update(i,j,k);
			else if (m<i) r->update(i,j,k);
			else l->update(i,m,k),r->update(m+1,j,k);
			
			l->propo(),r->propo();
			
			a=max(l->a,r->a);
			b=max(l->b,r->b);
			c=max(l->c,r->c);
			ab=max({l->ab,r->ab,l->a+r->b});
			bc=max({l->bc,r->bc,l->b+r->c});
			abc=max({l->abc,r->abc,l->a+r->bc,l->ab+r->c});
		}
	}
} *root=new node(0,200005);

ll n,q,w0;

vector<ii> al[100005];
ll w[100005];
int id[100005]; //assoc weight to node

int in[100005];
int out[100005];

int TIME=0;

void dfs(int i,int p){
	in[i]=TIME++;
	for (auto &it:al[i]){
		if (it.fi==p) continue;
		dfs(it.fi,i);
		id[it.se]=it.fi;
		out[i]=TIME++;
	}
	if (out[i]==0) out[i]=in[i];
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	
	cin>>n>>q>>w0;
	
	ll a,b,c;
	rep(x,0,n-1){
		cin>>a>>b>>c;
		al[a].push_back(ii(b,x));
		al[b].push_back(ii(a,x));
		
		w[x]=c;
	}
	dfs(1,-1);
	
	rep(x,0,n-1){
		root->update(in[id[x]],out[id[x]],w[x]);
	}
	
	ll lastans=0;
	while (q--){
		cin>>a>>b;
		a=(a+lastans)%(n-1),b=(b+lastans)%w0;
		
		root->update(in[id[a]],out[id[a]],b-w[a]);
		w[a]=b;
		
		lastans=root->abc;
		cout<<lastans<<endl;
	}
}

Compilation message

diameter.cpp: In constructor 'node::node(int, int)':
diameter.cpp:34:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |   s=_s,e=_e,m=s+e>>1;
      |               ~^~
# Verdict Execution time Memory Grader output
1 Correct 32 ms 40320 KB Output is correct
2 Correct 30 ms 40312 KB Output is correct
3 Correct 31 ms 40320 KB Output is correct
4 Correct 31 ms 40320 KB Output is correct
5 Correct 30 ms 40320 KB Output is correct
6 Correct 31 ms 40300 KB Output is correct
7 Correct 31 ms 40312 KB Output is correct
8 Correct 30 ms 40312 KB Output is correct
9 Correct 31 ms 40320 KB Output is correct
10 Correct 30 ms 40312 KB Output is correct
11 Correct 31 ms 40312 KB Output is correct
12 Correct 30 ms 40312 KB Output is correct
13 Correct 31 ms 40320 KB Output is correct
14 Correct 30 ms 40312 KB Output is correct
15 Correct 30 ms 40320 KB Output is correct
16 Correct 30 ms 40312 KB Output is correct
17 Correct 30 ms 40312 KB Output is correct
18 Correct 30 ms 40296 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 32 ms 40320 KB Output is correct
2 Correct 30 ms 40312 KB Output is correct
3 Correct 31 ms 40320 KB Output is correct
4 Correct 31 ms 40320 KB Output is correct
5 Correct 30 ms 40320 KB Output is correct
6 Correct 31 ms 40300 KB Output is correct
7 Correct 31 ms 40312 KB Output is correct
8 Correct 30 ms 40312 KB Output is correct
9 Correct 31 ms 40320 KB Output is correct
10 Correct 30 ms 40312 KB Output is correct
11 Correct 31 ms 40312 KB Output is correct
12 Correct 30 ms 40312 KB Output is correct
13 Correct 31 ms 40320 KB Output is correct
14 Correct 30 ms 40312 KB Output is correct
15 Correct 30 ms 40320 KB Output is correct
16 Correct 30 ms 40312 KB Output is correct
17 Correct 30 ms 40312 KB Output is correct
18 Correct 30 ms 40296 KB Output is correct
19 Correct 38 ms 40440 KB Output is correct
20 Correct 36 ms 40440 KB Output is correct
21 Correct 37 ms 40440 KB Output is correct
22 Correct 37 ms 40440 KB Output is correct
23 Correct 44 ms 40824 KB Output is correct
24 Correct 43 ms 40824 KB Output is correct
25 Correct 45 ms 40864 KB Output is correct
26 Correct 46 ms 41088 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 31 ms 40312 KB Output is correct
2 Correct 31 ms 40312 KB Output is correct
3 Correct 32 ms 40448 KB Output is correct
4 Correct 41 ms 40568 KB Output is correct
5 Correct 87 ms 41464 KB Output is correct
6 Correct 31 ms 40320 KB Output is correct
7 Correct 30 ms 40440 KB Output is correct
8 Correct 30 ms 40312 KB Output is correct
9 Correct 32 ms 40392 KB Output is correct
10 Correct 44 ms 40568 KB Output is correct
11 Correct 103 ms 41592 KB Output is correct
12 Correct 34 ms 40704 KB Output is correct
13 Correct 34 ms 40696 KB Output is correct
14 Correct 35 ms 40776 KB Output is correct
15 Correct 51 ms 41080 KB Output is correct
16 Correct 113 ms 42360 KB Output is correct
17 Correct 104 ms 48104 KB Output is correct
18 Correct 99 ms 48104 KB Output is correct
19 Correct 105 ms 48172 KB Output is correct
20 Correct 130 ms 48624 KB Output is correct
21 Correct 257 ms 49764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 32 ms 40448 KB Output is correct
2 Correct 44 ms 40512 KB Output is correct
3 Correct 84 ms 41096 KB Output is correct
4 Correct 132 ms 41848 KB Output is correct
5 Correct 44 ms 41208 KB Output is correct
6 Correct 53 ms 41340 KB Output is correct
7 Correct 115 ms 41976 KB Output is correct
8 Correct 176 ms 42744 KB Output is correct
9 Correct 87 ms 44792 KB Output is correct
10 Correct 102 ms 44920 KB Output is correct
11 Correct 188 ms 45616 KB Output is correct
12 Correct 280 ms 46456 KB Output is correct
13 Correct 141 ms 49400 KB Output is correct
14 Correct 166 ms 49400 KB Output is correct
15 Correct 259 ms 50168 KB Output is correct
16 Correct 382 ms 51084 KB Output is correct
17 Correct 294 ms 50680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 551 ms 53184 KB Output is correct
2 Correct 537 ms 53240 KB Output is correct
3 Correct 539 ms 53240 KB Output is correct
4 Correct 541 ms 53112 KB Output is correct
5 Correct 528 ms 53108 KB Output is correct
6 Correct 423 ms 52932 KB Output is correct
7 Correct 617 ms 55032 KB Output is correct
8 Correct 652 ms 55032 KB Output is correct
9 Correct 634 ms 55160 KB Output is correct
10 Correct 653 ms 55160 KB Output is correct
11 Correct 607 ms 54916 KB Output is correct
12 Correct 512 ms 54124 KB Output is correct
13 Correct 809 ms 57816 KB Output is correct
14 Correct 811 ms 57704 KB Output is correct
15 Correct 814 ms 57720 KB Output is correct
16 Correct 783 ms 57852 KB Output is correct
17 Correct 778 ms 57448 KB Output is correct
18 Correct 562 ms 55164 KB Output is correct
19 Correct 809 ms 57720 KB Output is correct
20 Correct 787 ms 57720 KB Output is correct
21 Correct 794 ms 57848 KB Output is correct
22 Correct 787 ms 57848 KB Output is correct
23 Correct 749 ms 57496 KB Output is correct
24 Correct 574 ms 55272 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 32 ms 40320 KB Output is correct
2 Correct 30 ms 40312 KB Output is correct
3 Correct 31 ms 40320 KB Output is correct
4 Correct 31 ms 40320 KB Output is correct
5 Correct 30 ms 40320 KB Output is correct
6 Correct 31 ms 40300 KB Output is correct
7 Correct 31 ms 40312 KB Output is correct
8 Correct 30 ms 40312 KB Output is correct
9 Correct 31 ms 40320 KB Output is correct
10 Correct 30 ms 40312 KB Output is correct
11 Correct 31 ms 40312 KB Output is correct
12 Correct 30 ms 40312 KB Output is correct
13 Correct 31 ms 40320 KB Output is correct
14 Correct 30 ms 40312 KB Output is correct
15 Correct 30 ms 40320 KB Output is correct
16 Correct 30 ms 40312 KB Output is correct
17 Correct 30 ms 40312 KB Output is correct
18 Correct 30 ms 40296 KB Output is correct
19 Correct 38 ms 40440 KB Output is correct
20 Correct 36 ms 40440 KB Output is correct
21 Correct 37 ms 40440 KB Output is correct
22 Correct 37 ms 40440 KB Output is correct
23 Correct 44 ms 40824 KB Output is correct
24 Correct 43 ms 40824 KB Output is correct
25 Correct 45 ms 40864 KB Output is correct
26 Correct 46 ms 41088 KB Output is correct
27 Correct 31 ms 40312 KB Output is correct
28 Correct 31 ms 40312 KB Output is correct
29 Correct 32 ms 40448 KB Output is correct
30 Correct 41 ms 40568 KB Output is correct
31 Correct 87 ms 41464 KB Output is correct
32 Correct 31 ms 40320 KB Output is correct
33 Correct 30 ms 40440 KB Output is correct
34 Correct 30 ms 40312 KB Output is correct
35 Correct 32 ms 40392 KB Output is correct
36 Correct 44 ms 40568 KB Output is correct
37 Correct 103 ms 41592 KB Output is correct
38 Correct 34 ms 40704 KB Output is correct
39 Correct 34 ms 40696 KB Output is correct
40 Correct 35 ms 40776 KB Output is correct
41 Correct 51 ms 41080 KB Output is correct
42 Correct 113 ms 42360 KB Output is correct
43 Correct 104 ms 48104 KB Output is correct
44 Correct 99 ms 48104 KB Output is correct
45 Correct 105 ms 48172 KB Output is correct
46 Correct 130 ms 48624 KB Output is correct
47 Correct 257 ms 49764 KB Output is correct
48 Correct 32 ms 40448 KB Output is correct
49 Correct 44 ms 40512 KB Output is correct
50 Correct 84 ms 41096 KB Output is correct
51 Correct 132 ms 41848 KB Output is correct
52 Correct 44 ms 41208 KB Output is correct
53 Correct 53 ms 41340 KB Output is correct
54 Correct 115 ms 41976 KB Output is correct
55 Correct 176 ms 42744 KB Output is correct
56 Correct 87 ms 44792 KB Output is correct
57 Correct 102 ms 44920 KB Output is correct
58 Correct 188 ms 45616 KB Output is correct
59 Correct 280 ms 46456 KB Output is correct
60 Correct 141 ms 49400 KB Output is correct
61 Correct 166 ms 49400 KB Output is correct
62 Correct 259 ms 50168 KB Output is correct
63 Correct 382 ms 51084 KB Output is correct
64 Correct 294 ms 50680 KB Output is correct
65 Correct 551 ms 53184 KB Output is correct
66 Correct 537 ms 53240 KB Output is correct
67 Correct 539 ms 53240 KB Output is correct
68 Correct 541 ms 53112 KB Output is correct
69 Correct 528 ms 53108 KB Output is correct
70 Correct 423 ms 52932 KB Output is correct
71 Correct 617 ms 55032 KB Output is correct
72 Correct 652 ms 55032 KB Output is correct
73 Correct 634 ms 55160 KB Output is correct
74 Correct 653 ms 55160 KB Output is correct
75 Correct 607 ms 54916 KB Output is correct
76 Correct 512 ms 54124 KB Output is correct
77 Correct 809 ms 57816 KB Output is correct
78 Correct 811 ms 57704 KB Output is correct
79 Correct 814 ms 57720 KB Output is correct
80 Correct 783 ms 57852 KB Output is correct
81 Correct 778 ms 57448 KB Output is correct
82 Correct 562 ms 55164 KB Output is correct
83 Correct 809 ms 57720 KB Output is correct
84 Correct 787 ms 57720 KB Output is correct
85 Correct 794 ms 57848 KB Output is correct
86 Correct 787 ms 57848 KB Output is correct
87 Correct 749 ms 57496 KB Output is correct
88 Correct 574 ms 55272 KB Output is correct
89 Correct 509 ms 52172 KB Output is correct
90 Correct 526 ms 52472 KB Output is correct
91 Correct 585 ms 53496 KB Output is correct
92 Correct 629 ms 53624 KB Output is correct
93 Correct 660 ms 55288 KB Output is correct
94 Correct 756 ms 54648 KB Output is correct
95 Correct 797 ms 55672 KB Output is correct
96 Correct 781 ms 55032 KB Output is correct
97 Correct 783 ms 55544 KB Output is correct
98 Correct 790 ms 56952 KB Output is correct
99 Correct 786 ms 55424 KB Output is correct
100 Correct 771 ms 55288 KB Output is correct