oj.uz

답안 #891927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891927 2023-12-24T12:47:56 Z goodspeed0208 Commuter Pass (JOI18_commuter_pass) C++14
31 / 100
 424 ms 26896 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<utility>
#define int long long
#define INF 1000000000000000000
#define pii pair<long long, long long>
using namespace std;

struct DS{
	int a, b, c;
};

signed main() {
	int n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	vector<vector<pii> >G(n+1);
	vector<DS>routes;
	int a, b, c;
	while (m--) {
		cin >> a >> b >> c;
		G[a].push_back({b, c});
		G[b].push_back({a, c});
		routes.push_back({a, b, c});
	}
	vector<int>sdis(n+5, INF), tdis(n+5, INF), vdis(n+5, INF);
	sdis[s] = 0;
	set<pii>q; q.insert({0, s});
	while (!q.empty()) {
		auto tmp = *q.begin(); q.erase(q.begin());
		int len = tmp.first, i = tmp.second;
		//cout << i << " " << len << "\n";
		if (len > sdis[i]) continue;
		
		for (auto &j : G[i]) {
			if (sdis[j.first] < len + j.second) continue;
			if (sdis[j.first] != INF) {
				q.erase({sdis[j.first], j.first});
			}
			sdis[j.first] = len + j.second;
			q.insert({sdis[j.first], j.first});
		}
	}
	tdis[t] = 0;
	q.insert({0, t});
	while (!q.empty()) {
		auto tmp = *q.begin(); q.erase(q.begin());
		int len = tmp.first, i = tmp.second;
		//cout << i << " " << len << "\n";
		if (len > tdis[i]) continue;
		
		for (auto &j : G[i]) {
			if (tdis[j.first] < len + j.second) continue;
			if (tdis[j.first] != INF) {
				q.erase({tdis[j.first], j.first});
			}
			tdis[j.first] = len + j.second;
			q.insert({tdis[j.first], j.first});
		}
	}
	int minroute = INF;
	vector<int>onroute(n+1, 0);
	for (int i = 1 ; i <= n ; i++) {
		minroute = min(minroute, sdis[i] + tdis[i]);
	}
	for (int i = 1 ; i <= n ; i++) {
		if (sdis[i] + tdis[i] == minroute) {
			onroute[i] = 1;
		}
	}
	if (s == u) {
		vdis[v] = 0;
		q.insert({0, v});
		while (!q.empty()) {
			auto tmp = *q.begin(); q.erase(q.begin());
			int len = tmp.first, i = tmp.second;
			//cout << i << " " << len << "\n";
			if (len > vdis[i]) continue;
			
			for (auto &j : G[i]) {
				if (vdis[j.first] < len + j.second) continue;
				if (vdis[j.first] != INF) {
					q.erase({vdis[j.first], j.first});
				}
				vdis[j.first] = len + j.second;
				q.insert({vdis[j.first], j.first});
			}
		}
		
		int ans = INF;
		for (int i = 1 ; i <= n ; i++) {
			if (sdis[i] + tdis[i] == minroute) {
				ans = min(ans, vdis[i]);
			}
		}
		cout << ans << "\n";
	} else {
		for (auto &i : routes) {
			if (onroute[i.a] && onroute[i.b]) {
				i.c = 0;
			}
		}
		for (int i = 1 ; i <= n ; i++) G[i].clear();
		for (auto &i : routes) {
			G[i.a].push_back({i.b, i.c});
			G[i.b].push_back({i.a, i.c});
		}
		vdis[v] = 0;
		q.insert({0, v});
		while (!q.empty()) {
			auto tmp = *q.begin(); q.erase(q.begin());
			int len = tmp.first, i = tmp.second;
			//cout << i << " " << len << "\n";
			if (len > vdis[i]) continue;
			
			for (auto &j : G[i]) {
				if (vdis[j.first] <= len + j.second) continue;
				if (vdis[j.first] != INF) {
					q.erase({vdis[j.first], j.first});
				}
				vdis[j.first] = len + j.second;
				q.insert({vdis[j.first], j.first});
			}
		}
		cout << vdis[u] << "\n";
	}
		
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 400 ms 26428 KB Output is correct
2 Correct 327 ms 26108 KB Output is correct
3 Correct 340 ms 24992 KB Output is correct
4 Correct 419 ms 26564 KB Output is correct
5 Correct 335 ms 26376 KB Output is correct
6 Correct 378 ms 26108 KB Output is correct
7 Correct 349 ms 26204 KB Output is correct
8 Correct 316 ms 25332 KB Output is correct
9 Correct 346 ms 26144 KB Output is correct
10 Correct 323 ms 26080 KB Output is correct
11 Correct 134 ms 14996 KB Output is correct
12 Correct 355 ms 26360 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 386 ms 26896 KB Output is correct
2 Correct 369 ms 25984 KB Output is correct
3 Correct 372 ms 25336 KB Output is correct
4 Correct 363 ms 25156 KB Output is correct
5 Correct 359 ms 25336 KB Output is correct
6 Correct 424 ms 24892 KB Output is correct
7 Correct 375 ms 26100 KB Output is correct
8 Correct 373 ms 26448 KB Output is correct
9 Correct 395 ms 25264 KB Output is correct
10 Correct 348 ms 25040 KB Output is correct
11 Correct 120 ms 14772 KB Output is correct
12 Correct 327 ms 24776 KB Output is correct

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2576 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 400 ms 26428 KB Output is correct
2 Correct 327 ms 26108 KB Output is correct
3 Correct 340 ms 24992 KB Output is correct
4 Correct 419 ms 26564 KB Output is correct
5 Correct 335 ms 26376 KB Output is correct
6 Correct 378 ms 26108 KB Output is correct
7 Correct 349 ms 26204 KB Output is correct
8 Correct 316 ms 25332 KB Output is correct
9 Correct 346 ms 26144 KB Output is correct
10 Correct 323 ms 26080 KB Output is correct
11 Correct 134 ms 14996 KB Output is correct
12 Correct 355 ms 26360 KB Output is correct
13 Correct 386 ms 26896 KB Output is correct
14 Correct 369 ms 25984 KB Output is correct
15 Correct 372 ms 25336 KB Output is correct
16 Correct 363 ms 25156 KB Output is correct
17 Correct 359 ms 25336 KB Output is correct
18 Correct 424 ms 24892 KB Output is correct
19 Correct 375 ms 26100 KB Output is correct
20 Correct 373 ms 26448 KB Output is correct
21 Correct 395 ms 25264 KB Output is correct
22 Correct 348 ms 25040 KB Output is correct
23 Correct 120 ms 14772 KB Output is correct
24 Correct 327 ms 24776 KB Output is correct
25 Correct 19 ms 2576 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Incorrect 1 ms 348 KB Output isn't correct
28 Halted 0 ms 0 KB -