-
Notifications
You must be signed in to change notification settings - Fork 0
/
boj_14501.py
53 lines (39 loc) · 1.15 KB
/
boj_14501.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# !/usr/bin/env python
# -*- coding: utf-8 -*-
# boj 14501 퇴사
import sys
from collections import deque
input = sys.stdin.readline
n = int(input())
meetings = []
for _ in range(n):
t, p = map(int, input().split())
meetings.append((t, p))
# BFS 풀이
def bfs(x):
if x + meetings[x][0] > n:
return 0
max_revenue = meetings[x][1]
revenue = meetings[x][1]
queue = deque([(x, revenue)])
while queue:
current, revenue = queue.popleft()
max_revenue = max(revenue, max_revenue)
for i in graph[current]:
queue.append((i, revenue + meetings[i][1]))
return max_revenue
graph = [[] for _ in range(n)]
for i in range(n):
for j in range(i + meetings[i][0], n):
if j + meetings[j][0] <= n:
graph[i].append(j)
revenues = []
for i in range(n):
revenues.append(bfs(i))
print(max(revenues))
# DP 풀이
dp = [0 for _ in range(n + 1)]
for i in range(n): # i일까지 일했을 때 최대 수익
for j in range(i + meetings[i][0], n + 1): # i일 상담 진행했을 때 상담 가능한 날부터 돌기
dp[j] = max(dp[j], dp[i] + meetings[i][1])
print(dp[-1])