結果
問題 | No.1777 万華鏡美術館 |
ユーザー |
![]() |
提出日時 | 2023-11-21 22:46:00 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 3,153 ms |
コード長 | 25,788 bytes |
コンパイル時間 | 6,530 ms |
コンパイル使用メモリ | 344,984 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-26 07:20:28 |
合計ジャッジ時間 | 7,304 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 |
ソースコード
#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;using u128 = unsigned __int128;using f128 = __float128;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); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(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>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#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) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {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;(check(x) ? ok : ng) = 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;(check(x) ? ok : ng) = 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"#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_t pil = 0, pir = 0, por = 0;struct Pre {char num[10000][4];constexpr Pre() : num() {for (int i = 0; i < 10000; i++) {int n = i;for (int j = 3; j >= 0; j--) {num[i][j] = n % 10 | '0';n /= 10;}}}} constexpr pre;inline void load() {memcpy(ibuf, ibuf + pil, pir - pil);pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __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/graph/base.hpp"template <typename T>struct Edge {int frm, to;T cost;int id;};template <typename T = int, bool directed = false>struct Graph {static constexpr bool is_directed = directed;int N, M;using cost_type = T;using edge_type = Edge<T>;vector<edge_type> edges;vector<int> indptr;vector<edge_type> csr_edges;vc<int> vc_deg, vc_indeg, vc_outdeg;bool prepared;class OutgoingEdges {public:OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}const edge_type* begin() const {if (l == r) { return 0; }return &G->csr_edges[l];}const edge_type* end() const {if (l == r) { return 0; }return &G->csr_edges[r];}private:const Graph* G;int l, r;};bool is_prepared() { return prepared; }Graph() : N(0), M(0), prepared(0) {}Graph(int N) : N(N), M(0), prepared(0) {}void build(int n) {N = n, M = 0;prepared = 0;edges.clear();indptr.clear();csr_edges.clear();vc_deg.clear();vc_indeg.clear();vc_outdeg.clear();}void add(int frm, int to, T cost = 1, int i = -1) {assert(!prepared);assert(0 <= frm && 0 <= to && to < N);if (i == -1) i = M;auto e = edge_type({frm, to, cost, i});edges.eb(e);++M;}#ifdef FASTIO// wt, offvoid read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }void read_graph(int M, bool wt = false, int off = 1) {for (int m = 0; m < M; ++m) {INT(a, b);a -= off, b -= off;if (!wt) {add(a, b);} else {T c;read(c);add(a, b, c);}}build();}#endifvoid build() {assert(!prepared);prepared = true;indptr.assign(N + 1, 0);for (auto&& e: edges) {indptr[e.frm + 1]++;if (!directed) indptr[e.to + 1]++;}for (int v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }auto counter = indptr;csr_edges.resize(indptr.back() + 1);for (auto&& e: edges) {csr_edges[counter[e.frm]++] = e;if (!directed)csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});}}OutgoingEdges operator[](int v) const {assert(prepared);return {this, indptr[v], indptr[v + 1]};}vc<int> deg_array() {if (vc_deg.empty()) calc_deg();return vc_deg;}pair<vc<int>, vc<int>> deg_array_inout() {if (vc_indeg.empty()) calc_deg_inout();return {vc_indeg, vc_outdeg};}int deg(int v) {if (vc_deg.empty()) calc_deg();return vc_deg[v];}int in_deg(int v) {if (vc_indeg.empty()) calc_deg_inout();return vc_indeg[v];}int out_deg(int v) {if (vc_outdeg.empty()) calc_deg_inout();return vc_outdeg[v];}#ifdef FASTIOvoid debug() {print("Graph");if (!prepared) {print("frm to cost id");for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);} else {print("indptr", indptr);print("frm to cost id");FOR(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);}}#endifvc<int> new_idx;vc<bool> used_e;// G における頂点 V[i] が、新しいグラフで i になるようにする// {G, es}Graph<T, directed> rearrange(vc<int> V, bool keep_eid = 0) {if (len(new_idx) != N) new_idx.assign(N, -1);if (len(used_e) != M) used_e.assign(M, 0);int n = len(V);FOR(i, n) new_idx[V[i]] = i;Graph<T, directed> G(n);vc<int> history;FOR(i, n) {for (auto&& e: (*this)[V[i]]) {if (used_e[e.id]) continue;int a = e.frm, b = e.to;if (new_idx[a] != -1 && new_idx[b] != -1) {history.eb(e.id);used_e[e.id] = 1;int eid = (keep_eid ? e.id : -1);G.add(new_idx[a], new_idx[b], e.cost, eid);}}}FOR(i, n) new_idx[V[i]] = -1;for (auto&& eid: history) used_e[eid] = 0;G.build();return G;}private:void calc_deg() {assert(vc_deg.empty());vc_deg.resize(N);for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;}void calc_deg_inout() {assert(vc_indeg.empty());vc_indeg.resize(N);vc_outdeg.resize(N);for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }}};#line 2 "/home/maspy/compro/library/geo/base.hpp"template <typename T>struct Point {T x, y;Point() : x(0), y(0) {}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}; }Point operator*(T t) const { return {x * t, y * t}; }Point operator/(T t) const { return {x / t, y / t}; }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; }double norm() { return sqrtl(x * x + y * y); }double angle() { return atan2(y, x); }Point rotate(double theta) {static_assert(!is_integral<T>::value);double c = cos(theta), s = sin(theta);return Point{c * x - s * y, s * x + c * y};}};#ifdef FASTIOtemplate <typename T>void rd(Point<T>& p) {fastio::rd(p.x), fastio::rd(p.y);}template <typename T>void wt(Point<T>& p) {fastio::wt(p.x);fastio::wt(' ');fastio::wt(p.y);}#endif// 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;}// 同じ直線が同じ a,b,c で表現されるようにするvoid normalize() {static_assert(is_same_v<T, int> || is_same_v<T, long long>);T g = gcd(gcd(abs(a), abs(b)), abs(c));a /= g, b /= g, c /= g;if (b < 0) { a = -a, b = -b, c = -c; }if (b == 0 && a < 0) { a = -a, b = -b, c = -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)) {}bool contain(Point<T> C) {static_assert(is_integral<T>::value);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/angle_sort.hpp"#line 4 "/home/maspy/compro/library/geo/angle_sort.hpp"// 偏角ソートに対する argsorttemplate <typename T>vector<int> angle_sort(vector<Point<T>>& P) {vector<int> lower, origin, upper;const Point<T> O = {0, 0};FOR(i, len(P)) {if (P[i] == O) origin.eb(i);elif ((P[i].y < 0) || (P[i].y == 0 && P[i].x > 0)) lower.eb(i);else upper.eb(i);}sort(all(lower), [&](auto& i, auto& j) { return P[i].det(P[j]) > 0; });sort(all(upper), [&](auto& i, auto& j) { return P[i].det(P[j]) > 0; });auto& I = lower;I.insert(I.end(), all(origin));I.insert(I.end(), all(upper));return I;}// 偏角ソートに対する argsorttemplate <typename T>vector<int> angle_sort(vector<pair<T, T>>& P) {vc<Point<T>> tmp(len(P));FOR(i, len(P)) tmp[i] = Point<T>(P[i]);return angle_sort<T>(tmp);}#line 7 "main.cpp"/*・連結平面グラフになっていないときにどう動作するかは何も考えていない・N=1 も扱わない*/template <typename XY>struct Planar_Graph {using P = Point<XY>;int NV, NE, NF;// 頂点, 辺からなるグラフ. 有向辺を 2 つ入れておくGraph<int, 1> G;// 頂点属性vc<P> point; // 座標// 辺属性vc<int> left_face; // 有向辺の左にある面の番号vc<int> nxt_edge; // 面を反時計回りにまわるときの次の辺// 面属性vc<int> first_edge;Planar_Graph(int N, vc<P> point) : NV(N), G(N), point(point) {assert(N > 1);}void add(int a, int b) { G.add(a, b), G.add(b, a); }void build() {G.build();NE = G.M / 2;nxt_edge.assign(G.M, -1);left_face.assign(G.M, -1);int v0 = 0;int e0 = 0;FOR(v, NV) {if (point[v] < point[v0]) v0 = v;vc<int> eid;vc<P> dir;for (auto& e: G[v]) {eid.eb(e.id);dir.eb(point[e.to] - point[e.frm]);}auto I = angle_sort(dir);assert(len(I) > 0);FOR(k, len(I)) {int i = (k == 0 ? I.back() : I[k - 1]);int j = I[k];i = eid[i], j = eid[j];nxt_edge[j ^ 1] = i;}if (v == v0) e0 = eid[I[0] ^ 1];}for (auto& x: nxt_edge) assert(x != -1);auto make_face = [&](int e) -> void {int p = len(first_edge);first_edge.eb(e);while (left_face[e] == -1) {left_face[e] = p;e = nxt_edge[e];}};make_face(e0);FOR(e, 2 * NE) {if (left_face[e] == -1) make_face(e);}NF = len(first_edge);assert(NV - NE + NF == 2);}// return {vs, es}// vs = [v0,v1,v2,v0], es = [e0,e1,e2]pair<vc<int>, vc<int>> get_face_data(int fid) {vc<int> eid = {first_edge[fid]};while (1) {int e = nxt_edge[eid.back()];if (e == first_edge[fid]) break;eid.eb(e);}vc<int> vid;for (auto& e: eid) vid.eb(G.edges[e].frm);vid.eb(vid[0]);return {vid, eid};}};/*・答は 4 or 5 である・4 で塗ろうとする・ある面とその頂点が確定する、隣接する面も確定するはず・結局、陽にグラフを作ってひとつの面を塗ったあと、確定するはずのところを決めていく*/using Re = double;const Re PI = acos(-1);void solve() {INT(N, M);vc<Point<Re>> point(N);FOR(i, N) point[i] = {cos(2 * PI / N * i), sin(2 * PI / N * i)};Planar_Graph<double> PG(N, point);FOR(i, N) { PG.add(i, (i + 1) % N); }FOR(M) {INT(a, b);--a, --b;PG.add(a, b);}PG.build();int NF = PG.NF;Graph<int, 0> G(N + NF);vc<pi> edges;// v-vfor (auto& e: PG.G.edges) { edges.eb(e.frm, e.to); }// v-fFOR(f, NF) {auto [vs, es] = PG.get_face_data(f);for (auto& v: vs) edges.eb(v, N + f);}// f-fFOR(i, PG.NE) {int a = PG.left_face[2 * i + 0];int b = PG.left_face[2 * i + 1];edges.eb(N + a, N + b);}for (auto& [a, b]: edges) {if (a > b) swap(a, b);}UNIQUE(edges);for (auto& [a, b]: edges) { G.add(a, b); }G.build();N = G.N;vc<int> cand(N, 15);vc<int> color(N, -1);pqg<pi> que;FOR(v, N) que.emplace(popcnt(cand[v]), v);auto set_color = [&](int v, int k) -> void {assert(color[v] == -1);color[v] = k;for (auto& e: G[v]) {int w = e.to;cand[w] &= ~(1 << k);if (color[w] == -1) que.emplace(popcnt(cand[w]), w);}};set_color(PG.NV, 0); // outerset_color(0, 1);set_color(1, 2);// 決まらない場合もあるらしいがやってみるwhile (len(que)) {int v = POP(que).se;if (color[v] != -1) continue;if (cand[v] == 0) return print(5);int k = topbit(cand[v]);set_color(v, k);}for (auto& c: color)if (c == -1) return print(5);for (auto& e: G.edges)if (color[e.frm] == color[e.to]) return print(5);print(4);}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}