Submission #1276705

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276705		coderg300711	Commuter Pass (JOI18_commuter_pass)	C++20	100 / 100	330 ms	27380 KiB

commuter_pass

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll maxn=100001;

vector<pair<ll, ll>> adj[maxn];
ll du[maxn], dv[maxn], ds[maxn], dp[2][maxn], ans;
bool vis[maxn];

void DJ1(ll start, ll arr[]) {
	fill(vis, vis+maxn, 0);

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

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

void DJ2(ll start, ll end) {
	fill(dp[0],dp[0]+maxn, LLONG_MAX/2);
	fill(dp[1],dp[1]+maxn, LLONG_MAX/2);
	fill(vis, vis + maxn, 0);

	priority_queue<pair<ll, pair<ll, ll>>> pq;
	pq.push({0, {start, 0}});
	dp[0][0] = dp[1][0] = LLONG_MAX / 2;
	while (!pq.empty()) {
		ll c, node, par;
		pair<ll, ll> p;
		tie(c, p) = pq.top();
		tie(node, par) = p;
		pq.pop();

		if (!vis[node]) {
			vis[node] = 1;
			ds[node] = -c;
			dp[0][node] = min(du[node], dp[0][par]);
			dp[1][node] = min(dv[node], dp[1][par]);
			for (auto i : adj[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]);
}

signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    ll n, m, s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	for (int i = 0; i < m; i++) {
		ll a, b, c;
		cin >> a >> b >> c;
		adj[a].push_back({b, c});
		adj[b].push_back({a, c});
	}

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

	ans=du[v];

	DJ2(s, t);
	DJ2(t, s);

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

• Subtask 1: 16 / 16
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 45 / 45