제출 #851874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
851874		stdfloat	Commuter Pass (JOI18_commuter_pass)	C++17	31 / 100	406 ms	262144 KiB

commuter_pass

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

using ll = long long;

ll ans, mnu, mnv;

int n, m, s, t, u, v;

vector<vector<pair<int, int>>> E;

vector<vector<vector<int>>> V;

vector<ll> dis, diss, dist, disu, disv;

priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> q;

vector<ll> f(int st){
	dis.assign(n + 1, LLONG_MAX);
	dis[st] = 0;
	q.push({0, st});
	while (!q.empty()) {
		int x = q.top().second;
		q.pop();
		for (auto i : E[x]) {
			if (dis[x] + i.second < dis[i.first]) {
				dis[i.first] = dis[x] + i.second;
				q.push({dis[i.first], i.first});
			}
		}
	}

	return dis;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	cin >> n >> m >> s >> t >> u >> v;

	E.assign(n + 1, {});
	while (m--) {
		int a, b, c;
		cin >> a >> b >> c;
		E[a].push_back({b, c});
		E[b].push_back({a, c});
	}

	diss = f(s); dist = f(t);
	disu = f(u); disv = f(v);

	ans = disu[v];
	if (n <= 300) {
		V.assign(n + 1, {});
		V[s] = {{s}};
		q.push({0, s});
		while (!q.empty()) {
			int x = q.top().second;
			q.pop();
			if (x == t) {
				int cur = t;
				for (auto i : V[x]) {
					mnu = LLONG_MAX; mnv = LLONG_MAX;
					for (auto j : i) {
						mnu = min(mnu, disu[j]);
						mnv = min(mnv, disv[j]);
					}
					ans = min(ans, mnu + mnv);
				}
				break;
			}
			for (auto i : E[x]) {
				if (diss[x] + i.second == diss[i.first]) {
					for (auto j : V[x]) {
						V[i.first].push_back(j);
						V[i.first].back().push_back(i.first);
					}
					q.push({diss[i.first], i.first});
				}
			}
		}
	}
	else {
		mnu = LLONG_MAX; mnv = LLONG_MAX;
		for (int i = 1; i <= n; i++) {
			if (diss[i] + dist[i] == diss[t]) {
				mnu = min(mnu, disu[i]);
				mnv = min(mnv, disv[i]);
			}
		}
		ans = min(ans, mnu + mnv);
	}

	cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:61:9: warning: unused variable 'cur' [-Wunused-variable]
   61 |     int cur = t;
      |         ^~~

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