洛谷入门赛15第二题92分,求解
  • 板块灌水区
  • 楼主Starry_dream
  • 当前回复7
  • 已保存回复7
  • 发布时间2023/8/16 15:26
  • 上次更新2023/11/3 03:22:12
查看原帖
洛谷入门赛15第二题92分,求解
818820
Starry_dream楼主2023/8/16 15:26

B3814,我的#17&&#23WA,请各位大佬指教。(悬关)

#include<bits/stdc++.h>
using namespace std;

int main() {
	int mx, my, sx, sy, cx, cy;
	cin >> sx >> sy >> cx >> cy >> mx >> my;
	int Mx[10] = {0, mx - 1, mx + 1, mx + 2, mx + 2, mx + 1, mx - 1, mx - 2, mx - 2};
	int My[10] = {0, my + 2, my + 2, my + 1, my - 1, my - 2, my - 2, my - 1, my + 1};
	for (int i = 1; i <= 8; i++) {
		if ((Mx[i] - 1 == sx && My[i] + 2 == sy) || (Mx[i] + 1 == sx && My[i] + 2 == sy) || (Mx[i] + 2 == sx && My[i] + 1 == sy) || (Mx[i] + 2 == sx && My[i] - 1 == sy) || (Mx[i] + 1 == sx && My[i] - 2 == sy) || (Mx[i] - 1 == sx && My[i] - 2 == sy) || (Mx[i] - 2 == sx && My[i] - 1 == sy) || (Mx[i] + 1 == sx && My[i] + 1 == sy)) {
			if ((Mx[i] - 1 == cx && My[i] + 2 == cy) || (Mx[i] + 1 == cx && My[i] + 2 == cy) || (Mx[i] + 2 == cx && My[i] + 1 == cy) || (Mx[i] + 2 == cx && My[i] - 1 == cy) || (Mx[i] + 1 == cx && My[i] - 2 == cy) || (Mx[i] - 1 == cx && My[i] - 2 == cy) || (Mx[i] - 2 == cx && My[i] - 1 == cy) || (Mx[i] + 1 == cx && My[i] + 1 == cy))
			{
				cout << "Yes";
				return 0;
			} 
			else
			{
				cout << "No";
				return 0;
			}
		}
	}
	cout << "No";
	return 0;
}
2023/8/16 15:26
加载中...