結果
| 問題 | No.2376 障害物競プロ |
| ユーザー |
👑  seekworser
|
| 提出日時 | 2023-06-16 23:53:56 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 689 ms / 4,000 ms |
| コード長 | 28,890 bytes |
| コンパイル時間 | 3,773 ms |
| コンパイル使用メモリ | 272,228 KB |
| 実行使用メモリ | 5,452 KB |
| 最終ジャッジ日時 | 2023-09-23 07:29:58 |
| 合計ジャッジ時間 | 65,949 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,376 KB |
| testcase_01 | AC | 1 ms
4,376 KB |
| testcase_02 | AC | 2 ms
4,376 KB |
| testcase_03 | AC | 2 ms
4,376 KB |
| testcase_04 | AC | 249 ms
4,376 KB |
| testcase_05 | AC | 356 ms
4,380 KB |
| testcase_06 | AC | 174 ms
4,380 KB |
| testcase_07 | AC | 634 ms
4,380 KB |
| testcase_08 | AC | 630 ms
4,376 KB |
| testcase_09 | AC | 626 ms
4,376 KB |
| testcase_10 | AC | 615 ms
4,380 KB |
| testcase_11 | AC | 548 ms
4,380 KB |
| testcase_12 | AC | 519 ms
4,376 KB |
| testcase_13 | AC | 596 ms
4,380 KB |
| testcase_14 | AC | 620 ms
4,380 KB |
| testcase_15 | AC | 557 ms
4,380 KB |
| testcase_16 | AC | 600 ms
4,384 KB |
| testcase_17 | AC | 525 ms
4,384 KB |
| testcase_18 | AC | 501 ms
4,384 KB |
| testcase_19 | AC | 511 ms
5,452 KB |
| testcase_20 | AC | 522 ms
5,384 KB |
| testcase_21 | AC | 526 ms
5,292 KB |
| testcase_22 | AC | 446 ms
4,388 KB |
| testcase_23 | AC | 369 ms
4,388 KB |
| testcase_24 | AC | 258 ms
4,388 KB |
| testcase_25 | AC | 124 ms
4,384 KB |
| testcase_26 | AC | 293 ms
4,384 KB |
| testcase_27 | AC | 248 ms
4,384 KB |
| testcase_28 | AC | 201 ms
4,392 KB |
| testcase_29 | AC | 127 ms
4,384 KB |
| testcase_30 | AC | 285 ms
4,388 KB |
| testcase_31 | AC | 182 ms
4,384 KB |
| testcase_32 | AC | 27 ms
4,384 KB |
| testcase_33 | AC | 107 ms
4,384 KB |
| testcase_34 | AC | 103 ms
4,388 KB |
| testcase_35 | AC | 51 ms
4,388 KB |
| testcase_36 | AC | 420 ms
4,384 KB |
| testcase_37 | AC | 373 ms
4,388 KB |
| testcase_38 | AC | 138 ms
4,384 KB |
| testcase_39 | AC | 525 ms
4,388 KB |
| testcase_40 | AC | 275 ms
4,388 KB |
| testcase_41 | AC | 118 ms
4,384 KB |
| testcase_42 | AC | 666 ms
5,448 KB |
| testcase_43 | AC | 689 ms
5,352 KB |
ソースコード
// line 1 "answer.cpp"
#if !__INCLUDE_LEVEL__
#include __FILE__
int main() {
ll n,m;
input(n,m);
assert(2 <= n && n <= 150);
assert(1 <= m && m <= 2 * powm(10, 5));
using P = Point<double>;
using S = Segment<double>;
vector<S> p;
rep(i, n) {
double x1,y1,x2,y2;
input(x1, y1, x2, y2);
assert(-powm(10, 4) <= x1 && x1 <= powm(10, 4));
assert(-powm(10, 4) <= y1 && y1 <= powm(10, 4));
assert(-powm(10, 4) <= x2 && x2 <= powm(10, 4));
assert(-powm(10, 4) <= y2 && y2 <= powm(10, 4));
p.emplace_back(P(x1,y1), P(x2,y2));
}
rep(i, n) debug(p[i]);
rep(i, n) {
assert(p[i].s != p[i].t);
}
rep(i, n) rep(j, i+1, n) {
assert(p[i].s != p[j].s);
assert(p[i].s != p[j].t);
assert(p[i].t != p[j].s);
assert(p[i].t != p[j].t);
}
rep(i, n) rep(j, n) {
if (i == j) continue;
assert(ccw(p[i], p[j].s) != ONSEGMENT);
assert(ccw(p[i], p[j].t) != ONSEGMENT);
}
vi from, to; vector<double> cost;
rep(i, 2 * n) rep(j, 2 * n) {
if (i == j) continue;
ll pos1 = i / 2;
ll pos2 = j / 2;
P p1, p2;
if (i % 2 == 0) p1 = p[pos1].s;
else p1 = p[pos1].t;
if (j % 2 == 0) p2 = p[pos2].s;
else p2 = p[pos2].t;
bool valid = true;
S s(p1, p2);
rep(k, n) {
if (k == pos1 || k == pos2) continue;
if (intersect(s, p[k])) valid = false;
}
if (valid) {
from.push_back(i);
to.push_back(j);
cost.push_back(abs(p1 - p2));
}
}
Graph g(2*n, from, to, cost);
vector<vector<double>> minc;
warshall_floyd(g, minc, (double)INFL);
rep(i, m) {
ll a,b,c,d;
input(a,b,c,d);
assert(a != c);
ll p1 = (a-1) * 2 + (b-1);
ll p2 = (c-1) * 2 + (d-1);
print(minc[p1][p2]);
}
}
#else
// line 2 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp"
#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
// 型名の短縮
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
// 定数の定義
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-10;
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<> bool eq<double>(const double x, const double y) { return (abs(x - y) < EPSL * x || abs(x - y) < EPSL); }
template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS * x; }
template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
// 入出力高速化
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};
template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };
template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }
// modでのpow
ll powm(ll a, ll n, ll mod=INFL) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * a) % mod;
if (n > 1) a = (a * a) % mod;
n >>= 1;
}
return res;
}
// 整数Sqrt
ll sqrtll(ll x) {
assert(x >= 0);
ll rev = sqrt(x);
while(rev * rev > x) --rev;
while((rev+1) * (rev+1)<=x) ++rev;
return rev;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
/**
* @brief std.hpp
* @docs docs/std/std.md
*/
// line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/geometry/base.hpp"
/**
* @brief Pointクラス
* @details
* Point : 2次元空間上の点・ベクトルを扱うためのクラス
* absもしくは単位ベクトルを使う場合はdoubleを使い、その他の場合はFracを使う
*/
template<typename T> struct Point {
T x, y;
Point(T x, T y) : x(x), y(y) {
};
Point() : Point(0, 0) {};
Point<T> &operator+=(const Point<T>& p) { (*this).x += p.x; (*this).y += p.y; return *this; }
Point<T> &operator-=(const Point<T>& p) { (*this).x -= p.x; (*this).y -= p.y; return *this; }
friend Point<T> operator+(const Point<T>& lhs, const Point<T>& rhs) { return Point(lhs) += rhs; }
friend Point<T> operator-(const Point<T>& lhs, const Point<T>& rhs) { return Point(lhs) -= rhs; }
Point<T> &operator+() { return *this; }
Point<T> &operator-() { (*this).x *= -1; (*this).y *= -1; return *this; }
Point<T> &operator*=(const T &x) { (*this).x *= x; (*this).y *= x; return *this; }
Point<T> &operator/=(const T &x) { (*this).x /= x; (*this).y /= x; return *this; }
friend Point<T> operator*(const Point<T>& lhs, const T& rhs) { return Point(lhs) *= rhs; }
friend Point<T> operator/(const Point<T>& lhs, const T& rhs) { return Point(lhs) /= rhs; }
friend Point<T> operator*(const T& lhs, const Point<T>& rhs) { return Point(rhs) *= lhs; }
friend Point<T> operator/(const T& lhs, const Point<T>& rhs) { return Point(rhs) /= lhs; }
friend bool operator==(const Point<T> &lhs, const Point<T> &rhs) {
return eq<T>(lhs.x, rhs.x) && eq<T>(lhs.y, rhs.y);
}
friend bool operator!=(const Point<T> &lhs, const Point<T> &rhs) {
return !(lhs == rhs);
}
friend bool operator>(const Point<T>& lhs, const Point<T>& rhs) {
if (eq<T>(lhs.x, rhs.x)) return gt<T>(lhs.y, rhs.y);
return gt<T>(lhs.x, rhs.x);
}
friend bool operator<(const Point<T>& lhs, const Point<T>& rhs) {
if (eq<T>(lhs.x, rhs.x)) return lt<T>(lhs.y, rhs.y);
return lt<T>(lhs.x, rhs.x);
}
friend bool operator>=(const Point<T>& lhs, const Point<T>& rhs) { return !(lhs < rhs); }
friend bool operator<=(const Point<T>& lhs, const Point<T>& rhs) { return !(lhs > rhs); }
T dot(const Point<T> &p) const {return (*this).x * p.x + (*this).y * p.y; };
T cross(const Point<T> &p) const {return (*this).x * p.y - (*this).y * p.x; };
T norm() const {return (*this).dot(*this); };
T abs() const {return sqrt((*this).norm()); };
T arg() const {return atan((*this).y / (*this).x); };
Point<T> rotate(const double &theta) {
(*this).x = cos(theta) * (*this).x - sin(theta) * (*this).y;
(*this).y = sin(theta) * (*this).x + cos(theta) * (*this).y;
return (*this);
};
T operator*=(const Point<T>& p) const { return (*this).dot(p); }
friend const T operator*(const Point<T>& lhs, const Point<T>& rhs) { return lhs *= rhs; }
friend ostream& operator<<(ostream& os, const Point<T> &p) { os << p.x << " " << p.y; return os; }
};
template<typename T> T dot(const Point<T> &p1, const Point<T> &p2) { return p1.dot(p2); }
template<typename T> T cross(const Point<T> &p1, const Point<T> &p2) { return p1.cross(p2); }
template<typename T> T norm(const Point<T> &p) { return p.norm(); }
double abs(const Point<double> &p) { return p.abs(); }
Point<double> unit_vector(const Point<double> &p) { return p / abs(p); }
template<typename T> Point<T> normal_vector(const Point<double> &p) { return Point(-p.y, p.x); }
Point<double> rotate(const Point<double> &p, const double &theta) { return Point(p).rotate(theta); }
// Line : 直線クラス
template<typename T> struct Line {
Point<T> s, t;
Line() = default;
Line(Point<T> s, Point<T> t) : s(s), t(t) {assert(s != t);};
// ax+by+c=0;
Line(T a, T b, T c) {
assert(neq<T>(a, T(0)) || neq<T>(b, T(0)));
if(eq<T>(b, T(0))) {
s = Point(-c / a, T(0)); t = Point(-c / a, T(1));
} else {
s = Point(T(0), -c / b); t = Point(T(1), (-a-c)/b);
}
};
Point<T> vec() const { return (*this).t - (*this).s; }
Point<T> normal() const { return normal_vector((*this).vec()); }
friend ostream& operator<<(ostream& os, const Line<T> &l) { os << l.s << " " << l.t; return os; }
};
// Segment : 線分を表す構造体
template <typename T> struct Segment : Line<T> {
Segment() = default;
Segment(Point<T> s, Point<T> t) : Line<T>(s, t) {}
};
// Circle : 円を表す構造体
// pが中心の位置ベクトル、rは半径
template<typename T> struct Circle {
Point<T> o;
T r;
Circle() = default;
Circle(Point<T> o, double r) : o(o), r(r) {}
};
/**
* @brief 幾何ライブラリベースクラス
* @docs docs/geometry/base.md
*/
// line 4 "/home/seekworser/.cpp_lib/competitive_library/competitive/geometry/counter_clockwise.hpp"
constexpr int COUNTER_CLOCKWISE = 2;
constexpr int CLOCKWISE = -2;
constexpr int ONSEGMENT = 0;
constexpr int ONLINE_BACK = 1;
constexpr int ONLINE_FRONT = -1;
template<typename T> int ccw(const Line<T> &l, const Point<T> &p, bool strict=false) {
T crs = cross(l.vec(), p - l.s);
if (lt<T>(crs, 0)) return CLOCKWISE;
if (gt<T>(crs, 0)) return COUNTER_CLOCKWISE;
T d = dot(l.vec(), p - l.s);
if (strict) {
if (le<T>(d, 0)) return ONLINE_BACK;
if (ge<T>(d, norm(l.vec()))) return ONLINE_FRONT;
} else {
if (lt<T>(d, 0)) return ONLINE_BACK;
if (gt<T>(d, norm(l.vec()))) return ONLINE_FRONT;
}
return ONSEGMENT;
};
template <typename T> int ccw(const Point<T> &p1, const Point<T> &p2, const Point<T> &p3, bool strict=false) {
return ccw(Line<T>(p1, p2), p3, strict);
};
template <typename T> bool online(const Line<T> &l, const Point<T> &p) {
int result = ccw(l, p);
return -1 <= result && result <= 1;
};
template <typename T> int online(const Point<T> &p1, const Point<T> &p2, const Point<T> &p3) {
return online(Line<T>(p1, p2), p3);
};
/**
* @brief counter_clockwise.hpp
* @docs docs/geometry/counter_clockwise.md
*/
// line 4 "/home/seekworser/.cpp_lib/competitive_library/competitive/geometry/angle.hpp"
constexpr int ANGLE_0 = 0;
constexpr int ANGLE_0_90 = 1;
constexpr int ANGLE_90 = 2;
constexpr int ANGLE_90_180 = 3;
constexpr int ANGLE_180 = 4;
constexpr int ANGLE_180_270 = -3;
constexpr int ANGLE_270 = -2;
constexpr int ANGLE_270_360 = -1;
template <typename T> int angle(const Point<T> &p1, const Point<T> &p2) {
Point<T> zero(0, 0);
assert(p1 != zero && p2 != zero);
T d = dot(p1, p2);
T c = cross(p1, p2);
if (eq<T>(c, 0)) {
if (gt<T>(d, 0)) return ANGLE_0;
else return ANGLE_180;
}
if (eq<T>(d, 0)) {
if (gt<T>(c, 0)) return ANGLE_90;
else return ANGLE_270;
}
if (gt<T>(d, 0) && gt<T>(c, 0)) return ANGLE_0_90;
if (lt<T>(d, 0) && gt<T>(c, 0)) return ANGLE_90_180;
if (lt<T>(d, 0) && lt<T>(c, 0)) return ANGLE_180_270;
if (gt<T>(d, 0) && lt<T>(c, 0)) return ANGLE_270_360;
throw runtime_error("function angle unexpectedly reached end");
};
template<typename T> int angle(const Line<T> &l1, const Line<T> &l2) { return angle(l1.vec(), l2.vec()); };
template<typename PointOrLine> bool is_parallel(const PointOrLine &p1, const PointOrLine &p2) {
int result = angle(p1, p2);
return result == ANGLE_0 || result == ANGLE_180;
}
template<typename PointOrLine> bool is_orthogonal(const PointOrLine &p1, const PointOrLine &p2) {
int result = angle(p1, p2);
return result == ANGLE_90 || result == ANGLE_270;
}
/**
* @brief angle.hpp
* @docs docs/geometry/angle.md
*/
// line 6 "/home/seekworser/.cpp_lib/competitive_library/competitive/geometry/intersection.hpp"
template <typename T> bool intersect(const Segment<T> &s1, const Segment<T> &s2, bool strict=false) {
if (strict) {
if (ccw(s1, s2.s, true) == ONSEGMENT) return online(s1, s2.t);
if (ccw(s1, s2.t, true) == ONSEGMENT) return online(s1, s2.s);
if (ccw(s2, s1.s, true) == ONSEGMENT) return online(s2, s1.t);
if (ccw(s2, s1.t, true) == ONSEGMENT) return online(s2, s1.s);
return
ccw(s1, s2.s) * ccw(s1, s2.t) < 0 &&
ccw(s2, s1.s) * ccw(s2, s1.t) < 0;
}
return
ccw(s1, s2.s) * ccw(s1, s2.t) <= 0 &&
ccw(s2, s1.s) * ccw(s2, s1.t) <= 0;
};
template<typename T> bool intersect(const Line<T> &l1, const Line<T> &l2) {
if(!is_parallel(l1, l2)) return true;
if (online(l1, l2.s)) return true;
return false;
};
template<typename T> Point<T> cross_point(const Line<T> &l1, const Line<T> &l2) {
assert(intersect(l1, l2));
if(is_parallel(l1, l2)) return l1.s;
T d1 = cross(l1.vec(), l2.vec());
T d2 = cross(l1.vec(), l1.t - l2.s);
return l2.s + l2.vec() * (d2 / d1);
};
template<typename T> Point<T> cross_point(const Segment<T> &s1, const Segment<T> &s2, bool strict=false) {
assert(intersect(s1, s2, strict));
if(is_parallel(s1, s2)) {
if (ccw(s1, s2.s, strict) == ONSEGMENT) return s2.s;
if (ccw(s1, s2.t, strict) == ONSEGMENT) return s2.t;
if (ccw(s2, s1.s, strict) == ONSEGMENT) return s1.s;
if (ccw(s2, s1.t, strict) == ONSEGMENT) return s1.t;
throw("segments are parallel but cannot find cross point");
}
return cross_point(Line(s1), Line(s2));
};
/**
* @brief intersection.hpp
* @docs docs/geometry/intersection.md
*/
// line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/math/fraction.hpp"
struct Frac {
ll num;
ll den;
Frac (ll _num, ll _den, bool reduce = true) : num(_num), den(_den) {
if (reduce) (*this).reduce();
}
Frac (ll _num) : Frac(_num, 1) {}
static ll redcue_limit;
Frac inv() const { return Frac((*this).den, (*this).num); }
Frac &operator+=(const Frac &x) {
(*this).num = (*this).num * x.den + x.num * (*this).den;
(*this).den = (*this).den * x.den;
if ((*this).den > redcue_limit || (*this).num > redcue_limit) (*this).reduce();
return (*this);
}
Frac &operator-=(const Frac &x) {
(*this).num = (*this).num * x.den - x.num * (*this).den;
(*this).den = (*this).den * x.den;
if ((*this).den > redcue_limit || (*this).num > redcue_limit) (*this).reduce();
return (*this);
}
Frac &operator*=(const Frac &x) {
(*this).num = (*this).num * x.num;
(*this).den = (*this).den * x.den;
if ((*this).den > redcue_limit || (*this).num > redcue_limit) (*this).reduce();
return (*this);
}
Frac &operator/=(const Frac &x) {
(*this) *= x.inv();
if ((*this).den > redcue_limit || (*this).num > redcue_limit) (*this).reduce();
return (*this);
}
Frac operator+(const Frac &x) const { return (Frac(*this) += x); }
Frac operator-(const Frac &x) const { return (Frac(*this) -= x); }
Frac operator*(const Frac &x) const { return (Frac(*this) *= x); }
Frac operator/(const Frac &x) const { return (Frac(*this) /= x); }
Frac operator+() const { return *this; }
Frac operator-() const { Frac x(-(*this).num, (*this).den); return x; }
friend bool operator==(const Frac& lhs, const Frac& rhs) {
return lhs.num * rhs.den == lhs.den * rhs.num;
}
friend bool operator!=(const Frac& lhs, const Frac& rhs) {
return lhs.num * rhs.den != lhs.den * rhs.num;
}
friend bool operator>=(const Frac& lhs, const Frac& rhs) {
return lhs.num * rhs.den >= lhs.den * rhs.num;
}
friend bool operator<=(const Frac& lhs, const Frac& rhs) {
return lhs.num * rhs.den <= lhs.den * rhs.num;
}
friend bool operator>(const Frac& lhs, const Frac& rhs) {
return lhs.num * rhs.den > lhs.den * rhs.num;
}
friend bool operator<(const Frac& lhs, const Frac& rhs) {
return lhs.num * rhs.den < lhs.den * rhs.num;
}
double val() const {return (double)((*this).num) / (double)((*this).den); }
friend ostream& operator<<(ostream& os, const Frac &x) { os << x.val(); return os; }
void reduce() {
assert((*this).den != 0 || (*this).num != 0);
if ((*this).den == 0) { (*this).num = 1; return; }
if ((*this).num == 0) { (*this).den = 1; return; }
ll g = gcd((*this).num, (*this).den);
(*this).num /= g;
(*this).den /= g;
if ((*this).den < 0) {
(*this).num *= -1;
(*this).den *= -1;
}
return;
}
};
ll Frac::redcue_limit = 1000000000;
Frac pow(const Frac &a, ll n) {
Frac res(1); Frac cur(a);
while (n > 0) {
if (n & 1) res *= cur;
cur *= cur;
n >>= 1;
}
return res;
}
Frac abs(const Frac &f) {
Frac rev(f);
if (rev.den * rev.num < 0) return -rev;
return rev;
}
/**
* @brief fraction.hpp
* @docs docs/math/fraction.md
*/
// line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/graph/graph.hpp"
template <class Cost> struct Graph{
public:
struct Edge {
int to;
Cost cost;
Edge() {};
Edge(int _to, Cost _cost) : to(_to), cost(_cost) {};
};
struct AdjacencyListRange{
using iterator = typename std::vector<Edge>::const_iterator;
iterator begi, endi;
iterator begin() const { return begi; }
iterator end() const { return endi; }
int size() const { return (int)distance(begi, endi); }
const Edge& operator[](int i) const { return begi[i]; }
};
private:
public:
vector<Edge> E;
vector<int> I;
int n;
Graph() : n(0) {}
Graph(int _n) : n(_n) {}
Graph(int _n, const vector<int>& from, vector<int>& to, vector<Cost>& cost, bool rev = false) : n(_n) {
vector<int> buf(n+1, 0);
for(int i=0; i<(int)from.size(); i++){
++buf[from[i]];
if (rev) ++buf[to[i]];
}
for(int i=1; i<=_n; i++) buf[i] += buf[i-1];
E.resize(buf[n]);
for(int i=(int)from.size()-1; i>=0; i--){
int u = from[i];
int v = to[i];
Cost c = cost[i];
E[--buf[u]] = Edge(v, c);
if(rev) E[--buf[v]] = Edge(u, c);
}
I = move(buf);
}
AdjacencyListRange operator[](int u) const {
return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };
}
int num_vertices() const { return n; }
int size() const { return num_vertices(); }
int num_edges() const { return E.size(); }
Graph<Cost> reversed_edges() const {
Graph<Cost> res;
int _n = res.n = n;
vi buf(n+1, 0);
for(auto v : E) ++buf[v.to];
for(int i=1; i<=n; i++) buf[i] += buf[i-1];
res.E.resize(buf[n]);
for(int u=0; u<n; u++) for(auto v : operator[](u)) res.E[--buf[v.to]] = {u, v.cost};
res.I = std::move(buf);
return res;
}
};
template <class T> ostream& operator<<(ostream& os, Graph<T> g) {
bool first = true;
rep(i, g.n) repe(e, g[i]) {
if (first) first = false;
else os << endl;
os << i << "->" << e.to << ": " << e.cost;
}
return os;
}
/**
* @brief graph.hpp
* @docs docs/graph/graph.md
*/
// line 4 "/home/seekworser/.cpp_lib/competitive_library/competitive/graph/warshall_floyd.hpp"
template <class Cost> bool warshall_floyd(
Graph<Cost> &G,
vector<vector<Cost>> &min_cost,
Cost inf=INF,
Cost identity=0
) {
min_cost = vector<vector<Cost>>(G.n, vector<Cost>(G.n, inf));
rep(i, G.n) repe(e, G[i]) {
min_cost[i][e.to] = e.cost;
}
rep(i, G.n) chmin(min_cost[i][i], identity);
rep(k, G.n) {
rep(i, G.n) {
rep(j, G.n) {
if (min_cost[i][k] == inf || min_cost[k][j] == inf) continue;
if (min_cost[i][j] == inf) {
min_cost[i][j] = min_cost[i][k] + min_cost[k][j];
} else {
chmin(min_cost[i][j], min_cost[i][k] + min_cost[k][j]);
}
}
}
}
rep(i, G.n) {
if (min_cost[i][i] < identity) return false;
}
return true;
}
/**
* @brief warshall_floyd.hpp
* @docs docs/graph/warshall_floyd.md
*/
// line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp"
// 演算子オーバーロード（プロトタイプ宣言）
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);
template <typename T> ostream &operator<<(ostream &os, queue<T> q);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <typename T> ostream &operator<<(ostream &os, stack<T> st);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);
// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }
template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };
template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {
cout << val << sep;
print_sep_end(sep, end, remain...);
return 0;
};
template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; };
template <typename... T> void flush() { cout << flush; };
template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };
#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print
template <typename T> void input(T &a) { cin >> a; };
template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };
#ifdef LOCAL_TEST
template <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
int scope = 0;
for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
cerr << name[i];
if (name[i] == '(' || name[i] == '{') scope++;
if (name[i] == ')' || name[i] == '}') scope--;
}
cerr << ":" << a << " ";
debug_func(i + 1, name, b...);
}
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {
int scope = 0;
for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
cerr << name[i];
if (name[i] == '(' || name[i] == '{') scope++;
if (name[i] == ')' || name[i] == '}') scope--;
}
cerr << ":" << a << " ";
debug_func(i + 1, name, b...);
}
#endif
#ifndef LOCAL_TEST
template <typename... T>
void debug_func(T &...) {}
template <typename... T>
void debug_func(const T &...) {}
#endif
/**
* @brief io.hpp
* @docs docs/std/io.md
*/
// line 75 "answer.cpp"
#endif