oj.uz

답안 #540915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540915 2022-03-22T01:17:32 Z jamezzz Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 238504 KB 
#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#define getchar_unlocked getchar
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<ll,int> li;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));
 
#define mod 1000000007
 
inline int add(int a,int b){
	int r=a+b;
	while(r>=mod)r-=mod;
	while(r<0)r+=mod;
	return r;
}
 
inline int mult(int a,int b){
	return (int)(((ll)(a*b))%mod);
}
 
inline int rd(){
	int x=0;
	char ch=getchar_unlocked();
	while(!(ch&16))ch=getchar();//keep reading while current character is whitespace
    while(ch&16){//this will break when ‘\n’ or ‘ ‘ is encountered
		x=(x<<3)+(x<<1)+(ch&15);
		ch=getchar_unlocked();
	}
	return x;
}
 
#define maxn 100005
 
struct edge{
	int u,v;ll w;
	vector<int> comp;
	vector<ii> range;
};
 
struct node{
	int s,e,m;
	li v;ll lz;
	node *l,*r;
	node(int _s,int _e){
		s=_s;e=_e;m=(s+e)/2;lz=0;v={0,s};
		if(s!=e)l=new node(s,m),r=new node(m+1,e);
	}
	void ppo(){
		v.fi+=lz;
		if(s!=e)l->lz+=lz,r->lz+=lz;
		lz=0;
	}
	void up(int x,int y,ll nv){
		if(s==x&&e==y){lz+=nv;return;}
		if(y<=m)l->up(x,y,nv);
		else if(x>m)r->up(x,y,nv);
		else l->up(x,m,nv),r->up(m+1,y,nv);
		l->ppo();r->ppo();
		v=max(l->v,r->v);
	}
	void print(){
		pf("%d %d %lld %lld\n",s,e,v.fi,lz);
		if(s!=e)l->print(),r->print();
	}
};
 
struct tree{
	int s,e;
	node *root;
	vector<int> block;
	vector<ii> ranges;
	tree(int _s,int _e){
		s=_s;e=_e;
		root=new node(s,e);
		block.resize(e-s+1);
	}
	void up(int x,int y,ll nv){
		root->up(x,y,nv);
	}
	ll qry(){
		root->ppo();
		ll ans=root->v.fi;
		int i=block[root->v.se];
		root->up(ranges[i].fi,ranges[i].se,-LINF);
		if(root->v.fi>=0)ans+=root->v.fi;
		up(ranges[i].fi,ranges[i].se,LINF);
		return ans;
	}
	
}*root[maxn];
 
int n,q,sub[maxn];ll w;
bool mark[maxn];
vii AL[maxn];
vector<edge> edges;
 
void find_sz(int u,int p){
	sub[u]=1;
	for(auto[v,i]:AL[u]){
		if(mark[v]||v==p)continue;
		find_sz(v,u);
		sub[u]+=sub[v];
	}
}
 
int cnt;
vii ranges;
 
ii dfs(int u,int p,int c){
	ii range={cnt,cnt};++cnt;
	for(auto[v,i]:AL[u]){
		if(mark[v]||v==p)continue;
		ii res=dfs(v,u,c);
		edges[i].comp.pb(c);
		edges[i].range.pb(res);
		mxto(range.se,res.se);
		if(p==-1)ranges.pb(res);
	}
	return range;
}
 
void decomp(int u){
	dbg("decomp: %d\n",u);
	
	dbg("find centroid\n");
	find_sz(u,-1);
	int c=u;
	while(true){
		bool val=true;
		for(auto[v,i]:AL[c]){
			if(!mark[v]&&sub[v]<sub[c]&&sub[v]>sub[u]/2){
				c=v;val=false;break;
			}
		}
		if(val)break;
	}
	
	dbg("centroid: %d\n",c);
	
	cnt=0;
	ranges.clear();
	
	dbg("dfs\n");
	dfs(c,-1,c);
	
	dbg("create node\n");
	root[c]=new tree(0,cnt-1);
	
	dbg("%d\n",sz(ranges));
	
	for(int i=0;i<sz(ranges);++i){
		dbg("add range: %d %d\n",ranges[i].fi,ranges[i].se);
		root[c]->ranges.pb(ranges[i]);
		for(int j=ranges[i].fi;j<=ranges[i].se;++j){
			root[c]->block[j]=i;
		}
	}
	
	mark[c]=true;
	for(auto[v,i]:AL[c]){
		if(!mark[v])decomp(v);
	}
}
 
