#920070 (C++17) No.2505 matriX cOnstRuction

提出ソース

結果

問題	No.2505 matriX cOnstRuction
ユーザー	n_vip
提出日時	2023-10-13 23:46:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,387 bytes
コンパイル時間	2,716 ms
コンパイル使用メモリ	155,132 KB
実行使用メモリ	43,628 KB
最終ジャッジ日時	2024-09-15 19:39:15
合計ジャッジ時間	10,614 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	17 ms 5,376 KB
testcase_02	AC	15 ms 5,376 KB
testcase_03	AC	15 ms 5,376 KB
testcase_04	AC	15 ms 5,376 KB
testcase_05	AC	15 ms 5,376 KB
testcase_06	AC	17 ms 5,376 KB
testcase_07	AC	12 ms 5,376 KB
testcase_08	AC	12 ms 5,376 KB
testcase_09	AC	12 ms 5,376 KB
testcase_10	AC	12 ms 5,376 KB
testcase_11	AC	12 ms 5,376 KB
testcase_12	AC	12 ms 5,376 KB
testcase_13	AC	12 ms 5,376 KB
testcase_14	AC	12 ms 5,376 KB
testcase_15	AC	12 ms 5,376 KB
testcase_16	AC	12 ms 5,376 KB
testcase_17	AC	13 ms 5,376 KB
testcase_18	AC	12 ms 5,376 KB
testcase_19	AC	12 ms 5,376 KB
testcase_20	AC	12 ms 5,376 KB
testcase_21	AC	12 ms 5,376 KB
testcase_22	AC	12 ms 5,376 KB
testcase_23	AC	12 ms 5,376 KB
testcase_24	AC	12 ms 5,376 KB
testcase_25	AC	12 ms 5,376 KB
testcase_26	AC	12 ms 5,376 KB
testcase_27	AC	12 ms 5,376 KB
testcase_28	AC	12 ms 5,376 KB
testcase_29	AC	12 ms 5,376 KB
testcase_30	AC	15 ms 5,376 KB
testcase_31	AC	15 ms 5,376 KB
testcase_32	AC	14 ms 5,376 KB
testcase_33	AC	16 ms 5,376 KB
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	AC	99 ms 13,156 KB
testcase_49	AC	605 ms 43,500 KB
testcase_50	AC	583 ms 43,628 KB
testcase_51	AC	310 ms 5,376 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	AC	21 ms 5,376 KB
testcase_56	AC	19 ms 5,376 KB
testcase_57	AC	20 ms 5,376 KB
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	AC	11 ms 5,376 KB
testcase_62	AC	12 ms 5,376 KB
testcase_63	AC	15 ms 5,376 KB

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

ソースコード

raw source code

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int X = 0;X < (int)(Y);++X)
#define reps(X,S,Y) for (int X = (int)(S);X < (int)(Y);++X)
#define rrep(X,Y) for (int X = (int)(Y)-1;X >=0;--X)
#define rreps(X,S,Y) for (int X = (int)(Y)-1;X >= (int)(S);--X)
#define repe(X,Y) for (X = 0;X < (Y);++X)
#define peat(X,Y) for (;X < (Y);++X)
#define all(X) X.begin(),X.end()
#define rall(X) X.rbegin(),X.rend()
#define eb emplace_back
#define UNIQUE(X) X.erase(unique(all(X)),X.end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
#ifdef __cpp_init_captures
template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}
template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}
template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){	addadd(lhs, rhs, index_sequence_for<T...>{});	return lhs;}
template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}
template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){	subsub(lhs, rhs, index_sequence_for<T...>{});	return lhs;}
template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}
#endif
template<class T=ll> T read(){ T re; cin>>re; return re;}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}
vv<int> readG(const int &n){ return readG(n,n-1);}
vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}
vv<int> readD(const int &n){ return readD(n,n-1);}
template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}
template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}
template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;}
template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}
#ifdef __cpp_deduction_guides
template<typename T> vector<T> readT(int n, T v){ return readV(n,v);}
template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...));	return re;}
#endif
template<class T> bool erase(multiset<T> &st, const T &v){if(cauto it=st.find(v); it==st.end()) return false; else{ st.erase(it); return true;}}
#ifdef NUIP
#define TT cauto TTT=read();rep(kase,TTT)if(cerr<<"Case #"<<kase<<endl)
#else
#define TT cauto TTT=read();rep(kase,TTT)
#endif
struct sorted_impl{template<class T>friend vector<T>operator-(vector<T>a,sorted_impl){sort(all(a));return a;}friend string operator-(string a,sorted_impl){sort(all(a));return a;}}sorted;struct reversed_impl{template<class T>friend vector<T>operator-(vector<T> a,reversed_impl){reverse(all(a));return a;}friend string operator-(string a,reversed_impl){reverse(all(a));return a;}}reversed;struct distinct_impl{template<class T>friend vector<T>operator-(vector<T> a,distinct_impl){sort(all(a));UNIQUE(a);return a;}}distinct;template<class S>struct sortedWith{const S f;sortedWith(const S &f):f(f){}template<class T>friend vector<T>operator-(vector<T> a,const sortedWith&b){sort(all(a),[&](cauto&i,cauto&j){return b.f(i)<b.f(j);});return a;}};
template<class T>int operator/(const T&v,const vector<T>&vs){return lower_bound(all(vs),v)-vs.begin();}
vector<int> Inds(const int n){vector<int> inds(n);iota(all(inds),0);return inds;}
const ll MOD=1e9+7; //998244353;

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cout<<fixed<<setprecision(0);
	TT{
		cauto n=read(0);
		cauto m=read(0);
		cauto Rs=readV(n,0);
		cauto Cs=readV(m,0);
		cauto mp=readT(n,m,0);
		vector<int> rs(n),cs(m);
		rep(i,n) rs[i]=mp[i][0]^mp[0][0];
		rep(j,m) cs[j]=mp[0][j];
		bool ok=true;
		rep(i,n)rep(j,m)if((rs[i]^cs[j])!=mp[i][j]) ok=false;
		if(!ok){
			cout<<-1 NL;
			continue;
		}
		const ll INF=1e7;
		map<int,ll> imo;
		cauto dfs=
			[&](auto &&dfs, int l, int r, int x, int L, int D)->void{
				if(cauto lb=(L^x)&~(D-1); l<=lb && lb+D<=r){
					--imo[L];
					++imo[L+D];
					return;
				}else if(r<=lb || lb+D<=l) return;
				dfs(dfs,l,r,x,L,D/2);
				dfs(dfs,l,r,x,L+D/2,D/2);
			};
		cauto fun=
			[&](const int v, const int ub){
				int pw=1;
				while(ub>=pw) pw+=pw;
				cauto bit=v&~(pw-1);
				imo[0]+=INF;
				imo[bit]+=2-INF;
				imo[bit+pw]+=INF-2;
				// [0,ub]^v -= 1
				dfs(dfs,0,ub+1,v,bit,pw);
				// [0,0]^v -= 1
				--imo[v];
				++imo[v+1];
			};
		rep(i,n) fun(rs[i], Rs[i]);
		rep(j,m) fun(cs[j], Cs[j]);
		int re=INF;
		int cur=0;
		for(cauto &p:imo){
			cur+=p.Y;
			MN(re,cur);
		}
		cout<<(re>=INF?-1:re) NL;
	}
	return 0;
}

yukicoder

結果

テストケース

ソースコード