oj.uz

답안 #486206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486206 2021-11-10T23:29:28 Z iag99 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 462 ms 31248 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;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 439 ms 27288 KB Output is correct
2 Correct 408 ms 26744 KB Output is correct
3 Correct 396 ms 26152 KB Output is correct
4 Correct 449 ms 26300 KB Output is correct
5 Correct 397 ms 23104 KB Output is correct
6 Correct 452 ms 27036 KB Output is correct
7 Correct 389 ms 26548 KB Output is correct
8 Correct 420 ms 26764 KB Output is correct
9 Correct 447 ms 27224 KB Output is correct
10 Correct 428 ms 26968 KB Output is correct
11 Correct 107 ms 11864 KB Output is correct
12 Correct 462 ms 27416 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 26924 KB Output is correct
2 Correct 388 ms 23088 KB Output is correct
3 Correct 388 ms 26468 KB Output is correct
4 Correct 383 ms 23040 KB Output is correct
5 Correct 391 ms 22812 KB Output is correct
6 Correct 400 ms 26208 KB Output is correct
7 Correct 387 ms 22964 KB Output is correct
8 Correct 394 ms 23172 KB Output is correct
9 Correct 388 ms 22880 KB Output is correct
10 Correct 401 ms 26324 KB Output is correct
11 Correct 105 ms 11800 KB Output is correct
12 Correct 402 ms 26288 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 7132 KB Output is correct
2 Correct 3 ms 4300 KB Output is correct
3 Correct 3 ms 4300 KB Output is correct
4 Correct 69 ms 10524 KB Output is correct
5 Correct 35 ms 8456 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 5 ms 4660 KB Output is correct
8 Correct 6 ms 4752 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 33 ms 8380 KB Output is correct
11 Correct 2 ms 4300 KB Output is correct
12 Correct 2 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 3 ms 4476 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 439 ms 27288 KB Output is correct
2 Correct 408 ms 26744 KB Output is correct
3 Correct 396 ms 26152 KB Output is correct
4 Correct 449 ms 26300 KB Output is correct
5 Correct 397 ms 23104 KB Output is correct
6 Correct 452 ms 27036 KB Output is correct
7 Correct 389 ms 26548 KB Output is correct
8 Correct 420 ms 26764 KB Output is correct
9 Correct 447 ms 27224 KB Output is correct
10 Correct 428 ms 26968 KB Output is correct
11 Correct 107 ms 11864 KB Output is correct
12 Correct 462 ms 27416 KB Output is correct
13 Correct 430 ms 26924 KB Output is correct
14 Correct 388 ms 23088 KB Output is correct
15 Correct 388 ms 26468 KB Output is correct
16 Correct 383 ms 23040 KB Output is correct
17 Correct 391 ms 22812 KB Output is correct
18 Correct 400 ms 26208 KB Output is correct
19 Correct 387 ms 22964 KB Output is correct
20 Correct 394 ms 23172 KB Output is correct
21 Correct 388 ms 22880 KB Output is correct
22 Correct 401 ms 26324 KB Output is correct
23 Correct 105 ms 11800 KB Output is correct
24 Correct 402 ms 26288 KB Output is correct
25 Correct 33 ms 7132 KB Output is correct
26 Correct 3 ms 4300 KB Output is correct
27 Correct 3 ms 4300 KB Output is correct
28 Correct 69 ms 10524 KB Output is correct
29 Correct 35 ms 8456 KB Output is correct
30 Correct 4 ms 4556 KB Output is correct
31 Correct 5 ms 4660 KB Output is correct
32 Correct 6 ms 4752 KB Output is correct
33 Correct 4 ms 4556 KB Output is correct
34 Correct 33 ms 8380 KB Output is correct
35 Correct 2 ms 4300 KB Output is correct
36 Correct 2 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 3 ms 4476 KB Output is correct
40 Correct 434 ms 30908 KB Output is correct
41 Correct 458 ms 31216 KB Output is correct
42 Correct 444 ms 31248 KB Output is correct
43 Correct 106 ms 14020 KB Output is correct
44 Correct 110 ms 14152 KB Output is correct
45 Correct 396 ms 25088 KB Output is correct
46 Correct 398 ms 24904 KB Output is correct
47 Correct 435 ms 26672 KB Output is correct
48 Correct 123 ms 13384 KB Output is correct
49 Correct 438 ms 29524 KB Output is correct
50 Correct 387 ms 25132 KB Output is correct
51 Correct 394 ms 25260 KB Output is correct