int main(){
	sf("%d%d%lld",&n,&q,&w);
	for(int i=0;i<n-1;++i){
		int a,b;ll c;
		sf("%d%d%lld",&a,&b,&c);
		AL[a].pb({b,i});
		AL[b].pb({a,i});
		edges.pb({a,b,c,{},{}});
	}
	
	decomp(1);
	
	for(auto &e:edges){
		dbg("edge: %d %d %lld\n",e.u,e.v,e.w);
		for(int i=0;i<sz(e.comp);++i){
			ii rng=e.range[i];
			dbg("comp: %d %d %d\n",e.comp[i],rng.fi,rng.se);
			root[e.comp[i]]->up(rng.fi,rng.se,e.w);
		}
	}
	
	set<li> s;
	for(int i=1;i<=n;++i){
		if(root[i]->s==root[i]->e)continue;
		dbg("%d: %lld\n",i,root[i]->qry());
		s.insert({root[i]->qry(),i});
	}
	
	ll ans=0;
	for(int i=0;i<q;++i){
		int idx;ll nw;
		sf("%d%lld",&idx,&nw);
		idx=(idx+ans)%(n-1);
		nw=(nw+ans)%w;
		edge &e=edges[idx];
		ll ow=e.w;
		e.w=nw;
		
		//dbg("upd: %d %lld\n",idx,nw);
		
		for(int i=0;i<sz(e.comp);++i){
			ii rng=e.range[i];
			int c=e.comp[i];
			
			ll old=root[c]->qry();
			root[c]->up(rng.fi,rng.se,nw-ow);
			ll upd=root[c]->qry();
			s.erase(s.find({old,c}));
			s.insert({upd,c});
		}
		
		ans=(*--s.end()).fi;
		
		pf("%lld\n",ans);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:192:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  192 |  sf("%d%d%lld",&n,&q,&w);
      |    ^
diameter.cpp:195:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  195 |   sf("%d%d%lld",&a,&b,&c);
      |     ^
diameter.cpp:222:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  222 |   sf("%d%lld",&idx,&nw);
      |     ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2664 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2672 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2660 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2664 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2672 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2660 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 36 ms 3796 KB Output is correct
20 Correct 39 ms 3892 KB Output is correct
21 Correct 55 ms 4056 KB Output is correct
22 Correct 45 ms 4324 KB Output is correct
23 Correct 74 ms 8804 KB Output is correct
24 Correct 98 ms 10304 KB Output is correct
25 Correct 113 ms 11172 KB Output is correct
26 Correct 99 ms 12472 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 18 ms 2900 KB Output is correct
5 Correct 78 ms 3808 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 5 ms 2932 KB Output is correct
10 Correct 28 ms 3148 KB Output is correct
11 Correct 138 ms 4220 KB Output is correct
12 Correct 7 ms 5196 KB Output is correct
13 Correct 8 ms 5228 KB Output is correct
14 Correct 10 ms 5256 KB Output is correct
15 Correct 43 ms 5408 KB Output is correct
16 Correct 181 ms 6604 KB Output is correct
17 Correct 110 ms 53284 KB Output is correct
18 Correct 109 ms 53184 KB Output is correct
19 Correct 116 ms 53288 KB Output is correct
20 Correct 159 ms 53572 KB Output is correct
21 Correct 362 ms 54876 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4052 KB Output is correct
2 Correct 61 ms 4160 KB Output is correct
3 Correct 293 ms 4676 KB Output is correct
4 Correct 584 ms 5428 KB Output is correct
5 Correct 70 ms 21600 KB Output is correct
6 Correct 166 ms 21828 KB Output is correct
7 Correct 576 ms 22436 KB Output is correct
8 Correct 1116 ms 23428 KB Output is correct
9 Correct 379 ms 113296 KB Output is correct
10 Correct 525 ms 113356 KB Output is correct
11 Correct 1166 ms 113968 KB Output is correct
12 Correct 1965 ms 114920 KB Output is correct
13 Correct 796 ms 236836 KB Output is correct
14 Correct 987 ms 237036 KB Output is correct
15 Correct 1773 ms 237820 KB Output is correct
16 Correct 2760 ms 238356 KB Output is correct
17 Correct 4230 ms 238404 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4690 ms 188152 KB Output is correct
2 Correct 4987 ms 193860 KB Output is correct
3 Correct 4870 ms 192100 KB Output is correct
4 Correct 4993 ms 193768 KB Output is correct
5 Correct 4837 ms 183048 KB Output is correct
6 Correct 4112 ms 128460 KB Output is correct
7 Execution timed out 5088 ms 238504 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2664 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2672 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2660 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 36 ms 3796 KB Output is correct
20 Correct 39 ms 3892 KB Output is correct
21 Correct 55 ms 4056 KB Output is correct
22 Correct 45 ms 4324 KB Output is correct
23 Correct 74 ms 8804 KB Output is correct
24 Correct 98 ms 10304 KB Output is correct
25 Correct 113 ms 11172 KB Output is correct
26 Correct 99 ms 12472 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 3 ms 2644 KB Output is correct
30 Correct 18 ms 2900 KB Output is correct
31 Correct 78 ms 3808 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 5 ms 2932 KB Output is correct
36 Correct 28 ms 3148 KB Output is correct
37 Correct 138 ms 4220 KB Output is correct
38 Correct 7 ms 5196 KB Output is correct
39 Correct 8 ms 5228 KB Output is correct
40 Correct 10 ms 5256 KB Output is correct
41 Correct 43 ms 5408 KB Output is correct
42 Correct 181 ms 6604 KB Output is correct
43 Correct 110 ms 53284 KB Output is correct
44 Correct 109 ms 53184 KB Output is correct
45 Correct 116 ms 53288 KB Output is correct
46 Correct 159 ms 53572 KB Output is correct
47 Correct 362 ms 54876 KB Output is correct
48 Correct 12 ms 4052 KB Output is correct
49 Correct 61 ms 4160 KB Output is correct
50 Correct 293 ms 4676 KB Output is correct
51 Correct 584 ms 5428 KB Output is correct
52 Correct 70 ms 21600 KB Output is correct
53 Correct 166 ms 21828 KB Output is correct
54 Correct 576 ms 22436 KB Output is correct
55 Correct 1116 ms 23428 KB Output is correct
56 Correct 379 ms 113296 KB Output is correct
57 Correct 525 ms 113356 KB Output is correct
58 Correct 1166 ms 113968 KB Output is correct
59 Correct 1965 ms 114920 KB Output is correct
60 Correct 796 ms 236836 KB Output is correct
61 Correct 987 ms 237036 KB Output is correct
62 Correct 1773 ms 237820 KB Output is correct
63 Correct 2760 ms 238356 KB Output is correct
64 Correct 4230 ms 238404 KB Output is correct
65 Correct 4690 ms 188152 KB Output is correct
66 Correct 4987 ms 193860 KB Output is correct
67 Correct 4870 ms 192100 KB Output is correct
68 Correct 4993 ms 193768 KB Output is correct
69 Correct 4837 ms 183048 KB Output is correct
70 Correct 4112 ms 128460 KB Output is correct
71 Execution timed out 5088 ms 238504 KB Time limit exceeded
72 Halted 0 ms 0 KB -