Submission #683445

# Submission time Handle Problem Language Result Execution time Memory
683445 2023-01-18T12:08:30 Z yogesh_sane Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
533 ms 31496 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 482 ms 27216 KB Output is correct
2 Correct 407 ms 26772 KB Output is correct
3 Correct 491 ms 29980 KB Output is correct
4 Correct 504 ms 30148 KB Output is correct
5 Correct 446 ms 26424 KB Output is correct
6 Correct 516 ms 30940 KB Output is correct
7 Correct 411 ms 30008 KB Output is correct
8 Correct 460 ms 30304 KB Output is correct
9 Correct 492 ms 31400 KB Output is correct
10 Correct 500 ms 31436 KB Output is correct
11 Correct 131 ms 13888 KB Output is correct
12 Correct 529 ms 31496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 503 ms 27004 KB Output is correct
2 Correct 400 ms 23076 KB Output is correct
3 Correct 439 ms 26500 KB Output is correct
4 Correct 416 ms 26556 KB Output is correct
5 Correct 470 ms 26328 KB Output is correct
6 Correct 435 ms 30000 KB Output is correct
7 Correct 419 ms 26384 KB Output is correct
8 Correct 437 ms 26532 KB Output is correct
9 Correct 428 ms 26348 KB Output is correct
10 Correct 447 ms 29716 KB Output is correct
11 Correct 127 ms 14036 KB Output is correct
12 Correct 468 ms 29968 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 37 ms 7144 KB Output is correct
2 Correct 3 ms 4308 KB Output is correct
3 Correct 4 ms 4308 KB Output is correct
4 Correct 69 ms 10592 KB Output is correct
5 Correct 36 ms 8460 KB Output is correct
6 Correct 5 ms 4520 KB Output is correct
7 Correct 6 ms 4668 KB Output is correct
8 Correct 7 ms 4760 KB Output is correct
9 Correct 4 ms 4484 KB Output is correct
10 Correct 35 ms 8416 KB Output is correct
11 Correct 2 ms 4348 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 4 ms 4352 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 5 ms 4436 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 482 ms 27216 KB Output is correct
2 Correct 407 ms 26772 KB Output is correct
3 Correct 491 ms 29980 KB Output is correct
4 Correct 504 ms 30148 KB Output is correct
5 Correct 446 ms 26424 KB Output is correct
6 Correct 516 ms 30940 KB Output is correct
7 Correct 411 ms 30008 KB Output is correct
8 Correct 460 ms 30304 KB Output is correct
9 Correct 492 ms 31400 KB Output is correct
10 Correct 500 ms 31436 KB Output is correct
11 Correct 131 ms 13888 KB Output is correct
12 Correct 529 ms 31496 KB Output is correct
13 Correct 503 ms 27004 KB Output is correct
14 Correct 400 ms 23076 KB Output is correct
15 Correct 439 ms 26500 KB Output is correct
16 Correct 416 ms 26556 KB Output is correct
17 Correct 470 ms 26328 KB Output is correct
18 Correct 435 ms 30000 KB Output is correct
19 Correct 419 ms 26384 KB Output is correct
20 Correct 437 ms 26532 KB Output is correct
21 Correct 428 ms 26348 KB Output is correct
22 Correct 447 ms 29716 KB Output is correct
23 Correct 127 ms 14036 KB Output is correct
24 Correct 468 ms 29968 KB Output is correct
25 Correct 37 ms 7144 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 4 ms 4308 KB Output is correct
28 Correct 69 ms 10592 KB Output is correct
29 Correct 36 ms 8460 KB Output is correct
30 Correct 5 ms 4520 KB Output is correct
31 Correct 6 ms 4668 KB Output is correct
32 Correct 7 ms 4760 KB Output is correct
33 Correct 4 ms 4484 KB Output is correct
34 Correct 35 ms 8416 KB Output is correct
35 Correct 2 ms 4348 KB Output is correct
36 Correct 3 ms 4308 KB Output is correct
37 Correct 4 ms 4352 KB Output is correct
38 Correct 5 ms 4436 KB Output is correct
39 Correct 5 ms 4436 KB Output is correct
40 Correct 492 ms 30920 KB Output is correct
41 Correct 533 ms 31228 KB Output is correct
42 Correct 522 ms 31296 KB Output is correct
43 Correct 111 ms 14040 KB Output is correct
44 Correct 133 ms 13972 KB Output is correct
45 Correct 443 ms 25216 KB Output is correct
46 Correct 428 ms 24908 KB Output is correct
47 Correct 479 ms 26644 KB Output is correct
48 Correct 125 ms 13464 KB Output is correct
49 Correct 464 ms 29480 KB Output is correct
50 Correct 435 ms 25204 KB Output is correct
51 Correct 399 ms 25120 KB Output is correct