mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

verify/aoj/id/2005.test.cpp

• View this file on GitHub
• Last update: 2025-07-01 03:22:56+09:00
• Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2005

Depends on

• 全頂点間最短距離 O(V^3) 及び更新を O(V^2) で行うアルゴリズム (ワーシャルフロイド法) (graph/warshall_floyd.hpp)
• template/template.hpp

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2005"

#include "./../../../template/template.hpp"
#include "./../../../graph/warshall_floyd.hpp"

using namespace mmrz;

bool SOLVE(){
	int n, m, s, g1, g2;
	cin >> n >> m >> s >> g1 >> g2;
	if(n == 0)return 1;
	s--, g1--, g2--;
	vector dist(n, vector(n, inf<int>()/3));
	rep(i, n)dist[i][i] = 0;
	while(m--){
		int u, v, c;
		cin >> u >> v >> c;
		u--, v--;
		dist[u][v] = c;
	}
	warshall_floyd wf(dist, inf<int>()/3);
	int ans = hinf<int>();
	rep(i, n){
		chmin(ans, wf.dist[s][i]+wf.dist[i][g1]+wf.dist[i][g2]);
	}
	cout << ans << '\n';
	return 0;
}

void mmrz::solve(){
	while(!SOLVE());
}

#line 1 "verify/aoj/id/2005.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2005"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "graph/warshall_floyd.hpp"

#line 5 "graph/warshall_floyd.hpp"

template<typename T>
struct warshall_floyd {
private:
	int V;
public:
	std::vector<std::vector<T>> dist;

	warshall_floyd(std::vector<std::vector<T>> &edge_cost, T infty=std::numeric_limits<T>::max()/2) : V(ssize(edge_cost)), dist(edge_cost){
		for(int k = 0;k < V;k++){
			for(int i = 0;i < V;i++){
				if(dist[i][k] == infty)continue;
				for(int j = 0;j < V;j++){
					if(dist[k][j] == infty)continue;
					dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
				}
			}
		}
	}

	void update(int s, int t, T cost){
		dist[s][t] = cost;
		for(int u = 0;u < V;u++){
			for(int v = 0;v < V;v++){
				dist[u][v] = min(dist[u][v], dist[u][s]+dist[s][t]+dist[t][v]);
			}
		}
	}
};

#line 5 "verify/aoj/id/2005.test.cpp"

using namespace mmrz;

bool SOLVE(){
	int n, m, s, g1, g2;
	cin >> n >> m >> s >> g1 >> g2;
	if(n == 0)return 1;
	s--, g1--, g2--;
	vector dist(n, vector(n, inf<int>()/3));
	rep(i, n)dist[i][i] = 0;
	while(m--){
		int u, v, c;
		cin >> u >> v >> c;
		u--, v--;
		dist[u][v] = c;
	}
	warshall_floyd wf(dist, inf<int>()/3);
	int ans = hinf<int>();
	rep(i, n){
		chmin(ans, wf.dist[s][i]+wf.dist[i][g1]+wf.dist[i][g2]);
	}
	cout << ans << '\n';
	return 0;
}

void mmrz::solve(){
	while(!SOLVE());
}

Back to top page