結果
問題 | No.2236 Lights Out On Simple Graph |
ユーザー | AngrySadEight |
提出日時 | 2023-03-03 23:25:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,071 ms / 4,000 ms |
コード長 | 6,048 bytes |
コンパイル時間 | 7,301 ms |
コンパイル使用メモリ | 318,008 KB |
実行使用メモリ | 124,556 KB |
最終ジャッジ日時 | 2023-10-18 03:40:46 |
合計ジャッジ時間 | 56,897 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 2,025 ms
124,556 KB |
testcase_04 | AC | 1,213 ms
107,424 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 1,548 ms
124,556 KB |
testcase_07 | AC | 1,302 ms
88,380 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 353 ms
30,884 KB |
testcase_11 | AC | 58 ms
8,624 KB |
testcase_12 | AC | 483 ms
37,620 KB |
testcase_13 | AC | 28 ms
7,072 KB |
testcase_14 | AC | 1,065 ms
72,004 KB |
testcase_15 | AC | 22 ms
6,548 KB |
testcase_16 | AC | 46 ms
9,700 KB |
testcase_17 | AC | 120 ms
17,028 KB |
testcase_18 | AC | 4 ms
4,348 KB |
testcase_19 | AC | 118 ms
16,004 KB |
testcase_20 | AC | 922 ms
63,800 KB |
testcase_21 | AC | 122 ms
16,004 KB |
testcase_22 | AC | 2,071 ms
124,556 KB |
testcase_23 | AC | 1,967 ms
124,556 KB |
testcase_24 | AC | 1,099 ms
72,004 KB |
testcase_25 | AC | 307 ms
28,768 KB |
testcase_26 | AC | 1,973 ms
124,556 KB |
testcase_27 | AC | 928 ms
63,800 KB |
testcase_28 | AC | 1,594 ms
107,424 KB |
testcase_29 | AC | 125 ms
16,004 KB |
testcase_30 | AC | 1,995 ms
124,556 KB |
testcase_31 | AC | 2,060 ms
124,556 KB |
testcase_32 | AC | 2,030 ms
124,556 KB |
testcase_33 | AC | 1,992 ms
124,556 KB |
testcase_34 | AC | 1,916 ms
124,556 KB |
testcase_35 | AC | 1,703 ms
115,684 KB |
testcase_36 | AC | 1,051 ms
81,252 KB |
testcase_37 | AC | 1,949 ms
124,556 KB |
testcase_38 | AC | 519 ms
47,076 KB |
testcase_39 | AC | 396 ms
44,920 KB |
testcase_40 | AC | 471 ms
39,008 KB |
testcase_41 | AC | 76 ms
12,044 KB |
testcase_42 | AC | 531 ms
41,844 KB |
testcase_43 | AC | 20 ms
5,748 KB |
testcase_44 | AC | 1,069 ms
75,444 KB |
testcase_45 | AC | 1,708 ms
115,684 KB |
testcase_46 | AC | 1,247 ms
80,196 KB |
testcase_47 | AC | 1,650 ms
115,684 KB |
testcase_48 | AC | 1,342 ms
88,380 KB |
testcase_49 | AC | 1,279 ms
88,380 KB |
testcase_50 | AC | 12 ms
4,348 KB |
testcase_51 | AC | 243 ms
24,616 KB |
testcase_52 | AC | 14 ms
4,700 KB |
testcase_53 | AC | 2 ms
4,348 KB |
testcase_54 | AC | 725 ms
49,836 KB |
testcase_55 | AC | 533 ms
45,756 KB |
testcase_56 | AC | 465 ms
44,920 KB |
testcase_57 | AC | 588 ms
46,020 KB |
testcase_58 | AC | 447 ms
44,920 KB |
testcase_59 | AC | 449 ms
44,920 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } void dijkstra(vvpll &graph, ll v, vl &dist, vl &cnt){ priority_queue<pll, vpll, greater<pll>> pque; vector<bool> decided(graph.size()); pque.push(pll(0, v)); cnt[v] = 1; dist[v] = 0; while(pque.size()){ pll p = pque.top(); pque.pop(); if (dist[p.second] < p.first){ continue; } decided[p.second] = true; for (auto x: graph[p.second]){ if (dist[x.first] + x.second == dist[p.second] && decided[x.first]){ cnt[p.second] = (cnt[p.second] + cnt[x.first]) % mod1; } } for (auto x: graph[p.second]){ if (dist[x.first] > dist[p.second] + x.second){ dist[x.first] = dist[p.second] + x.second; pque.push(pll(dist[x.first], x.first)); } } } } int main(){ ll N, M; cin >> N >> M; vl a(M); vl b(M); rep(i,M){ cin >> a[i] >> b[i]; a[i]--; b[i]--; } vl c(N); rep(i,N) cin >> c[i]; ll ans = M + 1; if (M <= 2){ for (ll i = 0; i < (1 << M); i++){ vl cnt(N, 0); rep(j, N) cnt[j] = c[j]; ll popcnt = 0; for (ll j = 0; j < M; j++){ if ((i >> j) & 1){ cnt[a[j]] ^= 1; cnt[b[j]] ^= 1; popcnt++; } } bool pos = true; rep(j, N){ if (cnt[j] == 1) pos = false; } if (pos){ ans = min(ans, popcnt); } } } else{ ll c_bit = 0; for (ll i = 0; i < N; i++){ if (c[i] == 1) c_bit += (1LL << i); } vpll former(0); vpll latter(0); for (ll i = 0; i < (1LL << (M / 2)); i++){ ll pop_cnt = 0; vl change(N, 0); for (ll j = 0; j < (M / 2); j++){ if ((i >> j) & 1){ pop_cnt++; change[a[j]] ^= 1; change[b[j]] ^= 1; } } ll change_bit = 0; for (ll j = 0; j < N; j++){ if (change[j] == 1){ change_bit += (1LL << j); } } former.push_back(pll(pop_cnt, change_bit)); } for (ll i = 0; i < (1LL << (M - M / 2)); i++){ ll pop_cnt = 0; vl change(N, 0); for (ll j = 0; j < (M - M / 2); j++){ if ((i >> j) & 1){ pop_cnt++; change[a[j + M / 2]] ^= 1; change[b[j + M / 2]] ^= 1; } } ll change_bit = 0; for (ll j = 0; j < N; j++){ if (change[j] == 1){ change_bit += (1LL << j); } } latter.push_back(pll(pop_cnt, change_bit)); } unordered_map<ll, ll> lattmap; for (ll i = 0; i < latter.size(); i++){ if (lattmap[latter[i].second] == 0) lattmap[latter[i].second] = latter[i].first; else lattmap[latter[i].second] = min(lattmap[latter[i].second], latter[i].first); } //debug(c_bit); for (ll i = 0; i < former.size(); i++){ //debug_out(former[i].second, former[i].first, lattmap[former[i].second ^ c_bit]); if ((former[i].second ^ c_bit) == 0) ans = min(ans, former[i].first); else{ if (lattmap[former[i].second ^ c_bit] >= 1){ ans = min(ans, former[i].first + lattmap[former[i].second ^ c_bit]); } } } } if (ans == M + 1) cout << -1 << endl; else cout << ans << endl; }