oj.uz

Submission #387094

# Submission time Handle Problem Language Result Execution time Memory
387094 2021-04-07T22:47:13 Z Kepha Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 672 ms 27444 KB 
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f3f3f3f3f
#define MX 100000
typedef long long ll;
using namespace std;

vector<pair<ll, ll>> graph[MX + 1];
ll du[MX + 1], dv[MX + 1], ds[MX + 1], dp[2][MX + 1], ans;
bool visited[MX + 1];

void dijkstra1(ll start, ll arr[]) {
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, ll>> pq;
	pq.push({0, start});
	while (!pq.empty()) {
		ll c, node;
		tie(c, node) = pq.top();
		pq.pop();

		if (!visited[node]) {
			arr[node] = -c;
			visited[node] = true;
			for (auto& i : graph[node]) 
                pq.push({c - i.second, i.first});
		}
	}
}

void dijkstra2(ll start, ll end) {
	fill(dp[0], dp[0] + 100001, INF);
	fill(dp[1], dp[1] + 100001, INF);
	fill(visited, visited + 100001, false);

	priority_queue<pair<ll, pair<ll, ll>>> pq;
	pq.push({0, {start, 0}});

	while (!pq.empty()) {
		ll c, node, par;
        c = pq.top().first;
        node = pq.top().second.first, par = pq.top().second.second;
		pq.pop();

		if (!visited[node]) {
			visited[node] = true;
			ds[node] = -c;

			dp[0][node] = min(du[node], dp[0][par]);
			dp[1][node] = min(dv[node], dp[1][par]);

			for (auto i : graph[node]) 
                pq.push({c - i.second, {i.first, node}});

		} 
        else if (-c == ds[node]) {
			if (min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) 
                    < dp[0][node] + dp[1][node]) {
				dp[0][node] = min(du[node], dp[0][par]);
				dp[1][node] = min(dv[node], dp[1][par]);
			}
		}
	}

	ans = min(ans, dp[0][end] + dp[1][end]);
}

int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);
	ll n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	for (int i = 1; i <= m; i++) {
		ll a, b, c;
		cin >> a >> b >> c;
		graph[a].push_back({b, c});
		graph[b].push_back({a, c});
	}

	dijkstra1(u, du);
	dijkstra1(v, dv);

	ans = du[v];

	dijkstra2(s, t);
	dijkstra2(t, s);

	cout << ans << '\n';
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 640 ms 27444 KB Output is correct
2 Correct 579 ms 26852 KB Output is correct
3 Correct 567 ms 26464 KB Output is correct
4 Correct 658 ms 26404 KB Output is correct
5 Correct 568 ms 23192 KB Output is correct
6 Correct 672 ms 27124 KB Output is correct
7 Correct 586 ms 26624 KB Output is correct
8 Correct 573 ms 26872 KB Output is correct
9 Correct 640 ms 27176 KB Output is correct
10 Correct 622 ms 27156 KB Output is correct
11 Correct 166 ms 12012 KB Output is correct
12 Correct 627 ms 27328 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 27136 KB Output is correct
2 Correct 545 ms 23128 KB Output is correct
3 Correct 549 ms 26568 KB Output is correct
4 Correct 551 ms 23200 KB Output is correct
5 Correct 555 ms 23132 KB Output is correct
6 Correct 568 ms 26300 KB Output is correct
7 Correct 553 ms 23084 KB Output is correct
8 Correct 551 ms 23244 KB Output is correct
9 Correct 558 ms 23056 KB Output is correct
10 Correct 555 ms 26364 KB Output is correct
11 Correct 171 ms 12012 KB Output is correct
12 Correct 558 ms 26280 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 7164 KB Output is correct
2 Correct 5 ms 4460 KB Output is correct
3 Correct 5 ms 4460 KB Output is correct
4 Correct 87 ms 9864 KB Output is correct
5 Correct 44 ms 8112 KB Output is correct
6 Correct 6 ms 4588 KB Output is correct
7 Correct 7 ms 4692 KB Output is correct
8 Correct 10 ms 4788 KB Output is correct
9 Correct 6 ms 4588 KB Output is correct
10 Correct 45 ms 8088 KB Output is correct
11 Correct 4 ms 4332 KB Output is correct
12 Correct 4 ms 4460 KB Output is correct
13 Correct 5 ms 4460 KB Output is correct
14 Correct 5 ms 4460 KB Output is correct
15 Correct 5 ms 4460 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 640 ms 27444 KB Output is correct
2 Correct 579 ms 26852 KB Output is correct
3 Correct 567 ms 26464 KB Output is correct
4 Correct 658 ms 26404 KB Output is correct
5 Correct 568 ms 23192 KB Output is correct
6 Correct 672 ms 27124 KB Output is correct
7 Correct 586 ms 26624 KB Output is correct
8 Correct 573 ms 26872 KB Output is correct
9 Correct 640 ms 27176 KB Output is correct
10 Correct 622 ms 27156 KB Output is correct
11 Correct 166 ms 12012 KB Output is correct
12 Correct 627 ms 27328 KB Output is correct
13 Correct 620 ms 27136 KB Output is correct
14 Correct 545 ms 23128 KB Output is correct
15 Correct 549 ms 26568 KB Output is correct
16 Correct 551 ms 23200 KB Output is correct
17 Correct 555 ms 23132 KB Output is correct
18 Correct 568 ms 26300 KB Output is correct
19 Correct 553 ms 23084 KB Output is correct
20 Correct 551 ms 23244 KB Output is correct
21 Correct 558 ms 23056 KB Output is correct
22 Correct 555 ms 26364 KB Output is correct
23 Correct 171 ms 12012 KB Output is correct
24 Correct 558 ms 26280 KB Output is correct
25 Correct 43 ms 7164 KB Output is correct
26 Correct 5 ms 4460 KB Output is correct
27 Correct 5 ms 4460 KB Output is correct
28 Correct 87 ms 9864 KB Output is correct
29 Correct 44 ms 8112 KB Output is correct
30 Correct 6 ms 4588 KB Output is correct
31 Correct 7 ms 4692 KB Output is correct
32 Correct 10 ms 4788 KB Output is correct
33 Correct 6 ms 4588 KB Output is correct
34 Correct 45 ms 8088 KB Output is correct
35 Correct 4 ms 4332 KB Output is correct
36 Correct 4 ms 4460 KB Output is correct
37 Correct 5 ms 4460 KB Output is correct
38 Correct 5 ms 4460 KB Output is correct
39 Correct 5 ms 4460 KB Output is correct
40 Correct 624 ms 26716 KB Output is correct
41 Correct 641 ms 27228 KB Output is correct
42 Correct 639 ms 27300 KB Output is correct
43 Correct 173 ms 12012 KB Output is correct
44 Correct 164 ms 12012 KB Output is correct
45 Correct 557 ms 21684 KB Output is correct
46 Correct 559 ms 21924 KB Output is correct
47 Correct 621 ms 22944 KB Output is correct
48 Correct 182 ms 12012 KB Output is correct
49 Correct 614 ms 25576 KB Output is correct
50 Correct 545 ms 21824 KB Output is correct
51 Correct 550 ms 21752 KB Output is correct