oj.uz

Submission #542791

# Submission time Handle Problem Language Result Execution time Memory
542791 2022-03-28T04:40:49 Z blue Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 2524 KB 
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

using ll = long long;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vi = vector<int>;

const int mx = 15'000;
const ll INF = 2'000'000'000'000'000'000LL;

int a[1+mx], b[1+mx];
ll l[1+mx];
vi edge[1+mx];

int n, q;
ll w;

vll getdistances(int src)
{
	vll res(1+n, INF);
	res[src] = 0;
	queue<int> tbv;
	tbv.push(src);
	while(!tbv.empty())
	{
		int u = tbv.front();
		tbv.pop();

		for(int e : edge[u])
		{
			int v = a[e] + b[e] - u;
			ll w = l[e];

			if(res[v] <= res[u] + w) continue;

			res[v] = res[u] + w;

			tbv.push(v);
		}
	}

	return res;
}

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

	cin >> n >> q;
	cin >> w;

	for(int e = 1; e <= n-1; e++)
	{
		cin >> a[e] >> b[e] >> l[e];
		edge[a[e]].push_back(e);
		edge[b[e]].push_back(e);
	}

	ll last = 0;

	for(int j = 1; j <= q; j++)
	{
		ll d, e;
		cin >> d >> e;

		d = ((d + last) % (n-1)) + 1;
		e = (e + last) % w;

		l[d] = e;

		vll zd = getdistances(1);
		int mx = 1;
		for(int i = 2; i <= n; i++)
			if(zd[i] > zd[mx])
				mx = i;

		vll zd2 = getdistances(mx);
		last = 0;
		for(int i = 1; i <= n; i++)
			last = max(last, zd2[i]);

		cout << last << '\n';
	}


}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 616 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 680 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 684 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 684 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 680 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 222 ms 820 KB Output is correct
20 Correct 229 ms 828 KB Output is correct
21 Correct 228 ms 940 KB Output is correct
22 Correct 289 ms 812 KB Output is correct
23 Correct 1620 ms 1388 KB Output is correct
24 Correct 1738 ms 1356 KB Output is correct
25 Correct 1729 ms 1112 KB Output is correct
26 Correct 1753 ms 1112 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 684 KB Output is correct
3 Correct 3 ms 712 KB Output is correct
4 Correct 18 ms 896 KB Output is correct
5 Correct 86 ms 1264 KB Output is correct
6 Correct 1 ms 680 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 4 ms 732 KB Output is correct
9 Correct 30 ms 752 KB Output is correct
10 Correct 282 ms 960 KB Output is correct
11 Correct 1414 ms 1388 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 33 ms 1076 KB Output is correct
14 Correct 288 ms 1108 KB Output is correct
15 Correct 2771 ms 1612 KB Output is correct
16 Execution timed out 5042 ms 1692 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 724 KB Output is correct
2 Correct 311 ms 1108 KB Output is correct
3 Correct 1512 ms 1356 KB Output is correct
4 Correct 2995 ms 2524 KB Output is correct
5 Correct 310 ms 1484 KB Output is correct
6 Correct 3022 ms 1692 KB Output is correct
7 Execution timed out 5060 ms 2104 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 1236 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 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 616 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 680 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 684 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 684 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 680 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 222 ms 820 KB Output is correct
20 Correct 229 ms 828 KB Output is correct
21 Correct 228 ms 940 KB Output is correct
22 Correct 289 ms 812 KB Output is correct
23 Correct 1620 ms 1388 KB Output is correct
24 Correct 1738 ms 1356 KB Output is correct
25 Correct 1729 ms 1112 KB Output is correct
26 Correct 1753 ms 1112 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 684 KB Output is correct
29 Correct 3 ms 712 KB Output is correct
30 Correct 18 ms 896 KB Output is correct
31 Correct 86 ms 1264 KB Output is correct
32 Correct 1 ms 680 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 4 ms 732 KB Output is correct
35 Correct 30 ms 752 KB Output is correct
36 Correct 282 ms 960 KB Output is correct
37 Correct 1414 ms 1388 KB Output is correct
38 Correct 5 ms 1108 KB Output is correct
39 Correct 33 ms 1076 KB Output is correct
40 Correct 288 ms 1108 KB Output is correct
41 Correct 2771 ms 1612 KB Output is correct
42 Execution timed out 5042 ms 1692 KB Time limit exceeded
43 Halted 0 ms 0 KB -