oj.uz

Submission #199388

# Submission time Handle Problem Language Result Execution time Memory
199388 2020-02-01T03:14:17 Z gs18081 Dynamic Diameter (CEOI19_diameter) C++11
100 / 100
 751 ms 54348 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<int,int> pi;

const int MAXN = 101010;

struct segtree{
	struct Node{
		ll a,b,ab,ba,aba;
		Node(){
			a = b = ab = ba = aba = 0;
		}
		Node operator+(Node c){
			Node ret;
			ret.aba = max({c.aba , aba , ab + c.a , a + c.ba});
			ret.ab = max({ab , c.ab , a + c.b});
			ret.ba = max({ba , c.ba , b + c.a});
			ret.b = max({b , c.b});
			ret.a = max({a , c.a});
			return ret;
		}
	};
	int n;
	vector<Node> tree;
	vector<ll> lazy;
	segtree(){}
	void resize(int size){
		n = size;
		tree = vector<Node> (n * 4);
		lazy = vector<ll> (n*4,0);
	}
	void laz(int node,int s,int e){
		if(s != e){
			lazy[node<<1] += lazy[node];
			lazy[node<<1|1] += lazy[node];
		}
		tree[node].a += lazy[node];
		tree[node].b -= 2 * lazy[node];
		tree[node].ab -= lazy[node];
		tree[node].ba -= lazy[node];
		lazy[node] = 0;
	}
	Node update(int node,int s,int e,int l,int r,ll diff){
		laz(node,s,e);
		if(e < l||r < s) return tree[node];
		if(l <= s && e <= r){
			lazy[node] += diff;
			laz(node,s,e);
			return tree[node];
		}
		int m = (s + e) >> 1;
		return tree[node] = update(node<<1,s,m,l,r,diff) + update(node<<1|1,m+1,e,l,r,diff);
	}
	void update(int l,int r,ll diff){
		update(1,1,n,l,r,diff);
		//printf("%d %d %lld %lld\n",l,r,diff,tree[1].aba);
	}
	ll getroot(){
		return tree[1].aba;
	}
}myseg;

int N,Q;
ll W;
int s[MAXN];
int e[MAXN];
int t;
int pedge[MAXN];
vector<pi> edge[MAXN];
ll elen[MAXN];
ll ans = 0;

void dfs(int node){
	s[node] = e[node] = ++t;
	for(auto i : edge[node]){
		if(s[i.first]) continue;
		pedge[i.second] = i.first;
		dfs(i.first);
		e[node] = ++t;
	}
}




int main(){
	scanf("%d %d %lld",&N,&Q,&W);
	for(int i=0;i<N-1;i++){
		int a,b;
		scanf("%d %d %lld",&a,&b,&elen[i]);
		edge[a].push_back(pi(b,i));
		edge[b].push_back(pi(a,i));
	}
	dfs(1);
	myseg.resize(t);
	for(int i=0;i<N-1;i++){
		myseg.update(s[pedge[i]],e[pedge[i]],elen[i]);
	}
	for(int i=0;i<Q;i++){
		int D;
		ll E;
		scanf("%d %lld",&D,&E);
		D = (D + ans) % (N - 1);
		E = (E + ans) % W;
		myseg.update(s[pedge[D]],e[pedge[D]],E - elen[D]);
		elen[D] = E;
		ans = myseg.getroot();
		printf("%lld\n",ans);
	}

	return 0;
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:90:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %lld",&N,&Q,&W);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %lld",&a,&b,&elen[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:105:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %lld",&D,&E);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2552 KB Output is correct
2 Correct 7 ms 2680 KB Output is correct
3 Correct 7 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 7 ms 2680 KB Output is correct
7 Correct 7 ms 2680 KB Output is correct
8 Correct 7 ms 2680 KB Output is correct
9 Correct 7 ms 2680 KB Output is correct
10 Correct 7 ms 2680 KB Output is correct
11 Correct 7 ms 2680 KB Output is correct
12 Correct 7 ms 2680 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 6 ms 2684 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 7 ms 2680 KB Output is correct
17 Correct 6 ms 2680 KB Output is correct
18 Correct 6 ms 2680 KB Output is correct
19 Correct 13 ms 3196 KB Output is correct
20 Correct 13 ms 3192 KB Output is correct
21 Correct 13 ms 3192 KB Output is correct
22 Correct 14 ms 3192 KB Output is correct
23 Correct 19 ms 4984 KB Output is correct
24 Correct 20 ms 4856 KB Output is correct
25 Correct 21 ms 4856 KB Output is correct
26 Correct 25 ms 5112 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2680 KB Output is correct
2 Correct 7 ms 2680 KB Output is correct
3 Correct 7 ms 2680 KB Output is correct
4 Correct 19 ms 2808 KB Output is correct
5 Correct 66 ms 3064 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 8 ms 2936 KB Output is correct
8 Correct 7 ms 2936 KB Output is correct
9 Correct 9 ms 2936 KB Output is correct
10 Correct 22 ms 3064 KB Output is correct
11 Correct 81 ms 3448 KB Output is correct
12 Correct 12 ms 4856 KB Output is correct
13 Correct 13 ms 4856 KB Output is correct
14 Correct 15 ms 4984 KB Output is correct
15 Correct 34 ms 4984 KB Output is correct
16 Correct 112 ms 5368 KB Output is correct
17 Correct 133 ms 46220 KB Output is correct
18 Correct 136 ms 46188 KB Output is correct
19 Correct 140 ms 46188 KB Output is correct
20 Correct 170 ms 46312 KB Output is correct
21 Correct 323 ms 46956 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3192 KB Output is correct
2 Correct 19 ms 3192 KB Output is correct
3 Correct 58 ms 3576 KB Output is correct
4 Correct 109 ms 3704 KB Output is correct
5 Correct 22 ms 7032 KB Output is correct
6 Correct 34 ms 7160 KB Output is correct
7 Correct 92 ms 7416 KB Output is correct
8 Correct 164 ms 7672 KB Output is correct
9 Correct 85 ms 24440 KB Output is correct
10 Correct 103 ms 24568 KB Output is correct
11 Correct 172 ms 24696 KB Output is correct
12 Correct 270 ms 25080 KB Output is correct
13 Correct 173 ms 46224 KB Output is correct
14 Correct 187 ms 46200 KB Output is correct
15 Correct 270 ms 46456 KB Output is correct
16 Correct 369 ms 46840 KB Output is correct
17 Correct 363 ms 46844 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 47420 KB Output is correct
2 Correct 565 ms 47480 KB Output is correct
3 Correct 511 ms 51616 KB Output is correct
4 Correct 539 ms 51580 KB Output is correct
5 Correct 553 ms 51576 KB Output is correct
6 Correct 464 ms 51696 KB Output is correct
7 Correct 517 ms 52732 KB Output is correct
8 Correct 564 ms 52944 KB Output is correct
9 Correct 612 ms 52732 KB Output is correct
10 Correct 546 ms 52856 KB Output is correct
11 Correct 532 ms 52856 KB Output is correct
12 Correct 540 ms 52588 KB Output is correct
13 Correct 658 ms 54264 KB Output is correct
14 Correct 749 ms 54348 KB Output is correct
15 Correct 667 ms 54136 KB Output is correct
16 Correct 751 ms 54136 KB Output is correct
17 Correct 707 ms 53880 KB Output is correct
18 Correct 555 ms 53060 KB Output is correct
19 Correct 727 ms 54008 KB Output is correct
20 Correct 676 ms 54272 KB Output is correct
21 Correct 660 ms 54264 KB Output is correct
22 Correct 612 ms 54136 KB Output is correct
23 Correct 640 ms 54008 KB Output is correct
24 Correct 590 ms 53360 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2552 KB Output is correct
2 Correct 7 ms 2680 KB Output is correct
3 Correct 7 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 7 ms 2680 KB Output is correct
7 Correct 7 ms 2680 KB Output is correct
8 Correct 7 ms 2680 KB Output is correct
9 Correct 7 ms 2680 KB Output is correct
10 Correct 7 ms 2680 KB Output is correct
11 Correct 7 ms 2680 KB Output is correct
12 Correct 7 ms 2680 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 6 ms 2684 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 7 ms 2680 KB Output is correct
17 Correct 6 ms 2680 KB Output is correct
18 Correct 6 ms 2680 KB Output is correct
19 Correct 13 ms 3196 KB Output is correct
20 Correct 13 ms 3192 KB Output is correct
21 Correct 13 ms 3192 KB Output is correct
22 Correct 14 ms 3192 KB Output is correct
23 Correct 19 ms 4984 KB Output is correct
24 Correct 20 ms 4856 KB Output is correct
25 Correct 21 ms 4856 KB Output is correct
26 Correct 25 ms 5112 KB Output is correct
27 Correct 7 ms 2680 KB Output is correct
28 Correct 7 ms 2680 KB Output is correct
29 Correct 7 ms 2680 KB Output is correct
30 Correct 19 ms 2808 KB Output is correct
31 Correct 66 ms 3064 KB Output is correct
32 Correct 6 ms 2680 KB Output is correct
33 Correct 8 ms 2936 KB Output is correct
34 Correct 7 ms 2936 KB Output is correct
35 Correct 9 ms 2936 KB Output is correct
36 Correct 22 ms 3064 KB Output is correct
37 Correct 81 ms 3448 KB Output is correct
38 Correct 12 ms 4856 KB Output is correct
39 Correct 13 ms 4856 KB Output is correct
40 Correct 15 ms 4984 KB Output is correct
41 Correct 34 ms 4984 KB Output is correct
42 Correct 112 ms 5368 KB Output is correct
43 Correct 133 ms 46220 KB Output is correct
44 Correct 136 ms 46188 KB Output is correct
45 Correct 140 ms 46188 KB Output is correct
46 Correct 170 ms 46312 KB Output is correct
47 Correct 323 ms 46956 KB Output is correct
48 Correct 9 ms 3192 KB Output is correct
49 Correct 19 ms 3192 KB Output is correct
50 Correct 58 ms 3576 KB Output is correct
51 Correct 109 ms 3704 KB Output is correct
52 Correct 22 ms 7032 KB Output is correct
53 Correct 34 ms 7160 KB Output is correct
54 Correct 92 ms 7416 KB Output is correct
55 Correct 164 ms 7672 KB Output is correct
56 Correct 85 ms 24440 KB Output is correct
57 Correct 103 ms 24568 KB Output is correct
58 Correct 172 ms 24696 KB Output is correct
59 Correct 270 ms 25080 KB Output is correct
60 Correct 173 ms 46224 KB Output is correct
61 Correct 187 ms 46200 KB Output is correct
62 Correct 270 ms 46456 KB Output is correct
63 Correct 369 ms 46840 KB Output is correct
64 Correct 363 ms 46844 KB Output is correct
65 Correct 569 ms 47420 KB Output is correct
66 Correct 565 ms 47480 KB Output is correct
67 Correct 511 ms 51616 KB Output is correct
68 Correct 539 ms 51580 KB Output is correct
69 Correct 553 ms 51576 KB Output is correct
70 Correct 464 ms 51696 KB Output is correct
71 Correct 517 ms 52732 KB Output is correct
72 Correct 564 ms 52944 KB Output is correct
73 Correct 612 ms 52732 KB Output is correct
74 Correct 546 ms 52856 KB Output is correct
75 Correct 532 ms 52856 KB Output is correct
76 Correct 540 ms 52588 KB Output is correct
77 Correct 658 ms 54264 KB Output is correct
78 Correct 749 ms 54348 KB Output is correct
79 Correct 667 ms 54136 KB Output is correct
80 Correct 751 ms 54136 KB Output is correct
81 Correct 707 ms 53880 KB Output is correct
82 Correct 555 ms 53060 KB Output is correct
83 Correct 727 ms 54008 KB Output is correct
84 Correct 676 ms 54272 KB Output is correct
85 Correct 660 ms 54264 KB Output is correct
86 Correct 612 ms 54136 KB Output is correct
87 Correct 640 ms 54008 KB Output is correct
88 Correct 590 ms 53360 KB Output is correct
89 Correct 535 ms 50616 KB Output is correct
90 Correct 501 ms 50972 KB Output is correct
91 Correct 535 ms 51576 KB Output is correct
92 Correct 595 ms 51448 KB Output is correct
93 Correct 650 ms 52560 KB Output is correct
94 Correct 649 ms 51904 KB Output is correct
95 Correct 625 ms 52504 KB Output is correct
96 Correct 615 ms 52088 KB Output is correct
97 Correct 553 ms 52472 KB Output is correct
98 Correct 568 ms 53488 KB Output is correct
99 Correct 618 ms 52284 KB Output is correct
100 Correct 612 ms 52448 KB Output is correct