oj.uz

답안 #953554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953554 2024-03-26T07:35:59 Z Trisanu_Das Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 447 ms 33208 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 409 ms 32808 KB Output is correct
2 Correct 354 ms 33208 KB Output is correct
3 Correct 393 ms 30296 KB Output is correct
4 Correct 402 ms 31720 KB Output is correct
5 Correct 348 ms 26596 KB Output is correct
6 Correct 447 ms 32672 KB Output is correct
7 Correct 362 ms 31088 KB Output is correct
8 Correct 361 ms 31812 KB Output is correct
9 Correct 390 ms 33204 KB Output is correct
10 Correct 388 ms 33104 KB Output is correct
11 Correct 90 ms 13908 KB Output is correct
12 Correct 398 ms 32772 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 393 ms 31228 KB Output is correct
2 Correct 370 ms 26580 KB Output is correct
3 Correct 333 ms 30472 KB Output is correct
4 Correct 361 ms 26888 KB Output is correct
5 Correct 339 ms 26412 KB Output is correct
6 Correct 356 ms 30724 KB Output is correct
7 Correct 335 ms 26392 KB Output is correct
8 Correct 357 ms 26492 KB Output is correct
9 Correct 356 ms 26360 KB Output is correct
10 Correct 345 ms 30780 KB Output is correct
11 Correct 69 ms 14132 KB Output is correct
12 Correct 339 ms 30892 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 9960 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 62 ms 13008 KB Output is correct
5 Correct 30 ms 10880 KB Output is correct
6 Correct 3 ms 7004 KB Output is correct
7 Correct 4 ms 7004 KB Output is correct
8 Correct 5 ms 7200 KB Output is correct
9 Correct 3 ms 7000 KB Output is correct
10 Correct 30 ms 10768 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 3 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 32808 KB Output is correct
2 Correct 354 ms 33208 KB Output is correct
3 Correct 393 ms 30296 KB Output is correct
4 Correct 402 ms 31720 KB Output is correct
5 Correct 348 ms 26596 KB Output is correct
6 Correct 447 ms 32672 KB Output is correct
7 Correct 362 ms 31088 KB Output is correct
8 Correct 361 ms 31812 KB Output is correct
9 Correct 390 ms 33204 KB Output is correct
10 Correct 388 ms 33104 KB Output is correct
11 Correct 90 ms 13908 KB Output is correct
12 Correct 398 ms 32772 KB Output is correct
13 Correct 393 ms 31228 KB Output is correct
14 Correct 370 ms 26580 KB Output is correct
15 Correct 333 ms 30472 KB Output is correct
16 Correct 361 ms 26888 KB Output is correct
17 Correct 339 ms 26412 KB Output is correct
18 Correct 356 ms 30724 KB Output is correct
19 Correct 335 ms 26392 KB Output is correct
20 Correct 357 ms 26492 KB Output is correct
21 Correct 356 ms 26360 KB Output is correct
22 Correct 345 ms 30780 KB Output is correct
23 Correct 69 ms 14132 KB Output is correct
24 Correct 339 ms 30892 KB Output is correct
25 Correct 31 ms 9960 KB Output is correct
26 Correct 3 ms 6748 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 62 ms 13008 KB Output is correct
29 Correct 30 ms 10880 KB Output is correct
30 Correct 3 ms 7004 KB Output is correct
31 Correct 4 ms 7004 KB Output is correct
32 Correct 5 ms 7200 KB Output is correct
33 Correct 3 ms 7000 KB Output is correct
34 Correct 30 ms 10768 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 3 ms 6748 KB Output is correct
39 Correct 2 ms 6748 KB Output is correct
40 Correct 398 ms 32084 KB Output is correct
41 Correct 390 ms 32108 KB Output is correct
42 Correct 390 ms 32480 KB Output is correct
43 Correct 75 ms 14176 KB Output is correct
44 Correct 69 ms 14144 KB Output is correct
45 Correct 342 ms 26112 KB Output is correct
46 Correct 372 ms 25756 KB Output is correct
47 Correct 430 ms 26704 KB Output is correct
48 Correct 88 ms 13392 KB Output is correct
49 Correct 390 ms 30164 KB Output is correct
50 Correct 396 ms 25988 KB Output is correct
51 Correct 415 ms 26488 KB Output is correct