oj.uz

답안 #924100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924100 2024-02-08T12:58:00 Z TAhmed33 Commuter Pass (JOI18_commuter_pass) C++
100 / 100
 270 ms 30576 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("trapv")
typedef long long ll;
const ll inf = 1e18;
const int MAXN = 1e5 + 25;
vector <pair <ll, ll>> adj[MAXN];
int n, m, s, t, u, v;
vector <int> adj2[MAXN];
ll dist[MAXN], dist2[MAXN];
ll dp[MAXN][2];
ll ans (int pos, int c) {
	ll &ret = dp[pos][c];
	if (ret != -1) return ret;
	if (c == 0) {
		ret = dist[pos] + ans(pos, 1);
		ll mn = inf;
		for (auto j : adj2[pos]) mn = min(mn, ans(j, 0));
		ret = min(ret, mn);
	} else {
		ret = dist2[pos];
		ll mn = inf;
		for (auto j : adj2[pos]) mn = min(mn, ans(j, 1));
		ret = min(ret, mn);
	}
	return ret;
}
ll ans2 (int pos, int c) {
	ll &ret = dp[pos][c];
	if (ret != -1) return ret;
	if (c == 0) {
		ret = dist2[pos] + ans2(pos, 1);
		ll mn = inf;
		for (auto j : adj2[pos]) mn = min(mn, ans2(j, 0));
		ret = min(ret, mn);
	} else {
		ret = dist[pos];
		ll mn = inf;
		for (auto j : adj2[pos]) mn = min(mn, ans2(j, 1));
		ret = min(ret, mn);
	}
	return ret;
}
int main () {
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m >> s >> t >> u >> v;
	for (int i = 1; i <= m; i++) { 
		int a, b, c;
		cin >> a >> b >> c;
		adj[a].push_back({b, c});
		adj[b].push_back({a, c});
	}
	for (int i = 1; i <= n; i++) dist[i] = inf;
	dist[s] = 0;
	priority_queue <pair <ll, ll>, vector <pair <ll, ll>>, greater <>> pq;
	pq.push({0, s});
	while (!pq.empty()) {
		auto k = pq.top();
		pq.pop();
		if (k.first > dist[k.second]) continue;
		for (auto j : adj[k.second]) {
			if (j.second + k.first < dist[j.first]) {
				dist[j.first] = k.first + j.second;
				pq.push({dist[j.first], j.first});
			}
		}
	}
	for (int i = 1; i <= n; i++) dist2[i] = inf;
	dist2[t] = 0;
	pq.push({0, t});
	while (!pq.empty()) {
		auto k = pq.top();
		pq.pop();
		if (k.first > dist2[k.second]) continue;
		for (auto j : adj[k.second]) {
			if (j.second + k.first < dist2[j.first]) {
				dist2[j.first] = k.first + j.second;
				pq.push({dist2[j.first], j.first});
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (auto j : adj[i]) {
			if (dist[i] + j.second == dist[j.first] && dist2[i] == dist2[j.first] + j.second && dist[i] + dist2[j.first] + j.second == dist[t]) {
				adj2[i].push_back(j.first);
			}
		}
	}
	for (int i = 1; i <= n; i++) dist[i] = dist2[i] = inf;
	dist[u] = 0;
	pq.push({0, u});
	while (!pq.empty()) {
		auto k = pq.top();
		pq.pop();
		if (k.first > dist[k.second]) continue;
		for (auto j : adj[k.second]) {
			if (j.second + k.first < dist[j.first]) {
				dist[j.first] = k.first + j.second;
				pq.push({dist[j.first], j.first});
			}
		}
	}
	dist2[v] = 0;
	pq.push({0, v});
	while (!pq.empty()) {
		auto k = pq.top();
		pq.pop();
		if (k.first > dist2[k.second]) continue;
		for (auto j : adj[k.second]) {
			if (j.second + k.first < dist2[j.first]) {
				dist2[j.first] = k.first + j.second;
				pq.push({dist2[j.first], j.first});
			}
		}
	}
	memset(dp, -1, sizeof(dp));
	ll mn = inf;
	for (int i = 1; i <= n; i++) mn = min(mn, ans(i, 0));
	ll mn2 = inf;
	memset(dp, -1, sizeof(dp));
	for (int i = 1; i <= n; i++) mn2 = min(mn2, ans2(i, 0));
	cout << min({dist[v], mn2, mn}) << '\n';
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 19648 KB Output is correct
2 Correct 212 ms 19908 KB Output is correct
3 Correct 233 ms 24600 KB Output is correct
4 Correct 201 ms 24272 KB Output is correct
5 Correct 221 ms 23752 KB Output is correct
6 Correct 212 ms 23748 KB Output is correct
7 Correct 264 ms 24520 KB Output is correct
8 Correct 228 ms 24520 KB Output is correct
9 Correct 204 ms 23760 KB Output is correct
10 Correct 169 ms 23700 KB Output is correct
11 Correct 95 ms 21076 KB Output is correct
12 Correct 211 ms 23660 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 233 ms 21700 KB Output is correct
2 Correct 235 ms 22212 KB Output is correct
3 Correct 237 ms 22728 KB Output is correct
4 Correct 240 ms 21156 KB Output is correct
5 Correct 240 ms 21552 KB Output is correct
6 Correct 224 ms 25028 KB Output is correct
7 Correct 257 ms 30576 KB Output is correct
8 Correct 270 ms 25288 KB Output is correct
9 Correct 266 ms 25836 KB Output is correct
10 Correct 223 ms 26176 KB Output is correct
11 Correct 91 ms 22868 KB Output is correct
12 Correct 255 ms 29940 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9560 KB Output is correct
2 Correct 3 ms 8140 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 14 ms 11036 KB Output is correct
5 Correct 8 ms 9564 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 4 ms 8380 KB Output is correct
8 Correct 4 ms 8284 KB Output is correct
9 Correct 3 ms 8284 KB Output is correct
10 Correct 9 ms 9564 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8116 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 19648 KB Output is correct
2 Correct 212 ms 19908 KB Output is correct
3 Correct 233 ms 24600 KB Output is correct
4 Correct 201 ms 24272 KB Output is correct
5 Correct 221 ms 23752 KB Output is correct
6 Correct 212 ms 23748 KB Output is correct
7 Correct 264 ms 24520 KB Output is correct
8 Correct 228 ms 24520 KB Output is correct
9 Correct 204 ms 23760 KB Output is correct
10 Correct 169 ms 23700 KB Output is correct
11 Correct 95 ms 21076 KB Output is correct
12 Correct 211 ms 23660 KB Output is correct
13 Correct 233 ms 21700 KB Output is correct
14 Correct 235 ms 22212 KB Output is correct
15 Correct 237 ms 22728 KB Output is correct
16 Correct 240 ms 21156 KB Output is correct
17 Correct 240 ms 21552 KB Output is correct
18 Correct 224 ms 25028 KB Output is correct
19 Correct 257 ms 30576 KB Output is correct
20 Correct 270 ms 25288 KB Output is correct
21 Correct 266 ms 25836 KB Output is correct
22 Correct 223 ms 26176 KB Output is correct
23 Correct 91 ms 22868 KB Output is correct
24 Correct 255 ms 29940 KB Output is correct
25 Correct 9 ms 9560 KB Output is correct
26 Correct 3 ms 8140 KB Output is correct
27 Correct 2 ms 8284 KB Output is correct
28 Correct 14 ms 11036 KB Output is correct
29 Correct 8 ms 9564 KB Output is correct
30 Correct 3 ms 8284 KB Output is correct
31 Correct 4 ms 8380 KB Output is correct
32 Correct 4 ms 8284 KB Output is correct
33 Correct 3 ms 8284 KB Output is correct
34 Correct 9 ms 9564 KB Output is correct
35 Correct 2 ms 8284 KB Output is correct
36 Correct 2 ms 8280 KB Output is correct
37 Correct 2 ms 8116 KB Output is correct
38 Correct 2 ms 8284 KB Output is correct
39 Correct 2 ms 8284 KB Output is correct
40 Correct 206 ms 23616 KB Output is correct
41 Correct 205 ms 23744 KB Output is correct
42 Correct 229 ms 24012 KB Output is correct
43 Correct 111 ms 23888 KB Output is correct
44 Correct 117 ms 24172 KB Output is correct
45 Correct 245 ms 25288 KB Output is correct
46 Correct 220 ms 24768 KB Output is correct
47 Correct 217 ms 24272 KB Output is correct
48 Correct 121 ms 19932 KB Output is correct
49 Correct 173 ms 23612 KB Output is correct
50 Correct 222 ms 24516 KB Output is correct
51 Correct 251 ms 25144 KB Output is correct