oj.uz

Submission #223675

# Submission time Handle Problem Language Result Execution time Memory
223675 2020-04-16T03:34:16 Z ryansee Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 211180 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

typedef long long ll; 
typedef long double ld;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
typedef pair<ll,ll>pi; typedef pair<ll,pi>spi; typedef pair<pi,pi>dpi;

#define LLINF ((long long)4e18+1000)
#define INF int(1e9+1e6)
#define MAXN (100006)
ll n,q,w;
int bck[MAXN],st[MAXN],en[MAXN],co,p[MAXN][17],depth[MAXN];
vector<pair<int,ll>> v[MAXN];
spi e[MAXN];
pi def=pi(-LLINF,-1);
struct node{
	int s,e,m;
	pair<ll,int> v;
	ll add;
	node*l,*r;
	node(int S,int E){
		s=S,e=E,m=(s+e)>>1;
		v.f=v.s=add=0;
		if(s^e)l=new node(s,m),r=new node(m+1,e);
	}
	void update(int x,int y,ll nval){
		if(x>y)return;
		if(s==x&&e==y) {
			add+=nval;
			return;
		}
		if(x>m)r->update(x,y,nval);
		else if(y<=m)l->update(x,y,nval);
		else l->update(x,m,nval),r->update(m+1,y,nval);
		v=max(l->value(),r->value());
	}
	pair<ll,int> value() {
		v.f+=add;
		if(s^e){
			l->add+=add;
			r->add+=add;
		}
		add=0;
		return v;
	}
	void set(int x,pair<ll,int> nval){
		value();
		if(s==e) {
			v=nval;
			return;
		}
		if(x>m)r->set(x,nval); else l->set(x,nval);
		v=max(l->value(),r->value());
	}
	pair<ll,int> rmq(int x,int y){
		if(x>y) return def;
		value();
		if(s==x&&e==y) return v;
		if(x>m) return r->rmq(x,y);
		else if(y<=m) return l->rmq(x,y);
		else return max(l->rmq(x,m),r->rmq(m+1,y));
	}
	pair<ll,int> exc_rmq(int x,int y){
		return max(rmq(s,x-1),rmq(y+1,e));
	}
	void exc_upd(int x,int y,ll nval){
		update(s,x-1,nval), update(y+1,e,nval);
	}
} *seg[MAXN];
struct fen {
	ll fw[MAXN];
	void pupdate(int x,ll nval) {
		for(;x<MAXN;x+=x&(-x)) fw[x]+=nval;
	}
	void update(int x,int y,ll nval){
		pupdate(x,nval),pupdate(y+1,-nval);
	}
	ll sum(int x){
		ll res=0;
		for(;x;x-=x&(-x)) res+=fw[x];
		return res;
	}
} dist;
void dfs(int x,int par,ll d){
	bck[co]=x, st[x]=co++;
	dist.update(st[x],st[x],d);
	p[x][0]=par;
	for(auto i:v[x]) if(i.f^par) {
		depth[i.f]=depth[x]+1, dfs(i.f,x,d+i.s);
	}
	en[x]=co-1;
}
bool isp(int a,int b) { return st[a]<=st[b]&&en[a]>=en[b]; }
int lca(int x,int y){
	if(isp(x,y))return x;
	if(isp(y,x))return y;
	DEC(i,16,0)if(!isp(p[x][i],y))x=p[x][i];
	return p[x][0];
}
ll disty(int a,int b) { return dist.sum(st[a]) + dist.sum(st[b]) - 2 * dist.sum(st[lca(a,b)]); }
int kpar(int x,int k){
	FOR(i,0,16) if(1<<i&k) {
		x=p[x][i];
	}
	return x;
}
int sz[MAXN], total, cp[MAXN];
bitset<MAXN> done;
vector<int> kids[MAXN];
void dfs1(int x,int p){
	sz[x]=1;
	++ total;
	for(auto i:v[x]) if(!done[i.f]&&i.f!=p){
		dfs1(i.f,x);
		sz[x]+=sz[i.f];
	}
}
int dfs2(int x,int p){
	for(auto i:v[x]) if(!done[i.f]&&i.f!=p&&sz[i.f]>total/2) return dfs2(i.f,x);
	return x;
}
int X;
void get_des(int x,int p){
	kids[X].pb(st[x]);
	for(auto i:v[x]) if(i.f!=p && !done[i.f]) get_des(i.f,x);
}
void dfs3(int x,int p){
	total=0;
	dfs1(x,x);
	x=dfs2(x,x);
	cp[x]=p;
	done[x]=1;
	X=x, get_des(x,x), sort(all(kids[x]));
	seg[x]=new node(0,siz(kids[x])-1);
	FOR(i,0,siz(kids[x])-1)seg[x]->set(i,pi(disty(bck[kids[x][i]],x),bck[kids[x][i]]));
	for(auto i:v[x]) if(!done[i.f]) dfs3(i.f,x);
	v[x].clear();
}
void upd(int x,int o,ll diff){
	if(x==-1) return;
	if(isp(o,x)) { // in subtre of o, exc_upd
		seg[x]->exc_upd(lbd(kids[x],st[o]),ubd(kids[x],en[o])-1,diff);
	}else{
		seg[x]->update(lbd(kids[x],st[o]),ubd(kids[x],en[o])-1,diff);
	}
	upd(cp[x],o,diff);
}
inline pair<ll,int> add(pair<ll,int> ans,ll x){
	return {ans.f+x,ans.s};
}
pair<ll,int> query(ll x,ll o){
	if(x==-1) return def;
	if(!isp(x,o)){
		return max(query(cp[x],o), add(seg[x]->rmq(lbd(kids[x],st[x]),ubd(kids[x],en[x])-1),disty(x,o)));
	}else{
		ll inter = kpar(o,depth[o]-depth[x]-1);
		return max(query(cp[x],o), add(seg[x]->exc_rmq(lbd(kids[x],st[inter]),ubd(kids[x],en[inter])-1),disty(x,o)));
	}
}
#define gc getchar
void in(ll&x){
	x=0;
	char ch=gc();
	while(ch<'0'||ch>'9') ch=gc();
	while(ch>='0'&&ch<='9'){
		x=(x<<3)+(x<<1)+ch-48;
		ch=gc();
	}
}
void in(int&x){
	x=0;
	char ch=gc();
	while(ch<'0'||ch>'9') ch=gc();
	while(ch>='0'&&ch<='9'){
		x=(x<<3)+(x<<1)+ch-48;
		ch=gc();
	}
}
int main(){
	FAST
	in(n),in(q),in(w);
	FOR(i,0,n-2){
		in(e[i].s.f),in(e[i].s.s),in(e[i].f);
		v[e[i].s.f].eb(e[i].s.s,e[i].f), v[e[i].s.s].eb(e[i].s.f,e[i].f);
	}
	co=1, dfs(1,1,0);
	FOR(j,1,16)FOR(i,1,n)p[i][j]=p[p[i][j-1]][j-1];
	dfs3(1,-1);
	ll d1=1,d2=1,best=0,pans=0;
	FOR(i,1,n) {
		pi tryy=query(i,i);
		if(tryy.f>best) best=tryy.f, d1=i, d2=tryy.s;
	}
	cerr<<"best: "<<best<<'\n';
	FOR(i,1,q){
		ll eg,ncost;
		in(eg),in(ncost);
		eg+=pans,eg%=n-1,ncost+=pans,ncost%=w;
		ll a=e[eg].s.f, b=e[eg].s.s;
		if(p[a][0]==b) swap(a,b);
		upd(b,b,ncost-e[eg].f);
		dist.update(st[b],en[b],ncost-e[eg].f);
		e[eg].f=ncost;
		best=disty(d1,d2);
		ll od1=d1,od2=d2;
		pi hmm=query(od1,od1);
		if(hmm.f>best) best=hmm.f, d1=od1, d2=hmm.s;
		hmm=query(od2,od2);
		if(hmm.f>best) best=hmm.f, d1=hmm.s, d2=od2;
		cout<<(pans=best)<<'\n';		
	}
	
}
/*
4 2 2000
1 2 100
2 3 1000
2 4 1000
2 1030
1 1020
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 7 ms 5120 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 7 ms 5248 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5248 KB Output is correct
14 Correct 7 ms 5248 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5248 KB Output is correct
17 Correct 8 ms 5248 KB Output is correct
18 Correct 8 ms 5248 KB Output is correct
19 Correct 40 ms 6144 KB Output is correct
20 Correct 47 ms 6264 KB Output is correct
21 Correct 55 ms 6392 KB Output is correct
22 Correct 43 ms 6528 KB Output is correct
23 Correct 86 ms 10368 KB Output is correct
24 Correct 110 ms 11768 KB Output is correct
25 Correct 129 ms 12544 KB Output is correct
26 Correct 93 ms 13816 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 9 ms 5120 KB Output is correct
4 Correct 28 ms 5376 KB Output is correct
5 Correct 109 ms 6340 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 8 ms 5376 KB Output is correct
8 Correct 8 ms 5376 KB Output is correct
9 Correct 11 ms 5376 KB Output is correct
10 Correct 45 ms 5624 KB Output is correct
11 Correct 180 ms 6648 KB Output is correct
12 Correct 15 ms 7168 KB Output is correct
13 Correct 15 ms 7168 KB Output is correct
14 Correct 19 ms 7296 KB Output is correct
15 Correct 68 ms 7464 KB Output is correct
16 Correct 246 ms 8544 KB Output is correct
17 Correct 196 ms 46052 KB Output is correct
18 Correct 188 ms 45924 KB Output is correct
19 Correct 202 ms 45924 KB Output is correct
20 Correct 254 ms 46052 KB Output is correct
21 Correct 505 ms 46544 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6400 KB Output is correct
2 Correct 66 ms 6520 KB Output is correct
3 Correct 284 ms 7020 KB Output is correct
4 Correct 526 ms 7920 KB Output is correct
5 Correct 88 ms 21496 KB Output is correct
6 Correct 180 ms 21624 KB Output is correct
7 Correct 596 ms 22284 KB Output is correct
8 Correct 1101 ms 22916 KB Output is correct
9 Correct 464 ms 102128 KB Output is correct
10 Correct 618 ms 102324 KB Output is correct
11 Correct 1263 ms 102516 KB Output is correct
12 Correct 2088 ms 103020 KB Output is correct
13 Correct 1010 ms 210696 KB Output is correct
14 Correct 1174 ms 210288 KB Output is correct
15 Correct 2004 ms 210544 KB Output is correct
16 Correct 2987 ms 211180 KB Output is correct
17 Correct 3500 ms 211080 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4583 ms 162092 KB Output is correct
2 Execution timed out 5031 ms 167284 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 7 ms 5120 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 7 ms 5248 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5248 KB Output is correct
14 Correct 7 ms 5248 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5248 KB Output is correct
17 Correct 8 ms 5248 KB Output is correct
18 Correct 8 ms 5248 KB Output is correct
19 Correct 40 ms 6144 KB Output is correct
20 Correct 47 ms 6264 KB Output is correct
21 Correct 55 ms 6392 KB Output is correct
22 Correct 43 ms 6528 KB Output is correct
23 Correct 86 ms 10368 KB Output is correct
24 Correct 110 ms 11768 KB Output is correct
25 Correct 129 ms 12544 KB Output is correct
26 Correct 93 ms 13816 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
28 Correct 7 ms 5120 KB Output is correct
29 Correct 9 ms 5120 KB Output is correct
30 Correct 28 ms 5376 KB Output is correct
31 Correct 109 ms 6340 KB Output is correct
32 Correct 7 ms 5120 KB Output is correct
33 Correct 8 ms 5376 KB Output is correct
34 Correct 8 ms 5376 KB Output is correct
35 Correct 11 ms 5376 KB Output is correct
36 Correct 45 ms 5624 KB Output is correct
37 Correct 180 ms 6648 KB Output is correct
38 Correct 15 ms 7168 KB Output is correct
39 Correct 15 ms 7168 KB Output is correct
40 Correct 19 ms 7296 KB Output is correct
41 Correct 68 ms 7464 KB Output is correct
42 Correct 246 ms 8544 KB Output is correct
43 Correct 196 ms 46052 KB Output is correct
44 Correct 188 ms 45924 KB Output is correct
45 Correct 202 ms 45924 KB Output is correct
46 Correct 254 ms 46052 KB Output is correct
47 Correct 505 ms 46544 KB Output is correct
48 Correct 17 ms 6400 KB Output is correct
49 Correct 66 ms 6520 KB Output is correct
50 Correct 284 ms 7020 KB Output is correct
51 Correct 526 ms 7920 KB Output is correct
52 Correct 88 ms 21496 KB Output is correct
53 Correct 180 ms 21624 KB Output is correct
54 Correct 596 ms 22284 KB Output is correct
55 Correct 1101 ms 22916 KB Output is correct
56 Correct 464 ms 102128 KB Output is correct
57 Correct 618 ms 102324 KB Output is correct
58 Correct 1263 ms 102516 KB Output is correct
59 Correct 2088 ms 103020 KB Output is correct
60 Correct 1010 ms 210696 KB Output is correct
61 Correct 1174 ms 210288 KB Output is correct
62 Correct 2004 ms 210544 KB Output is correct
63 Correct 2987 ms 211180 KB Output is correct
64 Correct 3500 ms 211080 KB Output is correct
65 Correct 4583 ms 162092 KB Output is correct
66 Execution timed out 5031 ms 167284 KB Time limit exceeded
67 Halted 0 ms 0 KB -