oj.uz

Submission #618901

# Submission time Handle Problem Language Result Execution time Memory
618901 2022-08-02T08:16:30 Z sentheta Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 11800 KB 
#include<algorithm>
#include<iostream>
#include<cassert>
#include<vector>
#include<string>
#include<array>
#include<stack>
#include<queue>
#include<map>
#include<set>
using namespace std;

#define V vector
#define Int long long
#define rep(i,a,b) for(int i=(int)(a); i<(int)(b); i++)
#define nl '\n'
#define dbg(x) cout << "?" << #x << " : " << x << endl;
#define all(x) (x).begin(), (x).end()

#define int long long
#define pii pair<int,int>

const int N = 1e5+5;
int n, q, wlim;
V<array<int,3>> edges;
V<pair<int,int>> queries;

struct Sub1{
	V<int> adj[N];
	int mxdist = 0, mxnode = -1;
	void dfs(int x,int par=-1,int dist=0){
		if(dist >= mxdist){
			mxdist = dist;
			mxnode = x;
		}

		for(int id : adj[x]){
			int y = edges[id][0]^edges[id][1]^x;
			int w = edges[id][2];
			if(y==par) continue;

			dfs(y,x, dist+w);
		}
	}
	void run(){
		rep(i,0,n-1){
			auto[u,v,w] = edges[i];
			adj[u].push_back(i);
			adj[v].push_back(i);
		}

		int last = 0;
		for(auto[i,w] : queries){
			i = (i+last)%(n-1);
			w = (w+last)%wlim;
			edges[i][2] = w;

			mxdist = 0;
			dfs(1);
			dfs(mxnode);

			cout << mxdist << nl;
			last = mxdist;
		}
	}
};

struct Sub3{
	int arr[N];
	multiset<int> s;
	void run(){
		rep(i,0,n-1){
			auto[u,v,w] = edges[i];
			if(u==1) swap(u,v);

			arr[u] = w;
			s.insert(w);
		}

		int last = 0;
		for(auto[i,w] : queries){
			i = (i+last)%(n-1);
			w = (w+last)%wlim;
			auto[u,v,ww] = edges[i];
			if(u==1) swap(u,v);

			s.erase(s.find(arr[u]));
			arr[u] = w;
			s.insert(arr[u]);

			int ans = *prev(s.end());
			if(n > 2){
				ans += *prev(prev(s.end()));
			}

			cout << ans << nl;
			last = ans;
		}
	}
};

signed main(){

	cin >> n >> q >> wlim;
	
	rep(i,0,n-1){
		int u, v, w;
		cin >> u >> v >> w;

		edges.push_back({u,v,w});
	}
	rep(i,0,q){
		int idx, w;
		cin >> idx >> w;

		queries.push_back({idx,w});
	}

	bool sub3 = 1;
	rep(i,0,n-1){
		auto[u,v,w] = edges[i];
		sub3 &= (u==1 || v==1);
	}
	if(sub3){
		Sub3 sub; sub.run(); return 0;
	}

	Sub1 sub; sub.run(); return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 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 2 ms 2644 KB Output is correct
8 Correct 3 ms 2644 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 2 ms 2644 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 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 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 2 ms 2644 KB Output is correct
8 Correct 3 ms 2644 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 2 ms 2644 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 2644 KB Output is correct
19 Correct 223 ms 2892 KB Output is correct
20 Correct 245 ms 2900 KB Output is correct
21 Correct 235 ms 2880 KB Output is correct
22 Correct 259 ms 2932 KB Output is correct
23 Correct 1618 ms 3056 KB Output is correct
24 Correct 1842 ms 3060 KB Output is correct
25 Correct 1848 ms 3084 KB Output is correct
26 Correct 2098 ms 3320 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 4 ms 2644 KB Output is correct
4 Correct 17 ms 3240 KB Output is correct
5 Correct 67 ms 4804 KB Output is correct
6 Correct 1 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 4 ms 2644 KB Output is correct
10 Correct 16 ms 3280 KB Output is correct
11 Correct 85 ms 4800 KB Output is correct
12 Correct 5 ms 2900 KB Output is correct
13 Correct 6 ms 2964 KB Output is correct
14 Correct 7 ms 3032 KB Output is correct
15 Correct 22 ms 3324 KB Output is correct
16 Correct 80 ms 4948 KB Output is correct
17 Correct 93 ms 9656 KB Output is correct
18 Correct 101 ms 9576 KB Output is correct
19 Correct 94 ms 9632 KB Output is correct
20 Correct 115 ms 10064 KB Output is correct
21 Correct 234 ms 11800 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2644 KB Output is correct
2 Correct 219 ms 3104 KB Output is correct
3 Correct 1058 ms 3948 KB Output is correct
4 Correct 2055 ms 4876 KB Output is correct
5 Correct 249 ms 3288 KB Output is correct
6 Correct 2361 ms 3480 KB Output is correct
7 Execution timed out 5051 ms 4192 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 5090 ms 10236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 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 2 ms 2644 KB Output is correct
8 Correct 3 ms 2644 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 2 ms 2644 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 2644 KB Output is correct
19 Correct 223 ms 2892 KB Output is correct
20 Correct 245 ms 2900 KB Output is correct
21 Correct 235 ms 2880 KB Output is correct
22 Correct 259 ms 2932 KB Output is correct
23 Correct 1618 ms 3056 KB Output is correct
24 Correct 1842 ms 3060 KB Output is correct
25 Correct 1848 ms 3084 KB Output is correct
26 Correct 2098 ms 3320 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 1 ms 2644 KB Output is correct
29 Correct 4 ms 2644 KB Output is correct
30 Correct 17 ms 3240 KB Output is correct
31 Correct 67 ms 4804 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 4 ms 2644 KB Output is correct
36 Correct 16 ms 3280 KB Output is correct
37 Correct 85 ms 4800 KB Output is correct
38 Correct 5 ms 2900 KB Output is correct
39 Correct 6 ms 2964 KB Output is correct
40 Correct 7 ms 3032 KB Output is correct
41 Correct 22 ms 3324 KB Output is correct
42 Correct 80 ms 4948 KB Output is correct
43 Correct 93 ms 9656 KB Output is correct
44 Correct 101 ms 9576 KB Output is correct
45 Correct 94 ms 9632 KB Output is correct
46 Correct 115 ms 10064 KB Output is correct
47 Correct 234 ms 11800 KB Output is correct
48 Correct 22 ms 2644 KB Output is correct
49 Correct 219 ms 3104 KB Output is correct
50 Correct 1058 ms 3948 KB Output is correct
51 Correct 2055 ms 4876 KB Output is correct
52 Correct 249 ms 3288 KB Output is correct
53 Correct 2361 ms 3480 KB Output is correct
54 Execution timed out 5051 ms 4192 KB Time limit exceeded
55 Halted 0 ms 0 KB -