oj.uz

Submission #260161

# Submission time Handle Problem Language Result Execution time Memory
260161 2020-08-09T12:22:06 Z ttnhuy313 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 421 ms 25108 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 344 ms 22116 KB Output is correct
2 Correct 354 ms 21612 KB Output is correct
3 Correct 377 ms 25108 KB Output is correct
4 Correct 339 ms 21988 KB Output is correct
5 Correct 345 ms 21484 KB Output is correct
6 Correct 360 ms 22168 KB Output is correct
7 Correct 371 ms 21784 KB Output is correct
8 Correct 369 ms 21740 KB Output is correct
9 Correct 348 ms 22332 KB Output is correct
10 Correct 289 ms 22240 KB Output is correct
11 Correct 175 ms 15852 KB Output is correct
12 Correct 385 ms 22184 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 23272 KB Output is correct
2 Correct 400 ms 23152 KB Output is correct
3 Correct 398 ms 23036 KB Output is correct
4 Correct 404 ms 22944 KB Output is correct
5 Correct 398 ms 23364 KB Output is correct
6 Correct 372 ms 24684 KB Output is correct
7 Correct 405 ms 24720 KB Output is correct
8 Correct 395 ms 23016 KB Output is correct
9 Correct 407 ms 23276 KB Output is correct
10 Correct 398 ms 22768 KB Output is correct
11 Correct 177 ms 16888 KB Output is correct
12 Correct 379 ms 24908 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4480 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 21 ms 6144 KB Output is correct
5 Correct 11 ms 4480 KB Output is correct
6 Correct 3 ms 2816 KB Output is correct
7 Correct 3 ms 2944 KB Output is correct
8 Correct 4 ms 2944 KB Output is correct
9 Correct 3 ms 2816 KB Output is correct
10 Correct 12 ms 4480 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Correct 3 ms 2816 KB Output is correct
15 Correct 3 ms 2944 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 22116 KB Output is correct
2 Correct 354 ms 21612 KB Output is correct
3 Correct 377 ms 25108 KB Output is correct
4 Correct 339 ms 21988 KB Output is correct
5 Correct 345 ms 21484 KB Output is correct
6 Correct 360 ms 22168 KB Output is correct
7 Correct 371 ms 21784 KB Output is correct
8 Correct 369 ms 21740 KB Output is correct
9 Correct 348 ms 22332 KB Output is correct
10 Correct 289 ms 22240 KB Output is correct
11 Correct 175 ms 15852 KB Output is correct
12 Correct 385 ms 22184 KB Output is correct
13 Correct 409 ms 23272 KB Output is correct
14 Correct 400 ms 23152 KB Output is correct
15 Correct 398 ms 23036 KB Output is correct
16 Correct 404 ms 22944 KB Output is correct
17 Correct 398 ms 23364 KB Output is correct
18 Correct 372 ms 24684 KB Output is correct
19 Correct 405 ms 24720 KB Output is correct
20 Correct 395 ms 23016 KB Output is correct
21 Correct 407 ms 23276 KB Output is correct
22 Correct 398 ms 22768 KB Output is correct
23 Correct 177 ms 16888 KB Output is correct
24 Correct 379 ms 24908 KB Output is correct
25 Correct 13 ms 4480 KB Output is correct
26 Correct 2 ms 2816 KB Output is correct
27 Correct 2 ms 2816 KB Output is correct
28 Correct 21 ms 6144 KB Output is correct
29 Correct 11 ms 4480 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 3 ms 2944 KB Output is correct
32 Correct 4 ms 2944 KB Output is correct
33 Correct 3 ms 2816 KB Output is correct
34 Correct 12 ms 4480 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2688 KB Output is correct
37 Correct 2 ms 2816 KB Output is correct
38 Correct 3 ms 2816 KB Output is correct
39 Correct 3 ms 2944 KB Output is correct
40 Correct 339 ms 22112 KB Output is correct
41 Correct 350 ms 22288 KB Output is correct
42 Correct 369 ms 22380 KB Output is correct
43 Correct 201 ms 16376 KB Output is correct
44 Correct 207 ms 16376 KB Output is correct
45 Correct 407 ms 21352 KB Output is correct
46 Correct 421 ms 20952 KB Output is correct
47 Correct 366 ms 21996 KB Output is correct
48 Correct 180 ms 14200 KB Output is correct
49 Correct 290 ms 21600 KB Output is correct
50 Correct 356 ms 21228 KB Output is correct
51 Correct 349 ms 21100 KB Output is correct