oj.uz

Submission #459191

# Submission time Handle Problem Language Result Execution time Memory
459191 2021-08-08T09:56:09 Z TeaTime Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 1008 ms 58020 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll SZ = 1e5 + 100, INF = 1e9 * 1e9 + 100;

vector<vector<pair<ll, ll>>> gr;
ll n, m, s, t, u, v;
ll dist[SZ][2], d[SZ][3];
ll used[SZ][2], us[SZ][3];

void djikstra(int v, int ind) {
	priority_queue<pair<ll, ll>> st;

	for (int i = 0; i < n; i++) {
		dist[i][ind] = INF;
	}

	dist[v][ind] = 0;

	for (int i = 0; i < n; i++) st.push({ -dist[i][ind], i });

	while (!st.empty()) {
		pair<ll, ll> v = (st.top());
		st.pop();
		if (used[v.second][ind]) continue;
		used[v.second][ind] = 1;
		v.first = -v.first;

		for (auto to : gr[v.second]) {
			if (dist[to.first][ind] > v.first + to.second) {
				dist[to.first][ind] = v.first + to.second;
				st.push({ -dist[to.first][ind], to.first });
			}
		}
	}
}

ll find_ans(int u, int v) {
	priority_queue<tuple<ll, ll, ll>> st;

	for (int i = 0; i < n; i++) {
		for (int k = 0; k < 3; k++) {
			d[i][k] = INF;
			us[i][k] = 0;
		}
	}

	d[v][0] = 0;

	for (int i = 0; i < n; i++) {
		for (int k = 0; k < 3; k++) st.push({ -d[i][k], i, k });
	}

	while (!st.empty()) {
		tuple<ll, ll, ll> v = (st.top());
		st.pop();
		ll vrt = get<1>(v), k = get<2>(v), dst = get<0>(v);
		if (us[vrt][k]) continue;
		us[vrt][k] = 1;
		dst = -dst;
		for (auto to : gr[vrt]) {
			
				if (k == 1) {
					if (d[to.first][k + 1] > dst + to.second) {
						d[to.first][k + 1] = dst + to.second;
						st.push({ -d[to.first][k + 1], to.first, k + 1 });
					}
				} else {
					if (d[to.first][k] > dst + to.second) {
						d[to.first][k] = dst + to.second;
						st.push({ -d[to.first][k], to.first, k });
					}
				}
			
			int s2 = vrt, t2 = to.first;
			if (dist[s2][0] + dist[t2][1] + to.second == dist[t][0]) {
				if (k == 0 || k == 1) {
					if (d[to.first][1] > dst) {
						d[to.first][1] = dst;
						st.push({ -d[to.first][1], to.first, 1 });
					}
				}
			}
		}
	}

	return min(min(d[u][0], d[u][1]), d[u][2]);
}

int main() {
	fastInp;

	cin >> n >> m;

	cin >> s >> t;

	cin >> u >> v;

	s--; t--; u--; v--;

	gr.resize(n);

	for (int i = 0; i < m; i++) {
		ll u, v, c;
		cin >> u >> v >> c;
		u--; v--;
		gr[u].push_back({ v, c });
		gr[v].push_back({ u, c });
	}
	
	djikstra(s, 0);
	djikstra(t, 1);

	ll a = find_ans(u, v);
	ll b = find_ans(v, u);

	cout << min(a, b);

	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 725 ms 43456 KB Output is correct
2 Correct 787 ms 42500 KB Output is correct
3 Correct 942 ms 44028 KB Output is correct
4 Correct 750 ms 43184 KB Output is correct
5 Correct 798 ms 43492 KB Output is correct
6 Correct 815 ms 43796 KB Output is correct
7 Correct 869 ms 43680 KB Output is correct
8 Correct 882 ms 43512 KB Output is correct
9 Correct 844 ms 42332 KB Output is correct
10 Correct 664 ms 42088 KB Output is correct
11 Correct 540 ms 36532 KB Output is correct
12 Correct 832 ms 42580 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 775 ms 43280 KB Output is correct
2 Correct 811 ms 42968 KB Output is correct
3 Correct 808 ms 42808 KB Output is correct
4 Correct 898 ms 42944 KB Output is correct
5 Correct 787 ms 42848 KB Output is correct
6 Correct 858 ms 43640 KB Output is correct
7 Correct 820 ms 42884 KB Output is correct
8 Correct 918 ms 42676 KB Output is correct
9 Correct 846 ms 42792 KB Output is correct
10 Correct 821 ms 42744 KB Output is correct
11 Correct 610 ms 37360 KB Output is correct
12 Correct 930 ms 43912 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1868 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 19 ms 3116 KB Output is correct
5 Correct 10 ms 1808 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 10 ms 1740 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 725 ms 43456 KB Output is correct
2 Correct 787 ms 42500 KB Output is correct
3 Correct 942 ms 44028 KB Output is correct
4 Correct 750 ms 43184 KB Output is correct
5 Correct 798 ms 43492 KB Output is correct
6 Correct 815 ms 43796 KB Output is correct
7 Correct 869 ms 43680 KB Output is correct
8 Correct 882 ms 43512 KB Output is correct
9 Correct 844 ms 42332 KB Output is correct
10 Correct 664 ms 42088 KB Output is correct
11 Correct 540 ms 36532 KB Output is correct
12 Correct 832 ms 42580 KB Output is correct
13 Correct 775 ms 43280 KB Output is correct
14 Correct 811 ms 42968 KB Output is correct
15 Correct 808 ms 42808 KB Output is correct
16 Correct 898 ms 42944 KB Output is correct
17 Correct 787 ms 42848 KB Output is correct
18 Correct 858 ms 43640 KB Output is correct
19 Correct 820 ms 42884 KB Output is correct
20 Correct 918 ms 42676 KB Output is correct
21 Correct 846 ms 42792 KB Output is correct
22 Correct 821 ms 42744 KB Output is correct
23 Correct 610 ms 37360 KB Output is correct
24 Correct 930 ms 43912 KB Output is correct
25 Correct 12 ms 1868 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 19 ms 3116 KB Output is correct
29 Correct 10 ms 1808 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 4 ms 588 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 10 ms 1740 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 858 ms 44060 KB Output is correct
41 Correct 774 ms 41460 KB Output is correct
42 Correct 779 ms 41568 KB Output is correct
43 Correct 585 ms 36640 KB Output is correct
44 Correct 539 ms 35724 KB Output is correct
45 Correct 865 ms 43984 KB Output is correct
46 Correct 837 ms 41844 KB Output is correct
47 Correct 805 ms 43292 KB Output is correct
48 Correct 505 ms 36700 KB Output is correct
49 Correct 722 ms 43668 KB Output is correct
50 Correct 893 ms 44328 KB Output is correct
51 Correct 1008 ms 58020 KB Output is correct