oj.uz

답안 #983409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983409 2024-05-15T12:05:16 Z farica Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 422 ms 33528 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 416 ms 28440 KB Output is correct
2 Correct 369 ms 32168 KB Output is correct
3 Correct 377 ms 30136 KB Output is correct
4 Correct 412 ms 32156 KB Output is correct
5 Correct 357 ms 26496 KB Output is correct
6 Correct 415 ms 32616 KB Output is correct
7 Correct 381 ms 31128 KB Output is correct
8 Correct 366 ms 31712 KB Output is correct
9 Correct 409 ms 32828 KB Output is correct
10 Correct 422 ms 32368 KB Output is correct
11 Correct 70 ms 14016 KB Output is correct
12 Correct 383 ms 32524 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 28032 KB Output is correct
2 Correct 360 ms 26492 KB Output is correct
3 Correct 363 ms 32020 KB Output is correct
4 Correct 336 ms 26632 KB Output is correct
5 Correct 392 ms 26432 KB Output is correct
6 Correct 371 ms 31496 KB Output is correct
7 Correct 361 ms 26520 KB Output is correct
8 Correct 333 ms 26760 KB Output is correct
9 Correct 353 ms 26648 KB Output is correct
10 Correct 340 ms 30204 KB Output is correct
11 Correct 67 ms 13928 KB Output is correct
12 Correct 363 ms 31404 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 9452 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 60 ms 13024 KB Output is correct
5 Correct 31 ms 10904 KB Output is correct
6 Correct 3 ms 7004 KB Output is correct
7 Correct 4 ms 7000 KB Output is correct
8 Correct 6 ms 7200 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct
10 Correct 30 ms 10740 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 6648 KB Output is correct
14 Correct 2 ms 7156 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 416 ms 28440 KB Output is correct
2 Correct 369 ms 32168 KB Output is correct
3 Correct 377 ms 30136 KB Output is correct
4 Correct 412 ms 32156 KB Output is correct
5 Correct 357 ms 26496 KB Output is correct
6 Correct 415 ms 32616 KB Output is correct
7 Correct 381 ms 31128 KB Output is correct
8 Correct 366 ms 31712 KB Output is correct
9 Correct 409 ms 32828 KB Output is correct
10 Correct 422 ms 32368 KB Output is correct
11 Correct 70 ms 14016 KB Output is correct
12 Correct 383 ms 32524 KB Output is correct
13 Correct 394 ms 28032 KB Output is correct
14 Correct 360 ms 26492 KB Output is correct
15 Correct 363 ms 32020 KB Output is correct
16 Correct 336 ms 26632 KB Output is correct
17 Correct 392 ms 26432 KB Output is correct
18 Correct 371 ms 31496 KB Output is correct
19 Correct 361 ms 26520 KB Output is correct
20 Correct 333 ms 26760 KB Output is correct
21 Correct 353 ms 26648 KB Output is correct
22 Correct 340 ms 30204 KB Output is correct
23 Correct 67 ms 13928 KB Output is correct
24 Correct 363 ms 31404 KB Output is correct
25 Correct 30 ms 9452 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 60 ms 13024 KB Output is correct
29 Correct 31 ms 10904 KB Output is correct
30 Correct 3 ms 7004 KB Output is correct
31 Correct 4 ms 7000 KB Output is correct
32 Correct 6 ms 7200 KB Output is correct
33 Correct 4 ms 7004 KB Output is correct
34 Correct 30 ms 10740 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 6648 KB Output is correct
38 Correct 2 ms 7156 KB Output is correct
39 Correct 3 ms 6748 KB Output is correct
40 Correct 405 ms 32064 KB Output is correct
41 Correct 378 ms 33528 KB Output is correct
42 Correct 419 ms 31640 KB Output is correct
43 Correct 73 ms 14144 KB Output is correct
44 Correct 69 ms 14164 KB Output is correct
45 Correct 360 ms 26212 KB Output is correct
46 Correct 372 ms 24992 KB Output is correct
47 Correct 386 ms 27012 KB Output is correct
48 Correct 82 ms 13400 KB Output is correct
49 Correct 390 ms 30564 KB Output is correct
50 Correct 330 ms 26636 KB Output is correct
51 Correct 349 ms 25776 KB Output is correct