oj.uz

Submission #851927

# Submission time Handle Problem Language Result Execution time Memory
851927 2023-09-20T20:18:44 Z Gurban Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 281 ms 18588 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int n, m, s, t, u, v, a, b, c, x;

vector<bool> vis;

vector<ll> dis, diss, dist, disu, disv;

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

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

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

	auto f = [&](int st) -> vector<ll>{
		dis.assign(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()) {
			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;
	};

	diss = f(s); dist = f(t);
	disu = f(u); disv = f(v);

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

	cout << ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 15256 KB Output is correct
2 Correct 243 ms 14104 KB Output is correct
3 Correct 219 ms 13788 KB Output is correct
4 Correct 222 ms 15076 KB Output is correct
5 Correct 237 ms 13944 KB Output is correct
6 Correct 212 ms 15240 KB Output is correct
7 Correct 281 ms 13920 KB Output is correct
8 Correct 239 ms 13784 KB Output is correct
9 Correct 191 ms 13768 KB Output is correct
10 Correct 166 ms 13636 KB Output is correct
11 Correct 73 ms 9808 KB Output is correct
12 Correct 259 ms 13968 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 14016 KB Output is correct
2 Correct 279 ms 14200 KB Output is correct
3 Correct 237 ms 14060 KB Output is correct
4 Correct 270 ms 14072 KB Output is correct
5 Correct 211 ms 13940 KB Output is correct
6 Correct 262 ms 13872 KB Output is correct
7 Correct 261 ms 13968 KB Output is correct
8 Correct 228 ms 14100 KB Output is correct
9 Correct 209 ms 13940 KB Output is correct
10 Correct 203 ms 13936 KB Output is correct
11 Correct 64 ms 9792 KB Output is correct
12 Correct 188 ms 13796 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 9 ms 1624 KB Output is correct
5 Correct 6 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 600 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 6 ms 1368 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 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 232 ms 15256 KB Output is correct
2 Correct 243 ms 14104 KB Output is correct
3 Correct 219 ms 13788 KB Output is correct
4 Correct 222 ms 15076 KB Output is correct
5 Correct 237 ms 13944 KB Output is correct
6 Correct 212 ms 15240 KB Output is correct
7 Correct 281 ms 13920 KB Output is correct
8 Correct 239 ms 13784 KB Output is correct
9 Correct 191 ms 13768 KB Output is correct
10 Correct 166 ms 13636 KB Output is correct
11 Correct 73 ms 9808 KB Output is correct
12 Correct 259 ms 13968 KB Output is correct
13 Correct 252 ms 14016 KB Output is correct
14 Correct 279 ms 14200 KB Output is correct
15 Correct 237 ms 14060 KB Output is correct
16 Correct 270 ms 14072 KB Output is correct
17 Correct 211 ms 13940 KB Output is correct
18 Correct 262 ms 13872 KB Output is correct
19 Correct 261 ms 13968 KB Output is correct
20 Correct 228 ms 14100 KB Output is correct
21 Correct 209 ms 13940 KB Output is correct
22 Correct 203 ms 13936 KB Output is correct
23 Correct 64 ms 9792 KB Output is correct
24 Correct 188 ms 13796 KB Output is correct
25 Correct 8 ms 1368 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 9 ms 1624 KB Output is correct
29 Correct 6 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 600 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 6 ms 1368 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 228 ms 17676 KB Output is correct
41 Correct 228 ms 16596 KB Output is correct
42 Correct 196 ms 16492 KB Output is correct
43 Correct 67 ms 11348 KB Output is correct
44 Correct 98 ms 11476 KB Output is correct
45 Correct 240 ms 18496 KB Output is correct
46 Correct 259 ms 18368 KB Output is correct
47 Correct 170 ms 17368 KB Output is correct
48 Correct 90 ms 11088 KB Output is correct
49 Correct 165 ms 17408 KB Output is correct
50 Correct 232 ms 18364 KB Output is correct
51 Correct 266 ms 18588 KB Output is correct