【HDU5579 2015上海赛区G】【超级大讨论】Game of Arrays a[]+b[]+c[]有些位置可以减一，状态是否可能达成

Game of Arrays Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 14    Accepted Submission(s): 6 Problem Description Tweek and Craig are good friends and always playing together. And they just invented a new game when doing their math homework. First of all, they write three arrays   A ,   B , and   C , each with   N  numbers. Then on the black board, they write those arrays as A+B=C If the equation is satisfied, it means for each position   i  from   1  to   N , there are   Ai+Bi=Ci  holds. Of course, this equation is not always satisfied at the very beginning. Fortunately, for arrays   A ,   B  and   C , some numbers are   changeable , while other's are not. Those   changeable  numbers' positions are determined before the game begins. During the game, Tweek and Craig will take turns, trying to change a number from an array. Tweek plays first. In each turn, the player can choose a   changeable  number from an array, and substract it by one. However, no negative numbers should appear, so the chosen number cannot be   0  before substraction. Tweek's goal is to make the equation satisfied during the game, while Craig's goal is to prevent it to happen. The game ends when the equation is satisfied (a win for Tweek) or there are no possible moves but still   A+B≠C  (means there is   at least one   i∈[1,N] , where   Ai+Bi≠Ci , which is a win for Craig). Given   A ,   B  and   C , and the position of   chang