二分图 写的日了狗了,不能玩了,一开始就搓了。二分图,一定是把点分为两部分,放在一起很难搞。这题用奇偶构图 】
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define N 1100
int n,m,k,tmp1,tmp2;
int map[N][N],link[N],vis[N];
int path[40][40];
bool dfs(int x) {
for(int i = 1; i < tmp2; i++) {
if(map[x][i] && vis[i] == 0) {
vis[i] = 1;
if(link[i] == 0 || dfs(link[i])) {
link[i] = x;
return 1;
}
}
}
return 0;
}
void solve() {
int ans = 0;
memset(link,0,sizeof(link));
for(int i = 1; i < tmp1; i++) {
memset(vis,0,sizeof(vis));
if(dfs(i)) ans++;
}
//cout<<ans<<endl;
if(ans*2+k == n*m) printf("YES\n");
else printf("NO\n");
}
int main() {
while(~scanf("%d%d%d",&n,&m,&k)) {
memset(path,0,sizeof(path));
int x,y;
for(int i = 0; i < k; i++) {
scanf("%d%d",&x,&y);
path[y][x] = -1;
}
tmp1 = tmp2 = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(path[i][j] == 0) {
if((i+j) %2 ==0) path[i][j] = tmp1++; //偶数点
else path[i][j] = tmp2++; //奇数点
}
}
}
memset(map,0,sizeof(map));
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(path[i][j] != -1 && (i+j)%2 == 1) { //map[i][j] 表示偶数点与奇数点
if(path[i-1][j] >= 1) map[path[i-1][j]][path[i][j]]=1;
if(path[i+1][j] >= 1) map[path[i+1][j]][path[i][j]]=1;
if(path[i][j-1] >= 1) map[path[i][j-1]][path[i][j]]=1;
if(path[i][j+1] >= 1) map[path[i][j+1]][path[i][j]]=1;
}
}
}
solve();
}
return 0;
}