oj.uz

Submission #852250

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

#define int long long
const int INF = 1e18;

vector<int> 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<int> dist(n, INF);
	priority_queue<pair<int, 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<int> dists = dijkstra(n, g1, s);
	vector<int> 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<int> 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 615 ms 129036 KB Output is correct
2 Correct 656 ms 128112 KB Output is correct
3 Correct 720 ms 133044 KB Output is correct
4 Correct 580 ms 126964 KB Output is correct
5 Correct 618 ms 133424 KB Output is correct
6 Correct 584 ms 128780 KB Output is correct
7 Correct 672 ms 131836 KB Output is correct
8 Correct 642 ms 131432 KB Output is correct
9 Correct 572 ms 126188 KB Output is correct
10 Correct 565 ms 126120 KB Output is correct
11 Correct 349 ms 88760 KB Output is correct
12 Correct 613 ms 124004 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 696 ms 126192 KB Output is correct
2 Correct 738 ms 125504 KB Output is correct
3 Correct 711 ms 130620 KB Output is correct
4 Correct 630 ms 125504 KB Output is correct
5 Correct 697 ms 128044 KB Output is correct
6 Correct 790 ms 131348 KB Output is correct
7 Correct 826 ms 135400 KB Output is correct
8 Correct 661 ms 127252 KB Output is correct
9 Correct 685 ms 127996 KB Output is correct
10 Correct 603 ms 126616 KB Output is correct
11 Correct 335 ms 91144 KB Output is correct
12 Correct 608 ms 130876 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 10404 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 26 ms 17044 KB Output is correct
5 Correct 11 ms 8680 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 3 ms 1720 KB Output is correct
9 Correct 2 ms 1100 KB Output is correct
10 Correct 12 ms 8740 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 2 ms 824 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 615 ms 129036 KB Output is correct
2 Correct 656 ms 128112 KB Output is correct
3 Correct 720 ms 133044 KB Output is correct
4 Correct 580 ms 126964 KB Output is correct
5 Correct 618 ms 133424 KB Output is correct
6 Correct 584 ms 128780 KB Output is correct
7 Correct 672 ms 131836 KB Output is correct
8 Correct 642 ms 131432 KB Output is correct
9 Correct 572 ms 126188 KB Output is correct
10 Correct 565 ms 126120 KB Output is correct
11 Correct 349 ms 88760 KB Output is correct
12 Correct 613 ms 124004 KB Output is correct
13 Correct 696 ms 126192 KB Output is correct
14 Correct 738 ms 125504 KB Output is correct
15 Correct 711 ms 130620 KB Output is correct
16 Correct 630 ms 125504 KB Output is correct
17 Correct 697 ms 128044 KB Output is correct
18 Correct 790 ms 131348 KB Output is correct
19 Correct 826 ms 135400 KB Output is correct
20 Correct 661 ms 127252 KB Output is correct
21 Correct 685 ms 127996 KB Output is correct
22 Correct 603 ms 126616 KB Output is correct
23 Correct 335 ms 91144 KB Output is correct
24 Correct 608 ms 130876 KB Output is correct
25 Correct 17 ms 10404 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 26 ms 17044 KB Output is correct
29 Correct 11 ms 8680 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 3 ms 1720 KB Output is correct
33 Correct 2 ms 1100 KB Output is correct
34 Correct 12 ms 8740 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 2 ms 824 KB Output is correct
40 Correct 565 ms 127312 KB Output is correct
41 Correct 541 ms 124472 KB Output is correct
42 Correct 507 ms 124608 KB Output is correct
43 Correct 380 ms 94016 KB Output is correct
44 Correct 365 ms 94264 KB Output is correct
45 Correct 664 ms 151660 KB Output is correct
46 Correct 646 ms 152008 KB Output is correct
47 Correct 510 ms 125296 KB Output is correct
48 Correct 319 ms 93772 KB Output is correct
49 Correct 427 ms 126908 KB Output is correct
50 Correct 600 ms 148364 KB Output is correct
51 Correct 587 ms 155552 KB Output is correct