結果
問題 | No.2505 matriX cOnstRuction |
ユーザー |
👑 ![]() |
提出日時 | 2023-10-17 03:00:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,232 bytes |
コンパイル時間 | 2,249 ms |
コンパイル使用メモリ | 220,344 KB |
最終ジャッジ日時 | 2025-02-17 08:07:10 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 13 WA * 51 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;cin>>t;rep(i,0,t) solve();}void solve(){int N,M;cin>>N>>M;vector<int> p(N),q(M);rep(i,0,N) cin>>p[i];rep(i,0,M) cin>>q[i];vector<vector<int>> A(N,vector<int>(M));rep(i,0,N) rep(j,0,M) cin>>A[i][j];vector<int> X(N),Y(M);Y=A[0];rep(i,0,N) X[i]=(A[i][0]^Y[0]);rep(i,0,N) rep(j,0,M){if(A[i][j]^X[i]^Y[j]){cout<<"-1\n";return;}}rep(i,0,M) p.push_back(q[i]),X.push_back(Y[i]);vector<set<int>> s(30);map<int,int> m;map<int,int> dp;rep(i,0,N+M){int tmp1=p[i],tmp2=X[i];m[X[i]]++;for(int d=29;d>=0;d--){if(tmp1&(1<<d)){}else{int l=(((1<<30)-(1<<d))&(tmp1^tmp2^(1<<d)));int r=l+(1<<d);s[d].insert(l);dp[l]++,dp[r]--;}}}int ans=-1;for(auto x:m){int tmp=x.first;bool ok=1;rep(d,0,30){if(s[d].count(((1<<30)-(1<<d))&tmp)) ok=0;}if(ok) chmax(ans,x.second);}if(!dp.empty()){if(!(dp.count(0)&&dp.count(1<<30))) chmax(ans,0);int v=0;dp.erase(1<<30);for(auto x:dp){v+=x.second;if(v==0) chmax(ans,0);}}if(ans>=0) cout<<N+M-ans<<"\n";else cout<<"-1\n";}