結果
| 問題 | No.2505 matriX cOnstRuction |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2023-10-14 00:10:56 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 384 ms / 2,500 ms |
| コード長 | 6,731 bytes |
| コンパイル時間 | 2,350 ms |
| コンパイル使用メモリ | 207,372 KB |
| 最終ジャッジ日時 | 2025-02-17 07:42:23 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 64 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
int n = a.size();
vector<T> b(n);
for (int i = 0; i < n; i++) b[i] = a[ord[i]];
swap(a, b);
}
template <typename T>
T floor(T x, T y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return (x >= 0 ? x / y : (x - y + 1) / y);
}
template <typename T>
T ceil(T x, T y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return (x >= 0 ? (x + y - 1) / y : x / y);
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} io_setup;
constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
template <int char_size, char base>
struct Trie {
struct Node {
array<int, char_size> next;
// vector<int> accept;
int count; // 子以下に追加された文字列の数
ll cost;
Node() : count(0), cost(0) { fill(begin(next), end(next), -1); }
};
vector<Node> nodes;
Trie() { nodes.emplace_back(); }
void insert(const string &s, ll cost) {
// cout << "! " << s MM cost << endl;
int now = 0;
for (int i = 0; i < (int)s.size(); i++) {
int t = s[i] - base;
int next = nodes[now].next[t];
if (next == -1) {
next = nodes.size();
nodes[now].next[t] = next;
nodes.emplace_back();
}
nodes[now].count++;
now = next;
}
nodes[now].count++;
// nodes[now].accept.push_back(id);
nodes[now].cost += cost;
}
// void insert(const string &s, ll cost) { insert(s, cost, nodes[0].count); }
int find(const string &s) const {
int now = 0;
for (int i = 0; i < s.size(); i++) {
int t = s[i] - base;
now = nodes[now].next[t];
if (now == -1) return -1;
}
return now;
}
int count(const string &s) const {
int p = find(s);
return p == -1 ? 0 : nodes[p].count;
}
ll dfs(int now) {
if (now == -1) return 0;
ll ret = INF;
each(e, nodes[now].next) {
chmin(ret, dfs(e)); //
}
if (ret == INF) ret = 0;
return ret + nodes[now].cost;
}
};
void solve() {
int N, M;
cin >> N >> M;
int K = N + M;
vector<int> b(K);
rep(i, K) cin >> b[i];
vector<vector<int>> result(N, vector<int>(M));
rep(i, N) rep(j, M) cin >> result[i][j];
vector<int> a;
{
vector<int> x(N), y(M);
rep(j, M) y[j] = result[0][j];
rep(i, N) x[i] = result[i][0] ^ y[0];
rep(i, N) rep(j, M) {
if (result[i][j] != (x[i] ^ y[j])) {
cout << "-1\n";
return;
}
}
rep(i, N) a.eb(x[i]);
rep(j, M) a.eb(y[j]);
}
Trie<2, '0'> trie;
rep(i, K) {
string S, T;
int f = 0;
per(t, 30) {
f |= flg(b[i], t);
if (!f) {
trie.insert(S + char('0' + (1 ^ flg(a[i], t))), inf);
} else if (!flg(b[i], t)) {
trie.insert(S + char('0' + (1 ^ flg(a[i], t))), 1);
}
S += char('0' + (flg(a[i], t) ^ flg(b[i], t)));
T += char('0' + flg(a[i], t));
}
trie.insert(T, -1);
}
ll ans = trie.dfs(0);
// print(a), print(b);
if (ans > (1 << 25)) {
cout << "-1\n";
} else {
cout << ans + K << '\n';
}
}
int main() {
int T = 1;
cin >> T;
while (T--) solve();
}