Submission #275968

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
275968	2020-08-20T08:41:36 Z	theStaticMind	Dynamic Diameter (CEOI19_diameter)	C++14	49 / 100	5000 ms	33128 KB

diameter

#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
int n;

vector<ii> adj[100005];
vector<ii> edge;
int anc[20][100005];
int depth[100005];

multiset<int> diameter;
multiset<int> data[100005];
map<int, int> ptr;

int getedge(int x, int y){
	return lower_bound(all(adj[x]), ii{y, -1}) - adj[x].begin();
}

int getdia(int x){
	if(data[x].empty()) return 0;
	if(data[x].size() == 1) return *data[x].rbegin();
	return *data[x].rbegin() + *++data[x].rbegin();
}
int getmax(int x){
	if(data[x].empty()) return 0;
	return *data[x].rbegin();	
}

void update(int x, int y){
	diameter.erase(diameter.find(getdia(x)));
	data[x].erase(data[x].lower_bound(ptr[y]));
	ptr[y] = getmax(y) + adj[x][getedge(x, y)].second;
	data[x].insert(ptr[y]);
	diameter.insert(getdia(x));
}

void init(int x, int pre){

	for(auto p : adj[x]){
		int y = p.first;
		if(y == pre) continue;
		
		anc[0][y] = x;
		depth[y] = depth[x] + 1;

		init(y, x);

		data[x].insert(getmax(y) + p.second);
		ptr[y] = getmax(y) + p.second;

	}

	diameter.insert(getdia(x));
}


