oj.uz

Submission #856519

# Submission time Handle Problem Language Result Execution time Memory
856519 2023-10-03T18:53:07 Z hocky Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 258 ms 98752 KB 
#include "bits/stdc++.h"

using namespace std;
const int LIM = 200000;
#define fi first
#define se second
typedef pair < int, int > PII;
typedef long long LL;

namespace DynamicDiameter {
    vector <pair<int, LL>> edge[LIM + 5];
    int event[2 * LIM + 5];
    int dfsTime = 0;
    LL weights[LIM + 5], depth[LIM + 5];
    PII order[LIM + 5];
    void eulerTour(int pos, int par = -1) {
        dfsTime++;
        order[pos].fi = dfsTime;
        event[dfsTime] = pos;
        for (auto &nx: edge[pos]) {
            if (nx.fi == par) continue;
            depth[nx.fi] = depth[pos] + nx.se;
            weights[nx.fi] = nx.se;
            eulerTour(nx.fi, pos);
            dfsTime++;
            event[dfsTime] = pos;
        }
        order[pos].se = dfsTime;
        return;
    }
    
    const LL INF = 1e14;
    // Segment Tree starts here
    struct Node{
		LL maxDepth = -INF, minDepth = INF;
		LL leftMax = -INF, rightMax = -INF;
		LL diameter = 0;
		LL lazy;
	};
	
	Node segt[4 * LIM + 5];
	void pushDown(int rangeL = 1, int rangeR = dfsTime, int idx = 1){
		if(segt[idx].lazy == 0) return;
		auto &val = segt[idx].lazy;
		segt[idx].maxDepth += val;
		segt[idx].minDepth += val;
		segt[idx].leftMax -= val;
		segt[idx].rightMax -= val;
		if(rangeL != rangeR){
			segt[idx * 2].lazy += val;
			segt[idx * 2 + 1].lazy += val;
		}
		val = 0;
		return;
	}
	void merge(Node &head, Node &l, Node &r){
		head.maxDepth = max(l.maxDepth, r.maxDepth);
		head.minDepth = min(l.minDepth, r.minDepth);
		
		head.leftMax = max(l.leftMax, r.leftMax);
		head.leftMax = max(head.leftMax, l.maxDepth - 2 * r.minDepth);
		
		head.rightMax = max(l.rightMax, r.rightMax);
		head.rightMax = max(head.rightMax, r.maxDepth - 2 * l.minDepth);
		
		head.diameter = max(l.diameter, r.diameter);
		head.diameter = max(head.diameter, l.maxDepth + r.rightMax);
		head.diameter = max(head.diameter, r.maxDepth + l.leftMax);
		//~ cout << head.maxDepth << " " << head.minDepth << " " << head.leftMax << " " << head.rightMax << " " << head.diameter << endl;
	}
	void build(int rangeL = 1, int rangeR = dfsTime, int idx = 1){
		//~ cout << rangeL << " " << rangeR << " " << idx << endl;
		if(rangeL == rangeR){
			segt[idx].minDepth = segt[idx].maxDepth = depth[event[rangeL]];
			segt[idx].leftMax = segt[idx].rightMax = -depth[event[rangeL]];
			return;
		}
		int mid = (rangeL + rangeR) >> 1;
		build(rangeL, mid, idx * 2);
		build(mid + 1, rangeR, idx * 2 + 1);
		merge(segt[idx], segt[idx * 2], segt[idx * 2 + 1]);
	}
    void update(int queryL, int queryR, int val, int rangeL = 1, int rangeR = dfsTime, int idx = 1){
		pushDown(rangeL, rangeR, idx);
		if(rangeR < queryL) return;
		if(queryR < rangeL) return; 
		if(queryL <= rangeL && rangeR <= queryR){
			segt[idx].lazy = val;
			pushDown(rangeL, rangeR, idx);
			return;
		}
		int mid = (rangeL + rangeR) >> 1;
		update(queryL, queryR, val, rangeL, mid, idx * 2);
		update(queryL, queryR, val, mid + 1, rangeR, idx * 2 + 1);
		merge(segt[idx], segt[idx * 2], segt[idx * 2 + 1]);
		return;
	}
}

