oj.uz

답안 #444018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444018 2021-07-13T01:57:29 Z test_account123 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 502 ms 27364 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

# 결과 실행 시간 메모리 Grader output
1 Correct 473 ms 27316 KB Output is correct
2 Correct 430 ms 26504 KB Output is correct
3 Correct 414 ms 22648 KB Output is correct
4 Correct 474 ms 26384 KB Output is correct
5 Correct 422 ms 22356 KB Output is correct
6 Correct 495 ms 27236 KB Output is correct
7 Correct 454 ms 26620 KB Output is correct
8 Correct 449 ms 26560 KB Output is correct
9 Correct 466 ms 27252 KB Output is correct
10 Correct 477 ms 27164 KB Output is correct
11 Correct 123 ms 11892 KB Output is correct
12 Correct 489 ms 27364 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 457 ms 26576 KB Output is correct
2 Correct 418 ms 22812 KB Output is correct
3 Correct 431 ms 22880 KB Output is correct
4 Correct 406 ms 22836 KB Output is correct
5 Correct 414 ms 22836 KB Output is correct
6 Correct 470 ms 22928 KB Output is correct
7 Correct 420 ms 22808 KB Output is correct
8 Correct 422 ms 22884 KB Output is correct
9 Correct 413 ms 22884 KB Output is correct
10 Correct 426 ms 23012 KB Output is correct
11 Correct 127 ms 11984 KB Output is correct
12 Correct 434 ms 22640 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 7244 KB Output is correct
2 Correct 3 ms 4300 KB Output is correct
3 Correct 3 ms 4300 KB Output is correct
4 Correct 67 ms 9936 KB Output is correct
5 Correct 35 ms 8076 KB Output is correct
6 Correct 4 ms 4428 KB Output is correct
7 Correct 5 ms 4556 KB Output is correct
8 Correct 7 ms 4604 KB Output is correct
9 Correct 4 ms 4428 KB Output is correct
10 Correct 33 ms 7164 KB Output is correct
11 Correct 3 ms 4300 KB Output is correct
12 Correct 3 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 4 ms 4428 KB Output is correct
15 Correct 4 ms 4428 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 473 ms 27316 KB Output is correct
2 Correct 430 ms 26504 KB Output is correct
3 Correct 414 ms 22648 KB Output is correct
4 Correct 474 ms 26384 KB Output is correct
5 Correct 422 ms 22356 KB Output is correct
6 Correct 495 ms 27236 KB Output is correct
7 Correct 454 ms 26620 KB Output is correct
8 Correct 449 ms 26560 KB Output is correct
9 Correct 466 ms 27252 KB Output is correct
10 Correct 477 ms 27164 KB Output is correct
11 Correct 123 ms 11892 KB Output is correct
12 Correct 489 ms 27364 KB Output is correct
13 Correct 457 ms 26576 KB Output is correct
14 Correct 418 ms 22812 KB Output is correct
15 Correct 431 ms 22880 KB Output is correct
16 Correct 406 ms 22836 KB Output is correct
17 Correct 414 ms 22836 KB Output is correct
18 Correct 470 ms 22928 KB Output is correct
19 Correct 420 ms 22808 KB Output is correct
20 Correct 422 ms 22884 KB Output is correct
21 Correct 413 ms 22884 KB Output is correct
22 Correct 426 ms 23012 KB Output is correct
23 Correct 127 ms 11984 KB Output is correct
24 Correct 434 ms 22640 KB Output is correct
25 Correct 43 ms 7244 KB Output is correct
26 Correct 3 ms 4300 KB Output is correct
27 Correct 3 ms 4300 KB Output is correct
28 Correct 67 ms 9936 KB Output is correct
29 Correct 35 ms 8076 KB Output is correct
30 Correct 4 ms 4428 KB Output is correct
31 Correct 5 ms 4556 KB Output is correct
32 Correct 7 ms 4604 KB Output is correct
33 Correct 4 ms 4428 KB Output is correct
34 Correct 33 ms 7164 KB Output is correct
35 Correct 3 ms 4300 KB Output is correct
36 Correct 3 ms 4300 KB Output is correct
37 Correct 3 ms 4300 KB Output is correct
38 Correct 4 ms 4428 KB Output is correct
39 Correct 4 ms 4428 KB Output is correct
40 Correct 443 ms 26740 KB Output is correct
41 Correct 464 ms 27308 KB Output is correct
42 Correct 502 ms 27228 KB Output is correct
43 Correct 127 ms 12100 KB Output is correct
44 Correct 125 ms 11988 KB Output is correct
45 Correct 445 ms 21896 KB Output is correct
46 Correct 407 ms 21648 KB Output is correct
47 Correct 449 ms 22880 KB Output is correct
48 Correct 143 ms 11972 KB Output is correct
49 Correct 450 ms 25576 KB Output is correct
50 Correct 406 ms 21900 KB Output is correct
51 Correct 419 ms 21736 KB Output is correct