oj.uz

답안 #489198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489198 2021-11-21T14:05:15 Z cfalas Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 70496 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;

		int l=0, r=c.size()-1;
		while(l<=r){
			if(dfso[c[MID]->id] > dfso[s]) r=MID-1;
			else pos=MID, l=MID+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{
			//cout<<id<<" "<<s<<" "<<c[pos]->id<<endl;
			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(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 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 27 ms 1024 KB Output is correct
20 Correct 41 ms 1028 KB Output is correct
21 Correct 111 ms 1024 KB Output is correct
22 Correct 230 ms 1084 KB Output is correct
23 Correct 38 ms 3780 KB Output is correct
24 Correct 120 ms 3792 KB Output is correct
25 Correct 427 ms 3876 KB Output is correct
26 Correct 2282 ms 4500 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 35 ms 352 KB Output is correct
5 Correct 174 ms 648 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 5 ms 588 KB Output is correct
10 Correct 42 ms 680 KB Output is correct
11 Correct 204 ms 1204 KB Output is correct
12 Correct 6 ms 3660 KB Output is correct
13 Correct 7 ms 3660 KB Output is correct
14 Correct 13 ms 3848 KB Output is correct
15 Correct 57 ms 3736 KB Output is correct
16 Correct 302 ms 4288 KB Output is correct
17 Correct 196 ms 67616 KB Output is correct
18 Correct 197 ms 67640 KB Output is correct
19 Correct 205 ms 67572 KB Output is correct
20 Correct 287 ms 67764 KB Output is correct
21 Correct 787 ms 70496 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 972 KB Output is correct
2 Correct 28 ms 1044 KB Output is correct
3 Correct 133 ms 1188 KB Output is correct
4 Correct 274 ms 1540 KB Output is correct
5 Correct 14 ms 7116 KB Output is correct
6 Correct 44 ms 7240 KB Output is correct
7 Correct 172 ms 7396 KB Output is correct
8 Correct 331 ms 7768 KB Output is correct
9 Correct 66 ms 34648 KB Output is correct
10 Correct 103 ms 34732 KB Output is correct
11 Correct 256 ms 34944 KB Output is correct
12 Correct 490 ms 35328 KB Output is correct
13 Correct 141 ms 69120 KB Output is correct
14 Correct 189 ms 69208 KB Output is correct
15 Correct 366 ms 69560 KB Output is correct
16 Correct 567 ms 69720 KB Output is correct
17 Correct 969 ms 70120 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5065 ms 69668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 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 27 ms 1024 KB Output is correct
20 Correct 41 ms 1028 KB Output is correct
21 Correct 111 ms 1024 KB Output is correct
22 Correct 230 ms 1084 KB Output is correct
23 Correct 38 ms 3780 KB Output is correct
24 Correct 120 ms 3792 KB Output is correct
25 Correct 427 ms 3876 KB Output is correct
26 Correct 2282 ms 4500 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 332 KB Output is correct
30 Correct 35 ms 352 KB Output is correct
31 Correct 174 ms 648 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 5 ms 588 KB Output is correct
36 Correct 42 ms 680 KB Output is correct
37 Correct 204 ms 1204 KB Output is correct
38 Correct 6 ms 3660 KB Output is correct
39 Correct 7 ms 3660 KB Output is correct
40 Correct 13 ms 3848 KB Output is correct
41 Correct 57 ms 3736 KB Output is correct
42 Correct 302 ms 4288 KB Output is correct
43 Correct 196 ms 67616 KB Output is correct
44 Correct 197 ms 67640 KB Output is correct
45 Correct 205 ms 67572 KB Output is correct
46 Correct 287 ms 67764 KB Output is correct
47 Correct 787 ms 70496 KB Output is correct
48 Correct 4 ms 972 KB Output is correct
49 Correct 28 ms 1044 KB Output is correct
50 Correct 133 ms 1188 KB Output is correct
51 Correct 274 ms 1540 KB Output is correct
52 Correct 14 ms 7116 KB Output is correct
53 Correct 44 ms 7240 KB Output is correct
54 Correct 172 ms 7396 KB Output is correct
55 Correct 331 ms 7768 KB Output is correct
56 Correct 66 ms 34648 KB Output is correct
57 Correct 103 ms 34732 KB Output is correct
58 Correct 256 ms 34944 KB Output is correct
59 Correct 490 ms 35328 KB Output is correct
60 Correct 141 ms 69120 KB Output is correct
61 Correct 189 ms 69208 KB Output is correct
62 Correct 366 ms 69560 KB Output is correct
63 Correct 567 ms 69720 KB Output is correct
64 Correct 969 ms 70120 KB Output is correct
65 Execution timed out 5065 ms 69668 KB Time limit exceeded
66 Halted 0 ms 0 KB -