oj.uz

Submission #854433

# Submission time Handle Problem Language Result Execution time Memory
854433 2023-09-27T16:21:38 Z QuangBui Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 382 ms 32832 KB 
// QuangBuiCP
// 375.cpp
#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "local/debug.hpp"
#else
#define debug(...)
#endif // LOCAL

#define SZ(a) (int)(a).size()
#define ALL(a) (a).begin(),(a).end()

#define int long long

struct State {
	int x;
	int dist;
	bool operator < (const State& other) const {
		return dist > other.dist;
	}
};

vector<int> run_dijkstra(int n, const vector<vector<pair<int, int>>> g, int start) {
	vector<int> dist(n, LLONG_MAX / 2);
	priority_queue<State> pq;
	pq.push({start, 0});
	dist[start] = 0;
	while (SZ(pq)) {
		State top = pq.top(); pq.pop();
		int u = top.x;
		int cur = top.dist;
		if (dist[u] != cur) {
			continue;
		}
		for (auto& p : g[u]) {
			int v = p.first;
			int w = p.second;
			if (cur + w < dist[v]) {
				dist[v] = cur + w;
				pq.push({v, dist[v]});
			}
		}
	}
	return dist;
}

signed main() {
#ifndef LOCAL
	cin.tie(nullptr)->sync_with_stdio(false);
#endif // LOCAL

	int n, m;
	cin >> n >> m;
	int S, T, X, Y;
	cin >> S >> T >> X >> Y; S--, T--, X--, Y--;
	vector<vector<pair<int, int>>> g(n);
	for (int i = 0; i < m; ++i) {
		int x, y, w;
		cin >> x >> y >> w; x--, y--;
		g[x].emplace_back(y, w);
		g[y].emplace_back(x, w);
	}
	vector<int> dS = run_dijkstra(n, g, S);
	vector<int> dT = run_dijkstra(n, g, T);
	vector<int> dX = run_dijkstra(n, g, X);
	vector<int> dY = run_dijkstra(n, g, Y);
	long long min_dist = dS[T];
	auto Calc = [&](const vector<int>& s, const vector<int>& t, const vector<int>& d, int start) {
		vector<int> topo;
		vector<bool> vis(n, false);
		function<void(int)> dfs = [&](int u) {
			vis[u] = true;
			for (auto& p : g[u]) {
				int v = p.first;
				int w = p.second;
				if (s[u] + w == min_dist - t[v] && !vis[v]) {
					dfs(v);
				}
			}
			topo.push_back(u);
		};
		dfs(start);
		reverse(ALL(topo));
		vector<int> dp(n, LLONG_MAX / 2);
		for (int u : topo) {
			dp[u] = min(dp[u], d[u]);
			for (auto& p : g[u]) {
				int v = p.first;
				int w = p.second;
				if (s[u] + w == min_dist - t[v]) {
					dp[v] = min(dp[v], dp[u]);
				}
			}
		}
		return dp;
	};
	vector<int> sx = Calc(dS, dT, dX, S);
	vector<int> sy = Calc(dS, dT, dY, S);
	vector<int> tx = Calc(dT, dS, dX, T);
	vector<int> ty = Calc(dT, dS, dY, T);
	int ans = dX[Y];
	for (int i = 0; i < n; ++i) {
		ans = min(ans, min(sx[i] + ty[i], sy[i] + tx[i]));
	}
	cout << ans << '\n';

#ifdef LOCAL
	cout << '\n' << clock() << "ms.";
#endif // LOCAL
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 28588 KB Output is correct
2 Correct 279 ms 27880 KB Output is correct
3 Correct 351 ms 32696 KB Output is correct
4 Correct 258 ms 28708 KB Output is correct
5 Correct 342 ms 27712 KB Output is correct
6 Correct 237 ms 28896 KB Output is correct
7 Correct 315 ms 27900 KB Output is correct
8 Correct 304 ms 27844 KB Output is correct
9 Correct 308 ms 27536 KB Output is correct
10 Correct 196 ms 27156 KB Output is correct
11 Correct 126 ms 21292 KB Output is correct
12 Correct 268 ms 27664 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 29604 KB Output is correct
2 Correct 301 ms 30168 KB Output is correct
3 Correct 288 ms 29524 KB Output is correct
4 Correct 334 ms 29772 KB Output is correct
5 Correct 359 ms 30284 KB Output is correct
6 Correct 308 ms 32048 KB Output is correct
7 Correct 347 ms 32832 KB Output is correct
8 Correct 315 ms 30032 KB Output is correct
9 Correct 318 ms 30536 KB Output is correct
10 Correct 289 ms 29512 KB Output is correct
11 Correct 151 ms 22828 KB Output is correct
12 Correct 337 ms 32304 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2392 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 11 ms 4524 KB Output is correct
5 Correct 6 ms 2460 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 6 ms 2456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 28588 KB Output is correct
2 Correct 279 ms 27880 KB Output is correct
3 Correct 351 ms 32696 KB Output is correct
4 Correct 258 ms 28708 KB Output is correct
5 Correct 342 ms 27712 KB Output is correct
6 Correct 237 ms 28896 KB Output is correct
7 Correct 315 ms 27900 KB Output is correct
8 Correct 304 ms 27844 KB Output is correct
9 Correct 308 ms 27536 KB Output is correct
10 Correct 196 ms 27156 KB Output is correct
11 Correct 126 ms 21292 KB Output is correct
12 Correct 268 ms 27664 KB Output is correct
13 Correct 321 ms 29604 KB Output is correct
14 Correct 301 ms 30168 KB Output is correct
15 Correct 288 ms 29524 KB Output is correct
16 Correct 334 ms 29772 KB Output is correct
17 Correct 359 ms 30284 KB Output is correct
18 Correct 308 ms 32048 KB Output is correct
19 Correct 347 ms 32832 KB Output is correct
20 Correct 315 ms 30032 KB Output is correct
21 Correct 318 ms 30536 KB Output is correct
22 Correct 289 ms 29512 KB Output is correct
23 Correct 151 ms 22828 KB Output is correct
24 Correct 337 ms 32304 KB Output is correct
25 Correct 9 ms 2392 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 11 ms 4524 KB Output is correct
29 Correct 6 ms 2460 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 6 ms 2456 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 236 ms 28884 KB Output is correct
41 Correct 275 ms 27692 KB Output is correct
42 Correct 250 ms 27440 KB Output is correct
43 Correct 148 ms 22060 KB Output is correct
44 Correct 165 ms 22056 KB Output is correct
45 Correct 324 ms 26596 KB Output is correct
46 Correct 382 ms 27396 KB Output is correct
47 Correct 243 ms 28748 KB Output is correct
48 Correct 169 ms 19436 KB Output is correct
49 Correct 214 ms 28908 KB Output is correct
50 Correct 350 ms 27280 KB Output is correct
51 Correct 352 ms 27540 KB Output is correct