kyopro/test/kth-shortest-path_yen_yukicoder.test.cpp

• View this file on GitHub
• Last update: 2022-07-20 00:04:43+09:00
• Problem: https://yukicoder.me/problems/no/1069

Depends on

• template(graph) (kyopro/library/graph/graph_template.cpp)
• kth-shortest-path(yen's algorithm) (kyopro/library/graph/kth-shortest-path_yen.cpp)
• template (kyopro/library/template/template.cpp)

Code

#define PROBLEM "https://yukicoder.me/problems/no/1069"

#define ERROR 1e-4

#include "../library/template/template.cpp"
#include "../library/graph/graph_template.cpp"

#include "../library/graph/kth-shortest-path_yen.cpp"

int main() {

	int n, m, k, x, y;
	scanf("%d%d%d%d%d", &n, &m, &k, &x, &y);
	--x; --y;
	graph<long double> g(n, false, true);
	vector<pair<int, int>> xy(n);
	set<vector<int>> routememo;
	int p, q;
	rep(i, n) {
		scanf("%d%d", &p, &q);
		xy[i] = { p, q };
	}
	rep(i, m) {
		scanf("%d%d", &p, &q);
		--p; --q;
		long double a = xy[p].first, b = xy[p].second, c = xy[q].first, d = xy[q].second;
		g.add_edge(p, q, sqrt((c - a) * (c - a) + (d - b) * (d - b)));
	}
	vector<vector<int>> path(k);
	vector<long double> ans;
	ksp<long double>(g, n, x, y, k, path, ans, numeric_limits<double>::infinity());
	rep(i, k)printLdb(ans[i]);

	Please AC;
}

#line 1 "kyopro/test/kth-shortest-path_yen_yukicoder.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1069"

#define ERROR 1e-4

#line 1 "kyopro/library/template/template.cpp"
/*
* @title template
* @docs kyopro/docs/template.md
*/


/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/

#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
#include <array>
#include <chrono>

//#pragma GCC target("arch=skylake-avx512")
//#pragma GCC target ("avx2")
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))

using ll = long long;
using ull = unsigned long long;

constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);

using namespace std;

void scans(string& str) {
	char c;
	str = "";
	scanf("%c", &c);
	if (c == '\n')scanf("%c", &c);
	while (c != '\n' && c != -1 && c != ' ') {
		str += c;
		scanf("%c", &c);
	}
}

void scanc(char& str) {
	char c;
	scanf("%c", &c);
	if (c == -1)return;
	while (c == '\n') {
		scanf("%c", &c);
	}
	str = c;
}

double acot(double x) {
	return PI / 2 - atan(x);
}

ll LSB(ll n) { return (n & (-n)); }

template<typename T>
inline T chmin(T& a, const T& b) {
	if (a > b)a = b;
	return a;
}

template<typename T>
inline T chmax(T& a, const T& b) {
	if (a < b)a = b;
	return a;
}

////cpp_int
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//using namespace boost::multiprecision;

//atcoder library
//#include <atcoder/all>
//using namespace atcoder;

//random_device seed_gen;
//mt19937 engine(seed_gen());
//uniform_distribution dist(-1.0, 1.0);

/*----------------------------------------------------------------------------------*/
#line 1 "kyopro/library/graph/graph_template.cpp"
/*
* @title template(graph)
* @docs kyopro/docs/graph_template.md
*/

template<typename T>
struct edge {
	T cost;
	int from, to;

	edge(int from, int to) : from(from), to(to), cost(T(1)) {}
	edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
};

template<typename T = int>
struct graph {

	int n;
	bool directed, weighted;

	vector<vector<edge<T>>> g;

	graph(int n, bool directed, bool weighted) : g(n), n(n), directed(directed), weighted(weighted) {}

	void add_edge(int from, int to, T cost = T(1)) {
		g[from].emplace_back(from, to, cost);
		if (not directed) {
			g[to].emplace_back(to, from, cost);
		}
	}

	vector<edge<T>>& operator[](const int& idx) {
		return g[idx];
	}

	void read(int e, bool one_indexed) {
		int a, b, c = 1;
		while (e--) {
			scanf("%d%d", &a, &b);
			if (weighted) {
				scanf("%d", &c);
			}
			if (one_indexed)--a, --b;
			add_edge(a, b, c);
		}
	}

	void read(int e, bool one_indexed, const string& format) {
		int a, b;
		T c = T(1);
		while (e--) {
			scanf("%d%d", &a, &b);
			if (weighted) {
				scanf(format.c_str(), &c);
			}
			if (one_indexed)--a, --b;
			add_edge(a, b, c);
		}
	}

};
#line 7 "kyopro/test/kth-shortest-path_yen_yukicoder.test.cpp"

#line 1 "kyopro/library/graph/kth-shortest-path_yen.cpp"
/*
* @title kth-shortest-path(yen's algorithm)
* @docs kyopro/docs/kth-shortest-path_yen.md
*/



