oj.uz

Submission #678568

# Submission time Handle Problem Language Result Execution time Memory
678568 2023-01-06T07:40:18 Z hollwo_pelw Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 343 ms 21020 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;

void Hollwo_Pelw();

signed main(){
#ifndef hollwo_pelw_local
	if (fopen(".inp", "r"))
		assert(freopen(".inp", "r", stdin)), assert(freopen(".out", "w", stdout));
#else
	using namespace chrono;
	auto start = steady_clock::now();
#endif
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = steady_clock::now();
	cout << "\nExecution time : " << duration_cast<milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}

#define int long long

const int N = 1e5 + 5;

int n, m, S, T, U, V;
vector<pair<int, int>> adj[N];

int ds[N], dt[N], du[N], dv[N], fu[N], fv[N];

void dijkstra(int s, int *d) {
	fill(d + 1, d + n + 1, 1e18);
	priority_queue<pair<int, int>> pq;

	pq.emplace(d[s] = 0, s);

	while (!pq.empty()) {
		auto [D, u] = pq.top(); pq.pop(), D = -D;
		if (d[u] != D) continue;

		for (auto [v, w] : adj[u]) {
			if (d[v] > D + w)
				pq.emplace(- (d[v] = D + w), v);
		}
	}
}

void Hollwo_Pelw(){
	cin >> n >> m >> S >> T >> U >> V;
	for (int u, v, w; m --; ) {
		cin >> u >> v >> w;
		adj[u].emplace_back(v, w);
		adj[v].emplace_back(u, w);
	}
	dijkstra(S, ds);
	dijkstra(T, dt);
	dijkstra(U, du);
	dijkstra(V, dv);

	vector<pair<int, int>> ord;

	for (int i = 1; i <= n; i++) {
		if (ds[i] + dt[i] == ds[T]) {
			// in path
			ord.emplace_back(dt[i], i);
		}
	}

	sort(ord.begin(), ord.end());

	fill(fu + 1, fu + n + 1, 1e18);
	fill(fv + 1, fv + n + 1, 1e18);

	int res = du[V];

	for (auto [_, x] : ord) {
		fu[x] = du[x], fv[x] = dv[x];
		for (auto [y, w] : adj[x]) {
			if (dt[y] + w == dt[x]) {
				fu[x] = min(fu[x], fu[y]);
				fv[x] = min(fv[x], fv[y]);
			}
		}
		res = min({res, fu[x] + dv[x], fv[x] + du[x]});
	}

	cout << res << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 19488 KB Output is correct
2 Correct 261 ms 19068 KB Output is correct
3 Correct 292 ms 21020 KB Output is correct
4 Correct 288 ms 19452 KB Output is correct
5 Correct 270 ms 19776 KB Output is correct
6 Correct 343 ms 19564 KB Output is correct
7 Correct 264 ms 19836 KB Output is correct
8 Correct 270 ms 19728 KB Output is correct
9 Correct 255 ms 18240 KB Output is correct
10 Correct 229 ms 18084 KB Output is correct
11 Correct 123 ms 13612 KB Output is correct
12 Correct 271 ms 18268 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 18952 KB Output is correct
2 Correct 281 ms 19004 KB Output is correct
3 Correct 311 ms 19132 KB Output is correct
4 Correct 291 ms 18968 KB Output is correct
5 Correct 272 ms 19600 KB Output is correct
6 Correct 296 ms 19876 KB Output is correct
7 Correct 278 ms 19424 KB Output is correct
8 Correct 312 ms 19056 KB Output is correct
9 Correct 268 ms 19520 KB Output is correct
10 Correct 280 ms 18968 KB Output is correct
11 Correct 106 ms 13888 KB Output is correct
12 Correct 291 ms 19944 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4304 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 14 ms 5672 KB Output is correct
5 Correct 10 ms 4364 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 8 ms 4308 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2684 KB Output is correct
13 Correct 3 ms 2676 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 2 ms 2684 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 19488 KB Output is correct
2 Correct 261 ms 19068 KB Output is correct
3 Correct 292 ms 21020 KB Output is correct
4 Correct 288 ms 19452 KB Output is correct
5 Correct 270 ms 19776 KB Output is correct
6 Correct 343 ms 19564 KB Output is correct
7 Correct 264 ms 19836 KB Output is correct
8 Correct 270 ms 19728 KB Output is correct
9 Correct 255 ms 18240 KB Output is correct
10 Correct 229 ms 18084 KB Output is correct
11 Correct 123 ms 13612 KB Output is correct
12 Correct 271 ms 18268 KB Output is correct
13 Correct 267 ms 18952 KB Output is correct
14 Correct 281 ms 19004 KB Output is correct
15 Correct 311 ms 19132 KB Output is correct
16 Correct 291 ms 18968 KB Output is correct
17 Correct 272 ms 19600 KB Output is correct
18 Correct 296 ms 19876 KB Output is correct
19 Correct 278 ms 19424 KB Output is correct
20 Correct 312 ms 19056 KB Output is correct
21 Correct 268 ms 19520 KB Output is correct
22 Correct 280 ms 18968 KB Output is correct
23 Correct 106 ms 13888 KB Output is correct
24 Correct 291 ms 19944 KB Output is correct
25 Correct 9 ms 4304 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 3 ms 2644 KB Output is correct
28 Correct 14 ms 5672 KB Output is correct
29 Correct 10 ms 4364 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 8 ms 4308 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2684 KB Output is correct
37 Correct 3 ms 2676 KB Output is correct
38 Correct 2 ms 2688 KB Output is correct
39 Correct 2 ms 2684 KB Output is correct
40 Correct 230 ms 19120 KB Output is correct
41 Correct 279 ms 18284 KB Output is correct
42 Correct 256 ms 18344 KB Output is correct
43 Correct 121 ms 14520 KB Output is correct
44 Correct 131 ms 14464 KB Output is correct
45 Correct 245 ms 19600 KB Output is correct
46 Correct 281 ms 19636 KB Output is correct
47 Correct 267 ms 19412 KB Output is correct
48 Correct 108 ms 14504 KB Output is correct
49 Correct 195 ms 19072 KB Output is correct
50 Correct 298 ms 19496 KB Output is correct
51 Correct 242 ms 19572 KB Output is correct