codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1365A.md (2297B)


      1 Source: https://codeforces.com/problemset/problem/1365/A
      2 
      3 A. Matrix Game
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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.
     24 
     25 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.
     26 
     27 Optimal play between two players means that both players choose the best possible strategy to achieve the best possible outcome for themselves.
     28 
     29 Input
     30 
     31 The first line consists of a single integer $t$ $(1 \le t \le 50)$ — the number of test cases. The description of the test cases follows.
     32 
     33 The first line of each test case consists of two space-separated integers $n$, $m$ $(1 \le n, m \le 50)$ — the number of rows and columns in the matrix.
     34 
     35 The following $n$ lines consist of $m$ integers each, the $j$-th integer on the $i$-th line denoting $a_{i,j}$ $(a_{i,j} \in \{0, 1\})$.
     36 
     37 Output
     38 
     39 For each test case if Ashish wins the game print "Ashish" otherwise print "Vivek" (without quotes).
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 4
     47 2 2
     48 0 0
     49 0 0
     50 2 2
     51 0 0
     52 0 1
     53 2 3
     54 1 0 1
     55 1 1 0
     56 3 3
     57 1 0 0
     58 0 0 0
     59 1 0 0
     60 ```
     61 
     62 Output
     63 
     64 ```
     65 Vivek
     66 Ashish
     67 Vivek
     68 Ashish
     69 ```
     70 
     71 Note
     72 
     73 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.
     74 
     75 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.
     76 
     77 For the third case: Ashish cannot make a move, so Vivek wins.
     78 
     79 For the fourth case: If Ashish claims cell $(2, 3)$, Vivek will have no moves left.