結果
問題 | No.2376 障害物競プロ |
ユーザー |
![]() |
提出日時 | 2023-07-07 22:01:38 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 445 ms / 4,000 ms |
コード長 | 19,478 bytes |
コンパイル時間 | 4,468 ms |
コンパイル使用メモリ | 292,320 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-21 18:04:09 |
合計ジャッジ時間 | 57,100 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 40 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {assert(!que.empty());T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {assert(!que.empty());T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace fastio {#define FASTIO// クラスが read(), print() を持っているかを判定するメタ関数struct has_write_impl {template <class T>static auto check(T &&x) -> decltype(x.write(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {};struct has_read_impl {template <class T>static auto check(T &&x) -> decltype(x.read(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <typename T,typename enable_if<has_read<T>::value>::type * = nullptr>inline bool read_single(T &x) {x.read();return true;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <size_t N = 0, typename T>void read_single_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);read_single(x);read_single_tuple<N + 1>(t);}}template <class... T>bool read_single(tuple<T...> &tpl) {read_single_tuple(tpl);return true;}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}template <typename T,typename enable_if<has_write<T>::value>::type * = nullptr>inline void write(T x) {x.write();}template <class T>void write(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> val) {write(val.first);write(' ');write(val.second);}template <size_t N = 0, typename T>void write_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { write(' '); }const auto x = std::get<N>(t);write(x);write_tuple<N + 1>(t);}}template <class... T>bool write(tuple<T...> tpl) {write_tuple(tpl);return true;}template <class T, size_t S>void write(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if (val < 0) {negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if (negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}} // namespace fastiousing fastio::print;using fastio::flush;using fastio::read;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/geo/base.hpp"template <typename T>struct Point {T x, y;Point() = default;template <typename A, typename B>Point(A x, B y) : x(x), y(y) {}template <typename A, typename B>Point(pair<A, B> p) : x(p.fi), y(p.se) {}Point operator+(Point p) const { return {x + p.x, y + p.y}; }Point operator-(Point p) const { return {x - p.x, y - p.y}; }bool operator==(Point p) const { return x == p.x && y == p.y; }bool operator!=(Point p) const { return x != p.x || y != p.y; }Point operator-() const { return {-x, -y}; }bool operator<(Point p) const {if (x != p.x) return x < p.x;return y < p.y;}T dot(Point other) { return x * other.x + y * other.y; }T det(Point other) { return x * other.y - y * other.x; }void read() { fastio::read(x), fastio::read(y); }void write() { fastio::printer.write(pair<T, T>({x, y})); }};// A -> B -> C と進むときに、左に曲がるならば +1、右に曲がるならば -1template <typename T>int ccw(Point<T> A, Point<T> B, Point<T> C) {T x = (B - A).det(C - A);if (x > 0) return 1;if (x < 0) return -1;return 0;}template <typename REAL, typename T>REAL dist(Point<T> A, Point<T> B) {A = A - B;T p = A.dot(A);return sqrt(REAL(p));}template <typename T>struct Line {T a, b, c;Line(T a, T b, T c) : a(a), b(b), c(c) {}Line(Point<T> A, Point<T> B) {a = A.y - B.y, b = B.x - A.x, c = A.x * B.y - A.y * B.x;}Line(T x1, T y1, T x2, T y2) : Line(Point<T>(x1, y1), Point<T>(x2, y2)) {}template <typename U>U eval(Point<U> P) {return a * P.x + b * P.y + c;}template <typename U>T eval(U x, U y) {return a * x + b * y + c;}bool is_parallel(Line other) { return a * other.b - b * other.a == 0; }bool is_orthogonal(Line other) { return a * other.a + b * other.b == 0; }};template <typename T>struct Segment {Point<T> A, B;Segment(Point<T> A, Point<T> B) : A(A), B(B) {}Segment(T x1, T y1, T x2, T y2): Segment(Point<T>(x1, y1), Point<T>(x2, y2)) {}template <enable_if_t<is_integral<T>::value, int> = 0>bool contain(Point<T> C) {T det = (C - A).det(B - A);if (det != 0) return 0;return (C - A).dot(B - A) >= 0 && (C - B).dot(A - B) >= 0;}Line<T> to_Line() { return Line(A, B); }};template <typename REAL>struct Circle {Point<REAL> O;REAL r;Circle(Point<REAL> O, REAL r) : O(O), r(r) {}Circle(REAL x, REAL y, REAL r) : O(x, y), r(r) {}template <typename T>bool contain(Point<T> p) {REAL dx = p.x - O.x, dy = p.y - O.y;return dx * dx + dy * dy <= r * r;}};template <typename T>struct Polygon {vc<Point<T>> points;T a;template <typename A, typename B>Polygon(vc<pair<A, B>> pairs) {for (auto&& [a, b]: pairs) points.eb(Point<T>(a, b));build();}Polygon(vc<Point<T>> points) : points(points) { build(); }int size() { return len(points); }template <typename REAL>REAL area() {return a * 0.5;}template <enable_if_t<is_integral<T>::value, int> = 0>T area_2() {return a;}bool is_convex() {FOR(j, len(points)) {int i = (j == 0 ? len(points) - 1 : j - 1);int k = (j == len(points) - 1 ? 0 : j + 1);if ((points[j] - points[i]).det(points[k] - points[j]) < 0) return false;}return true;}private:void build() {a = 0;FOR(i, len(points)) {int j = (i + 1 == len(points) ? 0 : i + 1);a += points[i].det(points[j]);}if (a < 0) {a = -a;reverse(all(points));}}};#line 2 "/home/maspy/compro/library/geo/cross_point.hpp"// 平行でないことを仮定template <typename REAL, typename T>Point<REAL> cross_point(const Line<T> L1, const Line<T> L2) {T det = L1.a * L2.b - L1.b * L2.a;assert(det != 0);REAL x = -REAL(L1.c) * L2.b + REAL(L1.b) * L2.c;REAL y = -REAL(L1.a) * L2.c + REAL(L1.c) * L2.a;return Point<REAL>(x / det, y / det);}// 0: 交点なし// 1: 一意な交点// 2:2 つ以上の交点(整数型を利用して厳密にやる)template <typename T, enable_if_t<is_integral<T>::value, int> = 0>int count_cross(Segment<T> S1, Segment<T> S2, bool include_ends) {Line<T> L1 = S1.to_Line();Line<T> L2 = S2.to_Line();if (L1.is_parallel(L2)) {if (L1.eval(S2.A) != 0) return 0;// 4 点とも同一直線上にあるT a1 = S1.A.x, b1 = S1.B.x;T a2 = S2.A.x, b2 = S2.B.x;if (a1 == b1) {a1 = S1.A.y, b1 = S1.B.y;a2 = S2.A.y, b2 = S2.B.y;}if (a1 > b1) swap(a1, b1);if (a2 > b2) swap(a2, b2);T a = max(a1, a2);T b = min(b1, b2);if (a < b) return 2;if (a > b) return 0;return (include_ends ? 1 : 0);}// 平行でない場合T a1 = L2.eval(S1.A), b1 = L2.eval(S1.B);T a2 = L1.eval(S2.A), b2 = L1.eval(S2.B);if (a1 > b1) swap(a1, b1);if (a2 > b2) swap(a2, b2);bool ok1 = 0, ok2 = 0;if (include_ends) {ok1 = (a1 <= 0) && (0 <= b1);ok2 = (a2 <= 0) && (0 <= b2);} else {ok1 = (a1 < 0) && (0 < b1);ok2 = (a2 < 0) && (0 < b2);}return (ok1 && ok2 ? 1 : 0);}#line 6 "main.cpp"using P = Point<ll>;void solve() {LL(N, M);VEC(P, dat, N + N);using Re = double;vv(Re, dp, N + N, N + N, infty<Re>);auto can = [&](int i, int j) -> bool {if (i == j) return 1;P A = dat[i], B = dat[j];Segment<ll> AB(A, B);FOR(k, N) {Segment<ll> seg(dat[2 * k + 0], dat[2 * k + 1]);ll det = (A - B).det(seg.A - seg.B);if (det == 0) continue;if (seg.contain(A) || seg.contain(B)) continue;int t = count_cross<ll>(seg, AB, 0);assert(t != 2);if (t) return false;}return true;};FOR(i, N + N) FOR(j, N + N) {if (!can(i, j)) continue;dp[i][j] = dist<Re, ll>(dat[i], dat[j]);}FOR(k, N + N) FOR(i, N + N) FOR(j, N + N) {chmin(dp[i][j], dp[i][k] + dp[k][j]);}// FOR(i, N + N) print(dp[i]);FOR(M) {LL(a, b, c, d);--a, --b, --c, --d;a = 2 * a + b;c = 2 * c + d;print(dp[a][c]);}}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}