oj.uz

Submission #952447

# Submission time Handle Problem Language Result Execution time Memory
952447 2024-03-24T01:43:29 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 207 ms 80584 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define int long long
#define s second
#define pii pair<int,int>
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
	
const int N = 1e6 + 5;
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
 
int n,m,k;
vector<tuple<int,int,int>>g[N];
vector<int>edge;
 
struct st{
	int pref,suff,sum,ans,all,usuff,upref;
};
 
st t[N*4];
pii p[N*4];
 
void dfs(int x, int pr){
	
	for(auto [to,w,ind] : g[x]){
		if(to == pr)continue;
		edge.pb(w);
		p[ind].f = edge.size();
		dfs(to,x);
		edge.pb(-w);
		p[ind].s = edge.size();
	}
 
}
 
void merge(int ind){
	#define seg t
	#define allans all
	#define prefans upref
	#define suffans usuff
	
	seg[ind].pref=max(seg[2*ind].pref, seg[2*ind].sum+seg[2*ind+1].pref);
    
	seg[ind].suff=max(seg[2*ind+1].suff, -seg[2*ind+1].sum+seg[2*ind].suff);
 
	seg[ind].sum=seg[2*ind].sum+seg[2*ind+1].sum;
 
	seg[ind].allans=max(seg[2*ind].allans+seg[2*ind+1].sum, -seg[2*ind].sum+seg[2*ind+1].allans);
 
	seg[ind].prefans=max({seg[2*ind].prefans, seg[2*ind].allans+seg[2*ind+1].pref, -seg[2*ind].sum+seg[2*ind+1].prefans});
	
	seg[ind].suffans=max({seg[2*ind+1].suffans, seg[2*ind+1].allans+seg[2*ind].suff, seg[2*ind+1].sum+seg[2*ind].suffans});
 
	seg[ind].ans=max({seg[2*ind].ans, seg[2*ind+1].ans, seg[2*ind].suffans+seg[2*ind+1].pref, seg[2*ind].suff+seg[2*ind+1].prefans});
	
}
 
void build(int l, int r, int ind){
 
    if(r==l){
        t[ind].pref=max(0LL, edge[l-1]);
        t[ind].suff=max(0LL, -edge[l-1]);
		t[ind].ans=t[ind].upref=t[ind].usuff=t[ind].all=abs(edge[l-1]);
		t[ind].sum=edge[l-1];
    }
    else{
		int mid=(r+l)>>1;
		build(l, mid, 2*ind); build(mid+1, r, 2*ind+1);
	 
		merge(ind);
	}/*
    cout << ind << "\n";
    cout<<seg[ind].pref<<"\n"<<seg[ind].suff<<"\n"<<seg[ind].sum<<"\n"<<seg[ind].allans<<"\n"<<seg[ind].prefans<<"\n"<<seg[ind].suffans<<"\n"<<seg[ind].ans<<"\n";
    cout << "\n";*/
}
 
void update(int tl, int tr, int v, int pos, int val){
	
	if(tl == tr){
		t[v].pref = max(0ll, val);
		t[v].suff = max(0ll, -val); 
		
		t[v].sum = val;
		
		t[v].all = abs(val);
		t[v].upref = abs(val);
		t[v].usuff = abs(val);
		t[v].ans = abs(val);
		return;
	}
 
	int tm = (tl+tr)/2;
	
	if(pos <= tm){
		update(tl,tm,v*2,pos,val);
	}
	else update(tm+1,tr,v*2+1,pos,val);
	
	merge(v);
	
}
 
