oj.uz

답안 #937629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937629 2024-03-04T09:51:08 Z MMihalev Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 477 ms 33484 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 32880 KB Output is correct
2 Correct 381 ms 31860 KB Output is correct
3 Correct 392 ms 31840 KB Output is correct
4 Correct 413 ms 32088 KB Output is correct
5 Correct 338 ms 26624 KB Output is correct
6 Correct 386 ms 31660 KB Output is correct
7 Correct 344 ms 31432 KB Output is correct
8 Correct 337 ms 31008 KB Output is correct
9 Correct 380 ms 32636 KB Output is correct
10 Correct 371 ms 32764 KB Output is correct
11 Correct 74 ms 14000 KB Output is correct
12 Correct 416 ms 33484 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 477 ms 32456 KB Output is correct
2 Correct 399 ms 26592 KB Output is correct
3 Correct 341 ms 31216 KB Output is correct
4 Correct 327 ms 26576 KB Output is correct
5 Correct 337 ms 26324 KB Output is correct
6 Correct 347 ms 31484 KB Output is correct
7 Correct 325 ms 26512 KB Output is correct
8 Correct 348 ms 26832 KB Output is correct
9 Correct 330 ms 26436 KB Output is correct
10 Correct 360 ms 31000 KB Output is correct
11 Correct 65 ms 14092 KB Output is correct
12 Correct 351 ms 30624 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 9964 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 63 ms 12996 KB Output is correct
5 Correct 31 ms 10912 KB Output is correct
6 Correct 3 ms 7000 KB Output is correct
7 Correct 4 ms 7004 KB Output is correct
8 Correct 6 ms 7200 KB Output is correct
9 Correct 3 ms 6912 KB Output is correct
10 Correct 34 ms 10880 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 6652 KB Output is correct
14 Correct 2 ms 6744 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 32880 KB Output is correct
2 Correct 381 ms 31860 KB Output is correct
3 Correct 392 ms 31840 KB Output is correct
4 Correct 413 ms 32088 KB Output is correct
5 Correct 338 ms 26624 KB Output is correct
6 Correct 386 ms 31660 KB Output is correct
7 Correct 344 ms 31432 KB Output is correct
8 Correct 337 ms 31008 KB Output is correct
9 Correct 380 ms 32636 KB Output is correct
10 Correct 371 ms 32764 KB Output is correct
11 Correct 74 ms 14000 KB Output is correct
12 Correct 416 ms 33484 KB Output is correct
13 Correct 477 ms 32456 KB Output is correct
14 Correct 399 ms 26592 KB Output is correct
15 Correct 341 ms 31216 KB Output is correct
16 Correct 327 ms 26576 KB Output is correct
17 Correct 337 ms 26324 KB Output is correct
18 Correct 347 ms 31484 KB Output is correct
19 Correct 325 ms 26512 KB Output is correct
20 Correct 348 ms 26832 KB Output is correct
21 Correct 330 ms 26436 KB Output is correct
22 Correct 360 ms 31000 KB Output is correct
23 Correct 65 ms 14092 KB Output is correct
24 Correct 351 ms 30624 KB Output is correct
25 Correct 30 ms 9964 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 63 ms 12996 KB Output is correct
29 Correct 31 ms 10912 KB Output is correct
30 Correct 3 ms 7000 KB Output is correct
31 Correct 4 ms 7004 KB Output is correct
32 Correct 6 ms 7200 KB Output is correct
33 Correct 3 ms 6912 KB Output is correct
34 Correct 34 ms 10880 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 6652 KB Output is correct
38 Correct 2 ms 6744 KB Output is correct
39 Correct 2 ms 6744 KB Output is correct
40 Correct 365 ms 31652 KB Output is correct
41 Correct 400 ms 33208 KB Output is correct
42 Correct 386 ms 32656 KB Output is correct
43 Correct 66 ms 14148 KB Output is correct
44 Correct 80 ms 14164 KB Output is correct
45 Correct 355 ms 26400 KB Output is correct
46 Correct 339 ms 26660 KB Output is correct
47 Correct 359 ms 26972 KB Output is correct
48 Correct 76 ms 13392 KB Output is correct
49 Correct 355 ms 30880 KB Output is correct
50 Correct 319 ms 25928 KB Output is correct
51 Correct 345 ms 26520 KB Output is correct