#845826 (C++17) No.2236 Lights Out On Simple Graph

• 問題: No.2236 Lights Out On Simple Graph
• ユーザー: kwm_t
• 提出日時: 2023-03-03 22:35:54
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,491 ms / 4,000 ms
• コード長: 2,409 bytes
• コンパイル時間: 2,126 ms
• コンパイル使用メモリ: 206,324 KB
• 最終ジャッジ日時: 2025-02-11 03:18:39
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 57

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
int popcount(long long n) {
    n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
    n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
    n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
    n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
    n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
    n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
    return n;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m; cin >> n >> m;
    vector<P>e(m);
    rep(i, m) {
        cin >> e[i].first >> e[i].second;
        e[i].first--;
        e[i].second--;
    }
    vector<int>v(n);
    rep(i, n)cin >> v[i];
    int l = m / 2;//[0,l)
    int r = m - l;//[l,n)
    map<long long, int>ldp, rdp;
    rep(i, 1 << l) {
        vector<long long>cnt(n);
        rep(j, l) {
            if (1 & (i >> j)) {
                int idx = j;
                cnt[e[idx].first] ^= 1;
                cnt[e[idx].second] ^= 1;
            }
        }
        long long x = 0;
        rep(j, n) x += cnt[j] << j;
        if (!ldp.count(x))ldp[x] = popcount(i);
        else chmin(ldp[x], popcount(i));
    }
    rep(i, 1 << r) {
        vector<long long>cnt(n);
        rep(j, r) {
            if (1 & (i >> j)) {
                int idx = j + l;
                cnt[e[idx].first] ^= 1;
                cnt[e[idx].second] ^= 1;
            }
        }
        long long x = 0;
        rep(j, n) x += cnt[j] << j;
        if (!rdp.count(x))rdp[x] = popcount(i);
        else chmin(rdp[x], popcount(i));
    }
    int ans = INF;
    for (auto [key, val] : ldp) {
        long long x = 0;
        rep(i, n) {
            long long bit = 1 & (key >> i);
            bit ^= v[i];
            x += bit << i;
        }
        if (rdp.count(x))chmin(ans, val + rdp[x]);
    }
    if (INF == ans)ans = -1;
    cout << ans << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX