oj.uz

답안 #857600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857600 2023-10-06T13:01:51 Z dio_2 Commuter Pass (JOI18_commuter_pass) C++17
55 / 100
 1372 ms 19352 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long)1e18;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	
	vector<vector<pair<int, int>>> adj(n + 1);
	
	while(m--){
		int a, b, c;
		cin >> a >> b >> c;
		adj[a].emplace_back(b, c);
		adj[b].emplace_back(a, c);
	}
	
	auto Do = [&](int src, vector<long long> &d)->void{
      fill(d.begin(), d.end(), inf);
      vector<bool> in_Q(n + 1);
      d[src] = 0;
      priority_queue<pair<long long, int>> pq;
      pq.push({0, src});
      while(!pq.empty()){
			auto [_, node] = pq.top();		
			pq.pop();
			if(in_Q[node]) continue;
			in_Q[node] = 1;
			for(auto [to, cost] : adj[node]){
				if(d[node] + cost < d[to]){
					d[to] = d[node] + cost;
					pq.push({-d[to], to});
				}
			}
	   }
	};
	
	auto clear_cost = [&](int a, int b)->void{
	  for(auto &[node, _] : adj[a])
		if(node == b) _ = 0;
	  for(auto &[node, _] : adj[b])
		if(node == a) _ = 0;
	};
	
	vector<long long> Ds(n + 1);
	vector<bool> in_sp(n + 1);
	Do(s, Ds);
	
	bool unique = 1;
	
	queue<int> q;
	q.push(t);
	in_sp[t] = 1;
	vector<pair<int, int>> combs;
	
	while(!q.empty()){
		int node = q.front(); q.pop();
		int cnt = 0;
	   for(auto [from, cost] : adj[node]){
			if(Ds[from] + cost == Ds[node] && !in_sp[from]){
				in_sp[from] = 1;
				q.push(from);
				++cnt;
				unique &= (cnt == 1);
				combs.emplace_back(from, node);
			}
		}
	}
	
	if(unique){
		for(auto [a, b] : combs)
			clear_cost(a, b);
	}
	
	vector<long long> Du(n + 1), Dv(n + 1);
	Do(u, Du);
	Do(v, Dv);
	
	
	if(unique){
		
		cout << Du[v] << '\n';
		return 0;
	}
	
	
	if(s == u){
		long long ans = inf;
		for(int i = 1;i <= n;i++)
			if(in_sp[i]) ans = min(ans, Dv[i]);
		cout << ans << '\n';
		return 0;
	}
	
	long long ans = Du[v];
	
	vector<long long> Dt(n + 1);
	Do(t, Dt);
	
	auto in_path = [&](int a, int b)->bool{
		vector<long long> Da(n + 1);
		Do(a, Da);
		return (Ds[t] == Ds[a] + Da[b] + Dt[b] || Ds[t] == Ds[b] + Da[b] + Dt[a]); 
	};
	
	if(n <= 300){
		for(int i = 1;i <= n;i++){
			for(int j = i;j <= n;j++){
				if(!in_sp[i] || !in_sp[j]) continue;
				if(in_path(i, j)){
					ans = min(ans, Du[i] + Dv[j]);
					ans = min(ans, Dv[i] + Du[j]);
				}
			}
		}
	}
	
	
	cout << ans << '\n';

	return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 14424 KB Output is correct
2 Correct 144 ms 13656 KB Output is correct
3 Correct 152 ms 13896 KB Output is correct
4 Correct 133 ms 14308 KB Output is correct
5 Correct 130 ms 13800 KB Output is correct
6 Correct 147 ms 14608 KB Output is correct
7 Correct 140 ms 14020 KB Output is correct
8 Correct 151 ms 14084 KB Output is correct
9 Correct 162 ms 13352 KB Output is correct
10 Correct 111 ms 13008 KB Output is correct
11 Correct 49 ms 8628 KB Output is correct
12 Correct 168 ms 13224 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 161 ms 15004 KB Output is correct
2 Correct 156 ms 14964 KB Output is correct
3 Correct 160 ms 14968 KB Output is correct
4 Correct 164 ms 13688 KB Output is correct
5 Correct 160 ms 14972 KB Output is correct
6 Correct 147 ms 14028 KB Output is correct
7 Correct 169 ms 15340 KB Output is correct
8 Correct 183 ms 15332 KB Output is correct
9 Correct 155 ms 14976 KB Output is correct
10 Correct 153 ms 13532 KB Output is correct
11 Correct 54 ms 8920 KB Output is correct
12 Correct 153 ms 14568 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1372 ms 1364 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 9 ms 1628 KB Output is correct
5 Correct 128 ms 1164 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 466 ms 548 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 249 ms 544 KB Output is correct
10 Correct 828 ms 1616 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 14 ms 512 KB Output is correct
14 Correct 23 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 14424 KB Output is correct
2 Correct 144 ms 13656 KB Output is correct
3 Correct 152 ms 13896 KB Output is correct
4 Correct 133 ms 14308 KB Output is correct
5 Correct 130 ms 13800 KB Output is correct
6 Correct 147 ms 14608 KB Output is correct
7 Correct 140 ms 14020 KB Output is correct
8 Correct 151 ms 14084 KB Output is correct
9 Correct 162 ms 13352 KB Output is correct
10 Correct 111 ms 13008 KB Output is correct
11 Correct 49 ms 8628 KB Output is correct
12 Correct 168 ms 13224 KB Output is correct
13 Correct 161 ms 15004 KB Output is correct
14 Correct 156 ms 14964 KB Output is correct
15 Correct 160 ms 14968 KB Output is correct
16 Correct 164 ms 13688 KB Output is correct
17 Correct 160 ms 14972 KB Output is correct
18 Correct 147 ms 14028 KB Output is correct
19 Correct 169 ms 15340 KB Output is correct
20 Correct 183 ms 15332 KB Output is correct
21 Correct 155 ms 14976 KB Output is correct
22 Correct 153 ms 13532 KB Output is correct
23 Correct 54 ms 8920 KB Output is correct
24 Correct 153 ms 14568 KB Output is correct
25 Correct 1372 ms 1364 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 9 ms 1628 KB Output is correct
29 Correct 128 ms 1164 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 466 ms 548 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 249 ms 544 KB Output is correct
34 Correct 828 ms 1616 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 14 ms 512 KB Output is correct
38 Correct 23 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 136 ms 19352 KB Output is correct
41 Correct 139 ms 17516 KB Output is correct
42 Correct 131 ms 17376 KB Output is correct
43 Incorrect 54 ms 12104 KB Output isn't correct
44 Halted 0 ms 0 KB -