oj.uz

Submission #535142

# Submission time Handle Problem Language Result Execution time Memory
535142 2022-03-09T13:42:28 Z amunduzbaev Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 452 ms 26444 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long

const int N = 1e5 + 5;
const int inf = 1e18;
vector<ar<int, 2>> edges[N];
int d[4][N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	vector<int> s(4);
	for(int i=0;i<4;i++) cin>>s[i];
	for(int i=0;i<m;i++){
		int a, b, c; cin>>a>>b>>c;
		edges[a].push_back({b, c});
		edges[b].push_back({a, c});
	}
	
	auto djk = [&](int u, int* d){
		d[u] = 0;
		priority_queue<ar<int, 2>, vector<ar<int, 2>>, greater<ar<int, 2>>> q;
		q.push({d[u], u});
		while(!q.empty()){
			int u = q.top()[1], D = q.top()[0]; q.pop();
			if(D > d[u]) continue;
			for(auto x : edges[u]){
				if(d[x[0]] > d[u] + x[1]){
					d[x[0]] = d[u] + x[1];
					q.push({d[x[0]], x[0]});
				}
			}
		}
	};
	
	memset(d, 63, sizeof d);
	for(int i=1;i<4;i++){
		djk(s[i], d[i]);
	}
	
	int res = d[2][s[3]];
	int TRU = d[1][s[0]];
	auto dj2 = [&](int a, int b){
		priority_queue<ar<int, 3>, vector<ar<int, 3>>, 	greater<ar<int, 3>>> q;
		vector<ar<int, 2>> _d(n + 1, {inf, inf});
		_d[s[0]] = {0, d[a][s[0]]};
		q.push({0, d[a][s[0]], s[0]});
		while(!q.empty()){
			int D = q.top()[0], _D = q.top()[1], u = q.top()[2]; q.pop();
			if(D > _d[u][0] || _D > _d[u][1]) continue;
			if(d[1][u] + D == TRU) res = min(res, _D + d[b][u]);
			//~ cout<<_D<<" "<<d[b][u]<<" "<<u<<"\n";
			for(auto x : edges[u]){
				if(_d[x[0]] > (ar<int, 2>){D + x[1], min(_D, d[a][x[0]])}){
					_d[x[0]] = {D + x[1], min(_D, d[a][x[0]])};
					q.push({_d[x[0]][0], _d[x[0]][1], x[0]});
				}
			}
		}
	};
	
	dj2(2, 3);
	dj2(3, 2);
	cout<<res<<"\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 26296 KB Output is correct
2 Correct 363 ms 24288 KB Output is correct
3 Correct 396 ms 23828 KB Output is correct
4 Correct 413 ms 26260 KB Output is correct
5 Correct 344 ms 23652 KB Output is correct
6 Correct 424 ms 26364 KB Output is correct
7 Correct 430 ms 24032 KB Output is correct
8 Correct 386 ms 24104 KB Output is correct
9 Correct 386 ms 24768 KB Output is correct
10 Correct 295 ms 24636 KB Output is correct
11 Correct 178 ms 14716 KB Output is correct
12 Correct 365 ms 24728 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 24448 KB Output is correct
2 Correct 441 ms 24224 KB Output is correct
3 Correct 371 ms 24120 KB Output is correct
4 Correct 382 ms 23956 KB Output is correct
5 Correct 397 ms 24132 KB Output is correct
6 Correct 328 ms 23908 KB Output is correct
7 Correct 391 ms 24104 KB Output is correct
8 Correct 371 ms 23952 KB Output is correct
9 Correct 452 ms 24004 KB Output is correct
10 Correct 385 ms 24028 KB Output is correct
11 Correct 125 ms 14676 KB Output is correct
12 Correct 337 ms 23936 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7628 KB Output is correct
2 Correct 4 ms 5740 KB Output is correct
3 Correct 4 ms 5724 KB Output is correct
4 Correct 16 ms 9204 KB Output is correct
5 Correct 9 ms 7500 KB Output is correct
6 Correct 5 ms 5872 KB Output is correct
7 Correct 4 ms 5876 KB Output is correct
8 Correct 7 ms 5964 KB Output is correct
9 Correct 4 ms 5836 KB Output is correct
10 Correct 11 ms 7472 KB Output is correct
11 Correct 3 ms 5708 KB Output is correct
12 Correct 3 ms 5740 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 4 ms 5740 KB Output is correct
15 Correct 4 ms 5772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 26296 KB Output is correct
2 Correct 363 ms 24288 KB Output is correct
3 Correct 396 ms 23828 KB Output is correct
4 Correct 413 ms 26260 KB Output is correct
5 Correct 344 ms 23652 KB Output is correct
6 Correct 424 ms 26364 KB Output is correct
7 Correct 430 ms 24032 KB Output is correct
8 Correct 386 ms 24104 KB Output is correct
9 Correct 386 ms 24768 KB Output is correct
10 Correct 295 ms 24636 KB Output is correct
11 Correct 178 ms 14716 KB Output is correct
12 Correct 365 ms 24728 KB Output is correct
13 Correct 404 ms 24448 KB Output is correct
14 Correct 441 ms 24224 KB Output is correct
15 Correct 371 ms 24120 KB Output is correct
16 Correct 382 ms 23956 KB Output is correct
17 Correct 397 ms 24132 KB Output is correct
18 Correct 328 ms 23908 KB Output is correct
19 Correct 391 ms 24104 KB Output is correct
20 Correct 371 ms 23952 KB Output is correct
21 Correct 452 ms 24004 KB Output is correct
22 Correct 385 ms 24028 KB Output is correct
23 Correct 125 ms 14676 KB Output is correct
24 Correct 337 ms 23936 KB Output is correct
25 Correct 11 ms 7628 KB Output is correct
26 Correct 4 ms 5740 KB Output is correct
27 Correct 4 ms 5724 KB Output is correct
28 Correct 16 ms 9204 KB Output is correct
29 Correct 9 ms 7500 KB Output is correct
30 Correct 5 ms 5872 KB Output is correct
31 Correct 4 ms 5876 KB Output is correct
32 Correct 7 ms 5964 KB Output is correct
33 Correct 4 ms 5836 KB Output is correct
34 Correct 11 ms 7472 KB Output is correct
35 Correct 3 ms 5708 KB Output is correct
36 Correct 3 ms 5740 KB Output is correct
37 Correct 3 ms 5836 KB Output is correct
38 Correct 4 ms 5740 KB Output is correct
39 Correct 4 ms 5772 KB Output is correct
40 Correct 348 ms 26444 KB Output is correct
41 Correct 358 ms 24716 KB Output is correct
42 Correct 376 ms 24832 KB Output is correct
43 Correct 127 ms 14724 KB Output is correct
44 Correct 143 ms 14712 KB Output is correct
45 Correct 297 ms 23464 KB Output is correct
46 Correct 387 ms 23308 KB Output is correct
47 Correct 363 ms 26020 KB Output is correct
48 Correct 148 ms 14052 KB Output is correct
49 Correct 347 ms 26060 KB Output is correct
50 Correct 313 ms 23800 KB Output is correct
51 Correct 370 ms 23456 KB Output is correct