Submission #387091

# Submission time Handle Problem Language Result Execution time Memory
387091 2021-04-07T22:44:05 Z Kepha Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
687 ms 31848 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);
	dijkstra2(t, s);

	cout << ans << '\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 631 ms 27264 KB Output is correct
2 Correct 558 ms 26816 KB Output is correct
3 Correct 573 ms 26292 KB Output is correct
4 Correct 647 ms 26644 KB Output is correct
5 Correct 559 ms 23132 KB Output is correct
6 Correct 651 ms 27184 KB Output is correct
7 Correct 559 ms 26692 KB Output is correct
8 Correct 561 ms 30496 KB Output is correct
9 Correct 653 ms 31624 KB Output is correct
10 Correct 615 ms 31848 KB Output is correct
11 Correct 198 ms 14188 KB Output is correct
12 Correct 635 ms 31792 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 614 ms 27664 KB Output is correct
2 Correct 528 ms 23640 KB Output is correct
3 Correct 550 ms 27388 KB Output is correct
4 Correct 541 ms 23840 KB Output is correct
5 Correct 563 ms 23516 KB Output is correct
6 Correct 561 ms 26992 KB Output is correct
7 Correct 533 ms 23532 KB Output is correct
8 Correct 560 ms 23644 KB Output is correct
9 Correct 550 ms 23440 KB Output is correct
10 Correct 580 ms 27024 KB Output is correct
11 Correct 165 ms 12396 KB Output is correct
12 Correct 567 ms 26792 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 48 ms 7424 KB Output is correct
2 Correct 5 ms 4460 KB Output is correct
3 Correct 5 ms 4460 KB Output is correct
4 Correct 86 ms 10628 KB Output is correct
5 Correct 45 ms 8496 KB Output is correct
6 Correct 6 ms 4608 KB Output is correct
7 Correct 8 ms 4716 KB Output is correct
8 Correct 9 ms 4844 KB Output is correct
9 Correct 8 ms 4588 KB Output is correct
10 Correct 44 ms 8476 KB Output is correct
11 Correct 4 ms 4460 KB Output is correct
12 Correct 5 ms 4352 KB Output is correct
13 Correct 5 ms 4460 KB Output is correct
14 Correct 6 ms 4460 KB Output is correct
15 Correct 6 ms 4588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 631 ms 27264 KB Output is correct
2 Correct 558 ms 26816 KB Output is correct
3 Correct 573 ms 26292 KB Output is correct
4 Correct 647 ms 26644 KB Output is correct
5 Correct 559 ms 23132 KB Output is correct
6 Correct 651 ms 27184 KB Output is correct
7 Correct 559 ms 26692 KB Output is correct
8 Correct 561 ms 30496 KB Output is correct
9 Correct 653 ms 31624 KB Output is correct
10 Correct 615 ms 31848 KB Output is correct
11 Correct 198 ms 14188 KB Output is correct
12 Correct 635 ms 31792 KB Output is correct
13 Correct 614 ms 27664 KB Output is correct
14 Correct 528 ms 23640 KB Output is correct
15 Correct 550 ms 27388 KB Output is correct
16 Correct 541 ms 23840 KB Output is correct
17 Correct 563 ms 23516 KB Output is correct
18 Correct 561 ms 26992 KB Output is correct
19 Correct 533 ms 23532 KB Output is correct
20 Correct 560 ms 23644 KB Output is correct
21 Correct 550 ms 23440 KB Output is correct
22 Correct 580 ms 27024 KB Output is correct
23 Correct 165 ms 12396 KB Output is correct
24 Correct 567 ms 26792 KB Output is correct
25 Correct 48 ms 7424 KB Output is correct
26 Correct 5 ms 4460 KB Output is correct
27 Correct 5 ms 4460 KB Output is correct
28 Correct 86 ms 10628 KB Output is correct
29 Correct 45 ms 8496 KB Output is correct
30 Correct 6 ms 4608 KB Output is correct
31 Correct 8 ms 4716 KB Output is correct
32 Correct 9 ms 4844 KB Output is correct
33 Correct 8 ms 4588 KB Output is correct
34 Correct 44 ms 8476 KB Output is correct
35 Correct 4 ms 4460 KB Output is correct
36 Correct 5 ms 4352 KB Output is correct
37 Correct 5 ms 4460 KB Output is correct
38 Correct 6 ms 4460 KB Output is correct
39 Correct 6 ms 4588 KB Output is correct
40 Correct 682 ms 31368 KB Output is correct
41 Correct 643 ms 31492 KB Output is correct
42 Correct 687 ms 31528 KB Output is correct
43 Correct 190 ms 14060 KB Output is correct
44 Correct 173 ms 14060 KB Output is correct
45 Correct 555 ms 25268 KB Output is correct
46 Correct 566 ms 24924 KB Output is correct
47 Correct 622 ms 26880 KB Output is correct
48 Correct 212 ms 13604 KB Output is correct
49 Correct 627 ms 29636 KB Output is correct
50 Correct 548 ms 25384 KB Output is correct
51 Correct 558 ms 25244 KB Output is correct