結果

問題 No.2236 Lights Out On Simple Graph
ユーザー stoqstoq
提出日時 2023-03-03 22:38:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,631 ms / 4,000 ms
コード長 6,328 bytes
コンパイル時間 6,091 ms
コンパイル使用メモリ 278,536 KB
実行使用メモリ 103,108 KB
最終ジャッジ日時 2023-10-18 02:48:25
合計ジャッジ時間 44,676 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
14,840 KB
testcase_01 AC 32 ms
14,840 KB
testcase_02 AC 32 ms
14,840 KB
testcase_03 AC 1,540 ms
103,108 KB
testcase_04 AC 758 ms
80,920 KB
testcase_05 AC 33 ms
14,840 KB
testcase_06 AC 1,037 ms
103,108 KB
testcase_07 AC 1,027 ms
69,904 KB
testcase_08 AC 33 ms
14,840 KB
testcase_09 AC 32 ms
14,840 KB
testcase_10 AC 253 ms
31,424 KB
testcase_11 AC 61 ms
15,160 KB
testcase_12 AC 346 ms
36,968 KB
testcase_13 AC 48 ms
17,656 KB
testcase_14 AC 813 ms
58,952 KB
testcase_15 AC 47 ms
17,012 KB
testcase_16 AC 61 ms
18,960 KB
testcase_17 AC 112 ms
23,068 KB
testcase_18 AC 34 ms
15,160 KB
testcase_19 AC 107 ms
23,144 KB
testcase_20 AC 693 ms
58,952 KB
testcase_21 AC 101 ms
23,144 KB
testcase_22 AC 1,574 ms
103,108 KB
testcase_23 AC 1,569 ms
103,108 KB
testcase_24 AC 887 ms
58,952 KB
testcase_25 AC 222 ms
31,328 KB
testcase_26 AC 1,579 ms
103,108 KB
testcase_27 AC 738 ms
58,952 KB
testcase_28 AC 1,099 ms
80,920 KB
testcase_29 AC 102 ms
23,144 KB
testcase_30 AC 1,556 ms
103,108 KB
testcase_31 AC 1,524 ms
103,108 KB
testcase_32 AC 1,579 ms
103,108 KB
testcase_33 AC 1,541 ms
103,108 KB
testcase_34 AC 1,514 ms
103,108 KB
testcase_35 AC 1,631 ms
81,008 KB
testcase_36 AC 944 ms
61,872 KB
testcase_37 AC 1,619 ms
103,108 KB
testcase_38 AC 451 ms
28,520 KB
testcase_39 AC 274 ms
16,020 KB
testcase_40 AC 344 ms
31,424 KB
testcase_41 AC 84 ms
20,508 KB
testcase_42 AC 444 ms
42,360 KB
testcase_43 AC 45 ms
16,360 KB
testcase_44 AC 880 ms
47,736 KB
testcase_45 AC 1,250 ms
80,920 KB
testcase_46 AC 992 ms
58,952 KB
testcase_47 AC 1,102 ms
80,920 KB
testcase_48 AC 1,194 ms
70,056 KB
testcase_49 AC 1,001 ms
69,904 KB
testcase_50 AC 39 ms
15,160 KB
testcase_51 AC 206 ms
28,596 KB
testcase_52 AC 40 ms
15,424 KB
testcase_53 AC 32 ms
14,840 KB
testcase_54 AC 614 ms
36,968 KB
testcase_55 AC 409 ms
23,068 KB
testcase_56 AC 338 ms
20,508 KB
testcase_57 AC 427 ms
25,972 KB
testcase_58 AC 310 ms
18,396 KB
testcase_59 AC 309 ms
18,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
// #include <atcoder/lazysegtree>
// #include <atcoder/modint>
// #include <atcoder/segtree>
using namespace atcoder;
#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#pragma region Macros
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr ld EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define RREP(i, m, n) for (ll i = n - 1; i >= m; i--)
#define rrep(i, m, n) RREP(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}
random_device seed_gen;
mt19937_64 engine(seed_gen());
inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; }
struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};
BiCoef bc(1000010);
#pragma endregion

// -------------------------------

unordered_map<ll, int> A, B;

void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m), b(m);
  rep(i, m) {
    cin >> a[i] >> b[i];
    a[i]--, b[i]--;
  }
  ll goal = 0;
  rep(i, n) {
    int c;
    cin >> c;
    if (c == 1) goal |= 1LL << i;
  }

  vector<int> L, R;
  rep(i, m) {
    if (i < m / 2)
      L.push_back(i);
    else
      R.push_back(i);
  }

  rep(msk, 1 << L.size()) {
    ll bit = 0;
    rep(i, L.size()) {
      if (not((1 << i) & msk)) continue;
      bit ^= 1LL << a[L[i]];
      bit ^= 1LL << b[L[i]];
    }
    if (A.count(bit))
      chmin(A[bit], __builtin_popcount(msk));
    else
      A[bit] = __builtin_popcount(msk);
  }

  rep(msk, 1 << R.size()) {
    ll bit = 0;
    rep(i, R.size()) {
      if (not((1 << i) & msk)) continue;
      bit ^= 1LL << a[R[i]];
      bit ^= 1LL << b[R[i]];
    }
    if (B.count(bit))
      chmin(B[bit], __builtin_popcount(msk));
    else
      B[bit] = __builtin_popcount(msk);
  }
  int ans = INF;
  for (auto [bit, cnt1] : A) {
    if (not B.count(bit ^ goal)) continue;
    chmin(ans, cnt1 + B[bit ^ goal]);
  }
  cout << (ans == INF ? -1 : ans) << "\n";
}

int main() { solve(); }
0