oj.uz

답안 #618951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618951 2022-08-02T08:35:04 Z sentheta Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 11832 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;
		}
	}
};

struct Sub4{
	int p[N];
	int ans[N], path[N];
	void dp_trans(int x){
		// 2 children
		if(2*x+1 <= n){
			ans[x] = max({
				ans[2*x], ans[2*x+1],
				path[2*x] + edges[p[2*x]][2]
				+ path[2*x+1] + edges[p[2*x+1]][2] 
			});
			path[x] = max({
				path[2*x] + edges[p[2*x]][2],
				path[2*x+1] + edges[p[2*x+1]][2] 
			});
		}
		// 1 children
		else if(2*x <= n){
			ans[x] = path[2*x] + edges[p[2*x]][2];
			path[x] = path[2*x] + edges[p[2*x]][2];
		}
		// 0 children
		else{
			ans[x] = path[x] = 0;
		}

		if(x!=1) dp_trans(x/2);
	}
	void run(){
		rep(i,0,n-1){
			auto[u,v,w] = edges[i];
			p[v] = i;
		}
		// rep(i,1,n+1){
		for(int i=n; i>=1; i--){
			dp_trans(i);
		}
		// rep(i,1,n+1){
		// 	dbg(i);
		// 	dbg(ans[i]); dbg(path[i]);
		// }

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

			edges[i][2] = w;
			dp_trans(edges[i][0]);

			cout << ans[1] << nl;
			last = ans[1];
		}
	}
};

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, sub4 = 1;
	rep(i,0,n-1){
		auto[u,v,w] = edges[i];
		if(u > v) swap(u,v);

		sub3 &= u==1;
		sub4 &= v/2==u;
	}
	if(sub3){
		Sub3 sub; sub.run(); return 0;
	}
	if(sub4){
		// dbg(sub4);
		Sub4 sub; sub.run(); return 0;
	}

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 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 2 ms 2644 KB Output is correct
9 Correct 1 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 3 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 2656 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 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 2 ms 2644 KB Output is correct
9 Correct 1 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 3 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 2656 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 187 ms 2892 KB Output is correct
20 Correct 222 ms 3016 KB Output is correct
21 Correct 219 ms 2892 KB Output is correct
22 Correct 239 ms 2912 KB Output is correct
23 Correct 1415 ms 3084 KB Output is correct
24 Correct 1620 ms 3172 KB Output is correct
25 Correct 1708 ms 3088 KB Output is correct
26 Correct 1899 ms 3340 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 15 ms 3280 KB Output is correct
5 Correct 66 ms 4720 KB Output is correct
6 Correct 1 ms 2516 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 18 ms 3228 KB Output is correct
11 Correct 66 ms 4800 KB Output is correct
12 Correct 5 ms 2964 KB Output is correct
13 Correct 7 ms 2992 KB Output is correct
14 Correct 7 ms 2964 KB Output is correct
15 Correct 19 ms 3344 KB Output is correct
16 Correct 77 ms 4940 KB Output is correct
17 Correct 86 ms 9592 KB Output is correct
18 Correct 100 ms 9580 KB Output is correct
19 Correct 102 ms 9688 KB Output is correct
20 Correct 119 ms 10204 KB Output is correct
21 Correct 224 ms 11832 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 9 ms 3044 KB Output is correct
3 Correct 27 ms 3840 KB Output is correct
4 Correct 53 ms 4800 KB Output is correct
5 Correct 9 ms 3092 KB Output is correct
6 Correct 14 ms 3344 KB Output is correct
7 Correct 44 ms 4172 KB Output is correct
8 Correct 62 ms 5296 KB Output is correct
9 Correct 39 ms 4268 KB Output is correct
10 Correct 46 ms 4292 KB Output is correct
11 Correct 68 ms 5912 KB Output is correct
12 Correct 102 ms 6896 KB Output is correct
13 Correct 79 ms 5724 KB Output is correct
14 Correct 83 ms 5748 KB Output is correct
15 Correct 106 ms 7108 KB Output is correct
16 Correct 148 ms 9100 KB Output is correct
17 Correct 140 ms 9180 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5082 ms 10168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 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 2 ms 2644 KB Output is correct
9 Correct 1 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 3 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 2656 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 187 ms 2892 KB Output is correct
20 Correct 222 ms 3016 KB Output is correct
21 Correct 219 ms 2892 KB Output is correct
22 Correct 239 ms 2912 KB Output is correct
23 Correct 1415 ms 3084 KB Output is correct
24 Correct 1620 ms 3172 KB Output is correct
25 Correct 1708 ms 3088 KB Output is correct
26 Correct 1899 ms 3340 KB Output is correct
27 Correct 1 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 15 ms 3280 KB Output is correct
31 Correct 66 ms 4720 KB Output is correct
32 Correct 1 ms 2516 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 18 ms 3228 KB Output is correct
37 Correct 66 ms 4800 KB Output is correct
38 Correct 5 ms 2964 KB Output is correct
39 Correct 7 ms 2992 KB Output is correct
40 Correct 7 ms 2964 KB Output is correct
41 Correct 19 ms 3344 KB Output is correct
42 Correct 77 ms 4940 KB Output is correct
43 Correct 86 ms 9592 KB Output is correct
44 Correct 100 ms 9580 KB Output is correct
45 Correct 102 ms 9688 KB Output is correct
46 Correct 119 ms 10204 KB Output is correct
47 Correct 224 ms 11832 KB Output is correct
48 Correct 3 ms 2644 KB Output is correct
49 Correct 9 ms 3044 KB Output is correct
50 Correct 27 ms 3840 KB Output is correct
51 Correct 53 ms 4800 KB Output is correct
52 Correct 9 ms 3092 KB Output is correct
53 Correct 14 ms 3344 KB Output is correct
54 Correct 44 ms 4172 KB Output is correct
55 Correct 62 ms 5296 KB Output is correct
56 Correct 39 ms 4268 KB Output is correct
57 Correct 46 ms 4292 KB Output is correct
58 Correct 68 ms 5912 KB Output is correct
59 Correct 102 ms 6896 KB Output is correct
60 Correct 79 ms 5724 KB Output is correct
61 Correct 83 ms 5748 KB Output is correct
62 Correct 106 ms 7108 KB Output is correct
63 Correct 148 ms 9100 KB Output is correct
64 Correct 140 ms 9180 KB Output is correct
65 Execution timed out 5082 ms 10168 KB Time limit exceeded
66 Halted 0 ms 0 KB -