{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\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. \n \u003cbr\u003eNow 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. \n \u003cbr\u003e \n给定p个人,有两种动物n只猫和m条狗,每个人都有一个喜欢的动物一个不喜欢的动物,这两种动物不会同时为同一种动物(不同为猫和不同为狗),当这个人的喜欢的动物存在而不喜欢的动物不存在时,这个人是开心的,现在只保留部分动物,求最多能有多少人开心。\n \u003cbr\u003e\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"MD","content":"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. \n\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) \n\u003cbr\u003e"}},{"title":"Output","value":{"format":"MD","content":"For each case, output a single integer: the maximum number of happy children."}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e1 1 2\nC1 D1\nD1 C1\n\n1 2 4\nC1 D1\nC1 D1\nC1 D2\nD2 C1\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre\u003e1\n3\n\n\n \n \u003ci style\u003d\"font-size:1px\"\u003e \u003c/i\u003e\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"MD","content":"\u003cpre\u003eCase 2: Remove D1 and D2, that makes child 1, 2, 3 happy.\n \n \u003c/pre\u003e"}}]}