oj.uz

Submission #579207

# Submission time Handle Problem Language Result Execution time Memory
579207 2022-06-18T13:25:36 Z temporary_juggernaut Dynamic Diameter (CEOI19_diameter) C++14
24 / 100
 5000 ms 10216 KB 
#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
int n,q;
int timer;
ll w[100005];
pair<int,int>edge[100005];
vector<pair<int,int>>g[100005];
bool vis[100005];
int sz[100005];
int par[100005];
int depth[100005];
void build_sz(int v,int p){
	sz[v]=1;
	for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr])){
		build_sz(to.fr,v);
		sz[v]+=sz[to.fr];
	}
}
int centroid(int v,int p,int sz){
	bool can;
	while(true){
		can=true;
		for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr])){
			if(::sz[to.fr]>sz){
				can=false;
				p=v;
				v=to.fr;
				break;
			}
		}
		if(can)return v;
	}
}
void build(int v,int p,int dep){
	build_sz(v,0);
	v=centroid(v,0,sz[v]>>1);
	par[v]=p;
	depth[v]=dep;
	vis[v]=true;
	for(auto &to:g[v])if(!vis[to.fr])build(to.fr,v,dep+1);
}
ll ans;
struct SegmentTree{
	vector<ll>vec;
	int n;
	SegmentTree(int _n){
		n=_n;
		vec.assign(n<<2|3,0ll);
	}
};
ll alls[100005];
ll go(int v,int p,int &pivot,ll depth){
	ll mx=depth;
	if(!p){
		ll m1=0,m2=0;
		for(auto &to:g[v])if((to.fr^p)&&::depth[to.fr]>pivot){
			ll cur=go(to.fr,v,pivot,depth+w[to.sc]);
			umax(mx,cur);
			if(cur>m1){
				m2=m1;
				m1=cur;
			}else if(cur>m2)m2=cur;
		}
		mx=m1+m2;
	}else for(auto &to:g[v])if((to.fr^p)&&::depth[to.fr]>pivot)umax(mx,go(to.fr,v,pivot,depth+w[to.sc]));
	return mx;
}
int main(){
	scanf("%d%d%lld",&n,&q,&w[0]);
	for(int i=1;i^n;i++){
		scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
		g[edge[i].fr].emplace_back(edge[i].sc,i);
		g[edge[i].sc].emplace_back(edge[i].fr,i);
	}
	build(1,0,0);
	for(int i=1;i^n;i++)if(depth[edge[i].fr]<depth[edge[i].sc])swap(edge[i].fr,edge[i].sc);
	for(int i=1;i<=n;i++)alls[i]=go(i,0,depth[i],0);
	while(q--){
		ll x;
		ll y;
		scanf("%lld%lld",&x,&y);
		x=(x+ans)%(n-1)+1;
		y=(y+ans)%w[0];
		//Episode 1-> Think hard
		w[x]=y;
		x=edge[x].fr;
		while(x){
			alls[x]=go(x,0,depth[x],0);
			x=par[x];
		}
		ans=0;
		for(int i=1;i<=n;i++)umax(ans,alls[i]);
		printf("%lld\n",ans);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:86:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |  scanf("%d%d%lld",&n,&q,&w[0]);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |   scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:98:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 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 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 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 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 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 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 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 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 114 ms 2752 KB Output is correct
20 Correct 136 ms 2744 KB Output is correct
21 Correct 168 ms 2760 KB Output is correct
22 Correct 199 ms 2800 KB Output is correct
23 Correct 740 ms 3188 KB Output is correct
24 Correct 1088 ms 3048 KB Output is correct
25 Correct 1229 ms 3168 KB Output is correct
26 Correct 1378 ms 3340 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 10 ms 2772 KB Output is correct
5 Correct 46 ms 3000 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 3 ms 2644 KB Output is correct
9 Correct 9 ms 2644 KB Output is correct
10 Correct 74 ms 2772 KB Output is correct
11 Correct 480 ms 3152 KB Output is correct
12 Correct 5 ms 3028 KB Output is correct
13 Correct 12 ms 3028 KB Output is correct
14 Correct 68 ms 3068 KB Output is correct
15 Correct 708 ms 3104 KB Output is correct
16 Correct 3857 ms 3576 KB Output is correct
17 Correct 59 ms 10132 KB Output is correct
18 Correct 194 ms 10124 KB Output is correct
19 Correct 1505 ms 10184 KB Output is correct
20 Execution timed out 5079 ms 10216 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2644 KB Output is correct
2 Correct 175 ms 2900 KB Output is correct
3 Correct 788 ms 2928 KB Output is correct
4 Correct 1557 ms 3280 KB Output is correct
5 Correct 156 ms 3412 KB Output is correct
6 Correct 1568 ms 3584 KB Output is correct
7 Execution timed out 5064 ms 3592 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5071 ms 9960 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 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 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 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 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 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 114 ms 2752 KB Output is correct
20 Correct 136 ms 2744 KB Output is correct
21 Correct 168 ms 2760 KB Output is correct
22 Correct 199 ms 2800 KB Output is correct
23 Correct 740 ms 3188 KB Output is correct
24 Correct 1088 ms 3048 KB Output is correct
25 Correct 1229 ms 3168 KB Output is correct
26 Correct 1378 ms 3340 KB Output is correct
27 Correct 3 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 10 ms 2772 KB Output is correct
31 Correct 46 ms 3000 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 3 ms 2644 KB Output is correct
35 Correct 9 ms 2644 KB Output is correct
36 Correct 74 ms 2772 KB Output is correct
37 Correct 480 ms 3152 KB Output is correct
38 Correct 5 ms 3028 KB Output is correct
39 Correct 12 ms 3028 KB Output is correct
40 Correct 68 ms 3068 KB Output is correct
41 Correct 708 ms 3104 KB Output is correct
42 Correct 3857 ms 3576 KB Output is correct
43 Correct 59 ms 10132 KB Output is correct
44 Correct 194 ms 10124 KB Output is correct
45 Correct 1505 ms 10184 KB Output is correct
46 Execution timed out 5079 ms 10216 KB Time limit exceeded
47 Halted 0 ms 0 KB -