oj.uz

Submission #364906

# Submission time Handle Problem Language Result Execution time Memory
364906 2021-02-10T12:28:53 Z NachoLibre Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 727 ms 25308 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 100005;
int n, m, s, t, u, o;
long long us[N], os[N];
vector<pair<int, int>> v[N];
vector<long long> sd, td, ud, od;

vector<long long> D(int x) {
	vector<long long> d(n + 1, -1);
	set<pair<long long, int>> s;
	d[x] = 0;
	s.insert({0, x});
	while(s.size()) {
		int y = s.begin()->second;
		s.erase(s.begin());
		for(auto a : v[y]) {
			if(d[a.first] == -1 || d[a.first] > d[y] + a.second) {
				if(d[a.first] != -1) s.erase(s.find({d[a.first], a.first}));
				d[a.first] = d[y] + a.second;
				s.insert({d[a.first], a.first});
			}
		}
	}
	return d;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> s >> t >> u >> o;
	for(int i = 0; i < m; ++i) {
		int x, y, z;
		cin >> x >> y >> z;
		v[x].push_back({y, z});
		v[y].push_back({x, z});
	}
	sd = D(s);
	td = D(t);
	ud = D(u);
	od = D(o);
	vector<pair<long long, int>> ve;
	for(int i = 1; i <= n; ++i) {
		ve.push_back({sd[i], i});
	}
	sort(ve.begin(), ve.end());
	long long fp = ud[o];
	for(auto a : ve) {
		us[a.second] = ud[a.second];
		os[a.second] = od[a.second];
		for(auto b : v[a.second]) {
			if(sd[b.first] + b.second == sd[a.second]) {
				us[a.second] = min(us[a.second], us[b.first]);
				os[a.second] = min(os[a.second], os[b.first]);
			}
		}
		if(sd[a.second] + td[a.second] == sd[t])
			fp = min(fp, min(us[a.second] + od[a.second], os[a.second] + ud[a.second]));
	}
	cout << fp << endl;
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 22196 KB Output is correct
2 Correct 562 ms 20840 KB Output is correct
3 Correct 482 ms 21020 KB Output is correct
4 Correct 605 ms 22248 KB Output is correct
5 Correct 463 ms 20840 KB Output is correct
6 Correct 727 ms 22252 KB Output is correct
7 Correct 508 ms 20556 KB Output is correct
8 Correct 518 ms 20776 KB Output is correct
9 Correct 495 ms 21608 KB Output is correct
10 Correct 410 ms 21992 KB Output is correct
11 Correct 195 ms 14248 KB Output is correct
12 Correct 556 ms 21468 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 20968 KB Output is correct
2 Correct 595 ms 20584 KB Output is correct
3 Correct 531 ms 20584 KB Output is correct
4 Correct 597 ms 20544 KB Output is correct
5 Correct 601 ms 20580 KB Output is correct
6 Correct 499 ms 20964 KB Output is correct
7 Correct 572 ms 20592 KB Output is correct
8 Correct 598 ms 20588 KB Output is correct
9 Correct 627 ms 20532 KB Output is correct
10 Correct 528 ms 20584 KB Output is correct
11 Correct 159 ms 14384 KB Output is correct
12 Correct 527 ms 21096 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3820 KB Output is correct
2 Correct 3 ms 2796 KB Output is correct
3 Correct 3 ms 2796 KB Output is correct
4 Correct 17 ms 4844 KB Output is correct
5 Correct 10 ms 3820 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 5 ms 2880 KB Output is correct
9 Correct 3 ms 2796 KB Output is correct
10 Correct 11 ms 3820 KB Output is correct
11 Correct 2 ms 2796 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 3 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 22196 KB Output is correct
2 Correct 562 ms 20840 KB Output is correct
3 Correct 482 ms 21020 KB Output is correct
4 Correct 605 ms 22248 KB Output is correct
5 Correct 463 ms 20840 KB Output is correct
6 Correct 727 ms 22252 KB Output is correct
7 Correct 508 ms 20556 KB Output is correct
8 Correct 518 ms 20776 KB Output is correct
9 Correct 495 ms 21608 KB Output is correct
10 Correct 410 ms 21992 KB Output is correct
11 Correct 195 ms 14248 KB Output is correct
12 Correct 556 ms 21468 KB Output is correct
13 Correct 613 ms 20968 KB Output is correct
14 Correct 595 ms 20584 KB Output is correct
15 Correct 531 ms 20584 KB Output is correct
16 Correct 597 ms 20544 KB Output is correct
17 Correct 601 ms 20580 KB Output is correct
18 Correct 499 ms 20964 KB Output is correct
19 Correct 572 ms 20592 KB Output is correct
20 Correct 598 ms 20588 KB Output is correct
21 Correct 627 ms 20532 KB Output is correct
22 Correct 528 ms 20584 KB Output is correct
23 Correct 159 ms 14384 KB Output is correct
24 Correct 527 ms 21096 KB Output is correct
25 Correct 10 ms 3820 KB Output is correct
26 Correct 3 ms 2796 KB Output is correct
27 Correct 3 ms 2796 KB Output is correct
28 Correct 17 ms 4844 KB Output is correct
29 Correct 10 ms 3820 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 3 ms 2796 KB Output is correct
32 Correct 5 ms 2880 KB Output is correct
33 Correct 3 ms 2796 KB Output is correct
34 Correct 11 ms 3820 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 2 ms 2796 KB Output is correct
37 Correct 3 ms 2796 KB Output is correct
38 Correct 3 ms 2796 KB Output is correct
39 Correct 3 ms 2796 KB Output is correct
40 Correct 683 ms 25308 KB Output is correct
41 Correct 574 ms 21992 KB Output is correct
42 Correct 540 ms 21736 KB Output is correct
43 Correct 167 ms 14300 KB Output is correct
44 Correct 165 ms 14300 KB Output is correct
45 Correct 451 ms 20308 KB Output is correct
46 Correct 398 ms 20328 KB Output is correct
47 Correct 670 ms 22184 KB Output is correct
48 Correct 160 ms 13788 KB Output is correct
49 Correct 448 ms 23432 KB Output is correct
50 Correct 464 ms 20712 KB Output is correct
51 Correct 435 ms 20572 KB Output is correct