[softeer] level 2 : 금고털이/8단 변속기/장애물 인식 프로그램

금고털이

Softeer

이렇게 p를 기준으로 내림차순 정렬해주고!

import sys

read = sys.stdin.readline

W, N = map(int, read().split())

price = [list(map(int, read().split())) for _ in range(N)]
price.sort(key=lambda x:x[1], reverse=True)

total = 0
for m, p in price:
    if W < m:
        total += W * p
        break
    else:
        total += m * p
        W -= m

print(total)

 

8단 변속기

Softeer

import sys

read = sys.stdin.readline

num = list(map(int, read().split()))

num_list = [1, 2, 3, 4, 5, 6, 7, 8]

if num == num_list:
    print("ascending")
elif num == sorted(num_list, reverse=True):
    print("descending")
else:
    print("mixed")

ㄴ 이런 걸 의도한 게 맞는가... 내는 모르겟다

 

장애물 인식 프로그램

Softeer

import sys
from collections import deque

read = sys.stdin.readline

dy = [-1, 0, 1, 0]
dx = [0, -1, 0, 1]

def out_of_range(y, x):
    return y < 0 or x < 0 or y >= N or x >= N

def bfs(y, x):
    que = deque()
    que.append([y, x])
    visited[y][x] = True

    cnt = 1 # block이 1일 때부터 들어오기 때문에 1로 초기화

    while que:
        sy, sx = que.popleft()
        for i in range(4):
            ny = sy + dy[i]
            nx = sx + dx[i]
            if out_of_range(ny, nx) or visited[ny][nx] or block[ny][nx] != 1:
                continue
            else:
                que.append([ny, nx])
                visited[ny][nx] = True
                cnt += 1
    return cnt


N = int(read())
block = [list(map(int, input())) for _ in range(N)]

visited = [[False] * N for _ in range(N)]

result = []
for i in range(N):
    for j in range(N):
        if block[i][j] == 1 and not visited[i][j]:
            result.append(bfs(i,j))

print(len(result))

result.sort()

for i in result:
    print(i)