Codeforces Round #512 (Div. 2, based on Technocup 2019 Elimination Round 1) B. Vasya and Cornfield

题解

题目大意 n和d 还有m个点的x y坐标 问坐标是否在(0, d) (d, 0) (n-d, n) (n, n-d)四个点围城的矩形内

判断矩形不好判断 可以判断是否在四个角的三角形内 不包括边上

AC代码

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;

int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
	int n, m, d;
	cin >> n >> d >> m;
	for (int i = 0; i < m; i++)
	{
		int x, y, xx, yy;
		cin >> x >> y;
		int flag = 1;
		xx = x, yy = y;
		if (xx + yy < d)
			flag = 0;
		xx = n - x, yy = y;
		if (xx + yy < n - d)
			flag = 0;
		xx = n - x, yy = n - y;
		if (xx + yy < d)
			flag = 0;
		xx = x, yy = n - y;
		if (xx + yy < n - d)
			flag = 0;
		if (flag)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}

	return 0;
}