• [1305] Cat VS Dog

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • 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's like-animal is a cat, then his/hers dislike-animal must be a dog, and vice versa.
    Now the zoo administrator is removing some animals, if one child's 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.
  • 输入
  • The input file contains multiple test cases, for each case, the first line contains three integers N <= 100, M <= 100 and P <= 500.
    Next P lines, each line contains a child's like-animal and dislike-animal, C for cat and D for dog. (See sample for details)
  • 输出
  • For each case, output a single integer: the maximum number of happy children.
  • 样例输入
  • 1 1 2
    C1 D1
    D1 C1
    
    1 2 4
    C1 D1
    C1 D1
    C1 D2
    D2 C1
  • 样例输出
  • 1
    3
  • 提示
  • Case 2: Remove D1 and D2, that makes child 1, 2, 3 happy.
  • 来源
  • 加多宝凉茶
  • 操作

显示春菜