Uva 11419-SAM I AM(최대 일치 템 플 릿,최소 덮어 쓰기 템 플 릿 찾기)

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 1000 + 5; //          

//          
struct BPM {
  int n, m;               //       
  vector<int> G[maxn];    //    
  int left[maxn];         // left[i]    i        ，-1     
  bool T[maxn];           // T[i]    i       

  int right[maxn];        //       
  bool S[maxn];           //       

  void init(int n, int m) {
    this->n = n;
    this->m = m;
    for(int i = 0; i < n; i++) G[i].clear();
  }

  void AddEdge(int u, int v) {
    G[u].push_back(v);
  }

  bool match(int u){
    S[u] = true;
    for(int i = 0; i < G[u].size(); i++) {
      int v = G[u][i];
      if (!T[v]){
        T[v] = true;
        if (left[v] == -1 || match(left[v])){
          left[v] = u;
          right[u] = v;
          return true;
        }
      }
    }
    return false;
  }

  //      
  int solve() {
    memset(left, -1, sizeof(left));
    memset(right, -1, sizeof(right));
    int ans = 0;
    for(int u = 0; u < n; u++) { //      u    
      memset(S, 0, sizeof(S));
      memset(T, 0, sizeof(T));
      if(match(u)) ans++;
    }
    return ans;
  }

  //      。X Y         
  int mincover(vector<int>& X, vector<int>& Y) {
    int ans = solve();
    memset(S, 0, sizeof(S));
    memset(T, 0, sizeof(T));
    for(int u = 0; u < n; u++)
      if(right[u] == -1) match(u); //    X       
    for(int u = 0; u < n; u++)
      if(!S[u]) X.push_back(u); // X      
    for(int v = 0; v < m; v++)
      if(T[v]) Y.push_back(v);  // Y      
   return ans;
  }
};

BPM solver;

int R, C, N;

int main(){
  int kase = 0;
  while(scanf("%d%d%d", &R, &C, &N) == 3 && R && C && N) {
    solver.init(R, C);
    for(int i = 0; i < N; i++) {
      int r, c;
      scanf("%d%d", &r, &c); r--; c--;
      solver.AddEdge(r, c);
    }
    vector<int> X, Y;
    int ans = solver.mincover(X, Y);//     X,Y  
    printf("%d", ans);
    for(int i = 0; i < X.size(); i++) printf(" r%d", X[i]+1);
    for(int i = 0; i < Y.size(); i++) printf(" c%d", Y[i]+1);
    printf("
");
  }
  return 0;
}