#define PROBLEM "https://yukicoder.me/problems/no/1777"
//
#include "../../template/template.hpp"
//
#include "../../math/sat-solver.hpp"
//
#include "../../graph/graph-template.hpp"
//
using namespace Nyaan;
struct Plane {
vector<int> nodes;
int index;
static int all_index;
Plane() : index(-1) {}
bool in(int u) const { return find(all(nodes), u) != end(nodes); }
bool in(int u, int v) const { return in(u) and in(v); }
bool edge_in(int u, int v) const {
if (u > v) swap(u, v);
auto itu = find(all(nodes), u);
auto itv = find(all(nodes), v);
if (itu == end(nodes) or itv == end(nodes)) return false;
if (itu + 1 == itv) return true;
if (itv + 1 == end(nodes) and itu == begin(nodes)) return true;
return false;
}
// 破壊的
Plane split(int u, int v) {
assert(in(u, v) and !edge_in(u, v));
Plane chd;
chd.set_index();
if (u > v) swap(u, v);
auto itl = find(all(nodes), u);
auto itr = find(all(nodes), v);
chd.nodes = {itl, itr + 1};
nodes.erase(itl + 1, itr);
return chd;
}
void set_index() { index = all_index++; }
friend ostream &operator<<(ostream &os, const Plane &p) {
os << endl;
os << "index : " << p.index << endl;
os << "nodes : " << p.nodes << endl;
os << endl;
return os;
}
};
int Plane::all_index = 0;
void Nyaan::solve() {
inl(N, M);
auto g = graph(N, M);
// 外周
Plane soto;
soto.set_index();
Plane naka;
naka.set_index();
{
vi init(N);
iota(all(init), 0);
soto.nodes = naka.nodes = init;
}
vector<Plane> ps;
ps.push_back(naka);
rep(i, N) each(j, g[i]) {
if (i > j) continue;
each(p, ps) {
if (p.in(i, j)) {
auto ch = p.split(i, j);
ps.push_back(ch);
break;
}
}
}
vp pg_es;
auto es_push = [&](int i, int j) {
if (i > j) swap(i, j);
pg_es.emplace_back(i, j);
};
rep(i, N) {
int j = (i + 1) % N;
each(p, ps) {
if (p.edge_in(i, j)) {
es_push(0, p.index);
break;
}
}
}
rep(i, N) each(j, g[i]) {
int p1 = -1, p2 = -1;
rep(k, sz(ps)) {
if (ps[k].edge_in(i, j)) {
p1 = k;
break;
}
}
reg(k, p1 + 1, sz(ps)) {
if (ps[k].edge_in(i, j)) {
p2 = k;
break;
}
}
if (p1 != -1 and p2 != -1) es_push(ps[p1].index, ps[p2].index);
}
pg_es = mkuni(pg_es);
ps.insert(begin(ps), soto);
M = sz(ps);
using Clause = vector<pair<int, bool>>;
SatSolver sat((N + M) * 4);
rep(i, N + M) {
Clause c;
rep(j, 4) c.emplace_back(i * 4 + j, true);
sat.add_clause(c);
}
auto add = [&](int a, int b) {
trc(a, b);
rep(j, 4) {
Clause c;
c.emplace_back(a * 4 + j, false);
c.emplace_back(b * 4 + j, false);
sat.add_clause(c);
}
};
rep(i, N) {
each(j, g[i]) add(i, j);
add(i, (i + 1) % N);
}
each2(i, j, pg_es) add(i + N, j + N);
each(p, ps) {
int i = p.index + N;
each(j, p.nodes) add(i, j);
}
auto sol = sat.solve();
trc(sol);
out(sol ? 4 : 5);
}
#line 1 "verify/verify-yuki/yuki-1777.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1777"
//
#line 2 "template/template.hpp"
using namespace std;
// intrinstic
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// utility
#line 1 "template/util.hpp"
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename U>
struct P : pair<T, U> {
template <typename... Args>
P(Args... args) : pair<T, U>(args...) {}
using pair<T, U>::first;
using pair<T, U>::second;
P &operator+=(const P &r) {
first += r.first;
second += r.second;
return *this;
}
P &operator-=(const P &r) {
first -= r.first;
second -= r.second;
return *this;
}
P &operator*=(const P &r) {
first *= r.first;
second *= r.second;
return *this;
}
template <typename S>
P &operator*=(const S &r) {
first *= r, second *= r;
return *this;
}
P operator+(const P &r) const { return P(*this) += r; }
P operator-(const P &r) const { return P(*this) -= r; }
P operator*(const P &r) const { return P(*this) *= r; }
template <typename S>
P operator*(const S &r) const {
return P(*this) *= r;
}
P operator-() const { return P{-first, -second}; }
};
using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;
constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;
template <typename T>
int sz(const T &t) {
return t.size();
}
template <typename T, typename U>
inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
inline T Max(const vector<T> &v) {
return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
return accumulate(begin(v), end(v), 0LL);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
return upper_bound(begin(v), end(v), a) - begin(v);
}
constexpr long long TEN(int n) {
long long ret = 1, x = 10;
for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
return ret;
}
template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
return make_pair(t, u);
}
template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
vector<T> ret(v.size() + 1);
if (rev) {
for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
} else {
for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
}
return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
vector<T> ret(v);
sort(ret.begin(), ret.end());
ret.erase(unique(ret.begin(), ret.end()), ret.end());
return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
vector<int> ord(N);
iota(begin(ord), end(ord), 0);
sort(begin(ord), end(ord), f);
return ord;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
int max_val = *max_element(begin(v), end(v));
vector<int> inv(max_val + 1, -1);
for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
return inv;
}
vector<int> mkiota(int n) {
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
return ret;
}
template <typename T>
T mkrev(const T &v) {
T w{v};
reverse(begin(w), end(w));
return w;
}
template <typename T>
bool nxp(vector<T> &v) {
return next_permutation(begin(v), end(v));
}
// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
vector<vector<T>> ret;
vector<T> v;
auto dfs = [&](auto rc, int i) -> void {
if (i == (int)a.size()) {
ret.push_back(v);
return;
}
for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
};
dfs(dfs, 0);
return ret;
}
// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
T res = I;
for (; n; f(a = a * a), n >>= 1) {
if (n & 1) f(res = res * a);
}
return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I) {
return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}
} // namespace Nyaan
#line 58 "template/template.hpp"
// bit operation
#line 1 "template/bitop.hpp"
namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
} // namespace Nyaan
#line 61 "template/template.hpp"
// inout
#line 1 "template/inout.hpp"
namespace Nyaan {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
istream &operator>>(istream &is, __int128_t &x) {
string S;
is >> S;
x = 0;
int flag = 0;
for (auto &c : S) {
if (c == '-') {
flag = true;
continue;
}
x *= 10;
x += c - '0';
}
if (flag) x = -x;
return is;
}
istream &operator>>(istream &is, __uint128_t &x) {
string S;
is >> S;
x = 0;
for (auto &c : S) {
x *= 10;
x += c - '0';
}
return is;
}
ostream &operator<<(ostream &os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
if (x == 0) return os << 0;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
} // namespace Nyaan
#line 64 "template/template.hpp"
// debug
#line 1 "template/debug.hpp"
namespace DebugImpl {
template <typename U, typename = void>
struct is_specialize : false_type {};
template <typename U>
struct is_specialize<
U, typename conditional<false, typename U::iterator, void>::type>
: true_type {};
template <typename U>
struct is_specialize<
U, typename conditional<false, decltype(U::first), void>::type>
: true_type {};
template <typename U>
struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {
};
void dump(const char& t) { cerr << t; }
void dump(const string& t) { cerr << t; }
void dump(const bool& t) { cerr << (t ? "true" : "false"); }
void dump(__int128_t t) {
if (t == 0) cerr << 0;
if (t < 0) cerr << '-', t = -t;
string S;
while (t) S.push_back('0' + t % 10), t /= 10;
reverse(begin(S), end(S));
cerr << S;
}
void dump(__uint128_t t) {
if (t == 0) cerr << 0;
string S;
while (t) S.push_back('0' + t % 10), t /= 10;
reverse(begin(S), end(S));
cerr << S;
}
template <typename U,
enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>
void dump(const U& t) {
cerr << t;
}
template <typename T>
void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {
string res;
if (t == Nyaan::inf) res = "inf";
if constexpr (is_signed<T>::value) {
if (t == -Nyaan::inf) res = "-inf";
}
if constexpr (sizeof(T) == 8) {
if (t == Nyaan::infLL) res = "inf";
if constexpr (is_signed<T>::value) {
if (t == -Nyaan::infLL) res = "-inf";
}
}
if (res.empty()) res = to_string(t);
cerr << res;
}
template <typename T, typename U>
void dump(const pair<T, U>&);
template <typename T>
void dump(const pair<T*, int>&);
template <typename T>
void dump(const T& t,
enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {
cerr << "[ ";
for (auto it = t.begin(); it != t.end();) {
dump(*it);
cerr << (++it == t.end() ? "" : ", ");
}
cerr << " ]";
}
template <typename T, typename U>
void dump(const pair<T, U>& t) {
cerr << "( ";
dump(t.first);
cerr << ", ";
dump(t.second);
cerr << " )";
}
template <typename T>
void dump(const pair<T*, int>& t) {
cerr << "[ ";
for (int i = 0; i < t.second; i++) {
dump(t.first[i]);
cerr << (i == t.second - 1 ? "" : ", ");
}
cerr << " ]";
}
void trace() { cerr << endl; }
template <typename Head, typename... Tail>
void trace(Head&& head, Tail&&... tail) {
cerr << " ";
dump(head);
if (sizeof...(tail) != 0) cerr << ",";
trace(forward<Tail>(tail)...);
}
} // namespace DebugImpl
#ifdef NyaanDebug
#define trc(...) \
do { \
cerr << "## " << #__VA_ARGS__ << " = "; \
DebugImpl::trace(__VA_ARGS__); \
} while (0)
#else
#define trc(...) (void(0))
#endif
#ifdef NyaanLocal
#define trc2(...) \
do { \
cerr << "## " << #__VA_ARGS__ << " = "; \
DebugImpl::trace(__VA_ARGS__); \
} while (0)
#else
#define trc2(...) (void(0))
#endif
#line 67 "template/template.hpp"
// macro
#line 1 "template/macro.hpp"
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define in2(s, t) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i]); \
}
#define in3(s, t, u) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i]); \
}
#define in4(s, t, u, v) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i], v[i]); \
}
#define die(...) \
do { \
Nyaan::out(__VA_ARGS__); \
return; \
} while (0)
#line 70 "template/template.hpp"
namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }
#line 4 "verify/verify-yuki/yuki-1777.test.cpp"
//
#line 2 "math/sat-solver.hpp"
#line 5 "math/sat-solver.hpp"
using namespace std;
// https://github.com/not522/CompetitiveProgramming/blob/master/old2/include/math/sat.hpp
class SatSolver {
private:
int n, qi;
vector<vector<pair<int, bool>>> cl;
vector<vector<int>> w[2];
vector<int> reason, level, que, activity;
void enqueue(int v, bool a, int r = -1) {
assigns[v] = a;
reason[v] = r;
level[v] = (que.empty() ? 1 : level[que.back()]);
que.emplace_back(v);
}
void add(const vector<pair<int, bool>> &clause) {
for (auto l : clause) w[l.second][l.first].emplace_back(cl.size());
cl.emplace_back(clause);
}
void analyze(int confl) {
int i = que.size(), lv = 1;
unordered_set<int> used;
vector<pair<int, bool>> learnt;
for (int cnt = 0; cnt || used.empty(); --cnt) {
for (auto q : cl[confl]) {
if (!used.emplace(q.first).second) continue;
activity[q.first] += 1e5;
if (level[q.first] == level[que.back()]) {
++cnt;
} else {
learnt.emplace_back(q);
lv = max(lv, level[q.first]);
}
}
while (!used.count(que[--i]))
;
confl = reason[que[i]];
}
learnt.emplace_back(que[i], !assigns[que[i]]);
for (; !que.empty() && level[que.back()] > lv; que.pop_back()) {
level[que.back()] = 0;
}
qi = que.size();
enqueue(learnt.back().first, learnt.back().second, cl.size());
add(learnt);
}
int propagate() {
for (; qi < int(que.size()); ++qi) {
for (int cr : w[!assigns[que[qi]]][que[qi]]) {
int cnt = 0;
for (auto &lit : cl[cr]) {
if (level[lit.first] == 0) {
activity[lit.first] += 1e3;
swap(lit, cl[cr][0]);
++cnt;
} else if (assigns[lit.first] == lit.second) {
swap(lit, cl[cr][0]);
cnt = -1;
break;
}
}
if (cnt == 0) return cr;
if (cnt == 1) enqueue(cl[cr][0].first, cl[cr][0].second, cr);
}
}
return -1;
}
public:
vector<bool> assigns;
SatSolver(int _n)
: n(_n), qi(0), reason(n), level(n), activity(n), assigns(n) {
w[0].resize(n), w[1].resize(n);
}
void add_clause(const vector<pair<int, bool>> &clause) { add(clause); }
void if_then(int v1, bool a1, int v2, bool a2) {
add(vector{make_pair(v1, !a1), make_pair(v2, a2)});
}
void set_val(int v, bool a) { add(vector{make_pair(v, a)}); }
bool solve() {
while (true) {
int confl = propagate();
if (confl != -1) {
if (level[que.back()] == 1u) return false;
for (auto &a : activity) a /= 1.05;
analyze(confl);
} else {
int k = -1;
for (int i = 0; i < n; ++i) {
if (level[i] == 0 && (k == -1 || activity[k] < activity[i])) k = i;
}
if (k == -1) return true;
enqueue(k, assigns[k]);
++level[k];
}
}
}
};
#line 6 "verify/verify-yuki/yuki-1777.test.cpp"
//
#line 2 "graph/graph-template.hpp"
template <typename T>
struct edge {
int src, to;
T cost;
edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}
edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnweightedGraph = vector<vector<int>>;
// Input of (Unweighted) Graph
UnweightedGraph graph(int N, int M = -1, bool is_directed = false,
bool is_1origin = true) {
UnweightedGraph g(N);
if (M == -1) M = N - 1;
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
if (is_1origin) x--, y--;
g[x].push_back(y);
if (!is_directed) g[y].push_back(x);
}
return g;
}
// Input of Weighted Graph
template <typename T>
WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,
bool is_1origin = true) {
WeightedGraph<T> g(N);
if (M == -1) M = N - 1;
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
T c;
cin >> c;
if (is_1origin) x--, y--;
g[x].emplace_back(x, y, c);
if (!is_directed) g[y].emplace_back(y, x, c);
}
return g;
}
// Input of Edges
template <typename T>
Edges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {
Edges<T> es;
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
T c;
if (is_weighted)
cin >> c;
else
c = 1;
if (is_1origin) x--, y--;
es.emplace_back(x, y, c);
}
return es;
}
// Input of Adjacency Matrix
template <typename T>
vector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,
bool is_directed = false, bool is_1origin = true) {
vector<vector<T>> d(N, vector<T>(N, INF));
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
T c;
if (is_weighted)
cin >> c;
else
c = 1;
if (is_1origin) x--, y--;
d[x][y] = c;
if (!is_directed) d[y][x] = c;
}
return d;
}
/**
* @brief グラフテンプレート
* @docs docs/graph/graph-template.md
*/
#line 8 "verify/verify-yuki/yuki-1777.test.cpp"
//
using namespace Nyaan;
struct Plane {
vector<int> nodes;
int index;
static int all_index;
Plane() : index(-1) {}
bool in(int u) const { return find(all(nodes), u) != end(nodes); }
bool in(int u, int v) const { return in(u) and in(v); }
bool edge_in(int u, int v) const {
if (u > v) swap(u, v);
auto itu = find(all(nodes), u);
auto itv = find(all(nodes), v);
if (itu == end(nodes) or itv == end(nodes)) return false;
if (itu + 1 == itv) return true;
if (itv + 1 == end(nodes) and itu == begin(nodes)) return true;
return false;
}
// 破壊的
Plane split(int u, int v) {
assert(in(u, v) and !edge_in(u, v));
Plane chd;
chd.set_index();
if (u > v) swap(u, v);
auto itl = find(all(nodes), u);
auto itr = find(all(nodes), v);
chd.nodes = {itl, itr + 1};
nodes.erase(itl + 1, itr);
return chd;
}
void set_index() { index = all_index++; }
friend ostream &operator<<(ostream &os, const Plane &p) {
os << endl;
os << "index : " << p.index << endl;
os << "nodes : " << p.nodes << endl;
os << endl;
return os;
}
};
int Plane::all_index = 0;
void Nyaan::solve() {
inl(N, M);
auto g = graph(N, M);
// 外周
Plane soto;
soto.set_index();
Plane naka;
naka.set_index();
{
vi init(N);
iota(all(init), 0);
soto.nodes = naka.nodes = init;
}
vector<Plane> ps;
ps.push_back(naka);
rep(i, N) each(j, g[i]) {
if (i > j) continue;
each(p, ps) {
if (p.in(i, j)) {
auto ch = p.split(i, j);
ps.push_back(ch);
break;
}
}
}
vp pg_es;
auto es_push = [&](int i, int j) {
if (i > j) swap(i, j);
pg_es.emplace_back(i, j);
};
rep(i, N) {
int j = (i + 1) % N;
each(p, ps) {
if (p.edge_in(i, j)) {
es_push(0, p.index);
break;
}
}
}
rep(i, N) each(j, g[i]) {
int p1 = -1, p2 = -1;
rep(k, sz(ps)) {
if (ps[k].edge_in(i, j)) {
p1 = k;
break;
}
}
reg(k, p1 + 1, sz(ps)) {
if (ps[k].edge_in(i, j)) {
p2 = k;
break;
}
}
if (p1 != -1 and p2 != -1) es_push(ps[p1].index, ps[p2].index);
}
pg_es = mkuni(pg_es);
ps.insert(begin(ps), soto);
M = sz(ps);
using Clause = vector<pair<int, bool>>;
SatSolver sat((N + M) * 4);
rep(i, N + M) {
Clause c;
rep(j, 4) c.emplace_back(i * 4 + j, true);
sat.add_clause(c);
}
auto add = [&](int a, int b) {
trc(a, b);
rep(j, 4) {
Clause c;
c.emplace_back(a * 4 + j, false);
c.emplace_back(b * 4 + j, false);
sat.add_clause(c);
}
};
rep(i, N) {
each(j, g[i]) add(i, j);
add(i, (i + 1) % N);
}
each2(i, j, pg_es) add(i + N, j + N);
each(p, ps) {
int i = p.index + N;
each(j, p.nodes) add(i, j);
}
auto sol = sat.solve();
trc(sol);
out(sol ? 4 : 5);
}
verify/verify-yuki/yuki-1777.test.cpp