Files
Algorithm/백준/0209_01.py
2026-04-11 11:46:27 +09:00

24 lines
570 B
Python

from collections import deque
queue = deque
queue.popleft()
def solution(clothes):
arr=[]
temp=2
answer = 1
clothes.sort(key = lambda x:(x[1], x[0]))
maxvalue = len(clothes)
for i in range(0, maxvalue-1):
if (clothes[i][1] != clothes[i+1][1]):
arr.append(temp)
temp=2
else:
temp+=1
arr.append(temp)
for j in arr:
answer *= j
answer -= 1
queue
return answer
print(solution([["yellow_hat", "headgear"], ["blue_sunglasses", "eyewear"], ["green_turban", "headgear"]]))