Submission #956537

# Submission time Handle Problem Language Result Execution time Memory
956537 2024-04-02T06:51:14 Z pragmatist Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
218 ms 26904 KB
#include <bits/stdc++.h>

using namespace std;

const int N = (int)1e5+20;
const int inf = (int)1e9+7;
const long long INF = (long long)1e18+7;
const int MOD = 42043;

int sum(int x, int y) {
	x += y;
	if(x >= MOD) {
		x -= MOD;
	}
	return x;
}

int mult(int x, int y) {
	return 1ll*x*y%MOD;
}

struct Edge {
	int u, v, w;
};

int n, m, s1, t1, s2, t2;
vector<pair<int, int> > g[N];
vector<int> g2[N];
long long d[4][N];

void dijkstra(int tp, int s) {
	fill(d[tp],  d[tp]+1+n, INF);
	d[tp][s] = 0;
	priority_queue<pair<long long, int> > q;
	q.push({0, s});
	while(!q.empty()) {
		long long cur_d = -q.top().first;
		int v = q.top().second;
		q.pop();
		if(cur_d>d[tp][v]) {
			continue;
		}
		for(auto [to, w] : g[v]) {
			if(d[tp][v]+w < d[tp][to]) {
				d[tp][to] = d[tp][v]+w;
				q.push({-d[tp][to], to});
			}
		}
	}	
}

bool used[N];
long long ans, mn1[N], mn2[N];

void dfs(int v) {  	
	used[v] = 1;
	mn1[v] = d[2][v];
	mn2[v] = d[3][v];
	for(auto to : g2[v]) {
		if(!used[to]) {
			dfs(to);
		}
		mn1[v] = min(mn1[v], mn1[to]);
		mn2[v] = min(mn2[v], mn2[to]);		
	}
	ans = min(ans, d[2][v]+mn2[v]);
	ans = min(ans, d[3][v]+mn1[v]);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
	cin >> n >> m >> s1 >> t1 >> s2 >> t2;
	vector<Edge> e;
	for(int i = 1; i <= m; ++i) {
		int u, v, w;
		cin >> u >> v >> w;
		e.push_back({u, v, w});
		g[u].push_back({v, w});
		g[v].push_back({u, w});
	}
	dijkstra(0, s1);
	dijkstra(1, t1);
	dijkstra(2, s2);
	dijkstra(3, t2);
	ans = d[2][t2];
	for(auto [u, v, w] : e) {
	    if(d[0][u]+w+d[1][v]==d[0][t1]) {
			g2[u].push_back(v);	    	
	    }
	    if(d[1][u]+w+d[0][v]==d[0][t1]) {
			g2[v].push_back(u);	    	
	    }
	}
	for(int i = 1; i <= n; ++i) {
		if(!used[i]) {
			dfs(i);
		}
	}
	cout << ans;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 172 ms 21468 KB Output is correct
2 Correct 198 ms 24060 KB Output is correct
3 Correct 184 ms 26228 KB Output is correct
4 Correct 182 ms 25080 KB Output is correct
5 Correct 165 ms 23808 KB Output is correct
6 Correct 175 ms 25416 KB Output is correct
7 Correct 213 ms 24000 KB Output is correct
8 Correct 210 ms 24048 KB Output is correct
9 Correct 173 ms 24828 KB Output is correct
10 Correct 135 ms 24568 KB Output is correct
11 Correct 65 ms 19816 KB Output is correct
12 Correct 215 ms 24480 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 178 ms 21392 KB Output is correct
2 Correct 208 ms 25088 KB Output is correct
3 Correct 209 ms 25468 KB Output is correct
4 Correct 188 ms 24828 KB Output is correct
5 Correct 187 ms 25032 KB Output is correct
6 Correct 196 ms 26392 KB Output is correct
7 Correct 196 ms 26828 KB Output is correct
8 Correct 189 ms 25464 KB Output is correct
9 Correct 218 ms 25188 KB Output is correct
10 Correct 190 ms 25336 KB Output is correct
11 Correct 66 ms 21012 KB Output is correct
12 Correct 182 ms 26904 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 10648 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 15 ms 12284 KB Output is correct
5 Correct 7 ms 10904 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9820 KB Output is correct
10 Correct 8 ms 11160 KB Output is correct
11 Correct 2 ms 9564 KB Output is correct
12 Correct 3 ms 9560 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 2 ms 10072 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 172 ms 21468 KB Output is correct
2 Correct 198 ms 24060 KB Output is correct
3 Correct 184 ms 26228 KB Output is correct
4 Correct 182 ms 25080 KB Output is correct
5 Correct 165 ms 23808 KB Output is correct
6 Correct 175 ms 25416 KB Output is correct
7 Correct 213 ms 24000 KB Output is correct
8 Correct 210 ms 24048 KB Output is correct
9 Correct 173 ms 24828 KB Output is correct
10 Correct 135 ms 24568 KB Output is correct
11 Correct 65 ms 19816 KB Output is correct
12 Correct 215 ms 24480 KB Output is correct
13 Correct 178 ms 21392 KB Output is correct
14 Correct 208 ms 25088 KB Output is correct
15 Correct 209 ms 25468 KB Output is correct
16 Correct 188 ms 24828 KB Output is correct
17 Correct 187 ms 25032 KB Output is correct
18 Correct 196 ms 26392 KB Output is correct
19 Correct 196 ms 26828 KB Output is correct
20 Correct 189 ms 25464 KB Output is correct
21 Correct 218 ms 25188 KB Output is correct
22 Correct 190 ms 25336 KB Output is correct
23 Correct 66 ms 21012 KB Output is correct
24 Correct 182 ms 26904 KB Output is correct
25 Correct 7 ms 10648 KB Output is correct
26 Correct 2 ms 9816 KB Output is correct
27 Correct 2 ms 9820 KB Output is correct
28 Correct 15 ms 12284 KB Output is correct
29 Correct 7 ms 10904 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 3 ms 9820 KB Output is correct
32 Correct 3 ms 9820 KB Output is correct
33 Correct 3 ms 9820 KB Output is correct
34 Correct 8 ms 11160 KB Output is correct
35 Correct 2 ms 9564 KB Output is correct
36 Correct 3 ms 9560 KB Output is correct
37 Correct 2 ms 9820 KB Output is correct
38 Correct 3 ms 9820 KB Output is correct
39 Correct 2 ms 10072 KB Output is correct
40 Correct 172 ms 25756 KB Output is correct
41 Correct 177 ms 25232 KB Output is correct
42 Correct 176 ms 24948 KB Output is correct
43 Correct 72 ms 22020 KB Output is correct
44 Correct 66 ms 22276 KB Output is correct
45 Correct 163 ms 24660 KB Output is correct
46 Correct 194 ms 24832 KB Output is correct
47 Correct 175 ms 25244 KB Output is correct
48 Correct 71 ms 19900 KB Output is correct
49 Correct 141 ms 25632 KB Output is correct
50 Correct 170 ms 24004 KB Output is correct
51 Correct 156 ms 24576 KB Output is correct