void solve(){
	
	cin >> n >> m >> k;
	
	for(int i = 1;i<n;i++){
		int a,b,c;
		cin >> a >> b >> c;
		g[a].pb({b,c,i-1});
		g[b].pb({a,c,i-1});
	}
	
	dfs(1,-1);
	
	build(1,edge.size(),1);
	
	/* int ind = 1;
	cout << t[ind].pref<<"\n" << t[ind].suff<<"\n" << t[ind].sum<<"\n" << t[ind].all<<"\n" << t[ind].upref<<"\n" << t[ind].usuff<<"\n" << t[ind].ans<<"\n";*/
	
	//etu huyni ya daje ne sam zakonchil, pizdec, chas nochi, poydu podrochu
	
	int last = 0;
	
	while(m--){
		int a,b;
		cin >> a >> b;
		a = (a+last)%(n-1);
		b = (b+last)%k;
		update(1,edge.size(),1,p[a].f,b);
		update(1,edge.size(),1,p[a].s,-b);
		//~ cout << p[a].f<<" "<<p[a].s<<"\n";
		cout << t[1].ans<<"\n";
		last = t[1].ans;
	}
	
}
/*
// Success consists of going from failure to failure without loss of enthusiasm
// Problems means that you are trying
// Soberis dolboyeb
*/
signed main()
{
	
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26712 KB Output is correct
2 Correct 9 ms 26460 KB Output is correct
3 Correct 7 ms 26460 KB Output is correct
4 Correct 7 ms 26460 KB Output is correct
5 Correct 6 ms 26460 KB Output is correct
6 Correct 7 ms 26460 KB Output is correct
7 Correct 6 ms 26460 KB Output is correct
8 Correct 6 ms 26488 KB Output is correct
9 Correct 6 ms 26460 KB Output is correct
10 Correct 6 ms 26460 KB Output is correct
11 Correct 7 ms 26460 KB Output is correct
12 Correct 6 ms 26460 KB Output is correct
13 Correct 6 ms 26456 KB Output is correct
14 Correct 6 ms 26456 KB Output is correct
15 Correct 6 ms 26712 KB Output is correct
16 Correct 6 ms 26456 KB Output is correct
17 Correct 6 ms 26460 KB Output is correct
18 Correct 6 ms 26460 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26712 KB Output is correct
2 Correct 9 ms 26460 KB Output is correct
3 Correct 7 ms 26460 KB Output is correct
4 Correct 7 ms 26460 KB Output is correct
5 Correct 6 ms 26460 KB Output is correct
6 Correct 7 ms 26460 KB Output is correct
7 Correct 6 ms 26460 KB Output is correct
8 Correct 6 ms 26488 KB Output is correct
9 Correct 6 ms 26460 KB Output is correct
10 Correct 6 ms 26460 KB Output is correct
11 Correct 7 ms 26460 KB Output is correct
12 Correct 6 ms 26460 KB Output is correct
13 Correct 6 ms 26456 KB Output is correct
14 Correct 6 ms 26456 KB Output is correct
15 Correct 6 ms 26712 KB Output is correct
16 Correct 6 ms 26456 KB Output is correct
17 Correct 6 ms 26460 KB Output is correct
18 Correct 6 ms 26460 KB Output is correct
19 Correct 12 ms 26460 KB Output is correct
20 Correct 9 ms 26460 KB Output is correct
21 Correct 9 ms 26460 KB Output is correct
22 Correct 9 ms 26712 KB Output is correct
23 Correct 12 ms 29272 KB Output is correct
24 Correct 15 ms 29608 KB Output is correct
25 Correct 12 ms 29276 KB Output is correct
26 Correct 12 ms 29788 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26460 KB Output is correct
2 Correct 7 ms 26460 KB Output is correct
3 Correct 8 ms 26460 KB Output is correct
4 Correct 13 ms 26512 KB Output is correct
5 Correct 35 ms 27444 KB Output is correct
6 Correct 6 ms 26456 KB Output is correct
7 Correct 7 ms 26308 KB Output is correct
8 Correct 6 ms 26460 KB Output is correct
9 Correct 7 ms 26460 KB Output is correct
10 Correct 14 ms 26716 KB Output is correct
11 Correct 45 ms 27732 KB Output is correct
12 Correct 8 ms 29016 KB Output is correct
13 Correct 8 ms 29120 KB Output is correct
14 Correct 9 ms 29128 KB Output is correct
15 Correct 19 ms 29276 KB Output is correct
16 Correct 56 ms 30608 KB Output is correct
17 Correct 47 ms 66820 KB Output is correct
18 Correct 39 ms 67412 KB Output is correct
19 Correct 49 ms 66560 KB Output is correct
20 Correct 55 ms 66808 KB Output is correct
21 Correct 127 ms 68608 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 26460 KB Output is correct
2 Correct 10 ms 26660 KB Output is correct
3 Correct 27 ms 27272 KB Output is correct
4 Correct 48 ms 28132 KB Output is correct
5 Correct 11 ms 31700 KB Output is correct
6 Correct 15 ms 31960 KB Output is correct
7 Correct 37 ms 32464 KB Output is correct
8 Correct 61 ms 33340 KB Output is correct
9 Correct 29 ms 48080 KB Output is correct
10 Correct 31 ms 48336 KB Output is correct
11 Correct 61 ms 47800 KB Output is correct
12 Correct 90 ms 48580 KB Output is correct
13 Correct 47 ms 66444 KB Output is correct
14 Correct 53 ms 66760 KB Output is correct
15 Correct 84 ms 67340 KB Output is correct
16 Correct 127 ms 68088 KB Output is correct
17 Correct 134 ms 68024 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 70288 KB Output is correct
2 Correct 197 ms 70192 KB Output is correct
3 Correct 166 ms 70248 KB Output is correct
4 Correct 165 ms 70212 KB Output is correct
5 Correct 166 ms 70128 KB Output is correct
6 Correct 146 ms 70568 KB Output is correct
7 Correct 173 ms 73848 KB Output is correct
8 Correct 178 ms 74176 KB Output is correct
9 Correct 173 ms 73916 KB Output is correct
10 Correct 186 ms 73812 KB Output is correct
11 Correct 192 ms 73656 KB Output is correct
12 Correct 145 ms 74236 KB Output is correct
13 Correct 191 ms 80528 KB Output is correct
14 Correct 187 ms 80512 KB Output is correct
15 Correct 207 ms 80464 KB Output is correct
16 Correct 191 ms 80424 KB Output is correct
17 Correct 176 ms 79748 KB Output is correct
18 Correct 145 ms 76376 KB Output is correct
19 Correct 180 ms 80576 KB Output is correct
20 Correct 180 ms 80572 KB Output is correct
21 Correct 203 ms 80576 KB Output is correct
22 Correct 195 ms 80584 KB Output is correct
23 Correct 189 ms 79672 KB Output is correct
24 Correct 155 ms 76284 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26712 KB Output is correct
2 Correct 9 ms 26460 KB Output is correct
3 Correct 7 ms 26460 KB Output is correct
4 Correct 7 ms 26460 KB Output is correct
5 Correct 6 ms 26460 KB Output is correct
6 Correct 7 ms 26460 KB Output is correct
7 Correct 6 ms 26460 KB Output is correct
8 Correct 6 ms 26488 KB Output is correct
9 Correct 6 ms 26460 KB Output is correct
10 Correct 6 ms 26460 KB Output is correct
11 Correct 7 ms 26460 KB Output is correct
12 Correct 6 ms 26460 KB Output is correct
13 Correct 6 ms 26456 KB Output is correct
14 Correct 6 ms 26456 KB Output is correct
15 Correct 6 ms 26712 KB Output is correct
16 Correct 6 ms 26456 KB Output is correct
17 Correct 6 ms 26460 KB Output is correct
18 Correct 6 ms 26460 KB Output is correct
19 Correct 12 ms 26460 KB Output is correct
20 Correct 9 ms 26460 KB Output is correct
21 Correct 9 ms 26460 KB Output is correct
22 Correct 9 ms 26712 KB Output is correct
23 Correct 12 ms 29272 KB Output is correct
24 Correct 15 ms 29608 KB Output is correct
25 Correct 12 ms 29276 KB Output is correct
26 Correct 12 ms 29788 KB Output is correct
27 Correct 6 ms 26460 KB Output is correct
28 Correct 7 ms 26460 KB Output is correct
29 Correct 8 ms 26460 KB Output is correct
30 Correct 13 ms 26512 KB Output is correct
31 Correct 35 ms 27444 KB Output is correct
32 Correct 6 ms 26456 KB Output is correct
33 Correct 7 ms 26308 KB Output is correct
34 Correct 6 ms 26460 KB Output is correct
35 Correct 7 ms 26460 KB Output is correct
36 Correct 14 ms 26716 KB Output is correct
37 Correct 45 ms 27732 KB Output is correct
38 Correct 8 ms 29016 KB Output is correct
39 Correct 8 ms 29120 KB Output is correct
40 Correct 9 ms 29128 KB Output is correct
41 Correct 19 ms 29276 KB Output is correct
42 Correct 56 ms 30608 KB Output is correct
43 Correct 47 ms 66820 KB Output is correct
44 Correct 39 ms 67412 KB Output is correct
45 Correct 49 ms 66560 KB Output is correct
46 Correct 55 ms 66808 KB Output is correct
47 Correct 127 ms 68608 KB Output is correct
48 Correct 7 ms 26460 KB Output is correct
49 Correct 10 ms 26660 KB Output is correct
50 Correct 27 ms 27272 KB Output is correct
51 Correct 48 ms 28132 KB Output is correct
52 Correct 11 ms 31700 KB Output is correct
53 Correct 15 ms 31960 KB Output is correct
54 Correct 37 ms 32464 KB Output is correct
55 Correct 61 ms 33340 KB Output is correct
56 Correct 29 ms 48080 KB Output is correct
57 Correct 31 ms 48336 KB Output is correct
58 Correct 61 ms 47800 KB Output is correct
59 Correct 90 ms 48580 KB Output is correct
60 Correct 47 ms 66444 KB Output is correct
61 Correct 53 ms 66760 KB Output is correct
62 Correct 84 ms 67340 KB Output is correct
63 Correct 127 ms 68088 KB Output is correct
64 Correct 134 ms 68024 KB Output is correct
65 Correct 163 ms 70288 KB Output is correct
66 Correct 197 ms 70192 KB Output is correct
67 Correct 166 ms 70248 KB Output is correct
68 Correct 165 ms 70212 KB Output is correct
69 Correct 166 ms 70128 KB Output is correct
70 Correct 146 ms 70568 KB Output is correct
71 Correct 173 ms 73848 KB Output is correct
72 Correct 178 ms 74176 KB Output is correct
73 Correct 173 ms 73916 KB Output is correct
74 Correct 186 ms 73812 KB Output is correct
75 Correct 192 ms 73656 KB Output is correct
76 Correct 145 ms 74236 KB Output is correct
77 Correct 191 ms 80528 KB Output is correct
78 Correct 187 ms 80512 KB Output is correct
79 Correct 207 ms 80464 KB Output is correct
80 Correct 191 ms 80424 KB Output is correct
81 Correct 176 ms 79748 KB Output is correct
82 Correct 145 ms 76376 KB Output is correct
83 Correct 180 ms 80576 KB Output is correct
84 Correct 180 ms 80572 KB Output is correct
85 Correct 203 ms 80576 KB Output is correct
86 Correct 195 ms 80584 KB Output is correct
87 Correct 189 ms 79672 KB Output is correct
88 Correct 155 ms 76284 KB Output is correct
89 Correct 167 ms 70460 KB Output is correct
90 Correct 185 ms 70760 KB Output is correct
91 Correct 157 ms 72764 KB Output is correct
92 Correct 188 ms 72912 KB Output is correct
93 Correct 161 ms 75964 KB Output is correct
94 Correct 169 ms 74688 KB Output is correct
95 Correct 193 ms 77292 KB Output is correct
96 Correct 174 ms 75712 KB Output is correct
97 Correct 170 ms 76800 KB Output is correct
98 Correct 175 ms 79624 KB Output is correct
99 Correct 169 ms 76472 KB Output is correct
100 Correct 175 ms 76420 KB Output is correct