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

提出ソース

結果

問題	No.2236 Lights Out On Simple Graph
ユーザー	dyktr_06
提出日時	2023-03-03 23:13:31
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,856 bytes
コンパイル時間	5,004 ms
コンパイル使用メモリ	287,760 KB
実行使用メモリ	207,984 KB
最終ジャッジ日時	2024-09-18 00:24:06
合計ジャッジ時間	97,143 ms
ジャッジサーバーID （参考情報）	judge6 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	5 ms 6,944 KB
testcase_05	AC	3 ms 6,944 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	WA	-
testcase_11	AC	12 ms 6,940 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	487 ms 18,688 KB
testcase_16	AC	3,244 ms 75,008 KB
testcase_17	AC	2,861 ms 45,952 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	747 ms 33,024 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	AC	127 ms 9,088 KB
testcase_28	AC	687 ms 26,880 KB
testcase_29	AC	1,891 ms 50,176 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	AC	130 ms 9,728 KB
testcase_36	AC	263 ms 13,184 KB
testcase_37	WA	-
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	2 ms 6,944 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	1 ms 6,940 KB
testcase_42	WA	-
testcase_43	AC	2,061 ms 36,480 KB
testcase_44	WA	-
testcase_45	AC	8 ms 6,944 KB
testcase_46	AC	2 ms 6,940 KB
testcase_47	AC	2 ms 6,944 KB
testcase_48	AC	2 ms 6,944 KB
testcase_49	AC	1 ms 6,940 KB
testcase_50	AC	2 ms 6,940 KB
testcase_51	AC	2 ms 6,944 KB
testcase_52	AC	3 ms 6,940 KB
testcase_53	AC	2 ms 6,944 KB
testcase_54	AC	8 ms 6,940 KB
testcase_55	AC	171 ms 9,728 KB
testcase_56	AC	3 ms 6,940 KB
testcase_57	AC	11 ms 6,940 KB
testcase_58	AC	2 ms 6,940 KB
testcase_59	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
template<class T> bool insec(const T& a, const T& l, const T& r){ return l <= a && a < r; }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } 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, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct UnionFind{
    vector<int> par;
    vector<int> siz;
    vector<int> edg;

    UnionFind(int N) : par(N), siz(N), edg(N){
        for(int i = 0; i < N; ++i){
            par[i] = i;
            siz[i] = 1;
            edg[i] = 0;
        }
    }

    int root(int x){
        if(par[x] == x) return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if(rx == ry){
            edg[rx]++;
            return;
        }
        par[rx] = ry;
        siz[ry] += siz[rx];
        edg[ry] += edg[rx] + 1;
    }

    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    long long size(int x){
        return siz[root(x)];
    }

    long long edge(int x){
        return edg[root(x)];
    }
};

ll n, m;
vector<ll> a, b, c;
ll ti;

void input(){
    in(n, m);
    a.resize(m); b.resize(m);
    rep(i, m){
        in(a[i], b[i]);
    }
    vin(c, n);
}

ll solve2(vll v){
    ll siz = v.size();
    if(siz == 0){
        return 0;
    }
    map<ll, ll> conv;
    rep(i, siz) conv[v[i]] = i;
    map<string, ll> mp;
    queue<string> q;
    string s(siz, '$');
    ll cnt = 0;
    rep(i, siz){
        s[i] = c[v[i]] + '0';
        cnt += c[v[i]];
    }
    if(cnt % 2){
        return -1;
    }
    q.push(s); mp[s] = 0;
    string ans(siz, '0');
    while(q.size() && clock() - ti <= 350 * CLOCKS_PER_SEC / 100 && mp.count(ans) == 0){
        string t = q.front();
        q.pop();
        rep(i, m){
            string nxt = t;
            if(conv.count(a[i]) == 0 || conv.count(b[i]) == 0) continue;

            if(nxt[conv[a[i]]] == '0' && nxt[conv[b[i]]] == '0'){
                continue;
            }
            if(nxt[conv[a[i]]] == '1'){
                nxt[conv[a[i]]]--;
            }else{
                nxt[conv[a[i]]]++;
            }
            if(nxt[conv[b[i]]] == '1'){
                nxt[conv[b[i]]]--;
            }else{
                nxt[conv[b[i]]]++;
            }
            if(mp.count(nxt) == 0){
                mp[nxt] = mp[t] + 1;
                q.push(nxt);
            }
        }
    }
    if(mp.count(ans) == 0){
        return -1;
    }else{
        return mp[ans];
    }
}

void solve(){
    UnionFind dsu(n);
    rep(i, m){
        a[i]--, b[i]--;
        dsu.unite(a[i], b[i]);
    }
    vector<vll> group(n);
    rep(i, n){
        group[dsu.root(i)].push_back(i);
    }
    ll ans = 0;
    rep(i, n){
        ll res = solve2(group[i]);
        if(res == -1){
            ans = -1;
            break;
        }else{
            ans += res;
        }
    }
    out(ans);
}

int main(){
    ti = clock();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード