oj.uz

Submission #666792

# Submission time Handle Problem Language Result Execution time Memory
666792 2022-11-29T17:47:05 Z kirakaminski968 Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 570 ms 31520 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

vector<pair<ll, ll>> graph[100001];
ll du[100001], dv[100001], ds[100001], dp[2][100001], ans;
bool visited[100001];

void dijkstra1(ll start, ll arr[]) {
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, ll>> pq;
	pq.push({0, start});
	while (!pq.empty()) {
		ll c, node;
		tie(c, node) = pq.top();
		pq.pop();

		if (!visited[node]) {
			arr[node] = -c;
			visited[node] = true;
			for (auto& i : graph[node]) pq.push({c - i.second, i.first});
		}
	}
}

void dijkstra2(ll start, ll end) {
	fill(dp[0], dp[0] + 100001, LLONG_MAX / 2);
	fill(dp[1], dp[1] + 100001, LLONG_MAX / 2);
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, pair<ll, ll>>> pq;
	pq.push({0, {start, 0}});
	dp[0][0] = dp[1][0] = LLONG_MAX/ 2;
	while (!pq.empty()) {
		ll c, node, par;
		pair<ll, ll> p;
		tie(c, p) = pq.top();
		tie(node, par) = p;
		pq.pop();

		if (!visited[node]) {
			visited[node] = true;
			ds[node] = -c;
			dp[0][node] = min(du[node], dp[0][par]);
			dp[1][node] = min(dv[node], dp[1][par]);
			for (auto i : graph[node]) pq.push({c - i.second, {i.first, node}});
		} else if (-c == ds[node]) {
			if (min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) <= dp[0][node] + dp[1][node]) {
				dp[0][node] = min(du[node], dp[0][par]);
				dp[1][node] = min(dv[node], dp[1][par]);
			}
		}
	}

	ans = min(ans, dp[0][end] + dp[1][end]);
}

int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);
	ll n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	for (int i = 0; i < m; i++) {
		ll a, b, c;
		cin >> a >> b >> c;
		graph[a].push_back({b, c});
		graph[b].push_back({a, c});
	}

	dijkstra1(u, du);
	dijkstra1(v, dv);

	ans = du[v];

	dijkstra2(s, t);
	dijkstra2(t, s);

	cout << ans << '\n';
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 31228 KB Output is correct
2 Correct 487 ms 30164 KB Output is correct
3 Correct 493 ms 29904 KB Output is correct
4 Correct 515 ms 30312 KB Output is correct
5 Correct 490 ms 26464 KB Output is correct
6 Correct 570 ms 30908 KB Output is correct
7 Correct 465 ms 30036 KB Output is correct
8 Correct 463 ms 30308 KB Output is correct
9 Correct 511 ms 31476 KB Output is correct
10 Correct 479 ms 31520 KB Output is correct
11 Correct 133 ms 13920 KB Output is correct
12 Correct 503 ms 31520 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 30528 KB Output is correct
2 Correct 515 ms 26520 KB Output is correct
3 Correct 429 ms 30020 KB Output is correct
4 Correct 431 ms 26624 KB Output is correct
5 Correct 443 ms 26320 KB Output is correct
6 Correct 442 ms 30100 KB Output is correct
7 Correct 440 ms 26460 KB Output is correct
8 Correct 420 ms 26636 KB Output is correct
9 Correct 446 ms 26312 KB Output is correct
10 Correct 422 ms 29680 KB Output is correct
11 Correct 153 ms 13980 KB Output is correct
12 Correct 442 ms 30056 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7500 KB Output is correct
2 Correct 3 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct
4 Correct 78 ms 10552 KB Output is correct
5 Correct 36 ms 8448 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 7 ms 4740 KB Output is correct
8 Correct 7 ms 4760 KB Output is correct
9 Correct 5 ms 4436 KB Output is correct
10 Correct 35 ms 8440 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 4 ms 4388 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 31228 KB Output is correct
2 Correct 487 ms 30164 KB Output is correct
3 Correct 493 ms 29904 KB Output is correct
4 Correct 515 ms 30312 KB Output is correct
5 Correct 490 ms 26464 KB Output is correct
6 Correct 570 ms 30908 KB Output is correct
7 Correct 465 ms 30036 KB Output is correct
8 Correct 463 ms 30308 KB Output is correct
9 Correct 511 ms 31476 KB Output is correct
10 Correct 479 ms 31520 KB Output is correct
11 Correct 133 ms 13920 KB Output is correct
12 Correct 503 ms 31520 KB Output is correct
13 Correct 475 ms 30528 KB Output is correct
14 Correct 515 ms 26520 KB Output is correct
15 Correct 429 ms 30020 KB Output is correct
16 Correct 431 ms 26624 KB Output is correct
17 Correct 443 ms 26320 KB Output is correct
18 Correct 442 ms 30100 KB Output is correct
19 Correct 440 ms 26460 KB Output is correct
20 Correct 420 ms 26636 KB Output is correct
21 Correct 446 ms 26312 KB Output is correct
22 Correct 422 ms 29680 KB Output is correct
23 Correct 153 ms 13980 KB Output is correct
24 Correct 442 ms 30056 KB Output is correct
25 Correct 37 ms 7500 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 3 ms 4308 KB Output is correct
28 Correct 78 ms 10552 KB Output is correct
29 Correct 36 ms 8448 KB Output is correct
30 Correct 4 ms 4564 KB Output is correct
31 Correct 7 ms 4740 KB Output is correct
32 Correct 7 ms 4760 KB Output is correct
33 Correct 5 ms 4436 KB Output is correct
34 Correct 35 ms 8440 KB Output is correct
35 Correct 3 ms 4308 KB Output is correct
36 Correct 3 ms 4308 KB Output is correct
37 Correct 4 ms 4308 KB Output is correct
38 Correct 5 ms 4436 KB Output is correct
39 Correct 4 ms 4388 KB Output is correct
40 Correct 488 ms 30924 KB Output is correct
41 Correct 510 ms 31268 KB Output is correct
42 Correct 516 ms 31248 KB Output is correct
43 Correct 133 ms 14048 KB Output is correct
44 Correct 127 ms 14036 KB Output is correct
45 Correct 437 ms 25184 KB Output is correct
46 Correct 464 ms 24848 KB Output is correct
47 Correct 534 ms 26820 KB Output is correct
48 Correct 143 ms 13388 KB Output is correct
49 Correct 511 ms 29476 KB Output is correct
50 Correct 457 ms 25124 KB Output is correct
51 Correct 486 ms 25188 KB Output is correct