oj.uz

Submission #489192

# Submission time Handle Problem Language Result Execution time Memory
489192 2021-11-21T13:46:30 Z cfalas Dynamic Diameter (CEOI19_diameter) C++17
42 / 100
 5000 ms 46484 KB 
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef map<ll, ll> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

ll t, n;
vi a, b;

vector<vii> adj;

ii f;

ll cnt=0;
vector<int> dfso;
void dfs(int s, int p=-1, ll d=0){
	dfso[s] = cnt++;
	if(d>f.F) f = max(f, {d, s});
	FOA(v, adj[s]){
		if(v.F!=p) dfs(v.F, s, d+v.S);
	}
}

vector<int> pr;

struct node{
	//ii l1={0,0}, l2={0,0};
	set<ii> pa;
	int w=0;
	int id=1;
	ll ans=0;
	vector<node*> c;
	vector<node*> all_c;

	void build(int p=-1){
		pr.push_back(id);
		FOA(v,adj[id]){
			if(v.F!=p){
				c.push_back(new node());
				c[c.size()-1]->w = v.S;
				c[c.size()-1]->id = v.F;
				c[c.size()-1]->build(id);
			}
		}
		if(pa.size()==0) pa.insert({0,0});
		FOA(v, c){
			pa.insert({v->pa.rbegin()->F + v->w, v->id});
			ans = max(ans, v->ans);
			//else if(v->w + v->l2 > l2) l2 = v->l2 + v->w;
		}
		if(pa.size()>1) ans = max(ans, (*pa.rbegin()).F + (*(++pa.rbegin())).F);
		//cout<<id<<" ("<<l1.F<<" "<<l1.S<<") ("<<l2.F<<" "<<l2.S<<")"<<" "<<ans<<endl;
	}

	void update(int s, ll t){
		int pos = c.size()-1;
		FOR(i,c.size()-1){
			if(dfso[c[i]->id] <= dfso[s] && dfso[s] < dfso[c[i+1]->id]) pos = i;
		}
		if(s==id){
			//cout<<"CHAINGE "<<s<<endl;
			w = t;
		}
		else{
			pa.erase({ c[pos]->pa.rbegin()->F + c[pos]->w, c[pos]->id});
			c[pos]->update(s, t);
			pa.insert({c[pos]->pa.rbegin()->F + c[pos]->w, c[pos]->id});
			//node*v = c[pos];
			ans = 0;
			FOA(v, c){
				ans = max(ans, v->ans);
			}
			if(pa.size()>1) ans = max(ans, (*pa.rbegin()).F + (*(++pa.rbegin())).F);
		}
	}
};

int main(){
	int q;
	ll w;
	cin>>n>>q>>w;
	adj.assign(n+1, vii());
	dfso.assign(n+1, 0);

	vector<pair<ii,ii> > edg(n-1);
	set<ii> ws;
	vi wu(n);
	FOR(i,n-1){
		ll a, b, c;
		cin>>a>>b>>c;
		ws.insert({-c, i});
		wu[i] = c;
		edg[i] = {{a, adj[a].size()}, {b, adj[b].size()}};
		adj[a].push_back({b,c});
		adj[b].push_back({a,c});
	}
	node root;
	root.build();
	ll last=0;
	dfs(1);
	//FOR(i,n) cout<<dfso[i+1]<<" "; cout<<endl;
	while(q--){
		ll a, b;
		cin>>a>>b;
			//cout<<"UPDATE\n";
		a= (a + last) % (n-1);
		b = (b+last) % w;

		adj[edg[a].F.F][edg[a].F.S].S = b;
		adj[edg[a].S.F][edg[a].S.S].S = b;

		f = {0,1};
		//dfs(1);
		//dfs(f.S);


		//cout<<a<<" "<<b<<endl;
		//cout<<"edg "<<edg[a].F.F<<" "<<edg[a].S.F<<endl;
		int upn = max(ii(dfso[edg[a].F.F], edg[a].F.F),ii(dfso[edg[a].S.F], edg[a].S.F)).S;
		//cout<<"pos "<<upn<<endl;
		root.update(upn, b);


		//last = f.F;
		last = root.ans;
		cout<<last<<endl;

	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 18 ms 716 KB Output is correct
20 Correct 25 ms 716 KB Output is correct
21 Correct 49 ms 780 KB Output is correct
22 Correct 96 ms 844 KB Output is correct
23 Correct 39 ms 2596 KB Output is correct
24 Correct 63 ms 2508 KB Output is correct
25 Correct 171 ms 2680 KB Output is correct
26 Correct 922 ms 3268 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 308 KB Output is correct
4 Correct 39 ms 328 KB Output is correct
5 Correct 195 ms 704 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 8 ms 528 KB Output is correct
10 Correct 67 ms 552 KB Output is correct
11 Correct 337 ms 908 KB Output is correct
12 Correct 9 ms 2560 KB Output is correct
13 Correct 13 ms 2520 KB Output is correct
14 Correct 39 ms 2520 KB Output is correct
15 Correct 399 ms 2628 KB Output is correct
16 Correct 1725 ms 2992 KB Output is correct
17 Correct 197 ms 44136 KB Output is correct
18 Correct 459 ms 44024 KB Output is correct
19 Correct 2783 ms 44280 KB Output is correct
20 Execution timed out 5059 ms 44164 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 716 KB Output is correct
2 Correct 24 ms 800 KB Output is correct
3 Correct 109 ms 980 KB Output is correct
4 Correct 227 ms 1264 KB Output is correct
5 Correct 16 ms 4812 KB Output is correct
6 Correct 41 ms 4820 KB Output is correct
7 Correct 135 ms 5108 KB Output is correct
8 Correct 254 ms 5444 KB Output is correct
9 Correct 78 ms 23104 KB Output is correct
10 Correct 144 ms 23016 KB Output is correct
11 Correct 211 ms 23336 KB Output is correct
12 Correct 364 ms 23616 KB Output is correct
13 Correct 181 ms 45684 KB Output is correct
14 Correct 193 ms 45760 KB Output is correct
15 Correct 329 ms 46168 KB Output is correct
16 Correct 471 ms 46268 KB Output is correct
17 Correct 667 ms 46304 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5055 ms 46484 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 18 ms 716 KB Output is correct
20 Correct 25 ms 716 KB Output is correct
21 Correct 49 ms 780 KB Output is correct
22 Correct 96 ms 844 KB Output is correct
23 Correct 39 ms 2596 KB Output is correct
24 Correct 63 ms 2508 KB Output is correct
25 Correct 171 ms 2680 KB Output is correct
26 Correct 922 ms 3268 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 4 ms 308 KB Output is correct
30 Correct 39 ms 328 KB Output is correct
31 Correct 195 ms 704 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 8 ms 528 KB Output is correct
36 Correct 67 ms 552 KB Output is correct
37 Correct 337 ms 908 KB Output is correct
38 Correct 9 ms 2560 KB Output is correct
39 Correct 13 ms 2520 KB Output is correct
40 Correct 39 ms 2520 KB Output is correct
41 Correct 399 ms 2628 KB Output is correct
42 Correct 1725 ms 2992 KB Output is correct
43 Correct 197 ms 44136 KB Output is correct
44 Correct 459 ms 44024 KB Output is correct
45 Correct 2783 ms 44280 KB Output is correct
46 Execution timed out 5059 ms 44164 KB Time limit exceeded
47 Halted 0 ms 0 KB -