oj.uz

Submission #537872

# Submission time Handle Problem Language Result Execution time Memory
537872 2022-03-15T18:06:18 Z tkwiatkowski Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 364 ms 21612 KB 
/*
	Zadanie: Commuter Pass
	Autor: Tomasz Kwiatkowski
*/

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 1e5 + 7;
const int INF = 1e9 + 7;

vector<pair<int, int>> G[MAXN];
ll dist[4][MAXN];
ll dp[2][MAXN];
int n;

void Dijkstra(int start, ll* dist)
{
	for (int i = 1; i <= n; ++i)
		dist[i] = 1e18;

	priority_queue<pair<ll, int>> Q;
	Q.push({0, start});
	while (Q.size()) {
		auto [d, v] = Q.top();
		Q.pop();
		if (-d >= dist[v])
			continue;
		dist[v] = -d;
		for (auto [u, w] : G[v]) {
			if (dist[u] > dist[v] + w)
				Q.push({-(dist[v] + w), u});
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);

	int m;
	int S, T, U, V;
	cin >> n >> m;
	cin >> S >> T;
	cin >> U >> V;
	for (int i = 0; i < m; ++i) {
		int u, v, w;
		cin >> u >> v >> w;
		G[u].pb({v, w});
		G[v].pb({u, w});
	}

	Dijkstra(S, dist[0]);
	Dijkstra(T, dist[1]);
	Dijkstra(U, dist[2]);
	Dijkstra(V, dist[3]);

	vector<pair<ll, int>> tmp;
	for (int v = 1; v <= n; ++v)
		tmp.pb({dist[0][v], v});
	sort(tmp.begin(), tmp.end());
	ll D = dist[0][T];
	for (auto [_, v] : tmp) {
		dp[0][v] = dist[2][v];
		dp[1][v] = dist[3][v];
		for (auto [u, w] : G[v]) {
			if (dist[0][u] + w == dist[0][v] && dist[0][v] + dist[1][v] == D) {
				dp[0][v] = min(dp[0][v], dp[0][u]);
				dp[1][v] = min(dp[1][v], dp[1][u]);
			}
		}
	}

	ll ans = dist[2][V];
	for (int v = 1; v <= n; ++v) {
		if (dist[0][v] + dist[1][v] != D)
			continue;
		ans = min({dp[0][v] + dist[3][v],
				   dp[1][v] + dist[2][v],
				   ans});
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 17468 KB Output is correct
2 Correct 293 ms 17180 KB Output is correct
3 Correct 316 ms 17132 KB Output is correct
4 Correct 348 ms 17188 KB Output is correct
5 Correct 304 ms 17088 KB Output is correct
6 Correct 312 ms 17180 KB Output is correct
7 Correct 321 ms 17156 KB Output is correct
8 Correct 306 ms 17148 KB Output is correct
9 Correct 320 ms 17352 KB Output is correct
10 Correct 294 ms 17148 KB Output is correct
11 Correct 107 ms 12080 KB Output is correct
12 Correct 361 ms 17224 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 17156 KB Output is correct
2 Correct 348 ms 17344 KB Output is correct
3 Correct 299 ms 17192 KB Output is correct
4 Correct 322 ms 20672 KB Output is correct
5 Correct 326 ms 20736 KB Output is correct
6 Correct 353 ms 20928 KB Output is correct
7 Correct 308 ms 20624 KB Output is correct
8 Correct 308 ms 20692 KB Output is correct
9 Correct 344 ms 20688 KB Output is correct
10 Correct 304 ms 20696 KB Output is correct
11 Correct 103 ms 14140 KB Output is correct
12 Correct 339 ms 20952 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3896 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 38 ms 5744 KB Output is correct
5 Correct 20 ms 4556 KB Output is correct
6 Correct 3 ms 2812 KB Output is correct
7 Correct 4 ms 2812 KB Output is correct
8 Correct 5 ms 2812 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 19 ms 4552 KB Output is correct
11 Correct 2 ms 2676 KB Output is correct
12 Correct 2 ms 2680 KB Output is correct
13 Correct 3 ms 2644 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 17468 KB Output is correct
2 Correct 293 ms 17180 KB Output is correct
3 Correct 316 ms 17132 KB Output is correct
4 Correct 348 ms 17188 KB Output is correct
5 Correct 304 ms 17088 KB Output is correct
6 Correct 312 ms 17180 KB Output is correct
7 Correct 321 ms 17156 KB Output is correct
8 Correct 306 ms 17148 KB Output is correct
9 Correct 320 ms 17352 KB Output is correct
10 Correct 294 ms 17148 KB Output is correct
11 Correct 107 ms 12080 KB Output is correct
12 Correct 361 ms 17224 KB Output is correct
13 Correct 314 ms 17156 KB Output is correct
14 Correct 348 ms 17344 KB Output is correct
15 Correct 299 ms 17192 KB Output is correct
16 Correct 322 ms 20672 KB Output is correct
17 Correct 326 ms 20736 KB Output is correct
18 Correct 353 ms 20928 KB Output is correct
19 Correct 308 ms 20624 KB Output is correct
20 Correct 308 ms 20692 KB Output is correct
21 Correct 344 ms 20688 KB Output is correct
22 Correct 304 ms 20696 KB Output is correct
23 Correct 103 ms 14140 KB Output is correct
24 Correct 339 ms 20952 KB Output is correct
25 Correct 20 ms 3896 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 38 ms 5744 KB Output is correct
29 Correct 20 ms 4556 KB Output is correct
30 Correct 3 ms 2812 KB Output is correct
31 Correct 4 ms 2812 KB Output is correct
32 Correct 5 ms 2812 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 19 ms 4552 KB Output is correct
35 Correct 2 ms 2676 KB Output is correct
36 Correct 2 ms 2680 KB Output is correct
37 Correct 3 ms 2644 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 2 ms 2688 KB Output is correct
40 Correct 303 ms 20920 KB Output is correct
41 Correct 364 ms 21612 KB Output is correct
42 Correct 317 ms 21388 KB Output is correct
43 Correct 97 ms 14240 KB Output is correct
44 Correct 127 ms 14180 KB Output is correct
45 Correct 341 ms 18668 KB Output is correct
46 Correct 301 ms 18412 KB Output is correct
47 Correct 359 ms 21000 KB Output is correct
48 Correct 105 ms 13628 KB Output is correct
49 Correct 310 ms 20576 KB Output is correct
50 Correct 347 ms 18780 KB Output is correct
51 Correct 292 ms 18604 KB Output is correct