{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child\u0027s like-animal is a cat, then his/hers dislike-animal must be a dog, and vice versa.\u003cbr\u003e\nNow the zoo administrator is removing some animals, if one child\u0027s like-animal is not removed and his/hers dislike-animal is removed, he/she will be happy. So the administrator wants to know which animals he should remove to make maximum number of happy children.\u003cbr\u003e \u003c/div\u003e\r\n "}},{"title":"Input","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n The input file contains multiple test cases, for each case, the first line contains three integers N \u0026lt;\u003d 100, M \u0026lt;\u003d 100 and P \u0026lt;\u003d 500.\u003cbr\u003eNext P lines, each line contains a child\u0027s like-animal and dislike-animal, C for cat and D for dog. (See sample for details) \u003c/div\u003e\r\n "}},{"title":"Output","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n For each case, output a single integer: the maximum number of happy children. \u003c/div\u003e\r\n "}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\r\n \u003cpre\u003e1 1 2\nC1 D1\nD1 C1\n\n1 2 4\nC1 D1\nC1 D1\nC1 D2\nD2 C1\u003c/pre\u003e\r\n \u003c/td\u003e\n \u003ctd\u003e\r\n \u003cpre\u003e1\n3\u003c/pre\u003e\r\n \u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\r\n \u003cpre\u003eCase 2: Remove D1 and D2, that makes child 1, 2, 3 happy.\u003c/pre\u003e\r\n "}}]}