Codeforces 55C 想法

Pie or die

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Volodya and Vlad play the following game. There are k pies at the cells of n  ×  m board. Each turn Volodya moves one pie to the neighbouring (by side) cell. If the pie lies at the border of the board then Volodya can move it outside the board, get the pie and win. After Volodya's move, Vlad bans some edge at the border of the board of length 1 (between two knots of the board) so that Volodya is not able to move the pie outside the board through this edge anymore. The question is: will Volodya win this game? We suppose both players follow the optimal strategy.

Input

First line contains 3 integers, separated by space: 1 ≤ n, m ≤ 100 — dimensions of the board and 0 ≤ k ≤ 100 — the number of pies. Each of the next k lines contains 2 integers, separated by space: 1 ≤ x ≤ n, 1 ≤ y ≤ m — coordinates of the corresponding pie. There could be more than one pie at a cell.

Output

Output only one word: "YES" — if Volodya wins, "NO" — otherwise.

Examples

input

2 2 1
1 2

output

YES

input

3 4 0

output

NO

input

100 50 2
50 25
50 25

output

NO

题意：在一个n*m的棋盘上，有k个棋子。
Volodya可以每次选择一个棋子向上下左右四个方向移动一格，如果移动前棋子位置在棋盘边界，Volodya就可以让棋子从棋盘上落下，获得棋子，从而赢取胜利。Volodya移动后，Vlad可以把一个长度为1的棋盘边界堵住，从而使得棋子不能掉出边界。
问在两人进行最优操作的情况下，Volodya能否获胜，能的话输出"YES", 否则输出"NO"。

题解：判断一下到边界是否小于5即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
	int n,m,k,i,j,flag=0;
	scanf("%d%d%d",&n,&m,&k);
	for(i=1;i<=k;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		if(x-1<5||n-x<5||y-1<5||m-y<5)flag=1;
	}
	if(flag)printf("YES\n");
	else printf("NO\n");
	return 0;
}