4408. 자기 방으로 돌아가기

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWNcJ2sapZMDFAV8&categoryId=AWNcJ2sapZMDFAV8&categoryType=CODE&problemTitle=%EC%9E%90%EA%B8%B0+%EB%B0%A9&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 

SW Expert Academy

def b(now,goal):
        if goal % 2 == 0:  # 짝수끼리
            for i in range(now, goal + 1):
                arr[i] += 1
        else:  # 홀수끼리
            for i in range(now, goal + 2):
                arr[i] += 1
        return
     
T = int(input())
for tc in range(1,T+1):
    N = int(input())
    arr = [0]*401
    for _ in range(N):
        now, goal = map(int,input().split())
        if now < goal:
            b(now,goal)
        else:
            b(goal,now)
    print(f'#{tc} {max(arr)}')

---

간결한 정석풀이

T = int(input())
for tc in range(1, T + 1):
    N = int(input())
    arr = [list(map(int, input().split())) for _ in range(N)]
 
    bokdo = [0] * 201 # 1 ~ 200번(방은 400개인데 홀짝 위아래로 200개씩 나눠져있으니)
 
    for a,b in arr:
        a = (a + (a % 2)) // 2  # 현재방 / 홀수면 1 더해서 2로 나눈 몫 이용
        b = (b + (b % 2)) // 2  # 돌아갈방
        for i in range(min(a,b), max(a,b) + 1):
            bokdo[i] +=1
 
    print(f'#{tc} {max(bokdo)}')