Submission #956539

# Submission time Handle Problem Language Result Execution time Memory
956539 2024-04-02T06:52:34 Z vjudge1 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
262 ms 25376 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 196 ms 24188 KB Output is correct
2 Correct 182 ms 22664 KB Output is correct
3 Correct 261 ms 24244 KB Output is correct
4 Correct 168 ms 23296 KB Output is correct
5 Correct 169 ms 22268 KB Output is correct
6 Correct 201 ms 24132 KB Output is correct
7 Correct 211 ms 22528 KB Output is correct
8 Correct 213 ms 22692 KB Output is correct
9 Correct 177 ms 22664 KB Output is correct
10 Correct 139 ms 22516 KB Output is correct
11 Correct 62 ms 18944 KB Output is correct
12 Correct 192 ms 22804 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 182 ms 23808 KB Output is correct
2 Correct 193 ms 23772 KB Output is correct
3 Correct 197 ms 24060 KB Output is correct
4 Correct 186 ms 23704 KB Output is correct
5 Correct 186 ms 23524 KB Output is correct
6 Correct 171 ms 24572 KB Output is correct
7 Correct 262 ms 25376 KB Output is correct
8 Correct 191 ms 23296 KB Output is correct
9 Correct 194 ms 23580 KB Output is correct
10 Correct 182 ms 24056 KB Output is correct
11 Correct 66 ms 20228 KB Output is correct
12 Correct 188 ms 25080 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 10904 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 12 ms 12144 KB Output is correct
5 Correct 7 ms 10904 KB Output is correct
6 Correct 3 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 7 ms 10904 KB Output is correct
11 Correct 2 ms 9564 KB Output is correct
12 Correct 3 ms 9564 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 2 ms 9820 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 196 ms 24188 KB Output is correct
2 Correct 182 ms 22664 KB Output is correct
3 Correct 261 ms 24244 KB Output is correct
4 Correct 168 ms 23296 KB Output is correct
5 Correct 169 ms 22268 KB Output is correct
6 Correct 201 ms 24132 KB Output is correct
7 Correct 211 ms 22528 KB Output is correct
8 Correct 213 ms 22692 KB Output is correct
9 Correct 177 ms 22664 KB Output is correct
10 Correct 139 ms 22516 KB Output is correct
11 Correct 62 ms 18944 KB Output is correct
12 Correct 192 ms 22804 KB Output is correct
13 Correct 182 ms 23808 KB Output is correct
14 Correct 193 ms 23772 KB Output is correct
15 Correct 197 ms 24060 KB Output is correct
16 Correct 186 ms 23704 KB Output is correct
17 Correct 186 ms 23524 KB Output is correct
18 Correct 171 ms 24572 KB Output is correct
19 Correct 262 ms 25376 KB Output is correct
20 Correct 191 ms 23296 KB Output is correct
21 Correct 194 ms 23580 KB Output is correct
22 Correct 182 ms 24056 KB Output is correct
23 Correct 66 ms 20228 KB Output is correct
24 Correct 188 ms 25080 KB Output is correct
25 Correct 9 ms 10904 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 2 ms 9820 KB Output is correct
28 Correct 12 ms 12144 KB Output is correct
29 Correct 7 ms 10904 KB Output is correct
30 Correct 3 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 7 ms 10904 KB Output is correct
35 Correct 2 ms 9564 KB Output is correct
36 Correct 3 ms 9564 KB Output is correct
37 Correct 3 ms 9820 KB Output is correct
38 Correct 3 ms 9820 KB Output is correct
39 Correct 2 ms 9820 KB Output is correct
40 Correct 180 ms 23768 KB Output is correct
41 Correct 171 ms 22520 KB Output is correct
42 Correct 166 ms 23092 KB Output is correct
43 Correct 73 ms 21252 KB Output is correct
44 Correct 83 ms 21824 KB Output is correct
45 Correct 161 ms 23204 KB Output is correct
46 Correct 164 ms 22888 KB Output is correct
47 Correct 166 ms 23284 KB Output is correct
48 Correct 72 ms 19456 KB Output is correct
49 Correct 144 ms 23832 KB Output is correct
50 Correct 168 ms 22452 KB Output is correct
51 Correct 171 ms 23288 KB Output is correct