oj.uz

Submission #944056

# Submission time Handle Problem Language Result Execution time Memory
944056 2024-03-12T07:48:49 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 2463 ms 21252 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define rep(i,s,f) for(int i = s;i < f;i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back

const int N = 1e5 + 1;

set<pair<int,int>> g[N];
int mx,fnd;

void dfs(int n,int p,int dis,bool check){
	if(dis > mx){
		mx = dis;
		fnd = n;
	}
	for(auto [to,cost] : g[n]){
		if(to != p){
			dfs(to,n,dis + cost,check);
		}
	}
}

void solve(){
	
	int n,m,w;
	cin >> n >> m >> w;
	array<int,3> ind[n];
	for(int i = 0;i < n - 1;i++){
		int a,b,c;
		cin >> a >> b >> c;
		g[a].insert({b,c});
		g[b].insert({a,c});
		ind[i] = {a,b,c};
	}
	int last = 0;
	for(int i = 0;i < m;i++){
		int d,e;
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % w;
		auto &[a,b,c] = ind[d];
		g[a].erase({b,c});
		g[b].erase({a,c});
		g[a].insert({b,e});
		g[b].insert({a,e});
		ind[d][2] = e;
		if(n <= 5000 && m <= 5000){
			dfs(1,-1,0,0);
			dfs(fnd,-1,0,1);
			cout << mx << "\n";
			last = mx;
			mx = 0;
		}
	}
	
}
 
signed main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 2 ms 4952 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4952 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 119 ms 5304 KB Output is correct
20 Correct 121 ms 5212 KB Output is correct
21 Correct 137 ms 5304 KB Output is correct
22 Correct 189 ms 5620 KB Output is correct
23 Correct 1503 ms 6128 KB Output is correct
24 Correct 1657 ms 6160 KB Output is correct
25 Correct 1730 ms 6196 KB Output is correct
26 Correct 2463 ms 6224 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Incorrect 6 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5212 KB Output is correct
2 Incorrect 4 ms 5212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 142 ms 21252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 2 ms 4952 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4952 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 119 ms 5304 KB Output is correct
20 Correct 121 ms 5212 KB Output is correct
21 Correct 137 ms 5304 KB Output is correct
22 Correct 189 ms 5620 KB Output is correct
23 Correct 1503 ms 6128 KB Output is correct
24 Correct 1657 ms 6160 KB Output is correct
25 Correct 1730 ms 6196 KB Output is correct
26 Correct 2463 ms 6224 KB Output is correct
27 Correct 1 ms 4952 KB Output is correct
28 Correct 2 ms 4956 KB Output is correct
29 Correct 3 ms 4956 KB Output is correct
30 Incorrect 6 ms 4956 KB Output isn't correct
31 Halted 0 ms 0 KB -