結果
問題 | No.2236 Lights Out On Simple Graph |
ユーザー |
👑 |
提出日時 | 2023-02-28 22:43:18 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,600 ms / 4,000 ms |
コード長 | 12,596 bytes |
コンパイル時間 | 3,472 ms |
コンパイル使用メモリ | 267,768 KB |
実行使用メモリ | 47,376 KB |
最終ジャッジ日時 | 2024-09-16 20:12:29 |
合計ジャッジ時間 | 43,961 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
#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_TESTusing 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 <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-16;bool eq(const double x, const double y) { return abs(x - y) < EPSL; }bool eq(const float x, const float y) { return abs(x - y) < EPS; }template<typename T> bool eq(const T x, const T y) { return x == y; }template<typename T> bool neq(const T x, const T y) { return !(eq(x, y)); }template<typename T> bool ge(const T x, const T y) { return eq(x, y) || (x > y); }template<typename T> bool le(const T x, const T y) { return eq(x, y) || (x < y); }template<typename T> bool gt(const T x, const T y) { return !(le(x, y)); }template<typename T> bool lt(const T x, const T y) { return !(ge(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) ((int)(x).size())#define rep(i, n) for(ll i = 0, i##_len = ll(n); i < i##_len; ++i) // 0 から n-1 まで昇順#define repi(i, s, t) for(ll i = ll(s), i##_end = ll(t); i < i##_end; ++i) // s から t まで昇順#define repis(i, s, t, step) for(ll i = ll(s), i##_end = ll(t); i < i##_end; i+=step) // s から t まで stepずつ#define repir(i, s, t, step) for(ll i = ll(s), i##_end = ll(t); i > i##_end; i+=step) // s から t まで stepずつ#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());} // 重複除去void Yes(bool b) { cout << (b ? "Yes\n" : "No\n"); return; };void YES(bool b) { cout << (b ? "YES\n" : "NO\n"); return; };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> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };// modでのpowll 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;}// 整数Sqrtll sqrtll(ll x) {assert(x >= 0);ll hi(x), lo(0);while (hi != lo) {ll y = (hi + lo + 1) / 2;if (y <= x/y) lo = y;else hi = y - 1;}return lo;}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/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 reversed_edges() const {// Graph res;// int _n = res.n = n;// std::vector<int> buf(n+1, 0);// for(int v : E) ++buf[v];// 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(int v : operator[](u)) res.E[--buf[v]] = u;// 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 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/math/bit.hpp"namespace bit{bool lb(ll x) { return (x & 1); }bool get(ll x, int n) { return ((x >> n) & 1); }ll update(ll x, int n, bool b) { return (x & ~(1LL << n)) + (b << n); }ll lsb(ll x) { return -x & x; }int digit(ll x) { int rev=0; while(x) { rev++; x >>= 1; } return rev; }ll msb(ll x) { if (x==0) return 0; return 1LL << (digit(x) - 1); }int lsbd(ll x) {return digit(lsb(x)); }int count(ll x) { int rev=0; while(x) { if (lb(x)) rev++; x >>= 1; } return rev; }string to_string(ll x, bool rev=true) { stringstream ss; while (x) { ss << lb(x); x >>= 1;} string s(ss.str()); if (rev) reverse(all(s)); returns; }}/*** @brief bit.hpp* @docs docs/math/bit.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, 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, 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 <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; }template <typename T> void print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; };template <typename T1, typename... T2> void print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {cout << val << sep;print_sep_end(sep, end, remain...);};template <typename... T> void print(const T&...args) {print_sep_end(" ", "\n", args...);};#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print#ifdef LOCAL_TESTtemplate <typename T>void debug_func(int i, 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) {for ( ; name[i] != ',' && name[i] != '\0'; i++ ) cerr << name[i];cerr << ":" << a << " ";debug_func(i + 1, name, b...);}#endif#ifndef LOCAL_TESTtemplate <typename... T>void debug_func(const T &...) {}#endif/*** @brief io.hpp* @docs docs/std/io.md*/#line 5 "answer.cpp"int main() {int n,m;cin >> n >> m;int m1 = m / 2;int m2 = m - m1;vi a(m), b(m);rep(i, m) { cin >> a[i] >> b[i]; }--a; --b;ll c(0);rep(i, n) {int ci; cin >> ci;if (ci == 1) c += 1LL << i;}debug(bit::to_string(c));unordered_map<ll, int> mp;rep(bt, 1 << m1) {vb cn(n, false);rep(i, m1) {if (bit::get(bt, i)) {cn[a[i]] = !cn[a[i]];cn[b[i]] = !cn[b[i]];}}ll l = 0;rep(i, n) {if (cn[i]) l += (1LL << i);}debug(cn, l);if (mp.count(l)) chmin(mp[l], __popcount(bt));else mp[l] = __popcount(bt);}int ans = INF;rep(bt, 1 << m2) {vb cn(n, false);rep(i, m2) {if (bit::get(bt, i)) {cn[a[m1+i]] = !cn[a[m1+i]];cn[b[m1+i]] = !cn[b[m1+i]];}}ll r = 0;rep(i, n) {if (cn[i]) r += (1LL << i);}r ^= c;if (mp.count(r)) chmin(ans, mp[r] + __popcount(bt));}if (ans != INF) print(ans);else print(-1);}