oj.uz

Submission #934481

# Submission time Handle Problem Language Result Execution time Memory
934481 2024-02-27T12:21:00 Z vjudge1 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 290 ms 26432 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 100005
#define int long long
#define oo 1e18
#define se second
#define fi first

typedef pair<int, int> ii;


/*
	1 --> s
	2 --> t
	3 --> u
	4 --> v
*/

int n, d[5][N], m, s, t, u, v, dp[3][N];
vector<ii> adj[N];
vector<int> vex;

bool cmp (int& i, int& j){
	return d[1][i] < d[1][j];
}

void ditra(int s, int typ){
	for (int i = 1; i <= n; i++){
		d[typ][i] = oo;
	}
	priority_queue<ii, vector<ii>, greater<ii>> q;
	d[typ][s] = 0;
	q.push({0, s});
	while (!q.empty()){
		int du = q.top().fi;
		int u = q.top().se;
		q.pop();
		if (du != d[typ][u]) continue;
		for (auto x : adj[u]){
			int v = x.fi;
			int dv = x.se;
			if (d[typ][v] > dv + du){
				d[typ][v] = dv + du;
				q.push({d[typ][v], v});
			}
		}
	}
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
        
    cin >> n >> m;
    cin >> s >> t;
    cin >> u >> v;

    for (int i = 1; i <= m; i++){
    	int u, v, w;
    	cin >> u >> v >> w;
    	adj[u].push_back({v, w});
    	adj[v].push_back({u, w});
    }

    ditra(s, 1);
    ditra(t, 2);
    ditra(u, 3);
    ditra(v, 4);

    for (int i = 1; i <= n; i++) {vex.push_back(i); dp[1][i] = d[3][i]; dp[2][i] = d[4][i];}
    sort(vex.begin(), vex.end(), cmp);
	int res = d[3][v];

	for (auto x : vex){
		for (auto xx : adj[x]){
			int v = xx.fi;
			int dv = xx.se;
			if (d[1][x] + dv + d[2][v] == d[1][t]){
				res = min(res, dp[1][x] + d[4][v]);
				res = min(res, dp[2][x] + d[3][v]);
				dp[1][v] = min(dp[1][v], dp[1][x]);
				dp[2][v] = min(dp[2][v], dp[2][x]);
			}
		}
	}

	cout << res;

    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 26396 KB Output is correct
2 Correct 215 ms 24868 KB Output is correct
3 Correct 191 ms 25952 KB Output is correct
4 Correct 218 ms 26204 KB Output is correct
5 Correct 249 ms 24596 KB Output is correct
6 Correct 268 ms 26432 KB Output is correct
7 Correct 222 ms 24656 KB Output is correct
8 Correct 192 ms 24884 KB Output is correct
9 Correct 220 ms 25592 KB Output is correct
10 Correct 153 ms 25472 KB Output is correct
11 Correct 85 ms 17236 KB Output is correct
12 Correct 255 ms 25436 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 24936 KB Output is correct
2 Correct 290 ms 24724 KB Output is correct
3 Correct 219 ms 24636 KB Output is correct
4 Correct 252 ms 24744 KB Output is correct
5 Correct 267 ms 24740 KB Output is correct
6 Correct 238 ms 24932 KB Output is correct
7 Correct 235 ms 24628 KB Output is correct
8 Correct 252 ms 24672 KB Output is correct
9 Correct 266 ms 24676 KB Output is correct
10 Correct 263 ms 24656 KB Output is correct
11 Correct 97 ms 17520 KB Output is correct
12 Correct 261 ms 24980 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10548 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 3 ms 8792 KB Output is correct
4 Correct 13 ms 12124 KB Output is correct
5 Correct 7 ms 10340 KB Output is correct
6 Correct 2 ms 8948 KB Output is correct
7 Correct 3 ms 8800 KB Output is correct
8 Correct 3 ms 9204 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 7 ms 10588 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8844 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 26396 KB Output is correct
2 Correct 215 ms 24868 KB Output is correct
3 Correct 191 ms 25952 KB Output is correct
4 Correct 218 ms 26204 KB Output is correct
5 Correct 249 ms 24596 KB Output is correct
6 Correct 268 ms 26432 KB Output is correct
7 Correct 222 ms 24656 KB Output is correct
8 Correct 192 ms 24884 KB Output is correct
9 Correct 220 ms 25592 KB Output is correct
10 Correct 153 ms 25472 KB Output is correct
11 Correct 85 ms 17236 KB Output is correct
12 Correct 255 ms 25436 KB Output is correct
13 Correct 224 ms 24936 KB Output is correct
14 Correct 290 ms 24724 KB Output is correct
15 Correct 219 ms 24636 KB Output is correct
16 Correct 252 ms 24744 KB Output is correct
17 Correct 267 ms 24740 KB Output is correct
18 Correct 238 ms 24932 KB Output is correct
19 Correct 235 ms 24628 KB Output is correct
20 Correct 252 ms 24672 KB Output is correct
21 Correct 266 ms 24676 KB Output is correct
22 Correct 263 ms 24656 KB Output is correct
23 Correct 97 ms 17520 KB Output is correct
24 Correct 261 ms 24980 KB Output is correct
25 Correct 7 ms 10548 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 3 ms 8792 KB Output is correct
28 Correct 13 ms 12124 KB Output is correct
29 Correct 7 ms 10340 KB Output is correct
30 Correct 2 ms 8948 KB Output is correct
31 Correct 3 ms 8800 KB Output is correct
32 Correct 3 ms 9204 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 7 ms 10588 KB Output is correct
35 Correct 2 ms 8792 KB Output is correct
36 Correct 2 ms 8796 KB Output is correct
37 Correct 2 ms 8844 KB Output is correct
38 Correct 2 ms 8796 KB Output is correct
39 Correct 2 ms 8796 KB Output is correct
40 Correct 215 ms 26192 KB Output is correct
41 Correct 197 ms 25452 KB Output is correct
42 Correct 234 ms 25580 KB Output is correct
43 Correct 93 ms 17540 KB Output is correct
44 Correct 88 ms 17456 KB Output is correct
45 Correct 187 ms 24416 KB Output is correct
46 Correct 241 ms 24400 KB Output is correct
47 Correct 235 ms 26084 KB Output is correct
48 Correct 101 ms 16984 KB Output is correct
49 Correct 153 ms 25752 KB Output is correct
50 Correct 216 ms 24520 KB Output is correct
51 Correct 228 ms 24588 KB Output is correct