oj.uz

Submission #499892

# Submission time Handle Problem Language Result Execution time Memory
499892 2021-12-29T22:36:56 Z couplefire Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 314 ms 27208 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 252 ms 21960 KB Output is correct
2 Correct 275 ms 21612 KB Output is correct
3 Correct 292 ms 27208 KB Output is correct
4 Correct 240 ms 22072 KB Output is correct
5 Correct 270 ms 21292 KB Output is correct
6 Correct 259 ms 21984 KB Output is correct
7 Correct 272 ms 21732 KB Output is correct
8 Correct 274 ms 21652 KB Output is correct
9 Correct 249 ms 22200 KB Output is correct
10 Correct 211 ms 22100 KB Output is correct
11 Correct 112 ms 17108 KB Output is correct
12 Correct 260 ms 22232 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 23912 KB Output is correct
2 Correct 296 ms 24020 KB Output is correct
3 Correct 272 ms 23400 KB Output is correct
4 Correct 285 ms 23844 KB Output is correct
5 Correct 282 ms 24380 KB Output is correct
6 Correct 272 ms 26392 KB Output is correct
7 Correct 314 ms 26560 KB Output is correct
8 Correct 281 ms 23916 KB Output is correct
9 Correct 290 ms 24376 KB Output is correct
10 Correct 310 ms 23696 KB Output is correct
11 Correct 129 ms 18780 KB Output is correct
12 Correct 297 ms 26768 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4428 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 14 ms 6092 KB Output is correct
5 Correct 9 ms 4332 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 3 ms 2892 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 8 ms 4348 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 21960 KB Output is correct
2 Correct 275 ms 21612 KB Output is correct
3 Correct 292 ms 27208 KB Output is correct
4 Correct 240 ms 22072 KB Output is correct
5 Correct 270 ms 21292 KB Output is correct
6 Correct 259 ms 21984 KB Output is correct
7 Correct 272 ms 21732 KB Output is correct
8 Correct 274 ms 21652 KB Output is correct
9 Correct 249 ms 22200 KB Output is correct
10 Correct 211 ms 22100 KB Output is correct
11 Correct 112 ms 17108 KB Output is correct
12 Correct 260 ms 22232 KB Output is correct
13 Correct 282 ms 23912 KB Output is correct
14 Correct 296 ms 24020 KB Output is correct
15 Correct 272 ms 23400 KB Output is correct
16 Correct 285 ms 23844 KB Output is correct
17 Correct 282 ms 24380 KB Output is correct
18 Correct 272 ms 26392 KB Output is correct
19 Correct 314 ms 26560 KB Output is correct
20 Correct 281 ms 23916 KB Output is correct
21 Correct 290 ms 24376 KB Output is correct
22 Correct 310 ms 23696 KB Output is correct
23 Correct 129 ms 18780 KB Output is correct
24 Correct 297 ms 26768 KB Output is correct
25 Correct 8 ms 4428 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 14 ms 6092 KB Output is correct
29 Correct 9 ms 4332 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 8 ms 4348 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2684 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 233 ms 21944 KB Output is correct
41 Correct 255 ms 22072 KB Output is correct
42 Correct 254 ms 22208 KB Output is correct
43 Correct 126 ms 17768 KB Output is correct
44 Correct 121 ms 17788 KB Output is correct
45 Correct 281 ms 21032 KB Output is correct
46 Correct 255 ms 20712 KB Output is correct
47 Correct 267 ms 21968 KB Output is correct
48 Correct 137 ms 14704 KB Output is correct
49 Correct 210 ms 21548 KB Output is correct
50 Correct 257 ms 21160 KB Output is correct
51 Correct 266 ms 21044 KB Output is correct