oj.uz

Submission #782882

# Submission time Handle Problem Language Result Execution time Memory
782882 2023-07-14T10:49:09 Z acatmeowmeow Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 238 ms 27160 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long 

const int N = 2e5 + 5;
int n, m, s, t, u, v, f[N], se[N], mn[N], mn2[N], ans[N], dist[N];
vector<pair<int, int>> adj[N];

void path(int s, int dist[]) {
	dist[s] = 0;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	pq.push({0, s});
	while (pq.size()) {
	    int	p = pq.top().first, u = pq.top().second;
		pq.pop();
		if (p != dist[u]) continue;
		for (auto&x : adj[u]) {
			int v = x.first, c = x.second;
			if (dist[v] <= dist[u] + c) continue;
			dist[v] = dist[u] + c;
			pq.push({dist[v], v});
		}
	}
}

void solve() {
	for (int i = 1; i <= n; i++) dist[i] = mn[i] = mn2[i] = ans[i] = 1e18;
	dist[s] = 0;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	pq.push({0, s});
	while (pq.size()) {
	    int	p = pq.top().first, u = pq.top().second;
		pq.pop();
		if (p != dist[u]) continue;
		mn[u] = min(mn[u], f[u]);
		mn2[u] = min(mn2[u], se[u]);
		for (auto&x : adj[u]) {
			int v = x.first, c = x.second;
			if (dist[v] + c == dist[u]) {
				mn[u] = min(mn[u], mn[v]);
				mn2[u] = min(mn2[u], mn2[v]);
				ans[u] = min(ans[u], ans[v]);
			} else if (dist[v] > dist[u] + c) {
				dist[v] = dist[u] + c;
				pq.push({dist[v], v});
			}
		}
		ans[u] = min({ans[u], se[u] + mn[u], f[u] + mn2[u]});
	}
	cout << min({ans[t], f[v]}) << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m >> s >> t >> u >> v;
	for (int i = 1;i <= m; i++) {
		int u, v, c;
		cin >> u >> v >> c;
		adj[u].push_back({v, c});
		adj[v].push_back({u, c});
	}
	for (int i = 1;i <= n; i++) f[i] = se[i] = 1e18;
	path(u, f);
   	path(v, se);
	solve();
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 24132 KB Output is correct
2 Correct 180 ms 25620 KB Output is correct
3 Correct 206 ms 25472 KB Output is correct
4 Correct 182 ms 25876 KB Output is correct
5 Correct 161 ms 25272 KB Output is correct
6 Correct 178 ms 27160 KB Output is correct
7 Correct 205 ms 25376 KB Output is correct
8 Correct 170 ms 25540 KB Output is correct
9 Correct 169 ms 26280 KB Output is correct
10 Correct 145 ms 26148 KB Output is correct
11 Correct 58 ms 16928 KB Output is correct
12 Correct 197 ms 26232 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 23164 KB Output is correct
2 Correct 204 ms 23036 KB Output is correct
3 Correct 196 ms 23320 KB Output is correct
4 Correct 182 ms 23040 KB Output is correct
5 Correct 191 ms 22944 KB Output is correct
6 Correct 194 ms 22668 KB Output is correct
7 Correct 179 ms 22952 KB Output is correct
8 Correct 185 ms 22944 KB Output is correct
9 Correct 196 ms 23012 KB Output is correct
10 Correct 238 ms 23040 KB Output is correct
11 Correct 63 ms 15996 KB Output is correct
12 Correct 185 ms 22772 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 6788 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 4 ms 5036 KB Output is correct
4 Correct 17 ms 8668 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 4 ms 5332 KB Output is correct
9 Correct 3 ms 5204 KB Output is correct
10 Correct 7 ms 6724 KB Output is correct
11 Correct 2 ms 5036 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 24132 KB Output is correct
2 Correct 180 ms 25620 KB Output is correct
3 Correct 206 ms 25472 KB Output is correct
4 Correct 182 ms 25876 KB Output is correct
5 Correct 161 ms 25272 KB Output is correct
6 Correct 178 ms 27160 KB Output is correct
7 Correct 205 ms 25376 KB Output is correct
8 Correct 170 ms 25540 KB Output is correct
9 Correct 169 ms 26280 KB Output is correct
10 Correct 145 ms 26148 KB Output is correct
11 Correct 58 ms 16928 KB Output is correct
12 Correct 197 ms 26232 KB Output is correct
13 Correct 183 ms 23164 KB Output is correct
14 Correct 204 ms 23036 KB Output is correct
15 Correct 196 ms 23320 KB Output is correct
16 Correct 182 ms 23040 KB Output is correct
17 Correct 191 ms 22944 KB Output is correct
18 Correct 194 ms 22668 KB Output is correct
19 Correct 179 ms 22952 KB Output is correct
20 Correct 185 ms 22944 KB Output is correct
21 Correct 196 ms 23012 KB Output is correct
22 Correct 238 ms 23040 KB Output is correct
23 Correct 63 ms 15996 KB Output is correct
24 Correct 185 ms 22772 KB Output is correct
25 Correct 10 ms 6788 KB Output is correct
26 Correct 3 ms 5032 KB Output is correct
27 Correct 4 ms 5036 KB Output is correct
28 Correct 17 ms 8668 KB Output is correct
29 Correct 8 ms 6740 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5204 KB Output is correct
32 Correct 4 ms 5332 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 7 ms 6724 KB Output is correct
35 Correct 2 ms 5036 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 205 ms 27040 KB Output is correct
41 Correct 181 ms 26180 KB Output is correct
42 Correct 172 ms 26224 KB Output is correct
43 Correct 57 ms 17092 KB Output is correct
44 Correct 58 ms 17016 KB Output is correct
45 Correct 189 ms 25088 KB Output is correct
46 Correct 164 ms 24816 KB Output is correct
47 Correct 169 ms 25700 KB Output is correct
48 Correct 68 ms 16512 KB Output is correct
49 Correct 145 ms 26644 KB Output is correct
50 Correct 216 ms 25132 KB Output is correct
51 Correct 154 ms 24960 KB Output is correct