pku 2446

/*
 * File:   pku2446.cpp
 * Author: chenjiang
 *
 * Created on 2010年4月11日, 下午9:00
 * 题目大意:一张m*n的棋盘，里面有k个洞，要你用1*2的纸能否全部盖住剩下的点
 * 纸张不能重叠，不能盖住洞。
 * 思路：二分匹配，相邻的没有洞的两个格子连一条边，如果最大匹配数等于剩下的
 * 格子数，则能实现，否则，不能实现。
 *
 */

#include <stdlib.h>
#include <stdio.h>
#include <iostream>
using namespace std;
#define Max_V 1500
int my[Max_V], mapmap[Max_V][Max_V], v, n, m, a[35][35], k, b[35][35], N;
bool visited[Max_V];
int step[4][2] = {//四个方向
    {0, 1},
    {0, -1},
    {1, 0},
    {-1, 0},
};
//匈牙利算法

bool find(int x) {
    int i;
    for (i = 1; i <= N; i++) {
        if (!visited[i] && mapmap[x][i]) {
            visited[i] = 1;
            if (my[i] == -1 || find(my[i])) {
                my[i] = x;
                return 1;
            }
        }
    }
    return 0;
}

int MMG() {
    int i, j, ans = 0;
    //memset(my, -1, sizeof (my));
    for (i = 1; i <= N; i++)my[i] = -1;
    for (i = 1; i <= N; i++) {
        //memset(visited, 0, sizeof (visited));
        for (j = 1; j <= N; j++)visited[j] = 0;
        if (find(i))
            ans++;
    }
    return ans;
}

/*
 *
 */
int main(int argc, char** argv) {

    int i, j, x, y, t;
    //freopen("a.in", "r", stdin);
    while (scanf("%d%d%d", &m, &n, &k) != EOF) {
        N = n*m;
        //memset(mapmap, 0, sizeof (mapmap));
        for (i = 1; i <= N; i++) {
            for (j = 1; j <= N; j++) {
                mapmap[i][j] = 0;
            }
        }
        //memset(a, 1, sizeof (a));
        for (i = 1; i <= m; i++) {
            for (j = 1; j <= n; j++) {
                a[i][j] = 1;
            }
        }
        for (i = 1; i <= k; i++) {
            scanf("%d%d", &x, &y);
            a[y][x] = 0;
        }
        for (i = 1; i <= m; i++) {
            for (j = 1; j <= n; j++) {
                b[i][j] = n * (i - 1) + j;
            }
        }
        for (i = 1; i <= m; i++) {
            for (j = 1; j <= n; j++) {
                if (a[i][j]) {
                    for (t = 0; t < 4; t++) {
                        x = i + step[t][0];
                        y = j + step[t][1];
                        if (x >= 1 && x <= m && y >= 1 && y <= n && a[x][y]) {
                            mapmap[b[i][j]][b[x][y]] = 1;
                        }
                    }
                }
            }
        }
        int ans = MMG();
        if (ans == (N - k))
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return (EXIT_SUCCESS);
}