oj.uz

Submission #753774

# Submission time Handle Problem Language Result Execution time Memory
753774 2023-06-06T01:46:52 Z buihuynhtay Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 417 ms 31588 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;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 30976 KB Output is correct
2 Correct 400 ms 29952 KB Output is correct
3 Correct 345 ms 26180 KB Output is correct
4 Correct 411 ms 30152 KB Output is correct
5 Correct 379 ms 25616 KB Output is correct
6 Correct 409 ms 30884 KB Output is correct
7 Correct 335 ms 29952 KB Output is correct
8 Correct 339 ms 29624 KB Output is correct
9 Correct 416 ms 31416 KB Output is correct
10 Correct 382 ms 31588 KB Output is correct
11 Correct 94 ms 13872 KB Output is correct
12 Correct 395 ms 31528 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 30052 KB Output is correct
2 Correct 368 ms 26372 KB Output is correct
3 Correct 391 ms 26248 KB Output is correct
4 Correct 368 ms 26288 KB Output is correct
5 Correct 373 ms 26236 KB Output is correct
6 Correct 329 ms 26540 KB Output is correct
7 Correct 374 ms 26216 KB Output is correct
8 Correct 329 ms 26216 KB Output is correct
9 Correct 348 ms 26296 KB Output is correct
10 Correct 359 ms 26128 KB Output is correct
11 Correct 110 ms 14012 KB Output is correct
12 Correct 399 ms 26448 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7480 KB Output is correct
2 Correct 3 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct
4 Correct 57 ms 10568 KB Output is correct
5 Correct 30 ms 8396 KB Output is correct
6 Correct 4 ms 4436 KB Output is correct
7 Correct 5 ms 4608 KB Output is correct
8 Correct 6 ms 4740 KB Output is correct
9 Correct 4 ms 4524 KB Output is correct
10 Correct 29 ms 7604 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 4 ms 4436 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 30976 KB Output is correct
2 Correct 400 ms 29952 KB Output is correct
3 Correct 345 ms 26180 KB Output is correct
4 Correct 411 ms 30152 KB Output is correct
5 Correct 379 ms 25616 KB Output is correct
6 Correct 409 ms 30884 KB Output is correct
7 Correct 335 ms 29952 KB Output is correct
8 Correct 339 ms 29624 KB Output is correct
9 Correct 416 ms 31416 KB Output is correct
10 Correct 382 ms 31588 KB Output is correct
11 Correct 94 ms 13872 KB Output is correct
12 Correct 395 ms 31528 KB Output is correct
13 Correct 402 ms 30052 KB Output is correct
14 Correct 368 ms 26372 KB Output is correct
15 Correct 391 ms 26248 KB Output is correct
16 Correct 368 ms 26288 KB Output is correct
17 Correct 373 ms 26236 KB Output is correct
18 Correct 329 ms 26540 KB Output is correct
19 Correct 374 ms 26216 KB Output is correct
20 Correct 329 ms 26216 KB Output is correct
21 Correct 348 ms 26296 KB Output is correct
22 Correct 359 ms 26128 KB Output is correct
23 Correct 110 ms 14012 KB Output is correct
24 Correct 399 ms 26448 KB Output is correct
25 Correct 35 ms 7480 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 3 ms 4308 KB Output is correct
28 Correct 57 ms 10568 KB Output is correct
29 Correct 30 ms 8396 KB Output is correct
30 Correct 4 ms 4436 KB Output is correct
31 Correct 5 ms 4608 KB Output is correct
32 Correct 6 ms 4740 KB Output is correct
33 Correct 4 ms 4524 KB Output is correct
34 Correct 29 ms 7604 KB Output is correct
35 Correct 3 ms 4308 KB Output is correct
36 Correct 4 ms 4308 KB Output is correct
37 Correct 3 ms 4308 KB Output is correct
38 Correct 4 ms 4436 KB Output is correct
39 Correct 3 ms 4436 KB Output is correct
40 Correct 379 ms 30928 KB Output is correct
41 Correct 417 ms 31360 KB Output is correct
42 Correct 415 ms 31200 KB Output is correct
43 Correct 146 ms 14028 KB Output is correct
44 Correct 126 ms 14032 KB Output is correct
45 Correct 340 ms 25136 KB Output is correct
46 Correct 328 ms 24880 KB Output is correct
47 Correct 380 ms 26584 KB Output is correct
48 Correct 158 ms 13368 KB Output is correct
49 Correct 381 ms 29308 KB Output is correct
50 Correct 319 ms 25144 KB Output is correct
51 Correct 331 ms 25036 KB Output is correct