oj.uz

Submission #684205

# Submission time Handle Problem Language Result Execution time Memory
684205 2023-01-20T16:25:53 Z fuad27 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 306 ms 24228 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=100'010;
vector<array<long long, 2>> g[N];
int n, m;
vector<long long> dist(int s) {
	priority_queue<pair<long long, long long>> pq;
	vector<bool> vis(n);
	vector<long long> d(n,1e18);
	pq.push({0,s});
	d[s]=0;
	while(pq.size()) {
		int at=pq.top().second;
		pq.pop();
		if(vis[at])continue;
		vis[at]=1;
		for(auto to:g[at]) {
			if(d[to[0]]>d[at]+to[1]) {
				d[to[0]]=d[at]+to[1];
				pq.push({-d[to[0]],to[0]});
			}
		}
	}
	return d;
}
int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	int S, T, U, V;
	cin >> S >> T >> U >> V;
	S--,T--,U--,V--;
	for(int i = 0;i<m;i++) {
		long long a, b, c;
		cin >> a >> b >> c;
		a--,b--;
		g[a].push_back({b,c});
		g[b].push_back({a,c});
	}
	vector<long long> s=dist(S), t=dist(T), u=dist(U), v=dist(V);
	long long dpu[n], dpv[n];
	dpu[0]=dpv[0]=1e18;
	vector<pair<long long, int>> is;
	for(int i = 0;i<n;i++) {
		dpu[i]=dpv[i]=1e18;
		if(s[i]+t[i]==s[T]){
			is.push_back({s[i],i});
		}
	}
	sort(is.begin(), is.end());
	long long res=1e18;
	for(auto [asdf,i]:is) {
		dpu[i]=u[i];
		dpv[i]=v[i];
		for(auto to:g[i]) {
			if(t[i]+to[1]+s[to[0]]==s[T]) {
				dpu[i]=min(dpu[i],dpu[to[0]]);
				dpv[i]=min(dpv[i],dpv[to[0]]);
			}
		}
		res=min(res,dpu[i]+v[i]);
		res=min(res,u[i]+dpv[i]);
	}
	res=min(res,u[V]);
	cout << res << endl;
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 19232 KB Output is correct
2 Correct 306 ms 18700 KB Output is correct
3 Correct 267 ms 20748 KB Output is correct
4 Correct 280 ms 23040 KB Output is correct
5 Correct 259 ms 22912 KB Output is correct
6 Correct 284 ms 23240 KB Output is correct
7 Correct 265 ms 23120 KB Output is correct
8 Correct 281 ms 22932 KB Output is correct
9 Correct 266 ms 22428 KB Output is correct
10 Correct 216 ms 22348 KB Output is correct
11 Correct 141 ms 15848 KB Output is correct
12 Correct 275 ms 22152 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 18648 KB Output is correct
2 Correct 274 ms 18792 KB Output is correct
3 Correct 275 ms 18708 KB Output is correct
4 Correct 294 ms 18788 KB Output is correct
5 Correct 273 ms 19300 KB Output is correct
6 Correct 258 ms 19664 KB Output is correct
7 Correct 290 ms 24144 KB Output is correct
8 Correct 276 ms 22268 KB Output is correct
9 Correct 285 ms 22864 KB Output is correct
10 Correct 285 ms 22068 KB Output is correct
11 Correct 108 ms 15816 KB Output is correct
12 Correct 285 ms 23592 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4052 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 15 ms 6136 KB Output is correct
5 Correct 8 ms 4320 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 3 ms 2892 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 8 ms 4308 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 2 ms 2680 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 19232 KB Output is correct
2 Correct 306 ms 18700 KB Output is correct
3 Correct 267 ms 20748 KB Output is correct
4 Correct 280 ms 23040 KB Output is correct
5 Correct 259 ms 22912 KB Output is correct
6 Correct 284 ms 23240 KB Output is correct
7 Correct 265 ms 23120 KB Output is correct
8 Correct 281 ms 22932 KB Output is correct
9 Correct 266 ms 22428 KB Output is correct
10 Correct 216 ms 22348 KB Output is correct
11 Correct 141 ms 15848 KB Output is correct
12 Correct 275 ms 22152 KB Output is correct
13 Correct 269 ms 18648 KB Output is correct
14 Correct 274 ms 18792 KB Output is correct
15 Correct 275 ms 18708 KB Output is correct
16 Correct 294 ms 18788 KB Output is correct
17 Correct 273 ms 19300 KB Output is correct
18 Correct 258 ms 19664 KB Output is correct
19 Correct 290 ms 24144 KB Output is correct
20 Correct 276 ms 22268 KB Output is correct
21 Correct 285 ms 22864 KB Output is correct
22 Correct 285 ms 22068 KB Output is correct
23 Correct 108 ms 15816 KB Output is correct
24 Correct 285 ms 23592 KB Output is correct
25 Correct 8 ms 4052 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 15 ms 6136 KB Output is correct
29 Correct 8 ms 4320 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 8 ms 4308 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2684 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct
39 Correct 2 ms 2680 KB Output is correct
40 Correct 243 ms 23028 KB Output is correct
41 Correct 259 ms 22260 KB Output is correct
42 Correct 264 ms 22620 KB Output is correct
43 Correct 109 ms 16912 KB Output is correct
44 Correct 104 ms 16920 KB Output is correct
45 Correct 270 ms 24168 KB Output is correct
46 Correct 265 ms 23952 KB Output is correct
47 Correct 273 ms 22996 KB Output is correct
48 Correct 153 ms 16320 KB Output is correct
49 Correct 210 ms 22608 KB Output is correct
50 Correct 289 ms 24228 KB Output is correct
51 Correct 282 ms 24156 KB Output is correct