oj.uz

Submission #947591

# Submission time Handle Problem Language Result Execution time Memory
947591 2024-03-16T14:21:58 Z 4QT0R Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 285 ms 25824 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>

vector<pii> graph[100003];
ll n,m,S,T,U,V,oo=1e18+1,min_dist;
ll dist[4][100003];
ll wyn[2][100003];

void Dijkstra(ll st, ll par){
	fill(dist[par],dist[par]+n+1,oo);
	dist[par][st]=0;
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	pq.push({0,st});
	while(pq.size()){
		auto [d,v]=pq.top();
		pq.pop();
		for (auto [u,w] : graph[v]){
			if (d+w<dist[par][u]){
				dist[par][u]=d+w;
				pq.push({d+w,u});
			}
		}
	}
}

ll dfs(ll v, ll par){
	if (wyn[par][v]<oo)return wyn[par][v];
	wyn[par][v]=dist[0][v];
	for (auto u : graph[v]){
		if (dist[par+2][v]+u.second+dist[(par^1)+2][u.first]==min_dist){
			wyn[par][v]=min(wyn[par][v],dfs(u.first,par));
		}
	}
	return wyn[par][v];
}

void init(){
	cin >> n >> m >> S >> T >> U >> V;
	ll a,b,c;
	for (ll i = 1; i<=m; i++){
		cin >> a >> b >> c;
		graph[a].push_back({b,c});
		graph[b].push_back({a,c});
	}
	Dijkstra(U,0);
	Dijkstra(V,1);
	Dijkstra(S,2);
	Dijkstra(T,3);
	min_dist=dist[2][T];
	fill(wyn[0],wyn[0]+n+1,oo);
	fill(wyn[1],wyn[1]+n+1,oo);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	init();
	ll ans=dist[0][V];
	for (ll i = 1; i<=n; i++){
		if (dist[2][i]+dist[3][i]==min_dist)ans=min(ans,min(dfs(i,0),dfs(i,1))+dist[1][i]);
	}
	cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 20892 KB Output is correct
2 Correct 196 ms 19480 KB Output is correct
3 Correct 212 ms 21156 KB Output is correct
4 Correct 186 ms 20724 KB Output is correct
5 Correct 189 ms 19500 KB Output is correct
6 Correct 201 ms 20876 KB Output is correct
7 Correct 271 ms 19728 KB Output is correct
8 Correct 208 ms 19652 KB Output is correct
9 Correct 186 ms 19472 KB Output is correct
10 Correct 196 ms 23880 KB Output is correct
11 Correct 81 ms 18164 KB Output is correct
12 Correct 230 ms 23772 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 20348 KB Output is correct
2 Correct 239 ms 20172 KB Output is correct
3 Correct 223 ms 20176 KB Output is correct
4 Correct 250 ms 21104 KB Output is correct
5 Correct 253 ms 20188 KB Output is correct
6 Correct 285 ms 22676 KB Output is correct
7 Correct 221 ms 22476 KB Output is correct
8 Correct 210 ms 19588 KB Output is correct
9 Correct 233 ms 20488 KB Output is correct
10 Correct 217 ms 20416 KB Output is correct
11 Correct 67 ms 17748 KB Output is correct
12 Correct 220 ms 25824 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8540 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 11 ms 10588 KB Output is correct
5 Correct 7 ms 9052 KB Output is correct
6 Correct 2 ms 7256 KB Output is correct
7 Correct 2 ms 7516 KB Output is correct
8 Correct 3 ms 7588 KB Output is correct
9 Correct 2 ms 7256 KB Output is correct
10 Correct 8 ms 8908 KB Output is correct
11 Correct 2 ms 7344 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7260 KB Output is correct
14 Correct 2 ms 7336 KB Output is correct
15 Correct 2 ms 7256 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 20892 KB Output is correct
2 Correct 196 ms 19480 KB Output is correct
3 Correct 212 ms 21156 KB Output is correct
4 Correct 186 ms 20724 KB Output is correct
5 Correct 189 ms 19500 KB Output is correct
6 Correct 201 ms 20876 KB Output is correct
7 Correct 271 ms 19728 KB Output is correct
8 Correct 208 ms 19652 KB Output is correct
9 Correct 186 ms 19472 KB Output is correct
10 Correct 196 ms 23880 KB Output is correct
11 Correct 81 ms 18164 KB Output is correct
12 Correct 230 ms 23772 KB Output is correct
13 Correct 262 ms 20348 KB Output is correct
14 Correct 239 ms 20172 KB Output is correct
15 Correct 223 ms 20176 KB Output is correct
16 Correct 250 ms 21104 KB Output is correct
17 Correct 253 ms 20188 KB Output is correct
18 Correct 285 ms 22676 KB Output is correct
19 Correct 221 ms 22476 KB Output is correct
20 Correct 210 ms 19588 KB Output is correct
21 Correct 233 ms 20488 KB Output is correct
22 Correct 217 ms 20416 KB Output is correct
23 Correct 67 ms 17748 KB Output is correct
24 Correct 220 ms 25824 KB Output is correct
25 Correct 7 ms 8540 KB Output is correct
26 Correct 2 ms 7260 KB Output is correct
27 Correct 2 ms 7260 KB Output is correct
28 Correct 11 ms 10588 KB Output is correct
29 Correct 7 ms 9052 KB Output is correct
30 Correct 2 ms 7256 KB Output is correct
31 Correct 2 ms 7516 KB Output is correct
32 Correct 3 ms 7588 KB Output is correct
33 Correct 2 ms 7256 KB Output is correct
34 Correct 8 ms 8908 KB Output is correct
35 Correct 2 ms 7344 KB Output is correct
36 Correct 2 ms 7260 KB Output is correct
37 Correct 2 ms 7260 KB Output is correct
38 Correct 2 ms 7336 KB Output is correct
39 Correct 2 ms 7256 KB Output is correct
40 Correct 175 ms 24612 KB Output is correct
41 Correct 179 ms 23772 KB Output is correct
42 Correct 179 ms 23740 KB Output is correct
43 Correct 69 ms 18884 KB Output is correct
44 Correct 74 ms 19232 KB Output is correct
45 Correct 229 ms 22652 KB Output is correct
46 Correct 170 ms 22300 KB Output is correct
47 Correct 178 ms 24456 KB Output is correct
48 Correct 68 ms 15700 KB Output is correct
49 Correct 164 ms 24248 KB Output is correct
50 Correct 180 ms 22696 KB Output is correct
51 Correct 168 ms 22564 KB Output is correct