oj.uz

Submission #500104

# Submission time Handle Problem Language Result Execution time Memory
500104 2021-12-30T10:26:16 Z buidangnguyen05 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 289 ms 15688 KB 
/* input

*/

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e5 + 10;
int n, m;
vector<pair<int, int>> adj[N];

pair<vector<ll>, vector<int>> dijkstra(int s) {
	vector<ll> d(n + 2, 1e15); vector<int> order;

	d[s] = 0;
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
	q.push(make_pair(d[s], s));

	while(!q.empty()) {
		ll dist; int x; tie(dist, x) = q.top(); q.pop();
		if(dist != d[x]) continue;
		order.push_back(x);
		for(pair<int, int> i : adj[x]) {
			int v, w; tie(v, w) = i;
			if(d[v] > d[x] + w) {
				d[v] = d[x] + w;
				q.push(make_pair(d[v], v));
			}
		}
	}

	return make_pair(d, order);
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	//freopen("task.inp", "r", stdin);
	//freopen("task.out", "w", stdout);

	int s, t, u, v; cin >> n >> m >> s >> t >> u >> v;
	for(int i = 1; i <= m; ++i) {
		int x, y, w; cin >> x >> y >> w;
		adj[x].push_back(make_pair(y, w));
		adj[y].push_back(make_pair(x, w));
	}

	vector<ll> fu = dijkstra(u).first;
	vector<ll> fv = dijkstra(v).first;
	vector<ll> ft = dijkstra(t).first;
	vector<ll> fs; vector<int> order; 
	tie(fs, order) = dijkstra(s);

	ll res = fu[v];
	for(int turn = 0; turn < 2; ++turn) {
		vector<ll> f(n + 2, 1e15);
		f[s] = fu[s];
		for(int x : order) {
			if(fs[x] + ft[x] != fs[t]) continue;
			res = min(res, f[x] + fv[x]);
			for(pair<int, int> e : adj[x]) {
				int i, w; tie(i, w) = e;
				if(fs[i] + ft[i] != fs[t]) continue;
				f[i] = min(f[i], f[x]); f[i] = min(f[i], fu[x]);
			}
		}
		fu.swap(fv);
	}

	cout << res << "\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 15620 KB Output is correct
2 Correct 237 ms 14716 KB Output is correct
3 Correct 267 ms 15340 KB Output is correct
4 Correct 256 ms 15304 KB Output is correct
5 Correct 232 ms 14604 KB Output is correct
6 Correct 280 ms 15688 KB Output is correct
7 Correct 248 ms 14800 KB Output is correct
8 Correct 244 ms 14744 KB Output is correct
9 Correct 258 ms 14612 KB Output is correct
10 Correct 199 ms 14480 KB Output is correct
11 Correct 142 ms 10556 KB Output is correct
12 Correct 254 ms 14612 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 14900 KB Output is correct
2 Correct 249 ms 14736 KB Output is correct
3 Correct 289 ms 14856 KB Output is correct
4 Correct 247 ms 14660 KB Output is correct
5 Correct 285 ms 14728 KB Output is correct
6 Correct 246 ms 14704 KB Output is correct
7 Correct 264 ms 14648 KB Output is correct
8 Correct 262 ms 14712 KB Output is correct
9 Correct 265 ms 14764 KB Output is correct
10 Correct 268 ms 14672 KB Output is correct
11 Correct 114 ms 10644 KB Output is correct
12 Correct 265 ms 15420 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3276 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 1 ms 2636 KB Output is correct
4 Correct 12 ms 4048 KB Output is correct
5 Correct 7 ms 3276 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 8 ms 3276 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 15620 KB Output is correct
2 Correct 237 ms 14716 KB Output is correct
3 Correct 267 ms 15340 KB Output is correct
4 Correct 256 ms 15304 KB Output is correct
5 Correct 232 ms 14604 KB Output is correct
6 Correct 280 ms 15688 KB Output is correct
7 Correct 248 ms 14800 KB Output is correct
8 Correct 244 ms 14744 KB Output is correct
9 Correct 258 ms 14612 KB Output is correct
10 Correct 199 ms 14480 KB Output is correct
11 Correct 142 ms 10556 KB Output is correct
12 Correct 254 ms 14612 KB Output is correct
13 Correct 283 ms 14900 KB Output is correct
14 Correct 249 ms 14736 KB Output is correct
15 Correct 289 ms 14856 KB Output is correct
16 Correct 247 ms 14660 KB Output is correct
17 Correct 285 ms 14728 KB Output is correct
18 Correct 246 ms 14704 KB Output is correct
19 Correct 264 ms 14648 KB Output is correct
20 Correct 262 ms 14712 KB Output is correct
21 Correct 265 ms 14764 KB Output is correct
22 Correct 268 ms 14672 KB Output is correct
23 Correct 114 ms 10644 KB Output is correct
24 Correct 265 ms 15420 KB Output is correct
25 Correct 8 ms 3276 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 1 ms 2636 KB Output is correct
28 Correct 12 ms 4048 KB Output is correct
29 Correct 7 ms 3276 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 3 ms 2764 KB Output is correct
32 Correct 3 ms 2764 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 8 ms 3276 KB Output is correct
35 Correct 3 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 216 ms 15204 KB Output is correct
41 Correct 258 ms 14744 KB Output is correct
42 Correct 255 ms 14696 KB Output is correct
43 Correct 104 ms 10488 KB Output is correct
44 Correct 106 ms 10608 KB Output is correct
45 Correct 240 ms 15448 KB Output is correct
46 Correct 236 ms 14340 KB Output is correct
47 Correct 259 ms 14716 KB Output is correct
48 Correct 123 ms 10704 KB Output is correct
49 Correct 185 ms 15208 KB Output is correct
50 Correct 264 ms 14388 KB Output is correct
51 Correct 221 ms 14296 KB Output is correct