oj.uz

Submission #401437

# Submission time Handle Problem Language Result Execution time Memory
401437 2021-05-10T09:24:52 Z Azimjon Dreaming (IOI13_dreaming) C++17
14 / 100
 65 ms 14104 KB 
#include <bits/stdc++.h>
#include "dreaming.h"

using namespace std;

typedef long long ll;

const int UNVISITED = -1;
const int N = 111111;

int finish;
int d[N];
vector<pair<int, int>> g[N];

vector<int> cc, path;

void dfs(int x, int y) {
	cc.push_back(x);
	for (auto [a, b] : g[x]) {
		if (a == y) continue;
		d[a] = d[x] + b;

		dfs(a, x);
	}
}

void dff(int x, int y) {
	if (!path.empty() && path.back() == finish) return;

	path.push_back(x);
	// cout << x << endl;

	if (path.back() == finish) return;

	for (auto [a, b] : g[x]) {
		if (a == y) continue;

		dff(a, x);

		if (path.back() == finish) return;
	}

	path.pop_back();
}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
	memset(d, UNVISITED, sizeof(d));

	for (int i = 0; i < m; i++) {
		g[a[i]].push_back({b[i], t[i]});
		g[b[i]].push_back({a[i], t[i]});
	}

	vector<int> r, di;

	for (int i = 0; i < n; i++) {
		if (d[i] == UNVISITED) {
			cc.clear();
			d[i] = 0;
			dfs(i, N);

			int nu = i;
			for (int x : cc) {
				if (d[x] > d[nu]) nu = x;
			}

			cc.clear();
			d[nu] = 0;
			dfs(nu, N);

			int ku = nu;
			for (int x : cc) {
				if (d[x] > d[ku]) ku = x;
			}

			path.clear();
			finish = ku;
			dff(nu, N);

			int diam = d[ku];

			int centre = 0;
			for (int j = 0; j < (int)path.size(); j++) {
				if (abs(2 * d[path[j]] - diam)
					<= abs(2 * d[path[centre]] - diam)) {
					centre = j;
				}
			}

			centre = path[centre];

			int radius = max(d[centre], diam - d[centre]);
			r.push_back(radius);
			di.push_back(diam);
			/*
						cerr << nu << " " << ku << " " << diam << endl;
						cerr << centre << " " << radius << endl;
						cerr << "=================\n";
						for (int i : path)
							cerr << i << " ";

						cerr << "\n=================\n";
						*/
		}
	}

	sort(r.rbegin(), r.rend());

	if (all_of(r.begin(), r.end(), [](int i) { return i == 0; })) {
		return 2 * l;
	}

	if (r.size() == 1) return di[0];

	return max(*max_element(di.begin(), di.end()), r[0] + r[1] + l);
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 14104 KB Output is correct
2 Correct 55 ms 13980 KB Output is correct
3 Correct 37 ms 10248 KB Output is correct
4 Correct 9 ms 4888 KB Output is correct
5 Correct 8 ms 4172 KB Output is correct
6 Correct 15 ms 5708 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 28 ms 6860 KB Output is correct
9 Correct 39 ms 8516 KB Output is correct
10 Correct 3 ms 3404 KB Output is correct
11 Correct 53 ms 9884 KB Output is correct
12 Correct 65 ms 12100 KB Output is correct
13 Correct 3 ms 3404 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3276 KB Output is correct
2 Correct 3 ms 3276 KB Output is correct
3 Correct 3 ms 3276 KB Output is correct
4 Correct 3 ms 3276 KB Output is correct
5 Correct 3 ms 3280 KB Output is correct
6 Correct 2 ms 3276 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 2 ms 3280 KB Output is correct
9 Correct 2 ms 3276 KB Output is correct
10 Correct 3 ms 3276 KB Output is correct
11 Correct 2 ms 3276 KB Output is correct
12 Correct 3 ms 3276 KB Output is correct
13 Correct 2 ms 3276 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Incorrect 2 ms 3276 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 14104 KB Output is correct
2 Correct 55 ms 13980 KB Output is correct
3 Correct 37 ms 10248 KB Output is correct
4 Correct 9 ms 4888 KB Output is correct
5 Correct 8 ms 4172 KB Output is correct
6 Correct 15 ms 5708 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 28 ms 6860 KB Output is correct
9 Correct 39 ms 8516 KB Output is correct
10 Correct 3 ms 3404 KB Output is correct
11 Correct 53 ms 9884 KB Output is correct
12 Correct 65 ms 12100 KB Output is correct
13 Correct 3 ms 3404 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Correct 3 ms 3276 KB Output is correct
16 Correct 3 ms 3276 KB Output is correct
17 Correct 3 ms 3276 KB Output is correct
18 Correct 3 ms 3280 KB Output is correct
19 Correct 2 ms 3276 KB Output is correct
20 Correct 3 ms 3276 KB Output is correct
21 Correct 2 ms 3280 KB Output is correct
22 Correct 2 ms 3276 KB Output is correct
23 Correct 3 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
26 Correct 2 ms 3276 KB Output is correct
27 Correct 3 ms 3276 KB Output is correct
28 Incorrect 2 ms 3276 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6344 KB Output is correct
2 Incorrect 34 ms 6272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3276 KB Output is correct
2 Correct 3 ms 3276 KB Output is correct
3 Correct 3 ms 3276 KB Output is correct
4 Correct 3 ms 3276 KB Output is correct
5 Correct 3 ms 3280 KB Output is correct
6 Correct 2 ms 3276 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 2 ms 3280 KB Output is correct
9 Correct 2 ms 3276 KB Output is correct
10 Correct 3 ms 3276 KB Output is correct
11 Correct 2 ms 3276 KB Output is correct
12 Correct 3 ms 3276 KB Output is correct
13 Correct 2 ms 3276 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Incorrect 2 ms 3276 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 14104 KB Output is correct
2 Correct 55 ms 13980 KB Output is correct
3 Correct 37 ms 10248 KB Output is correct
4 Correct 9 ms 4888 KB Output is correct
5 Correct 8 ms 4172 KB Output is correct
6 Correct 15 ms 5708 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 28 ms 6860 KB Output is correct
9 Correct 39 ms 8516 KB Output is correct
10 Correct 3 ms 3404 KB Output is correct
11 Correct 53 ms 9884 KB Output is correct
12 Correct 65 ms 12100 KB Output is correct
13 Correct 3 ms 3404 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Correct 3 ms 3276 KB Output is correct
16 Correct 3 ms 3276 KB Output is correct
17 Correct 3 ms 3276 KB Output is correct
18 Correct 3 ms 3280 KB Output is correct
19 Correct 2 ms 3276 KB Output is correct
20 Correct 3 ms 3276 KB Output is correct
21 Correct 2 ms 3280 KB Output is correct
22 Correct 2 ms 3276 KB Output is correct
23 Correct 3 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
26 Correct 2 ms 3276 KB Output is correct
27 Correct 3 ms 3276 KB Output is correct
28 Incorrect 2 ms 3276 KB Output isn't correct
29 Halted 0 ms 0 KB -