oj.uz

Submission #59022

# Submission time Handle Problem Language Result Execution time Memory
59022 2018-07-20T08:27:36 Z tmwilliamlin168 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 678 ms 21356 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pli pair<ll, int>
#define fi first
#define se second

const int mxN=1e5;
int n, m, s, t, u, v;
vector<pli> adj[mxN];
ll du[mxN], dv[mxN], ds[mxN], dt[mxN], dp[mxN], ans;
priority_queue<pli, vector<pli>, greater<pli>> pq;

void dijkstra(int s, ll dist[mxN]) {
	memset(dist, 0x3F, 8*n);
	dist[s]=0;
	pq.push({0, s});
	while(!pq.empty()) {
		pli p=pq.top();
		pq.pop();
		int u=p.se;
		if(p.fi>dist[u])
			continue;
		for(pli e : adj[u]) {
			int v=e.se;
			if(dist[u]+e.fi<dist[v]) {
				dist[v]=dist[u]+e.fi;
				pq.push({dist[v], v});
			}
		}
	}
}

ll cdp(int u, bool a) {
	if(dp[u]==-1) {
		if(ds[u]+dt[u]==ds[t]) {
			dp[u]=dv[u];
			for(pli e : adj[u])
				if(a?ds[u]+e.fi==ds[e.se]:dt[u]+e.fi==dt[e.se])
					dp[u]=min(cdp(e.se, a), dp[u]);
			ans=min(du[u]+dp[u], ans);
		} else
			dp[u]=1e18;
	}
	return dp[u];
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> s >> t >> u >> v, --s, --t, --u, --v;
	while(m--) {
		int ui, vi, wi;
		cin >> ui >> vi >> wi, --ui, --vi;
		adj[ui].push_back({wi, vi});
		adj[vi].push_back({wi, ui});
	}
	dijkstra(u, du);
	dijkstra(v, dv);
	dijkstra(s, ds);
	dijkstra(t, dt);
	ans=du[v];
	memset(dp, -1, 8*n);
	cdp(t, 0);
	memset(dp, -1, 8*n);
	cdp(s, 1);
	cout << ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 18276 KB Output is correct
2 Correct 472 ms 18276 KB Output is correct
3 Correct 678 ms 21280 KB Output is correct
4 Correct 586 ms 21280 KB Output is correct
5 Correct 486 ms 21280 KB Output is correct
6 Correct 429 ms 21280 KB Output is correct
7 Correct 528 ms 21280 KB Output is correct
8 Correct 466 ms 21280 KB Output is correct
9 Correct 442 ms 21280 KB Output is correct
10 Correct 347 ms 21280 KB Output is correct
11 Correct 198 ms 21280 KB Output is correct
12 Correct 442 ms 21280 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 519 ms 21280 KB Output is correct
2 Correct 601 ms 21280 KB Output is correct
3 Correct 481 ms 21280 KB Output is correct
4 Correct 622 ms 21280 KB Output is correct
5 Correct 609 ms 21280 KB Output is correct
6 Correct 563 ms 21280 KB Output is correct
7 Correct 646 ms 21344 KB Output is correct
8 Correct 538 ms 21344 KB Output is correct
9 Correct 559 ms 21344 KB Output is correct
10 Correct 553 ms 21344 KB Output is correct
11 Correct 226 ms 21344 KB Output is correct
12 Correct 628 ms 21356 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 18276 KB Output is correct
2 Correct 472 ms 18276 KB Output is correct
3 Correct 678 ms 21280 KB Output is correct
4 Correct 586 ms 21280 KB Output is correct
5 Correct 486 ms 21280 KB Output is correct
6 Correct 429 ms 21280 KB Output is correct
7 Correct 528 ms 21280 KB Output is correct
8 Correct 466 ms 21280 KB Output is correct
9 Correct 442 ms 21280 KB Output is correct
10 Correct 347 ms 21280 KB Output is correct
11 Correct 198 ms 21280 KB Output is correct
12 Correct 442 ms 21280 KB Output is correct
13 Correct 519 ms 21280 KB Output is correct
14 Correct 601 ms 21280 KB Output is correct
15 Correct 481 ms 21280 KB Output is correct
16 Correct 622 ms 21280 KB Output is correct
17 Correct 609 ms 21280 KB Output is correct
18 Correct 563 ms 21280 KB Output is correct
19 Correct 646 ms 21344 KB Output is correct
20 Correct 538 ms 21344 KB Output is correct
21 Correct 559 ms 21344 KB Output is correct
22 Correct 553 ms 21344 KB Output is correct
23 Correct 226 ms 21344 KB Output is correct
24 Correct 628 ms 21356 KB Output is correct
25 Correct 13 ms 21356 KB Output is correct
26 Correct 5 ms 21356 KB Output is correct
27 Correct 5 ms 21356 KB Output is correct
28 Correct 37 ms 21356 KB Output is correct
29 Correct 14 ms 21356 KB Output is correct
30 Correct 6 ms 21356 KB Output is correct
31 Correct 6 ms 21356 KB Output is correct
32 Correct 7 ms 21356 KB Output is correct
33 Correct 6 ms 21356 KB Output is correct
34 Correct 16 ms 21356 KB Output is correct
35 Correct 5 ms 21356 KB Output is correct
36 Correct 4 ms 21356 KB Output is correct
37 Correct 7 ms 21356 KB Output is correct
38 Correct 5 ms 21356 KB Output is correct
39 Correct 5 ms 21356 KB Output is correct
40 Correct 376 ms 21356 KB Output is correct
41 Correct 447 ms 21356 KB Output is correct
42 Correct 487 ms 21356 KB Output is correct
43 Correct 227 ms 21356 KB Output is correct
44 Correct 297 ms 21356 KB Output is correct
45 Correct 583 ms 21356 KB Output is correct
46 Correct 457 ms 21356 KB Output is correct
47 Correct 465 ms 21356 KB Output is correct
48 Correct 319 ms 21356 KB Output is correct
49 Correct 453 ms 21356 KB Output is correct
50 Correct 473 ms 21356 KB Output is correct
51 Correct 433 ms 21356 KB Output is correct