[백준 문제풀이] 얼렁뚱땅 9205 맥주 마시면서 걸어가기 풀이

https://www.acmicpc.net/problem/9205

9205번: 맥주 마시면서 걸어가기

 

from collections import deque

def dfs(visited,x,y) :
    global where, rock_x, rock_y, market, sign
    if abs(rock_x - x) + abs(rock_y - y) <= 1000 :
        sign = 1
    for k in range(market) :
        if (visited[k]==1):
            continue
        if abs(where[k][0]-x) + abs(where[k][1]-y) <= 1000 :
            visited[k]=1
            dfs(visited, where[k][0], where[k][1])
    

t = int(input())
for _ in range(t) :
    market = int(input())
    house_x, house_y = map(int,input().split())
    where = []
    visited = [0] * market
    for j in range(market) :
        temp = list(map(int,input().split()))
        where.append(temp)
    rock_x, rock_y = map(int,input().split())
    sign = 0
    dfs(visited,house_x,house_y)

    if sign==1 :
        print('happy')
    else :
        print('sad')