CF1499A Domino on Windowsill 题解

思路

我们可以想象一下，无论如何，最优的情况一定只有以下两个：

$$\boxed{\begin{array}{c}+\\ +\end{array}}\boxed{\begin{array}{c}+\\ +\end{array}}\dots \boxed{\begin{array}{c}+\\ +\end{array}}\begin{array}{c}\boxed{++}\\ \boxed{++}\end{array}\begin{array}{c}\boxed{++}\\ \boxed{++}\end{array}\dots \begin{array}{c}\boxed{++}\\ \boxed{++}\end{array}\begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}\begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}\dots \begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}$$
$$\boxed{\begin{array}{c}+\\ +\end{array}}\boxed{\begin{array}{c}+\\ +\end{array}}\dots \boxed{\begin{array}{c}+\\ +\end{array}}\begin{array}{c}\boxed{++}\\ \boxed{++}\end{array}\begin{array}{c}\boxed{++}\\ \boxed{++}\end{array}\dots \begin{array}{c}\boxed{++}\\ \boxed{++}\end{array}\begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}\begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}\begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}\dots \begin{array}{c}\boxed{+}\\ \boxed{+}\end{array}$$

那么，可以放多少个呢？

先考虑白色的方块：前面的部分一定是 $\min \{\begin{array}{l}k1\\ k2\end{array}$，后面的部分则是 $\frac{\max \{\begin{array}{l}k1\\ k2\end{array}-\min \{\begin{array}{l}k1\\ k2\end{array}}{2}$。

所以，白色方块可以放置的个数为 $\min \{\begin{array}{l}k1\\ k2\end{array}+\frac{\max \{\begin{array}{l}k1\\ k2\end{array}-\min \{\begin{array}{l}k1\\ k2\end{array}}{2}$。

同理，黑色方块可以防止的个数是 $\min \{\begin{array}{l}n-k1\\ n-k2\end{array}+\frac{\max \{\begin{array}{l}k1\\ k2\end{array}-\min \{\begin{array}{l}k1\\ k2\end{array}}{2}$。

这样就可以写出代码了。

code

#include <bits/stdc++.h>
#define ll long long
#define inl inline
using namespace std;
int n, k1, k2, w, b;

int main() {
	int t;
	cin >> t;
	while (t--) {
		cin >> n >> k1 >> k2 >> w >> b;
		if (k1 < k2) {
			swap(k1, k2);
		}
		if (w <= k2 + (k1 - k2) / 2) {
			if (b <= (n - k1) + (k1 - k2) / 2) {
				cout << "YES";
			} else {
				cout << "NO";
			}
		} else {
			cout << "NO";
		}
		cout << endl;
	}
	return 0;
}