結果

問題 No.2236 Lights Out On Simple Graph
ユーザー woodywoodywoodywoody
提出日時 2023-03-04 04:30:55
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,346 ms / 4,000 ms
コード長 5,500 bytes
コンパイル時間 3,488 ms
コンパイル使用メモリ 238,912 KB
実行使用メモリ 91,464 KB
最終ジャッジ日時 2024-09-18 00:56:33
合計ジャッジ時間 37,146 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1,346 ms
91,412 KB
testcase_04 AC 678 ms
69,332 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 978 ms
91,352 KB
testcase_07 AC 869 ms
58,292 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 205 ms
19,516 KB
testcase_11 AC 42 ms
6,940 KB
testcase_12 AC 295 ms
25,144 KB
testcase_13 AC 24 ms
6,944 KB
testcase_14 AC 699 ms
47,100 KB
testcase_15 AC 19 ms
6,940 KB
testcase_16 AC 36 ms
7,260 KB
testcase_17 AC 93 ms
11,404 KB
testcase_18 AC 4 ms
6,940 KB
testcase_19 AC 78 ms
11,436 KB
testcase_20 AC 569 ms
47,104 KB
testcase_21 AC 79 ms
11,564 KB
testcase_22 AC 1,263 ms
91,336 KB
testcase_23 AC 1,270 ms
91,392 KB
testcase_24 AC 725 ms
47,176 KB
testcase_25 AC 164 ms
19,452 KB
testcase_26 AC 1,341 ms
91,332 KB
testcase_27 AC 511 ms
47,180 KB
testcase_28 AC 863 ms
69,200 KB
testcase_29 AC 79 ms
11,440 KB
testcase_30 AC 1,220 ms
91,464 KB
testcase_31 AC 1,302 ms
91,416 KB
testcase_32 AC 1,340 ms
91,336 KB
testcase_33 AC 1,244 ms
91,372 KB
testcase_34 AC 1,275 ms
91,380 KB
testcase_35 AC 1,171 ms
69,280 KB
testcase_36 AC 847 ms
50,060 KB
testcase_37 AC 1,247 ms
91,416 KB
testcase_38 AC 510 ms
16,836 KB
testcase_39 AC 341 ms
6,944 KB
testcase_40 AC 321 ms
19,640 KB
testcase_41 AC 64 ms
8,612 KB
testcase_42 AC 306 ms
30,664 KB
testcase_43 AC 18 ms
6,940 KB
testcase_44 AC 738 ms
36,092 KB
testcase_45 AC 1,116 ms
69,328 KB
testcase_46 AC 849 ms
47,092 KB
testcase_47 AC 996 ms
69,204 KB
testcase_48 AC 998 ms
58,236 KB
testcase_49 AC 900 ms
58,180 KB
testcase_50 AC 9 ms
6,940 KB
testcase_51 AC 175 ms
16,848 KB
testcase_52 AC 12 ms
6,940 KB
testcase_53 AC 2 ms
6,940 KB
testcase_54 AC 507 ms
25,112 KB
testcase_55 AC 488 ms
11,296 KB
testcase_56 AC 450 ms
8,612 KB
testcase_57 AC 515 ms
14,100 KB
testcase_58 AC 448 ms
6,940 KB
testcase_59 AC 434 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    int n,m; cin>>n>>m;
    int m1 = m/2;
    int m2 = m - m1;
    unordered_map<ll,int> mp;
    unordered_map<ll,int> mp2;

    vpii e(m);
    rep(i,m){
        int a,b; cin>>a>>b;
        a--; b--;
        e[i] = {a,b};
    }
    vi v(n);
    rep(i,n) cin>>v[i];
    string s2,s;
    rep(i,n){
        s2 += '0' + v[i];
        s += '0';
    }
    // string s; cin>>s;

    int l1 = 1 << m1;
    int l2 = 1 << m2;
    auto swap_c = [&](string& t,int i)->void{
        char c = t[i];
        if (c=='0') c = '1';
        else c = '0';
        t[i] = c;
    };
    rep(i,l1){
        string t = s;
        rep(j,m1){
            if ((i>>j&1) == 1){
                swap_c(t,e[j].fi);
                swap_c(t,e[j].se);
            }
        }
        ll tar = 0;
        rep(j,n) if (t[j]=='1') tar += (1ll << j);
        int p = pcnt(i);
        if (mp.count(tar)) chmin(mp[tar],p);
        else mp[tar] = p;
    }
    rep(i,l2){
        string t = s;
        rep(j,m2){
            if ((i>>j&1) == 1){
                swap_c(t,e[j+m1].fi);
                swap_c(t,e[j+m1].se);
            }
        }
        ll tar = 0;
        rep(j,n) if (t[j]=='1') tar += (1ll << j);
        int p = pcnt(i);
        if (mp2.count(tar)) chmin(mp2[tar],p);
        else mp2[tar] = p;
    }
    int ans = INF;
    ll tar = 0;
    rep(i,n) if (s2[i]=='1') tar += (1ll << i);
    fore(y , mp){
        ll k = tar^y.fi;
        if (mp2.count(k)) chmin(ans , y.se+mp2[k]);
    }
    if (ans==INF) ans = -1;
    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0