using namespace DynamicDiameter;

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
	int n, q, w; cin >> n >> q >> w;
	vector <PII> edges(n - 1);
    for (int i = 0; i < n - 1; i++) {
		int c;
        cin >> edges[i].fi >> edges[i].se >> c;
        edge[edges[i].fi].emplace_back(edges[i].se, c);
        edge[edges[i].se].emplace_back(edges[i].fi, c);
    }
    eulerTour(1);
    //~ for(int i = 1;i <= dfsTime;i++) cout << event[i] << " ";
    //~ cout << endl;
    //~ for(int i = 1;i <= n;i++) cout << i << " " << order[i].fi << " " << order[i].se << endl;
    build();
    int ans = 0;
    //~ cout << segt[1].diameter << endl;
    //~ return 0;
    while(q--){
		int d, e; cin >> d >> e;
		d = (d + ans) % (n - 1);
		e = (e + ans) % w;
		auto &edge = edges[d];
		if(order[edge.fi].fi > order[edge.se].fi) {
			swap(edge.fi, edge.se);
		}
		// Update the segment tree
		//~ cout << e - weights[edge.se] << endl;
		//~ cout << segt[1].diameter << endl;
		update(order[edge.se].fi, order[edge.se].se, e - weights[edge.se]);
		weights[edge.se] = e;
		pushDown();
		ans = segt[1].diameter;
		cout << ans << endl;
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 46940 KB Output is correct
2 Correct 8 ms 46936 KB Output is correct
3 Correct 7 ms 46940 KB Output is correct
4 Correct 7 ms 46940 KB Output is correct
5 Correct 7 ms 46892 KB Output is correct
6 Correct 8 ms 46684 KB Output is correct
7 Correct 7 ms 46940 KB Output is correct
8 Correct 8 ms 46940 KB Output is correct
9 Correct 7 ms 46940 KB Output is correct
10 Correct 7 ms 46940 KB Output is correct
11 Correct 7 ms 46940 KB Output is correct
12 Correct 8 ms 46936 KB Output is correct
13 Correct 7 ms 46940 KB Output is correct
14 Correct 7 ms 46856 KB Output is correct
15 Correct 7 ms 46856 KB Output is correct
16 Correct 7 ms 46936 KB Output is correct
17 Correct 8 ms 46936 KB Output is correct
18 Correct 7 ms 46940 KB Output is correct
19 Correct 14 ms 46940 KB Output is correct
20 Correct 15 ms 46940 KB Output is correct
21 Correct 15 ms 46940 KB Output is correct
22 Correct 15 ms 46936 KB Output is correct
23 Correct 16 ms 47304 KB Output is correct
24 Correct 16 ms 47308 KB Output is correct
25 Correct 18 ms 47148 KB Output is correct
26 Correct 19 ms 47708 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 46940 KB Output is correct
2 Correct 7 ms 46940 KB Output is correct
3 Correct 9 ms 46936 KB Output is correct
4 Correct 33 ms 46940 KB Output is correct
5 Correct 139 ms 47304 KB Output is correct
6 Correct 7 ms 46936 KB Output is correct
7 Correct 7 ms 46940 KB Output is correct
8 Correct 7 ms 46840 KB Output is correct
9 Correct 10 ms 46940 KB Output is correct
10 Correct 39 ms 47256 KB Output is correct
11 Correct 151 ms 47308 KB Output is correct
12 Correct 8 ms 47192 KB Output is correct
13 Correct 9 ms 47196 KB Output is correct
14 Correct 13 ms 47124 KB Output is correct
15 Correct 41 ms 47352 KB Output is correct
16 Correct 177 ms 47936 KB Output is correct
17 Correct 30 ms 53452 KB Output is correct
18 Correct 31 ms 54464 KB Output is correct
19 Correct 37 ms 54720 KB Output is correct
20 Correct 65 ms 54976 KB Output is correct
21 Correct 258 ms 56452 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 46936 KB Output is correct
2 Correct 22 ms 46940 KB Output is correct
3 Correct 85 ms 47184 KB Output is correct
4 Correct 162 ms 47440 KB Output is correct
5 Correct 11 ms 47448 KB Output is correct
6 Correct 28 ms 47648 KB Output is correct
7 Correct 94 ms 47696 KB Output is correct
8 Correct 189 ms 47988 KB Output is correct
9 Correct 22 ms 50268 KB Output is correct
10 Correct 39 ms 50524 KB Output is correct
11 Correct 112 ms 50728 KB Output is correct
12 Correct 226 ms 51044 KB Output is correct
13 Correct 37 ms 54104 KB Output is correct
14 Correct 55 ms 56188 KB Output is correct
15 Correct 134 ms 56592 KB Output is correct
16 Correct 247 ms 57424 KB Output is correct
17 Correct 228 ms 57168 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 98752 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 46940 KB Output is correct
2 Correct 8 ms 46936 KB Output is correct
3 Correct 7 ms 46940 KB Output is correct
4 Correct 7 ms 46940 KB Output is correct
5 Correct 7 ms 46892 KB Output is correct
6 Correct 8 ms 46684 KB Output is correct
7 Correct 7 ms 46940 KB Output is correct
8 Correct 8 ms 46940 KB Output is correct
9 Correct 7 ms 46940 KB Output is correct
10 Correct 7 ms 46940 KB Output is correct
11 Correct 7 ms 46940 KB Output is correct
12 Correct 8 ms 46936 KB Output is correct
13 Correct 7 ms 46940 KB Output is correct
14 Correct 7 ms 46856 KB Output is correct
15 Correct 7 ms 46856 KB Output is correct
16 Correct 7 ms 46936 KB Output is correct
17 Correct 8 ms 46936 KB Output is correct
18 Correct 7 ms 46940 KB Output is correct
19 Correct 14 ms 46940 KB Output is correct
20 Correct 15 ms 46940 KB Output is correct
21 Correct 15 ms 46940 KB Output is correct
22 Correct 15 ms 46936 KB Output is correct
23 Correct 16 ms 47304 KB Output is correct
24 Correct 16 ms 47308 KB Output is correct
25 Correct 18 ms 47148 KB Output is correct
26 Correct 19 ms 47708 KB Output is correct
27 Correct 8 ms 46940 KB Output is correct
28 Correct 7 ms 46940 KB Output is correct
29 Correct 9 ms 46936 KB Output is correct
30 Correct 33 ms 46940 KB Output is correct
31 Correct 139 ms 47304 KB Output is correct
32 Correct 7 ms 46936 KB Output is correct
33 Correct 7 ms 46940 KB Output is correct
34 Correct 7 ms 46840 KB Output is correct
35 Correct 10 ms 46940 KB Output is correct
36 Correct 39 ms 47256 KB Output is correct
37 Correct 151 ms 47308 KB Output is correct
38 Correct 8 ms 47192 KB Output is correct
39 Correct 9 ms 47196 KB Output is correct
40 Correct 13 ms 47124 KB Output is correct
41 Correct 41 ms 47352 KB Output is correct
42 Correct 177 ms 47936 KB Output is correct
43 Correct 30 ms 53452 KB Output is correct
44 Correct 31 ms 54464 KB Output is correct
45 Correct 37 ms 54720 KB Output is correct
46 Correct 65 ms 54976 KB Output is correct
47 Correct 258 ms 56452 KB Output is correct
48 Correct 8 ms 46936 KB Output is correct
49 Correct 22 ms 46940 KB Output is correct
50 Correct 85 ms 47184 KB Output is correct
51 Correct 162 ms 47440 KB Output is correct
52 Correct 11 ms 47448 KB Output is correct
53 Correct 28 ms 47648 KB Output is correct
54 Correct 94 ms 47696 KB Output is correct
55 Correct 189 ms 47988 KB Output is correct
56 Correct 22 ms 50268 KB Output is correct
57 Correct 39 ms 50524 KB Output is correct
58 Correct 112 ms 50728 KB Output is correct
59 Correct 226 ms 51044 KB Output is correct
60 Correct 37 ms 54104 KB Output is correct
61 Correct 55 ms 56188 KB Output is correct
62 Correct 134 ms 56592 KB Output is correct
63 Correct 247 ms 57424 KB Output is correct
64 Correct 228 ms 57168 KB Output is correct
65 Runtime error 46 ms 98752 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -