A. Matrix Game(水题)

A. Matrix Game time limit per test1 second memory limit per test256
megabytes inputstandard input outputstandard output Ashish and Vivek
play a game on a matrix consisting of n rows and m columns, where they
take turns claiming cells. Unclaimed cells are represented by 0, while
claimed cells are represented by 1. The initial state of the matrix is
given. There can be some claimed cells in the initial state.

In each turn, a player must claim a cell. A cell may be claimed if it
is unclaimed and does not share a row or column with any other already
claimed cells. When a player is unable to make a move, he loses and
the game ends.

If Ashish and Vivek take turns to move and Ashish goes first,
determine the winner of the game if both of them are playing
optimally.

Optimal play between two players means that both players choose the
best possible strategy to achieve the best possible outcome for
themselves.

Input The first line consists of a single integer t (1≤t≤50) — the
number of test cases. The description of the test cases follows.

The first line of each test case consists of two space-separated
integers n, m (1≤n,m≤50) — the number of rows and columns in the
matrix.

The following n lines consist of m integers each, the j-th integer on
the i-th line denoting ai,j (ai,j∈{0,1}).

Output For each test case if Ashish wins the game print “Ashish”
otherwise print “Vivek” (without quotes).

Example inputCopy 4 2 2 0 0 0 0 2 2 0 0 0 1 2 3 1 0 1 1 1 0 3 3 1 0 0
0 0 0 1 0 0 outputCopy Vivek Ashish Vivek Ashish Note For the first
case: One possible scenario could be: Ashish claims cell (1,1), Vivek
then claims cell (2,2). Ashish can neither claim cell (1,2), nor cell
(2,1) as cells (1,1) and (2,2) are already claimed. Thus Ashish loses.
It can be shown that no matter what Ashish plays in this case, Vivek
will win.

For the second case: Ashish claims cell (1,1), the only cell that can
be claimed in the first move. After that Vivek has no moves left.

For the third case: Ashish cannot make a move, so Vivek wins.

For the fourth case: If Ashish claims cell (2,3), Vivek will have no
moves left.

#include <iostream>
#include <algorithm>
#include <cmath>
#include<cstring>
#include <vector>
#include <map>
using namespace std;
#define ll long long
inline bool bigger(long long x, long long y)
{
    return x > y;
}
inline bool smalonglonger(long long x, long long y)
{
    return x < y;
}
long long judgebpri(long long x, long long y)
{
    return y == 0 ? x : judgebpri(y, x % y);
}
void initvectorlonglong(vector<long long> &a, long long n)
{
    for (long long i = 0; i < n; i++)
    {
        long long t;
        cin >> t;
        a.push_back(t);
    }
}
void showlonglong(vector<long long> &a, long long beg, long long enl)
{
    auto it = a.begin() + beg;
    auto its = a.begin() + enl;
    for (it; it < its; it++)
        cout << *it << ' ';
    cout << endl;
}
long long binfind(long long x,vector<long long>&a)
{
    long long l=0,r=a.size()-1;
    while(l<=r)
    {
        long long mid=(l+r)>>1;
        if(a[mid]>x)r=mid-1;
        else l=mid+1;
    }
    return l-1;
} //返回第一个小于
int a[55],b[55];
int main()
{
    int m,n,t;cin>>t;
    while(t--&&cin>>m>>n){
    for(int i=1;i<=m;i++)
        a[i]=1;
    a[0]=m;
    for(int i=1;i<=n;i++)
        b[i]=1;
    b[0]=n;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
    {
        int g;cin>>g;
        if(g){
        if(a[i]){a[0]--;a[i]=0;}
        if(b[j]){b[0]--;b[j]=0;}
        }
    }
    //cout<<"??????"<<endl;
    if(a[0]<0||b[0]<0){
        cout<<"Vivek"<<endl;continue;
    }
   else{ int minn=min(a[0],b[0]);
    //cout<<minn<<"???"<<endl;
    if(minn&1)cout<<"Ashish"<<endl;
    else cout<<"Vivek"<<endl;
   }
    }
}