글 읽기 - 반례 좀 찾아주세요 ㅠㅠㅠ

junghun1997 6년 전 0

반례를 못 찾겠어요 ㅠㅠㅠ

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int	arr[2], ans[2];
queue <pair <int, int>> q;
vector <pair <int, int>> v;
vector <bool> check;
int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n,a=0;
		scanf("%d", &n);
		check.resize(n);
		scanf("%d %d", &arr[0], &arr[1]);
		for (int i = 0; i < n; i++) {
			int x, y;
			scanf("%d %d", &x, &y);
			v.push_back(make_pair(x, y));
		}
		scanf("%d %d", &ans[0], &ans[1]);
		q.push(make_pair(arr[0], arr[1]));
		while (!q.empty()) {
			int x = q.front().first;
			int y = q.front().second;
			q.pop();
			if (ans[1] + ans[0] - (x + y) <= 1000 && ans[1] + ans[0] - (x + y) >= -1000) {
				a = 1;
				break;
			}
			for (int i = 0; i < n; i++) {
				int temp = v[i].first - x + v[i].second - y;
				if (!check[i] && (temp >= -1000 && temp <= 1000)) {
					check[i] = true;
					q.push(make_pair(v[i].first, v[i].second));

				}
			}
		}
		if (a) printf("happy\n");
		else printf("sad\n");
	}
	return 0;
}