// // S i r o t a n w a t c h e s o v e r y o u . // // ...Jggg+J+JJJg@NQmgJa....., // ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,. // ...JH@@MMHY"! ? __""YH@@@@N&... // ..JH@@HY"~ _TW@@@Mme. // .Jg@@#"= _TTM@@N.. // .Jg@@MY! ?T@@@h,. // .-@@@B! (TM@@@L // .(H@MY ?W@@@+ // .W@@@ .T@@@[ // .d@@M! .T@@N, // .d@M@' -W@@o. // (@@M\ ?M@N, // -d@M% .., .., j@@b // d@@M= TM9 ?MD W@@[ // .H@M: .W@H, // H@Ht ,@@# // (@@M~ .@@h. // .@@M% ..gmHHJ. .JdHga. .H@@e // j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\ // d@@@ .4@@@@@@MF (@@@@@@@@ H@@b // d@@[ ?"BMY"= .d@@@@H, ?TWHHY"! d@@e // J@@b .JJJ-.., ,@@@@@@M% ......... -@@@M. // ?@@M\ ?YHHM@@@@b .. .W@@HP X@@HMWY"= d@@@# // ,@@@L. ?H@Ng&+gd@@#H@@NHaJ+gH@[ J@@@] // X@@@[ ...... ?"YYYYY"" ?"YHHHB"^ ..... (@@@# // WH@N+. .W@@@@MHB= .TWH@M@Hmc .H@@M~ // .H@@@@N, _!~ .d@@@N, // .J@@#T@@@N, .d@@@@@@@b. // (@@@@! .T@@@n, .(H@@@H>.W@@@x // (@@@F 4@@@@MaJ. .d@@@@Y77 4@@@r //.H@@P ?TM@@@@N... .-JH@HMY= d@@N, //(@@@F ?"WM@@@MQa-,. .(J(JN@@M#" Z@@@L // d@@H, (M@@@@@@@Ng&maJ.... .. ...J.J+W@@@@@@HY! .dH@b // ?M@@@N&. ..(JW@@@MM"?7""TYHMH@@HH@@@@@HHHgkHagHa(mggdmmagH@H@@Q@@HMMMHY"7!TMM@@@HaJ,. ..H@@@M^ // ?"W@@@@MN@@@@@H@@MMY" _???!"= ?WMMBYYTMH=7""Y@""?"~^ _"YM@@@@@@@@MH@@@@@#"^ // ?77WMMMYB""! _7"WWMMMY"7= // need #include #include // data structure #include #include #include #include #include #include #include #include #include //#include #include #include #include #include // etc #include #include #include #include #include #include #include #include // input #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template void MACRO_VAR_Scan(T& t) { std::cin >> t; } templatevoid MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_ void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } templatevoid MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } templatevoid MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define VEC(type, c, n) std::vector c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& R:c)for(auto& w:R)std::cin>>w; // output templatevoid MACRO_OUT(const T t) { std::cout << t; } templatevoid MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); } #define OUT(...) MACRO_OUT(__VA_ARGS__); #define FOUT(n, dist) std::cout<=(a);--w) #define RREP(w, n) RFOR(w, 0, n) template bool IN(S a, T x, U b) { return a <= x && x < b; } template inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } // test template using V = std::vector; template using VV = V>; template std::ostream& operator<<(std::ostream& os, std::pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } // type/const using i64 = std::int_fast64_t; using u64 = std::uint_fast64_t; using ll = long long; using ull = unsigned long long; using ld = long double; using PAIR = std::pair; using PAIRLL = std::pair; constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-6; constexpr i64 MOD = 998244353; constexpr double PI = 3.141592653589793238462643383279; template void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; } template void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); } template void FILL(std::vector & a, const T & val) { for (auto& x : a) x = val; } template void FILL(std::vector> & a, const T & val) { for (auto& b : a) FILL(b, val); } // ------------>8--------- signed main() { INIT; VAR(int, n, m, k, x, y); --x; --y; VEC_ROW(int, n, p, q); VEC_ROW(int, m, P, Q); VV cost(n, V(n, 1e300)); REP(i, n) REP(j, n) cost[i][j] = std::hypot(p[i] - p[j], q[i] - q[j]); REP(i, m) --P[i], --Q[i]; V> g(n); auto reset = [&] { g.resize(0); g.resize(n); REP(i, m) { g[P[i]][Q[i]] = cost[P[i]][Q[i]]; g[Q[i]][P[i]] = cost[Q[i]][P[i]]; } }; reset(); std::set> shortpathset; using Pa = std::pair>; std::priority_queue, std::greater> candpathpq; std::set> candpathset; std::vector dist(n); V pre(n); auto getLastPath = [&] { V res({ y }); int now = y; while (pre[now] != -1) { now = pre[now]; res.emplace_back(now); } std::reverse(ALL(res)); return res; }; std::function Dijkstra = [&](int s) { using P = std::pair; std::priority_queue, std::greater

> pq; FILL(dist, 1e300l); FILL(pre, -1); dist[s] = 0.l; pq.push(P(0.l, s)); while (!pq.empty()) { P p = pq.top(); pq.pop(); int v = p.second; if (dist[v] < p.first) continue; for(const auto& e : g[v]) { if (dist[e.first] > dist[v] + e.second) { dist[e.first] = dist[v] + e.second; pre[e.first] = v; pq.push(P(dist[e.first], e.first)); } } } }; Dijkstra(x); V path = getLastPath(); shortpathset.insert(path); V ans({ dist[y] }); while (ans.size() < k) { ld sum = 0; REP(i, path.size() - 1) { REP(j, i + 1) { g[path[j]].erase(path[j + 1]); g[path[j + 1]].erase(path[j]); } for (auto& tpath : shortpathset) { if (i + 1 >= tpath.size()) continue; if (tpath == path) continue; bool ok = true; REP(j, i + 1) if (tpath[j] != path[j]) ok = false; if (ok) { g[tpath[i]].erase(tpath[i + 1]); g[tpath[i + 1]].erase(tpath[i]); } } Dijkstra(path[i]); V tpath(path.begin(), path.begin() + i); { auto tmppath = getLastPath(); tpath.insert(tpath.end(), ALL(tmppath)); } if (dist[y] < 1e100) { if (!shortpathset.count(tpath) && !candpathset.count(tpath)) { candpathset.insert(tpath); candpathpq.emplace(sum + dist[y], tpath); } } sum += cost[path[i]][path[i + 1]]; reset(); } if (candpathpq.empty()) break; Pa mi = candpathpq.top(); candpathpq.pop(); if (mi.first > 1e100) break; path = mi.second; candpathset.erase(path); shortpathset.insert(path); ans.emplace_back(mi.first); } ans.resize(k, -1); REP(i, k) { if (ans[i] < 0 || ans[i] > 1e100) { OUT(-1)BR; } else { FOUT(12, ans[i])BR; } } return 0; }