oj.uz

Submission #855951

# Submission time Handle Problem Language Result Execution time Memory
855951 2023-10-02T11:38:14 Z phoenix0423 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 350 ms 29160 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
const int maxn = 2e5 + 5;
const int N = 1e9 + 7;
const ll INF = 1e18;
vector<pll> adj[maxn];
int n, m, s, t, u, v;
ll dist[maxn][6];

void dijkstra(int st, int id){
	for(int i = 0; i < n; i++) dist[i][id] = INF;
	dist[st][id] = 0;
	priority_queue<pll, vector<pll>, greater<pll>> q;
	q.push({0, st});
	while(!q.empty()){
		auto [d, pos] = q.top(); q.pop();
		if(dist[pos][id] != d) continue;
		for(auto [x, w] : adj[pos]){
			if(dist[x][id] > dist[pos][id] + w){
				dist[x][id] = dist[pos][id] + w;
				q.push({dist[x][id], x});
			}
		}
	}
}

void dijkstra2(int dir, int id){
	priority_queue<pll, vector<pll>, greater<pll>> q;
	for(int i = 0; i < n; i++) dist[i][id] = dist[i][2], q.push({dist[i][id], i});
	while(!q.empty()){
		auto [d, pos] = q.top(); q.pop();
		if(dist[pos][id] != d) continue;
		for(auto [x, w] : adj[pos]){
			if(dist[pos][dir] + dist[x][dir ^ 1] + w == dist[t][0]){
				if(dist[x][id] > dist[pos][id]){
					dist[x][id] = dist[pos][id];
					q.push({dist[x][id], x});
				}
			}
		}
	}
}

int main(void){
	fastio;
	cin>>n>>m>>s>>t>>u>>v;
	s--, t--, u--, v--;
	for(int i = 0; i < m; i++){
		int a, b, c;
		cin>>a>>b>>c;
		a--, b--;
		adj[a].eb(b, c);
		adj[b].eb(a, c);
	}
	dijkstra(s, 0);
	dijkstra(t, 1);
	dijkstra(v, 2);
	dijkstra2(0, 3);
	dijkstra2(1, 4);
	dijkstra(u, 5);
	ll ans = INF;
	for(int i = 0; i < n; i++) ans = min(ans, dist[i][5] + min(dist[i][3], dist[i][4]));
	cout<<ans<<"\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 29160 KB Output is correct
2 Correct 322 ms 28496 KB Output is correct
3 Correct 280 ms 28464 KB Output is correct
4 Correct 262 ms 28448 KB Output is correct
5 Correct 253 ms 28448 KB Output is correct
6 Correct 253 ms 28652 KB Output is correct
7 Correct 264 ms 28376 KB Output is correct
8 Correct 333 ms 28596 KB Output is correct
9 Correct 251 ms 28764 KB Output is correct
10 Correct 213 ms 28820 KB Output is correct
11 Correct 98 ms 22436 KB Output is correct
12 Correct 297 ms 28616 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 28464 KB Output is correct
2 Correct 331 ms 28428 KB Output is correct
3 Correct 324 ms 28560 KB Output is correct
4 Correct 293 ms 28520 KB Output is correct
5 Correct 267 ms 28444 KB Output is correct
6 Correct 272 ms 28532 KB Output is correct
7 Correct 260 ms 28412 KB Output is correct
8 Correct 289 ms 28472 KB Output is correct
9 Correct 275 ms 28488 KB Output is correct
10 Correct 260 ms 28412 KB Output is correct
11 Correct 111 ms 23216 KB Output is correct
12 Correct 257 ms 28384 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7768 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 12 ms 9344 KB Output is correct
5 Correct 7 ms 7772 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 3 ms 6252 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 7 ms 7772 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 6036 KB Output is correct
14 Correct 2 ms 6236 KB Output is correct
15 Correct 2 ms 6488 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 29160 KB Output is correct
2 Correct 322 ms 28496 KB Output is correct
3 Correct 280 ms 28464 KB Output is correct
4 Correct 262 ms 28448 KB Output is correct
5 Correct 253 ms 28448 KB Output is correct
6 Correct 253 ms 28652 KB Output is correct
7 Correct 264 ms 28376 KB Output is correct
8 Correct 333 ms 28596 KB Output is correct
9 Correct 251 ms 28764 KB Output is correct
10 Correct 213 ms 28820 KB Output is correct
11 Correct 98 ms 22436 KB Output is correct
12 Correct 297 ms 28616 KB Output is correct
13 Correct 297 ms 28464 KB Output is correct
14 Correct 331 ms 28428 KB Output is correct
15 Correct 324 ms 28560 KB Output is correct
16 Correct 293 ms 28520 KB Output is correct
17 Correct 267 ms 28444 KB Output is correct
18 Correct 272 ms 28532 KB Output is correct
19 Correct 260 ms 28412 KB Output is correct
20 Correct 289 ms 28472 KB Output is correct
21 Correct 275 ms 28488 KB Output is correct
22 Correct 260 ms 28412 KB Output is correct
23 Correct 111 ms 23216 KB Output is correct
24 Correct 257 ms 28384 KB Output is correct
25 Correct 7 ms 7768 KB Output is correct
26 Correct 3 ms 6236 KB Output is correct
27 Correct 2 ms 6236 KB Output is correct
28 Correct 12 ms 9344 KB Output is correct
29 Correct 7 ms 7772 KB Output is correct
30 Correct 2 ms 6236 KB Output is correct
31 Correct 2 ms 6236 KB Output is correct
32 Correct 3 ms 6252 KB Output is correct
33 Correct 2 ms 6236 KB Output is correct
34 Correct 7 ms 7772 KB Output is correct
35 Correct 2 ms 5980 KB Output is correct
36 Correct 2 ms 5980 KB Output is correct
37 Correct 2 ms 6036 KB Output is correct
38 Correct 2 ms 6236 KB Output is correct
39 Correct 2 ms 6488 KB Output is correct
40 Correct 242 ms 27800 KB Output is correct
41 Correct 254 ms 28664 KB Output is correct
42 Correct 286 ms 28700 KB Output is correct
43 Correct 106 ms 22436 KB Output is correct
44 Correct 112 ms 22604 KB Output is correct
45 Correct 350 ms 28364 KB Output is correct
46 Correct 233 ms 28228 KB Output is correct
47 Correct 243 ms 28328 KB Output is correct
48 Correct 106 ms 22160 KB Output is correct
49 Correct 202 ms 27808 KB Output is correct
50 Correct 337 ms 28432 KB Output is correct
51 Correct 229 ms 29100 KB Output is correct