Submission #471881

# Submission time Handle Problem Language Result Execution time Memory
471881 2021-09-11T11:32:54 Z dooompy Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
486 ms 31508 KB
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

vector<pair<ll, ll>> graph[100001];
ll du[100001], dv[100001], ds[100001], dp[2][100001], ans;
bool visited[100001];

void dijkstra1(ll start, ll arr[]) {
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, ll>> pq;
	pq.push({0, start});
	while (!pq.empty()) {
		ll c, node;
		tie(c, node) = pq.top();
		pq.pop();

		if (!visited[node]) {
			arr[node] = -c;
			visited[node] = true;
			for (auto& i : graph[node]) pq.push({c - i.second, i.first});
		}
	}
}

void dijkstra2(ll start, ll end) {
	fill(dp[0], dp[0] + 100001, LLONG_MAX / 2);
	fill(dp[1], dp[1] + 100001, LLONG_MAX / 2);
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, pair<ll, ll>>> pq;
	pq.push({0, {start, 0}});
	dp[0][0] = dp[1][0] = LLONG_MAX/ 2;
	while (!pq.empty()) {
		ll c, node, par;
		pair<ll, ll> p;
		tie(c, p) = pq.top();
		tie(node, par) = p;
		pq.pop();

		if (!visited[node]) {
			visited[node] = true;
			ds[node] = -c;
			dp[0][node] = min(du[node], dp[0][par]);
			dp[1][node] = min(dv[node], dp[1][par]);
			for (auto i : graph[node]) pq.push({c - i.second, {i.first, node}});
		} else if (-c == ds[node]) {
			if (min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) <= dp[0][node] + dp[1][node]) {
				dp[0][node] = min(du[node], dp[0][par]);
				dp[1][node] = min(dv[node], dp[1][par]);
			}
		}
	}

	ans = min(ans, dp[0][end] + dp[1][end]);
}

int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);
	ll n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	for (int i = 0; i < m; i++) {
		ll a, b, c;
		cin >> a >> b >> c;
		graph[a].push_back({b, c});
		graph[b].push_back({a, c});
	}

	dijkstra1(u, du);
	dijkstra1(v, dv);

	ans = du[v];

	dijkstra2(s, t);

	cout << ans << '\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 443 ms 31080 KB Output is correct
2 Correct 400 ms 30020 KB Output is correct
3 Correct 396 ms 26176 KB Output is correct
4 Correct 444 ms 30144 KB Output is correct
5 Correct 450 ms 25612 KB Output is correct
6 Correct 452 ms 30816 KB Output is correct
7 Correct 421 ms 29768 KB Output is correct
8 Correct 441 ms 29624 KB Output is correct
9 Correct 486 ms 31348 KB Output is correct
10 Correct 437 ms 31508 KB Output is correct
11 Correct 115 ms 13888 KB Output is correct
12 Correct 452 ms 31468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 445 ms 30168 KB Output is correct
2 Correct 389 ms 26272 KB Output is correct
3 Correct 407 ms 26132 KB Output is correct
4 Correct 390 ms 26240 KB Output is correct
5 Correct 412 ms 26248 KB Output is correct
6 Correct 409 ms 26456 KB Output is correct
7 Correct 398 ms 26128 KB Output is correct
8 Correct 439 ms 26312 KB Output is correct
9 Correct 428 ms 26332 KB Output is correct
10 Correct 424 ms 26224 KB Output is correct
11 Correct 123 ms 14100 KB Output is correct
12 Correct 425 ms 26332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 34 ms 7484 KB Output is correct
2 Correct 3 ms 4300 KB Output is correct
3 Correct 3 ms 4300 KB Output is correct
4 Correct 74 ms 10556 KB Output is correct
5 Correct 38 ms 8352 KB Output is correct
6 Correct 5 ms 4476 KB Output is correct
7 Correct 5 ms 4556 KB Output is correct
8 Correct 7 ms 4684 KB Output is correct
9 Correct 5 ms 4428 KB Output is correct
10 Correct 33 ms 7440 KB Output is correct
11 Correct 3 ms 4300 KB Output is correct
12 Correct 4 ms 4340 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 4 ms 4476 KB Output is correct
15 Correct 4 ms 4428 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 443 ms 31080 KB Output is correct
2 Correct 400 ms 30020 KB Output is correct
3 Correct 396 ms 26176 KB Output is correct
4 Correct 444 ms 30144 KB Output is correct
5 Correct 450 ms 25612 KB Output is correct
6 Correct 452 ms 30816 KB Output is correct
7 Correct 421 ms 29768 KB Output is correct
8 Correct 441 ms 29624 KB Output is correct
9 Correct 486 ms 31348 KB Output is correct
10 Correct 437 ms 31508 KB Output is correct
11 Correct 115 ms 13888 KB Output is correct
12 Correct 452 ms 31468 KB Output is correct
13 Correct 445 ms 30168 KB Output is correct
14 Correct 389 ms 26272 KB Output is correct
15 Correct 407 ms 26132 KB Output is correct
16 Correct 390 ms 26240 KB Output is correct
17 Correct 412 ms 26248 KB Output is correct
18 Correct 409 ms 26456 KB Output is correct
19 Correct 398 ms 26128 KB Output is correct
20 Correct 439 ms 26312 KB Output is correct
21 Correct 428 ms 26332 KB Output is correct
22 Correct 424 ms 26224 KB Output is correct
23 Correct 123 ms 14100 KB Output is correct
24 Correct 425 ms 26332 KB Output is correct
25 Correct 34 ms 7484 KB Output is correct
26 Correct 3 ms 4300 KB Output is correct
27 Correct 3 ms 4300 KB Output is correct
28 Correct 74 ms 10556 KB Output is correct
29 Correct 38 ms 8352 KB Output is correct
30 Correct 5 ms 4476 KB Output is correct
31 Correct 5 ms 4556 KB Output is correct
32 Correct 7 ms 4684 KB Output is correct
33 Correct 5 ms 4428 KB Output is correct
34 Correct 33 ms 7440 KB Output is correct
35 Correct 3 ms 4300 KB Output is correct
36 Correct 4 ms 4340 KB Output is correct
37 Correct 3 ms 4300 KB Output is correct
38 Correct 4 ms 4476 KB Output is correct
39 Correct 4 ms 4428 KB Output is correct
40 Correct 440 ms 30796 KB Output is correct
41 Correct 458 ms 31260 KB Output is correct
42 Correct 454 ms 31256 KB Output is correct
43 Correct 137 ms 13980 KB Output is correct
44 Correct 136 ms 14008 KB Output is correct
45 Correct 417 ms 25180 KB Output is correct
46 Correct 412 ms 24852 KB Output is correct
47 Correct 445 ms 26628 KB Output is correct
48 Correct 131 ms 13380 KB Output is correct
49 Correct 442 ms 29448 KB Output is correct
50 Correct 394 ms 25088 KB Output is correct
51 Correct 407 ms 25156 KB Output is correct