oj.uz

Submission #532541

# Submission time Handle Problem Language Result Execution time Memory
532541 2022-03-03T06:29:01 Z rk42745417 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 342 ms 23604 KB 
#include <bits/stdc++.h>
using namespace std;

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using uint = uint32_t;
using ull = uint64_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-8;
const ll LINF = ll(4e18) + ll(2e15);
static int LamyIsCute = []() {
	EmiliaMyWife
	return 48763;
}();

signed main() {
	int n, m, s, t, a, b;
	cin >> n >> m >> s >> t >> a >> b;
	vector<vector<pair<int, int>>> edge(n + 1);
	while(m--) {
		int u, v, c;
		cin >> u >> v >> c;
		edge[u].push_back({v, c});
		edge[v].push_back({u, c});
	}
	auto dijk = [&](vector<ll> &dis, int st) {
		dis.resize(n + 1, LINF);
		dis[st] = 0;
		priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
		pq.push({0, st});

		while(!pq.empty()) {
			auto [d, u] = pq.top();
			pq.pop();
			if(d > dis[u])
				continue;
			for(const auto &[v, c] : edge[u])
				if(dis[v] > dis[u] + c)
					dis[v] = dis[u] + c, pq.push({dis[v], v});
		}
	};
	vector<ll> diss, dist;
	dijk(diss, s);
	dijk(dist, t);
	const ll mn = diss[t];

	vector<array<ll, 4>> ans(n + 1, {LINF, LINF, LINF, LINF});
	ans[a][0] = 0;
	priority_queue<tuple<ll, int, int>, vector<tuple<ll, int, int>>, greater<tuple<ll, int, int>>> pq;
	pq.push({0, a, 0});
	while(!pq.empty()) {
		auto [d, u, w] = pq.top();
		pq.pop();
		if(d > ans[u][w])
			continue;
		//cerr << "xdd " << u << ' ' << w << ' ' << d << '\n';
		//cerr << "owo " << u << ' ' << diss[u] << ' ' << dist[u] << '\n';
		for(const auto &[v, c] : edge[u]) {
			if((w == 0 || w == 3) && ans[v][w] > ans[u][w] + c) {
				ans[v][w] = ans[u][w] + c;
				pq.push({ans[v][w], v, w});
			}
			if((w == 1 || w == 2) && ans[v][3] > ans[u][w] + c) {
				ans[v][3] = ans[u][w] + c;
				pq.push({ans[v][3], v, 3});
			}
			if((w == 0 || w == 1) && diss[u] + dist[u] == mn && diss[v] + dist[v] == mn && diss[v] - diss[u] == c) {
				if(ans[v][1] > ans[u][w]) {
					ans[v][1] = ans[u][w];
					pq.push({ans[v][1], v, 1});
				}
			}
			if((w == 0 || w == 2) && diss[u] + dist[u] == mn && diss[v] + dist[v] == mn && diss[u] - diss[v] == c) {
				if(ans[v][2] > ans[u][w]) {
					ans[v][2] = ans[u][w];
					pq.push({ans[v][2], v, 2});
				}
			}
		}
	}
	cout << min({ans[b][0], ans[b][1], ans[b][2], ans[b][3]}) << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 23604 KB Output is correct
2 Correct 304 ms 20080 KB Output is correct
3 Correct 314 ms 23472 KB Output is correct
4 Correct 257 ms 20584 KB Output is correct
5 Correct 289 ms 21188 KB Output is correct
6 Correct 258 ms 23548 KB Output is correct
7 Correct 311 ms 21224 KB Output is correct
8 Correct 322 ms 21248 KB Output is correct
9 Correct 284 ms 20932 KB Output is correct
10 Correct 229 ms 21216 KB Output is correct
11 Correct 137 ms 13560 KB Output is correct
12 Correct 265 ms 20876 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 20512 KB Output is correct
2 Correct 308 ms 20188 KB Output is correct
3 Correct 303 ms 21308 KB Output is correct
4 Correct 301 ms 20100 KB Output is correct
5 Correct 296 ms 20128 KB Output is correct
6 Correct 302 ms 21460 KB Output is correct
7 Correct 340 ms 21164 KB Output is correct
8 Correct 307 ms 20160 KB Output is correct
9 Correct 303 ms 20024 KB Output is correct
10 Correct 327 ms 20144 KB Output is correct
11 Correct 134 ms 14692 KB Output is correct
12 Correct 325 ms 21592 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1472 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 13 ms 2456 KB Output is correct
5 Correct 7 ms 1356 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 524 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 7 ms 1348 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 23604 KB Output is correct
2 Correct 304 ms 20080 KB Output is correct
3 Correct 314 ms 23472 KB Output is correct
4 Correct 257 ms 20584 KB Output is correct
5 Correct 289 ms 21188 KB Output is correct
6 Correct 258 ms 23548 KB Output is correct
7 Correct 311 ms 21224 KB Output is correct
8 Correct 322 ms 21248 KB Output is correct
9 Correct 284 ms 20932 KB Output is correct
10 Correct 229 ms 21216 KB Output is correct
11 Correct 137 ms 13560 KB Output is correct
12 Correct 265 ms 20876 KB Output is correct
13 Correct 342 ms 20512 KB Output is correct
14 Correct 308 ms 20188 KB Output is correct
15 Correct 303 ms 21308 KB Output is correct
16 Correct 301 ms 20100 KB Output is correct
17 Correct 296 ms 20128 KB Output is correct
18 Correct 302 ms 21460 KB Output is correct
19 Correct 340 ms 21164 KB Output is correct
20 Correct 307 ms 20160 KB Output is correct
21 Correct 303 ms 20024 KB Output is correct
22 Correct 327 ms 20144 KB Output is correct
23 Correct 134 ms 14692 KB Output is correct
24 Correct 325 ms 21592 KB Output is correct
25 Correct 9 ms 1472 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 13 ms 2456 KB Output is correct
29 Correct 7 ms 1356 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 524 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 7 ms 1348 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 312 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 254 ms 23544 KB Output is correct
41 Correct 247 ms 19672 KB Output is correct
42 Correct 253 ms 19748 KB Output is correct
43 Correct 152 ms 14788 KB Output is correct
44 Correct 140 ms 14776 KB Output is correct
45 Correct 320 ms 21172 KB Output is correct
46 Correct 319 ms 20888 KB Output is correct
47 Correct 259 ms 21604 KB Output is correct
48 Correct 156 ms 14156 KB Output is correct
49 Correct 211 ms 23064 KB Output is correct
50 Correct 315 ms 21260 KB Output is correct
51 Correct 309 ms 21192 KB Output is correct