oj.uz

Submission #525585

# Submission time Handle Problem Language Result Execution time Memory
525585 2022-02-12T03:55:12 Z Gurban Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 319 ms 20716 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=1e5+5;
int n,m,a[4];
bool vis[maxn];
ll dp[maxn];
ll dis[4][maxn],ans;
vector<int>v;
vector<pair<int,int>>E[maxn];

void f(int cp,int sg){
	for(int i = 1;i <= n;i++) dp[i] = 1e9;
	for(auto i : v){
		dp[i] = dis[cp][i];
		for(auto j : E[i]){
			if(dis[0][j.first] + j.second == dis[0][i] and j.second + dis[0][j.first] + dis[1][i] == dis[0][a[1]]) dp[i] = min(dp[i],dp[j.first]);
		}
		// if(dp[i] + dis[sg][i] == 0) cout<<i<<' '<<dis[0][i]<<' '<<dis[1][i]<<' '<<dis[2][i]<<' '<<dis[3][i]<<'\n';
		ans = min(ans,dp[i] + dis[sg][i]);
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m >> a[0] >> a[1] >> a[2] >> a[3];
	for(int i = 1;i <= m;i++){
		int x,y,w; cin >> x >> y >> w;
		E[x].push_back({y,w});
		E[y].push_back({x,w});
	}

	for(int i = 0;i < 4;i++){
		for(int j = 1;j <= n;j++) dis[i][j] = 1e18,vis[j] = 0;
		dis[i][a[i]] = 0;
		priority_queue<pair<ll,int>>q;
		q.push({0,a[i]});
		while(!q.empty()){
			int x = q.top().second; q.pop();
			if(vis[x]) continue;
			if(i == 0) v.push_back(x);
			vis[x] = 1;
			for(auto j : E[x]){
				if(dis[i][j.first] > dis[i][x] + j.second){
					dis[i][j.first] = dis[i][x] + j.second;
					q.push({-dis[i][j.first],j.first});
				}
			}
		}
	}
	ans = dis[2][a[3]];
	// for(auto i : v) cout<<i<<' ';
	// cout<<'\n';
	// cout<<ans<<'\n';
	f(2,3);
	f(3,2);
	cout<<ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 20228 KB Output is correct
2 Correct 308 ms 18736 KB Output is correct
3 Correct 293 ms 19048 KB Output is correct
4 Correct 260 ms 19388 KB Output is correct
5 Correct 304 ms 18472 KB Output is correct
6 Correct 315 ms 20376 KB Output is correct
7 Correct 309 ms 18660 KB Output is correct
8 Correct 265 ms 18672 KB Output is correct
9 Correct 307 ms 19508 KB Output is correct
10 Correct 239 ms 19412 KB Output is correct
11 Correct 122 ms 12420 KB Output is correct
12 Correct 280 ms 19368 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 19004 KB Output is correct
2 Correct 279 ms 18636 KB Output is correct
3 Correct 307 ms 18772 KB Output is correct
4 Correct 271 ms 18672 KB Output is correct
5 Correct 292 ms 18700 KB Output is correct
6 Correct 257 ms 18916 KB Output is correct
7 Correct 299 ms 18700 KB Output is correct
8 Correct 291 ms 18684 KB Output is correct
9 Correct 319 ms 18660 KB Output is correct
10 Correct 283 ms 18568 KB Output is correct
11 Correct 117 ms 12412 KB Output is correct
12 Correct 249 ms 19036 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3780 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2680 KB Output is correct
4 Correct 14 ms 4804 KB Output is correct
5 Correct 7 ms 3712 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 3 ms 2704 KB Output is correct
8 Correct 4 ms 2812 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 8 ms 3740 KB Output is correct
11 Correct 2 ms 2676 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 20228 KB Output is correct
2 Correct 308 ms 18736 KB Output is correct
3 Correct 293 ms 19048 KB Output is correct
4 Correct 260 ms 19388 KB Output is correct
5 Correct 304 ms 18472 KB Output is correct
6 Correct 315 ms 20376 KB Output is correct
7 Correct 309 ms 18660 KB Output is correct
8 Correct 265 ms 18672 KB Output is correct
9 Correct 307 ms 19508 KB Output is correct
10 Correct 239 ms 19412 KB Output is correct
11 Correct 122 ms 12420 KB Output is correct
12 Correct 280 ms 19368 KB Output is correct
13 Correct 303 ms 19004 KB Output is correct
14 Correct 279 ms 18636 KB Output is correct
15 Correct 307 ms 18772 KB Output is correct
16 Correct 271 ms 18672 KB Output is correct
17 Correct 292 ms 18700 KB Output is correct
18 Correct 257 ms 18916 KB Output is correct
19 Correct 299 ms 18700 KB Output is correct
20 Correct 291 ms 18684 KB Output is correct
21 Correct 319 ms 18660 KB Output is correct
22 Correct 283 ms 18568 KB Output is correct
23 Correct 117 ms 12412 KB Output is correct
24 Correct 249 ms 19036 KB Output is correct
25 Correct 9 ms 3780 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2680 KB Output is correct
28 Correct 14 ms 4804 KB Output is correct
29 Correct 7 ms 3712 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 3 ms 2704 KB Output is correct
32 Correct 4 ms 2812 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 8 ms 3740 KB Output is correct
35 Correct 2 ms 2676 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 3 ms 2636 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2688 KB Output is correct
40 Correct 255 ms 20716 KB Output is correct
41 Correct 278 ms 19432 KB Output is correct
42 Correct 280 ms 19332 KB Output is correct
43 Correct 92 ms 12380 KB Output is correct
44 Correct 120 ms 12568 KB Output is correct
45 Correct 272 ms 18192 KB Output is correct
46 Correct 226 ms 18160 KB Output is correct
47 Correct 259 ms 20140 KB Output is correct
48 Correct 98 ms 11772 KB Output is correct
49 Correct 211 ms 20236 KB Output is correct
50 Correct 236 ms 18384 KB Output is correct
51 Correct 233 ms 18312 KB Output is correct