結果

問題 No.2236 Lights Out On Simple Graph
ユーザー 👑 seekworserseekworser
提出日時 2023-02-28 23:11:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,193 ms / 4,000 ms
コード長 9,212 bytes
コンパイル時間 2,568 ms
コンパイル使用メモリ 213,412 KB
実行使用メモリ 47,240 KB
最終ジャッジ日時 2023-10-15 02:39:41
合計ジャッジ時間 28,940 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,352 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,352 KB
testcase_03 AC 948 ms
47,064 KB
testcase_04 AC 508 ms
24,960 KB
testcase_05 AC 2 ms
4,356 KB
testcase_06 AC 687 ms
47,016 KB
testcase_07 AC 563 ms
13,996 KB
testcase_08 AC 1 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 187 ms
14,136 KB
testcase_11 AC 29 ms
4,352 KB
testcase_12 AC 267 ms
13,916 KB
testcase_13 AC 13 ms
4,424 KB
testcase_14 AC 578 ms
25,084 KB
testcase_15 AC 8 ms
4,352 KB
testcase_16 AC 17 ms
4,484 KB
testcase_17 AC 73 ms
8,608 KB
testcase_18 AC 2 ms
4,372 KB
testcase_19 AC 39 ms
5,772 KB
testcase_20 AC 431 ms
25,032 KB
testcase_21 AC 38 ms
5,860 KB
testcase_22 AC 958 ms
47,092 KB
testcase_23 AC 962 ms
47,132 KB
testcase_24 AC 596 ms
24,948 KB
testcase_25 AC 106 ms
8,592 KB
testcase_26 AC 946 ms
47,008 KB
testcase_27 AC 450 ms
25,112 KB
testcase_28 AC 598 ms
25,020 KB
testcase_29 AC 39 ms
5,868 KB
testcase_30 AC 937 ms
47,072 KB
testcase_31 AC 953 ms
47,016 KB
testcase_32 AC 952 ms
47,132 KB
testcase_33 AC 953 ms
47,008 KB
testcase_34 AC 926 ms
47,132 KB
testcase_35 AC 1,193 ms
47,008 KB
testcase_36 AC 792 ms
47,148 KB
testcase_37 AC 1,007 ms
47,240 KB
testcase_38 AC 443 ms
13,920 KB
testcase_39 AC 222 ms
4,356 KB
testcase_40 AC 306 ms
14,044 KB
testcase_41 AC 38 ms
5,644 KB
testcase_42 AC 174 ms
8,536 KB
testcase_43 AC 10 ms
4,352 KB
testcase_44 AC 783 ms
24,948 KB
testcase_45 AC 724 ms
25,180 KB
testcase_46 AC 685 ms
25,012 KB
testcase_47 AC 616 ms
24,956 KB
testcase_48 AC 906 ms
47,016 KB
testcase_49 AC 536 ms
14,000 KB
testcase_50 AC 7 ms
4,352 KB
testcase_51 AC 79 ms
5,780 KB
testcase_52 AC 8 ms
4,356 KB
testcase_53 AC 2 ms
4,352 KB
testcase_54 AC 393 ms
14,044 KB
testcase_55 AC 334 ms
8,596 KB
testcase_56 AC 286 ms
5,700 KB
testcase_57 AC 363 ms
8,596 KB
testcase_58 AC 261 ms
5,924 KB
testcase_59 AC 251 ms
5,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 <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での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 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/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_TEST
template <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_TEST
template <typename... T>
void debug_func(const T &...) {}
#endif
/**
 * @brief io.hpp
 * @docs docs/std/io.md
 */
#line 3 "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;
    }
    unordered_map<ll, int> mp;
    rep(bt, 1 << m1) {
        ll l(0);
        rep(i, m1) {
            if ((bt >> i) & 1) {
                l ^= 1LL << a[i];
                l ^= 1LL << b[i];
            }
        }
        if (mp.count(l)) chmin(mp[l], __popcount(bt));
        else mp[l] = __popcount(bt);
    }
    int ans = INF;
    rep(bt, 1 << m2) {
        ll r(0);
        rep(i, m2) {
            if ((bt >> i) & 1) {
                r ^= 1LL << a[m1+i];
                r ^= 1LL << b[m1+i];
            }
        }
        r ^= c;
        if (mp.count(r)) chmin(ans, mp[r] + __popcount(bt));
    }
    if (ans != INF) print(ans);
    else print(-1);
}
0