oj.uz

Submission #851929

# Submission time Handle Problem Language Result Execution time Memory
851929 2023-09-20T20:26:42 Z stdfloat Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 262 ms 15548 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

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

	vector<pair<int, int>> E[n + 1];
	while (m--) {
		int a, b, c;
		cin >> a >> b >> c;
		E[a].push_back({b, c});
		E[b].push_back({a, c});
	}

	auto f = [&](int st) -> vector<ll>{
		vector<ll> dis(n + 1, LLONG_MAX); dis[st] = 0;
		priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> q; q.push({0, st});
		while (!q.empty()) {
			int x = q.top().second; q.pop();
			for (auto i : E[x]) {
				if (dis[x] + i.second < dis[i.first]) {
					dis[i.first] = dis[x] + i.second;
					q.push({dis[i.first], i.first});
				}
			}
		}
		return dis;
	};

	vector<ll> diss = f(s), dist = f(t), disu = f(u), disv = f(v);

	vector<bool> vis(n + 1);
	priority_queue<vector<ll>> q;
	q.push({0, -disu[s] - disv[s], s, disu[s], disv[s]});
	while (!q.empty()) {
		vector<ll> u = q.top(); q.pop();
		if (u[2] == t) {
			return cout << min(disu[v], -u[1]), 0;
		}
		if (vis[u[2]]) continue;
		vis[u[2]] = true;
		for (auto i : E[u[2]]) {
			if (diss[u[2]] + i.second == diss[i.first] && diss[i.first] + dist[i.first] == diss[t]) {
				ll a = min(u[3], disu[i.first]), b = min(u[4], disv[i.first]);
				q.push({-diss[i.first], - a - b, i.first, a, b});
			}
		}
	}
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 15524 KB Output is correct
2 Correct 224 ms 14116 KB Output is correct
3 Correct 221 ms 13824 KB Output is correct
4 Correct 194 ms 15360 KB Output is correct
5 Correct 193 ms 13928 KB Output is correct
6 Correct 231 ms 15172 KB Output is correct
7 Correct 228 ms 13896 KB Output is correct
8 Correct 252 ms 13764 KB Output is correct
9 Correct 194 ms 13872 KB Output is correct
10 Correct 157 ms 13988 KB Output is correct
11 Correct 58 ms 9004 KB Output is correct
12 Correct 181 ms 13824 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 14108 KB Output is correct
2 Correct 210 ms 13988 KB Output is correct
3 Correct 206 ms 14016 KB Output is correct
4 Correct 212 ms 13988 KB Output is correct
5 Correct 240 ms 13872 KB Output is correct
6 Correct 223 ms 14084 KB Output is correct
7 Correct 218 ms 14016 KB Output is correct
8 Correct 232 ms 14004 KB Output is correct
9 Correct 215 ms 13844 KB Output is correct
10 Correct 216 ms 14072 KB Output is correct
11 Correct 60 ms 9040 KB Output is correct
12 Correct 202 ms 13808 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1368 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 9 ms 1936 KB Output is correct
5 Correct 5 ms 1112 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 5 ms 1112 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 15524 KB Output is correct
2 Correct 224 ms 14116 KB Output is correct
3 Correct 221 ms 13824 KB Output is correct
4 Correct 194 ms 15360 KB Output is correct
5 Correct 193 ms 13928 KB Output is correct
6 Correct 231 ms 15172 KB Output is correct
7 Correct 228 ms 13896 KB Output is correct
8 Correct 252 ms 13764 KB Output is correct
9 Correct 194 ms 13872 KB Output is correct
10 Correct 157 ms 13988 KB Output is correct
11 Correct 58 ms 9004 KB Output is correct
12 Correct 181 ms 13824 KB Output is correct
13 Correct 200 ms 14108 KB Output is correct
14 Correct 210 ms 13988 KB Output is correct
15 Correct 206 ms 14016 KB Output is correct
16 Correct 212 ms 13988 KB Output is correct
17 Correct 240 ms 13872 KB Output is correct
18 Correct 223 ms 14084 KB Output is correct
19 Correct 218 ms 14016 KB Output is correct
20 Correct 232 ms 14004 KB Output is correct
21 Correct 215 ms 13844 KB Output is correct
22 Correct 216 ms 14072 KB Output is correct
23 Correct 60 ms 9040 KB Output is correct
24 Correct 202 ms 13808 KB Output is correct
25 Correct 8 ms 1368 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 9 ms 1936 KB Output is correct
29 Correct 5 ms 1112 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 5 ms 1112 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 180 ms 15324 KB Output is correct
41 Correct 182 ms 14112 KB Output is correct
42 Correct 182 ms 14144 KB Output is correct
43 Correct 65 ms 9040 KB Output is correct
44 Correct 81 ms 9040 KB Output is correct
45 Correct 253 ms 15340 KB Output is correct
46 Correct 250 ms 15548 KB Output is correct
47 Correct 184 ms 15092 KB Output is correct
48 Correct 78 ms 9040 KB Output is correct
49 Correct 152 ms 15324 KB Output is correct
50 Correct 219 ms 15148 KB Output is correct
51 Correct 262 ms 15464 KB Output is correct