oj.uz

Submission #852255

# Submission time Handle Problem Language Result Execution time Memory
852255 2023-09-21T13:43:03 Z Calico Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 783 ms 92236 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

vector<long long> dijkstra(int n, vector<tuple<int, int, int>> edges, int src) {
	vector<vector<pair<int, int>>> g(n);
	for (auto [x, y, w]: edges) {
		g[x].emplace_back(y, w);
	}

	vector<long long> dist(n, INF);
	priority_queue<pair<long long, int>> pq;
	pq.push({0, src}); dist[src] = 0;

	while (pq.size()) {
		auto [ds, u] = pq.top(); pq.pop();
		if (dist[u] != -ds) continue;

		for (auto [v, w]: g[u]) {
			if (dist[v] > dist[u]+w) {
				dist[v] = dist[u]+w;
				pq.push({-dist[v], v});
			}
		}
	}

	return dist;
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	s--, t--, u--, v--;

	vector<tuple<int, int, int>> g1;
	for (int i = 0; i < m; i++) {
		int x, y, w; cin >> x >> y >> w; x--, y--;
		g1.emplace_back(x, y, w);
		g1.emplace_back(y, x, w);
	}

	vector<long long> dists = dijkstra(n, g1, s);
	vector<long long> distt = dijkstra(n, g1, t);

	vector<tuple<int, int, int>> g2;
	for (int i = 0; i < n; i++) {
		g2.emplace_back(i, n+i, 0);
		g2.emplace_back(i, 2*n+i, 0);

		g2.emplace_back(n+i, 3*n+i, 0);
		g2.emplace_back(2*n+i, 3*n+i, 0);
	}
	for (auto [x, y, w]: g1) {
		g2.emplace_back(x, y, w);
		g2.emplace_back(3*n+x, 3*n+y, w);

		if (dists[x]+distt[y]+w == dists[t]) {
			g2.emplace_back(n+x, n+y, 0);
			g2.emplace_back(2*n+y, 2*n+x, 0);
		}
	}

	vector<long long> ans = dijkstra(4*n, g2, u);
	cout << ans[3*n+v] << '\n';
	
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 80464 KB Output is correct
2 Correct 510 ms 77080 KB Output is correct
3 Correct 583 ms 78580 KB Output is correct
4 Correct 462 ms 75100 KB Output is correct
5 Correct 669 ms 79564 KB Output is correct
6 Correct 453 ms 80668 KB Output is correct
7 Correct 604 ms 78952 KB Output is correct
8 Correct 459 ms 78140 KB Output is correct
9 Correct 467 ms 73804 KB Output is correct
10 Correct 470 ms 74176 KB Output is correct
11 Correct 230 ms 54376 KB Output is correct
12 Correct 474 ms 74508 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 515 ms 76516 KB Output is correct
2 Correct 632 ms 77608 KB Output is correct
3 Correct 485 ms 78548 KB Output is correct
4 Correct 568 ms 77880 KB Output is correct
5 Correct 585 ms 77832 KB Output is correct
6 Correct 562 ms 79284 KB Output is correct
7 Correct 592 ms 81800 KB Output is correct
8 Correct 584 ms 78316 KB Output is correct
9 Correct 452 ms 75860 KB Output is correct
10 Correct 531 ms 77456 KB Output is correct
11 Correct 255 ms 54708 KB Output is correct
12 Correct 595 ms 78928 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5308 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 16 ms 8632 KB Output is correct
5 Correct 8 ms 4320 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 2 ms 1116 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 9 ms 4296 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 80464 KB Output is correct
2 Correct 510 ms 77080 KB Output is correct
3 Correct 583 ms 78580 KB Output is correct
4 Correct 462 ms 75100 KB Output is correct
5 Correct 669 ms 79564 KB Output is correct
6 Correct 453 ms 80668 KB Output is correct
7 Correct 604 ms 78952 KB Output is correct
8 Correct 459 ms 78140 KB Output is correct
9 Correct 467 ms 73804 KB Output is correct
10 Correct 470 ms 74176 KB Output is correct
11 Correct 230 ms 54376 KB Output is correct
12 Correct 474 ms 74508 KB Output is correct
13 Correct 515 ms 76516 KB Output is correct
14 Correct 632 ms 77608 KB Output is correct
15 Correct 485 ms 78548 KB Output is correct
16 Correct 568 ms 77880 KB Output is correct
17 Correct 585 ms 77832 KB Output is correct
18 Correct 562 ms 79284 KB Output is correct
19 Correct 592 ms 81800 KB Output is correct
20 Correct 584 ms 78316 KB Output is correct
21 Correct 452 ms 75860 KB Output is correct
22 Correct 531 ms 77456 KB Output is correct
23 Correct 255 ms 54708 KB Output is correct
24 Correct 595 ms 78928 KB Output is correct
25 Correct 10 ms 5308 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 16 ms 8632 KB Output is correct
29 Correct 8 ms 4320 KB Output is correct
30 Correct 4 ms 856 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 2 ms 856 KB Output is correct
34 Correct 9 ms 4296 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 582 ms 77540 KB Output is correct
41 Correct 524 ms 77136 KB Output is correct
42 Correct 434 ms 77308 KB Output is correct
43 Correct 251 ms 56416 KB Output is correct
44 Correct 238 ms 56936 KB Output is correct
45 Correct 661 ms 87804 KB Output is correct
46 Correct 783 ms 87480 KB Output is correct
47 Correct 515 ms 74688 KB Output is correct
48 Correct 291 ms 56216 KB Output is correct
49 Correct 375 ms 76832 KB Output is correct
50 Correct 588 ms 87380 KB Output is correct
51 Correct 647 ms 92236 KB Output is correct