#include #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++) #define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++) #define codefor int test;scanf("%d",&test);while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define yes(ans) if(ans)printf("yes\n");else printf("no\n") #define Yes(ans) if(ans)printf("Yes\n");else printf("No\n") #define YES(ans) if(ans)printf("YES\n");else printf("NO\n") #define popcount(v) __builtin_popcountll(v) #define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) #define vector4d(type,name,h,w,d,...) vector>>>name(h,vector>>(w,vector>(d,vector(__VA_ARGS__)))) using namespace std; using ll = long long; template using rpriority_queue = priority_queue, greater>; const int MOD=1000000007; const int MOD2=998244353; const int INF=1<<30; const ll INF2=1LL<<60; void scan(int& a){scanf("%d",&a);} void scan(long long& a){scanf("%lld",&a);} templatevoid scan(pair& p){scan(p.first);scan(p.second);} templatevoid scan(tuple& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));} template void scan(array& a){ for(auto&& i : a) scan(i);} template void scan(T& a){cin>>a;} template void scan(vector& vec){for(auto&& it:vec)scan(it);} void in(){} template void in(Head& head, Tail&... tail){scan(head);in(tail...);} void print(const int& a){printf("%d",a);} void print(const long long& a){printf("%lld",a);} void print(const double& a){printf("%.15lf",a);} templatevoid print(const pair& p){print(p.first);putchar(' ');print(p.second);} template void print(const T& a){cout< void print(const vector& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}} void out(){putchar('\n');} template void out(const T& t){print(t);putchar('\n');} template void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);} template void dprint(const T& a){cerr< void dprint(const vector& vec){if(vec.empty())return;cerr< void debug(const T& t){dprint(t);cerr< void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);} ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;} ll updivide(ll a,ll b){return (a+b-1)/b;} template void chmax(T &a,const T b){if(b>a)a=b;} template void chmin(T &a,const T b){if(b> groups() { std::vector leader_buf(_n), group_size(_n); for (int i = 0; i < _n; i++) { leader_buf[i] = leader(i); group_size[leader_buf[i]]++; } std::vector> result(_n); for (int i = 0; i < _n; i++) { result[i].reserve(group_size[i]); } for (int i = 0; i < _n; i++) { result[leader_buf[i]].push_back(i); } result.erase( std::remove_if(result.begin(), result.end(), [&](const std::vector& v) { return v.empty(); }), result.end()); return result; } private: int _n; std::vector parent_or_size; std::vector diff_weight; }; template struct BitMatrix{ int H, W; vector> A; BitMatrix(int n) : H(n), W(MAX_COL), A(n) {} const bitset& operator[](int k) const { return A[k]; } bitset& operator[](int k) { return A[k]; } int gauss_jordan(bool extended = false) { int rank = 0; for(int j = 0; j < W - extended; j++) { int pivot = -1; for(int i = rank; i < H; i++) { if(A[i][j]){ pivot = i; break; } } if(pivot==-1)continue; swap(A[pivot], A[rank]); for (int i = 0 ; i < H ; i++) { if (i != rank && A[i][j])A[i]^=A[rank]; } rank++; } return rank; } pair> linear_equation(const vector& b) { assert(H == (int)b.size()); for (int i = 0; i < H; i++) A[i][W] = b[i]; int rank = gauss_jordan(true); for (int i = rank; i < H; i++) { if (A[i][W]) return {-1, vector{}}; } vector res(W, 0); for (int i = 0; i < rank; i++) res[i] = A[i][W]; return {rank, res}; } //N次正方行列について行列式を解く int Determinant(int N){ assert(0 <= N && N <= H && N <= W); return (N == gauss_jordan() ); } }; int main(){ INT(h,w); vector A(h); in(A); INT(m); vector> b(m); rep(i,m){ in(b[i].first,b[i].second); } Weighted_dsu uf1(h+w),uf2(h+w); bool f1 = true, f2 = true; for(int y=0;y E(h+w),F(h+w),G(h+w),H(h+w); for(int i=0;i c(h+w); rep(i,h+w)c[i]=uf1.diff(0,i); if(E.linear_equation(c).first!=-1){ out("Yes"); return 0; } rep(i,h+w)c[i]^=1; if(F.linear_equation(c).first!=-1){ out("Yes"); return 0; } } if(f2){ vector c(h+w); rep(i,h+w)c[i]=uf2.diff(0,i); if(G.linear_equation(c).first!=-1){ out("Yes"); return 0; } rep(i,h+w)c[i]^=1; if(H.linear_equation(c).first!=-1){ out("Yes"); return 0; } } out("No"); }