vector<int> dp(100005, 0);
void naive(int x, int pre){

	for(auto p : adj[x]){
		int y = p.first;
		if(y == pre) continue;
		
		dp[y] = dp[x] + p.second;

		naive(y, x);

	}
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int q, W;
	cin >> n >> q >> W;

	for(int i = 0; i < n - 1; i++){
		int x, y, z;
		cin >> x >> y >> z;
		adj[x].pb({y, z});
		adj[y].pb({x, z});

		edge.pb({x, y});
	}

	for(int i = 1; i <= n; i++){
		sort(all(adj[i]));
	}

	init(1, 0);

	int last = 0;

	while(q--){
		ii p;
		cin >> p.first >> p.second;
		p.first = (p.first + last) % (n - 1);
		p.second = (p.second + last) % W;
		int x = edge[p.first].first;
		int y = edge[p.first].second;
		int z = p.second;

		adj[x][getedge(x, y)].second = z;
		adj[y][getedge(y, x)].second = z;

		if(n <= 5000){
			int root = 1;

			dp = vector<int>(n + 1, 0);
			naive(root, -1);

			root = max_element(all(dp)) - dp.begin();
			dp = vector<int>(n + 1, 0);
			naive(root, -1);

			last = *max_element(all(dp));
		}
		else{

			if(depth[x] > depth[y]) swap(x, y);

			while(x){
				update(x, y);
				y = x;
				x = anc[0][x];
			}

			last = *diameter.rbegin();
		}
		cout << last << "\n";
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	8192 KB	Output is correct
2	Correct	6 ms	8192 KB	Output is correct
3	Correct	5 ms	8192 KB	Output is correct
4	Correct	6 ms	8192 KB	Output is correct
5	Correct	6 ms	8192 KB	Output is correct
6	Correct	6 ms	8192 KB	Output is correct
7	Correct	6 ms	8192 KB	Output is correct
8	Correct	6 ms	8192 KB	Output is correct
9	Correct	7 ms	8192 KB	Output is correct
10	Correct	6 ms	8192 KB	Output is correct
11	Correct	6 ms	8192 KB	Output is correct
12	Correct	6 ms	8192 KB	Output is correct
13	Correct	6 ms	8192 KB	Output is correct
14	Correct	6 ms	8192 KB	Output is correct
15	Correct	6 ms	8192 KB	Output is correct
16	Correct	7 ms	8192 KB	Output is correct
17	Correct	6 ms	8192 KB	Output is correct
18	Correct	6 ms	8192 KB	Output is correct
19	Correct	153 ms	8448 KB	Output is correct
20	Correct	163 ms	8448 KB	Output is correct
21	Correct	174 ms	8448 KB	Output is correct
22	Correct	225 ms	8448 KB	Output is correct
23	Correct	1158 ms	9472 KB	Output is correct
24	Correct	1342 ms	9472 KB	Output is correct
25	Correct	1433 ms	9472 KB	Output is correct
26	Correct	1574 ms	9984 KB	Output is correct

Subtask #3
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	8192 KB	Output is correct
2	Correct	6 ms	8192 KB	Output is correct
3	Correct	9 ms	8192 KB	Output is correct
4	Correct	20 ms	8244 KB	Output is correct
5	Correct	81 ms	8192 KB	Output is correct
6	Correct	6 ms	8192 KB	Output is correct
7	Correct	8 ms	8320 KB	Output is correct
8	Correct	9 ms	8320 KB	Output is correct
9	Correct	23 ms	8320 KB	Output is correct
10	Correct	171 ms	8320 KB	Output is correct
11	Correct	837 ms	8320 KB	Output is correct
12	Correct	11 ms	9344 KB	Output is correct
13	Correct	11 ms	9344 KB	Output is correct
14	Correct	14 ms	9344 KB	Output is correct
15	Correct	40 ms	9592 KB	Output is correct
16	Correct	184 ms	9848 KB	Output is correct
17	Correct	182 ms	31676 KB	Output is correct
18	Correct	180 ms	31700 KB	Output is correct
19	Correct	190 ms	31704 KB	Output is correct
20	Correct	268 ms	31832 KB	Output is correct
21	Correct	789 ms	32596 KB	Output is correct

Subtask #4
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	8448 KB	Output is correct
2	Correct	200 ms	8448 KB	Output is correct
3	Correct	973 ms	8448 KB	Output is correct
4	Correct	1968 ms	8448 KB	Output is correct
5	Correct	21 ms	10620 KB	Output is correct
6	Correct	58 ms	10620 KB	Output is correct
7	Correct	261 ms	10868 KB	Output is correct
8	Correct	471 ms	11380 KB	Output is correct
9	Correct	108 ms	20472 KB	Output is correct
10	Correct	167 ms	20504 KB	Output is correct
11	Correct	439 ms	20684 KB	Output is correct
12	Correct	891 ms	20972 KB	Output is correct
13	Correct	164 ms	32488 KB	Output is correct
14	Correct	278 ms	32488 KB	Output is correct
15	Correct	702 ms	32744 KB	Output is correct
16	Correct	1138 ms	33128 KB	Output is correct
17	Correct	3035 ms	33044 KB	Output is correct

Subtask #5
0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	5078 ms	32356 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	8192 KB	Output is correct
2	Correct	6 ms	8192 KB	Output is correct
3	Correct	5 ms	8192 KB	Output is correct
4	Correct	6 ms	8192 KB	Output is correct
5	Correct	6 ms	8192 KB	Output is correct
6	Correct	6 ms	8192 KB	Output is correct
7	Correct	6 ms	8192 KB	Output is correct
8	Correct	6 ms	8192 KB	Output is correct
9	Correct	7 ms	8192 KB	Output is correct
10	Correct	6 ms	8192 KB	Output is correct
11	Correct	6 ms	8192 KB	Output is correct
12	Correct	6 ms	8192 KB	Output is correct
13	Correct	6 ms	8192 KB	Output is correct
14	Correct	6 ms	8192 KB	Output is correct
15	Correct	6 ms	8192 KB	Output is correct
16	Correct	7 ms	8192 KB	Output is correct
17	Correct	6 ms	8192 KB	Output is correct
18	Correct	6 ms	8192 KB	Output is correct
19	Correct	153 ms	8448 KB	Output is correct
20	Correct	163 ms	8448 KB	Output is correct
21	Correct	174 ms	8448 KB	Output is correct
22	Correct	225 ms	8448 KB	Output is correct
23	Correct	1158 ms	9472 KB	Output is correct
24	Correct	1342 ms	9472 KB	Output is correct
25	Correct	1433 ms	9472 KB	Output is correct
26	Correct	1574 ms	9984 KB	Output is correct
27	Correct	6 ms	8192 KB	Output is correct
28	Correct	6 ms	8192 KB	Output is correct
29	Correct	9 ms	8192 KB	Output is correct
30	Correct	20 ms	8244 KB	Output is correct
31	Correct	81 ms	8192 KB	Output is correct
32	Correct	6 ms	8192 KB	Output is correct
33	Correct	8 ms	8320 KB	Output is correct
34	Correct	9 ms	8320 KB	Output is correct
35	Correct	23 ms	8320 KB	Output is correct
36	Correct	171 ms	8320 KB	Output is correct
37	Correct	837 ms	8320 KB	Output is correct
38	Correct	11 ms	9344 KB	Output is correct
39	Correct	11 ms	9344 KB	Output is correct
40	Correct	14 ms	9344 KB	Output is correct
41	Correct	40 ms	9592 KB	Output is correct
42	Correct	184 ms	9848 KB	Output is correct
43	Correct	182 ms	31676 KB	Output is correct
44	Correct	180 ms	31700 KB	Output is correct
45	Correct	190 ms	31704 KB	Output is correct
46	Correct	268 ms	31832 KB	Output is correct
47	Correct	789 ms	32596 KB	Output is correct
48	Correct	27 ms	8448 KB	Output is correct
49	Correct	200 ms	8448 KB	Output is correct
50	Correct	973 ms	8448 KB	Output is correct
51	Correct	1968 ms	8448 KB	Output is correct
52	Correct	21 ms	10620 KB	Output is correct
53	Correct	58 ms	10620 KB	Output is correct
54	Correct	261 ms	10868 KB	Output is correct
55	Correct	471 ms	11380 KB	Output is correct
56	Correct	108 ms	20472 KB	Output is correct
57	Correct	167 ms	20504 KB	Output is correct
58	Correct	439 ms	20684 KB	Output is correct
59	Correct	891 ms	20972 KB	Output is correct
60	Correct	164 ms	32488 KB	Output is correct
61	Correct	278 ms	32488 KB	Output is correct
62	Correct	702 ms	32744 KB	Output is correct
63	Correct	1138 ms	33128 KB	Output is correct
64	Correct	3035 ms	33044 KB	Output is correct
65	Execution timed out	5078 ms	32356 KB	Time limit exceeded
66	Halted	0 ms	0 KB	-

Submission #275968

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 13.0 / 13.0

Subtask #3 7.0 / 7.0

Subtask #4 18.0 / 18.0

Subtask #5 0 / 24.0

Subtask #6 0 / 27.0

Subtask #1
11.0 / 11.0

Subtask #2
13.0 / 13.0

Subtask #3
7.0 / 7.0

Subtask #4
18.0 / 18.0

Subtask #5
0 / 24.0

Subtask #6
0 / 27.0