template<typename T>
vector<T> dijkstra(graph<T>& gh, vector<int>& path, const int& v, const int& g, const int& n, const T Inf, const vector<vector<bool>>& deleted, set<int> r) {
	priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> priq;
	vector<T> res(n);
	vector<int> prev(n);
	fill(all(prev), -1);
	fill(all(res), Inf);
	priq.push({ 0, v });
	res[v] = 0;
	int top;
	while (!priq.empty()) {
		top = priq.top().second;
		priq.pop();
		for (const auto& aa : gh[top]) {
			if (res[top] + aa.cost >= res[aa.to] or deleted[top][aa.to] or r.find(aa.to) != r.end())continue;
			res[aa.to] = aa.cost + res[top];
			prev[aa.to] = top;
			priq.push({ res[aa.to], aa.to });
		}
	}

	for (int i = g; i != -1; i = prev[i])path.push_back(i);
	reverse(all(path));

	return res;
}

template<typename T>
void ksp(graph<T>& g, const int& n, const int& start, const int& goal, const int& k, vector<vector<int>>& path, vector<T>& ans, const T& Inf) {
	set<vector<int>> routememo;
	vector<T> res, anstmp;
	vector<vector<bool>> deleted(n, vector<bool>(n));
	ans.resize(k);
	path.resize(k);
	res = dijkstra<T>(g, path[0], start, goal, n, Inf, deleted, {});
	ans[0] = res[goal];
	anstmp = res;
	routememo.insert(path[0]);
	auto func = [](const tuple<T, vector<int>, vector<T>>& a, const tuple<T, vector<int>, vector<T>>& b) -> bool {
		if (get<0>(a) != get<0>(b))return get<0>(a) > get<0>(b);
		else if (get<1>(a) != get<1>(b))return get<1>(a) > get<1>(b);
		else return get<2>(a) > get<2>(b);
	};
	priority_queue<tuple<T, vector<int>, vector<T>>, vector<tuple<T, vector<int>, vector<T>>>, decltype(func)> priq{ func };
	map<vector<int>, vector<int>> spurnode;
	rep(i, k - 1) {
		int siz = path[i].size();
		vector<int> route;
		set<int> r;
		T cost = 0;
		rep(j, siz - 1) {
			route.push_back(path[i][j]);
			r.insert(path[i][j]);
			spurnode[route].push_back(path[i][j + 1]);
			if (j != 0) {
				for (const auto& aa : g[path[i][j - 1]]) {
					if (aa.to == path[i][j]) {
						cost += aa.cost;
						break;
					}
				}
			}
			for (const auto& aa : spurnode[route])deleted[path[i][j]][aa] = deleted[aa][path[i][j]] = true;
			if (j > 0)deleted[path[i][j - 1]][path[i][j]] = deleted[path[i][j]][path[i][j - 1]] = true;
			res = dijkstra<T>(g, path[i + 1], path[i][j], goal, n, Inf, deleted, r);
			if (j > 0)deleted[path[i][j - 1]][path[i][j]] = deleted[path[i][j]][path[i][j - 1]] = false;
			for (const auto& aa : spurnode[route])deleted[path[i][j]][aa] = deleted[aa][path[i][j]] = false;
			if (res[goal] >= Inf)continue;
			vector<int> tmp;
			vector<T> tmp2(n);
			for (int l = 0; l <= j; ++l) {
				tmp2[path[i][l]] = anstmp[path[i][l]];
			}
			int l = 0;
			for (; path[i][l] != path[i][j]; ++l) {
				tmp2[path[i][l]] = anstmp[path[i][l]];
				tmp.push_back(path[i][l]);
			}
			for (l = 0; path[i + 1][l] != goal; ++l) {
				tmp2[path[i + 1][l]] = res[path[i + 1][l]];
				tmp.push_back(path[i + 1][l]);
			}
			tmp.push_back(goal);
			int siz2 = path[i + 1].size();
			for (int l = 1; l < siz2; ++l) tmp2[path[i + 1][l]] = res[path[i + 1][l]] + anstmp[path[i][j]];
			priq.push(make_tuple(cost + res[goal], tmp, tmp2));
		}
		if (priq.empty()) {
			for (; i < k - 1; ++i)ans[i + 1] = -1;
			break;
		}
		auto tmp = priq.top();
		priq.pop();
		while (routememo.find(get<1>(tmp)) != routememo.end() and !priq.empty()) {
			tmp = priq.top();
			priq.pop();
		}
		if (routememo.find(get<1>(tmp)) != routememo.end() and priq.empty()) {
			for (; i < k - 1; ++i)ans[i + 1] = -1;
			break;
		}
		path[i + 1] = get<1>(tmp);
		ans[i + 1] = get<0>(tmp);
		routememo.insert(path[i + 1]);
	}
	return;
}
#line 9 "kyopro/test/kth-shortest-path_yen_yukicoder.test.cpp"

int main() {

	int n, m, k, x, y;
	scanf("%d%d%d%d%d", &n, &m, &k, &x, &y);
	--x; --y;
	graph<long double> g(n, false, true);
	vector<pair<int, int>> xy(n);
	set<vector<int>> routememo;
	int p, q;
	rep(i, n) {
		scanf("%d%d", &p, &q);
		xy[i] = { p, q };
	}
	rep(i, m) {
		scanf("%d%d", &p, &q);
		--p; --q;
		long double a = xy[p].first, b = xy[p].second, c = xy[q].first, d = xy[q].second;
		g.add_edge(p, q, sqrt((c - a) * (c - a) + (d - b) * (d - b)));
	}
	vector<vector<int>> path(k);
	vector<long double> ans;
	ksp<long double>(g, n, x, y, k, path, ans, numeric_limits<double>::infinity());
	rep(i, k)printLdb(ans[i]);

	Please AC;
}

Back to top page