oj.uz

Submission #489197

# Submission time Handle Problem Language Result Execution time Memory
489197 2021-11-21T13:54:54 Z cfalas Dynamic Diameter (CEOI19_diameter) C++17
42 / 100
 5000 ms 69844 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;
	set<ii> an;
	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});
		if(an.size()==0) pa.insert({0,id});
		FOA(v, c){
			pa.insert({v->pa.rbegin()->F + v->w, v->id});
			an.insert({v->an.rbegin()->F, v->id});
			//else if(v->w + v->l2 > l2) l2 = v->l2 + v->w;
		}
		if(pa.size()>1) an.insert({(*pa.rbegin()).F + (*(++pa.rbegin())).F, id});
		//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{
			if(pa.size()>1) an.erase({(*pa.rbegin()).F + (*(++pa.rbegin())).F, id});
			pa.erase({ c[pos]->pa.rbegin()->F + c[pos]->w, c[pos]->id});
			an.erase({c[pos]->an.rbegin()->F, c[pos]->id});
			c[pos]->update(s, t);
			pa.insert({c[pos]->pa.rbegin()->F + c[pos]->w, c[pos]->id});
			an.insert({c[pos]->an.rbegin()->F, c[pos]->id});
			//node*v = c[pos];
			if(pa.size()>1) an.insert({(*pa.rbegin()).F + (*(++pa.rbegin())).F, id});
		}
	}
};

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.an.rbegin()->F;
		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 0 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 332 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 0 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 332 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 31 ms 972 KB Output is correct
20 Correct 46 ms 1120 KB Output is correct
21 Correct 109 ms 1004 KB Output is correct
22 Correct 218 ms 972 KB Output is correct
23 Correct 40 ms 3660 KB Output is correct
24 Correct 124 ms 3788 KB Output is correct
25 Correct 436 ms 3852 KB Output is correct
26 Correct 2282 ms 4476 KB Output is correct

Subtask #3
0 / 7.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 8 ms 204 KB Output is correct
4 Correct 44 ms 364 KB Output is correct
5 Correct 213 ms 808 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 8 ms 588 KB Output is correct
10 Correct 64 ms 656 KB Output is correct
11 Correct 321 ms 1160 KB Output is correct
12 Correct 8 ms 3660 KB Output is correct
13 Correct 11 ms 3588 KB Output is correct
14 Correct 30 ms 3684 KB Output is correct
15 Correct 320 ms 3696 KB Output is correct
16 Correct 1322 ms 4132 KB Output is correct
17 Correct 257 ms 67548 KB Output is correct
18 Correct 376 ms 67632 KB Output is correct
19 Correct 1722 ms 67632 KB Output is correct
20 Execution timed out 5060 ms 67756 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 972 KB Output is correct
2 Correct 32 ms 1100 KB Output is correct
3 Correct 148 ms 1128 KB Output is correct
4 Correct 309 ms 1404 KB Output is correct
5 Correct 20 ms 7212 KB Output is correct
6 Correct 51 ms 7216 KB Output is correct
7 Correct 196 ms 7404 KB Output is correct
8 Correct 372 ms 7788 KB Output is correct
9 Correct 101 ms 34696 KB Output is correct
10 Correct 129 ms 34728 KB Output is correct
11 Correct 303 ms 35084 KB Output is correct
12 Correct 522 ms 35220 KB Output is correct
13 Correct 191 ms 69180 KB Output is correct
14 Correct 226 ms 69200 KB Output is correct
15 Correct 411 ms 69432 KB Output is correct
16 Correct 664 ms 69752 KB Output is correct
17 Correct 1108 ms 69844 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5053 ms 69524 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 0 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 332 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 31 ms 972 KB Output is correct
20 Correct 46 ms 1120 KB Output is correct
21 Correct 109 ms 1004 KB Output is correct
22 Correct 218 ms 972 KB Output is correct
23 Correct 40 ms 3660 KB Output is correct
24 Correct 124 ms 3788 KB Output is correct
25 Correct 436 ms 3852 KB Output is correct
26 Correct 2282 ms 4476 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 8 ms 204 KB Output is correct
30 Correct 44 ms 364 KB Output is correct
31 Correct 213 ms 808 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 2 ms 588 KB Output is correct
35 Correct 8 ms 588 KB Output is correct
36 Correct 64 ms 656 KB Output is correct
37 Correct 321 ms 1160 KB Output is correct
38 Correct 8 ms 3660 KB Output is correct
39 Correct 11 ms 3588 KB Output is correct
40 Correct 30 ms 3684 KB Output is correct
41 Correct 320 ms 3696 KB Output is correct
42 Correct 1322 ms 4132 KB Output is correct
43 Correct 257 ms 67548 KB Output is correct
44 Correct 376 ms 67632 KB Output is correct
45 Correct 1722 ms 67632 KB Output is correct
46 Execution timed out 5060 ms 67756 KB Time limit exceeded
47 Halted 0 ms 0 KB -