-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
5 changed files
with
172 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,57 @@ | ||
| import sys | ||
|
|
||
| def input(): return sys.stdin.readline().rstrip() | ||
|
|
||
| N = int(input()) | ||
| info = [list(map(int, input().split())) + [i] for i in range(N)] | ||
| dp = [0 for _ in range(N)] | ||
| answer = [0 for _ in range(N)] | ||
|
|
||
| # ์ํ -> ์๊ฐ ์ด๊ณผ | ||
| # a๊ฐ b๋ณด๋ค ํฌ๋ฉด (์์ด ๋ค๋ฅด๋ค๋ ๊ฐ์ ํ์), a๋ b ๊ฐ์ + ํ๋ฉด ๋จ -> ๋์ ํฉ -> ์ ์ฒด ๊ฐ์์ ๊ฐ์ ์๋ง ๋นผ์ฃผ๊ธฐ | ||
|
|
||
| info.sort(key=lambda x: (x[1], x[0])) | ||
| total = 0 | ||
| color_sum = [0 for _ in range(200001)] | ||
| size_sum = [0 for _ in range(200001)] | ||
| pre_size = 0 # ๋ค๋ฅธ ์ปฌ๋ฌ์ด๋ฉด์ ๊ฐ์ ์ฌ์ด์ฆ์ธ ๊ฒฝ์ฐ๋ฅผ ์ํด ์ ์ฅ | ||
| pre_color = 0 | ||
|
|
||
| for i in range(N): | ||
| color, size, index = info[i] | ||
|
|
||
| if pre_color == color and pre_size == size: | ||
| dp[index] = dp[info[i-1][2]] | ||
| else : | ||
| dp[index] = total - color_sum[color] - size_sum[size] | ||
|
|
||
| total += size | ||
| color_sum[color] += size # ๊ฐ์ ์๊น์ ํฉ | ||
| size_sum[size] += size # ๊ฐ์ ์ฌ์ด์ฆ์ ํฉ | ||
|
|
||
| pre_size = size | ||
| pre_color = color | ||
|
|
||
| for i in dp: | ||
| print(i) | ||
|
|
||
| # ์์ธ ์ผ์ด์ค | ||
| # 3 | ||
| # 1 4 | ||
| # 2 4 | ||
| # 1 4 | ||
|
|
||
| # 6 | ||
| # 1 5 | ||
| # 2 6 | ||
| # 7 6 | ||
| # 5 6 | ||
| # 2 6 | ||
| # 1 6 | ||
|
|
||
| # 5 | ||
| # 3 15 | ||
| # 3 15 | ||
| # 3 5 | ||
| # 1 15 | ||
| # 2 10 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,66 @@ | ||
| import sys | ||
| from heapq import * | ||
|
|
||
| def input(): return sys.stdin.readline().rstrip() | ||
|
|
||
| N, P, K = map(int, input().split()) | ||
| graph = [[int(1e9) for _ in range(N+1)] for _ in range(N+1)] | ||
|
|
||
| for _ in range(P): | ||
| start, destination, cost = map(int, input().split()) | ||
| graph[start][destination] = min(graph[start][destination], cost) | ||
| graph[destination][start] = min(graph[destination][start], cost) | ||
|
|
||
| def check(mid): | ||
| if dijkstra(mid): return True | ||
| return False | ||
|
|
||
| def dijkstra(_max): | ||
| visited = set() | ||
| DP = [[int(1e9) for _ in range(K+1)] for _ in range(N+1)] | ||
| DP[1][K] = 0 | ||
|
|
||
| # ๊ฐ์ ์ฝ์คํธ, ๋จ์ ๊ธฐํ, ํ์ฌ ๋ ธ๋ | ||
| heap = [(0, K, 1)] | ||
| while heap: | ||
| now_cost, now_remain, now_node = heappop(heap) | ||
|
|
||
| if (now_node, now_remain) in visited: continue | ||
| visited.add((now_node, now_remain)) | ||
|
|
||
| if DP[now_node][now_remain] < now_cost: continue | ||
| DP[now_node][now_remain] = now_cost | ||
|
|
||
| if now_node == N: | ||
| return True | ||
|
|
||
| for idx, cost in enumerate(graph[now_node]): | ||
| if idx == 0: continue | ||
| if cost == int(1e9): continue | ||
|
|
||
| if cost <= _max: | ||
| if (idx, now_remain) in visited: continue | ||
| if DP[idx][now_remain] > cost: heappush(heap, (cost, now_remain, idx)) | ||
|
|
||
| elif cost > _max and now_remain >= 1: | ||
| if (idx, now_remain-1) in visited: continue | ||
| if DP[idx][now_remain-1] > cost: heappush(heap, (cost, now_remain-1, idx)) | ||
|
|
||
| for idx in range(1, K+1): | ||
| if DP[N][idx] != int(1e9): return True | ||
|
|
||
| return False | ||
|
|
||
| answer = int(1e9) | ||
| left = -1 | ||
| right = 1_000_001 | ||
| while left+1<right: | ||
| mid = (left + right) // 2 | ||
|
|
||
| if check(mid): | ||
| right = mid | ||
| answer = mid | ||
| else: left = mid | ||
|
|
||
| if answer != int(1e9): print(answer) | ||
| else: print(-1) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,43 @@ | ||
| import sys | ||
|
|
||
| def input(): return sys.stdin.readline().rstrip() | ||
|
|
||
| L, K, C = map(int, input().split()) | ||
| cut_points = sorted(list(map(int, input().split()))) | ||
| cut_points = [0] + cut_points + [L] | ||
|
|
||
| def check(max_len): | ||
| cuts = 0 | ||
| last_cut = L | ||
| for i in range(len(cut_points) - 1, 0, -1): | ||
| if cut_points[i] - cut_points[i - 1] > max_len: | ||
| return False | ||
| if last_cut - cut_points[i - 1] > max_len: | ||
| cuts += 1 | ||
| last_cut = cut_points[i] | ||
| return cuts <= C | ||
|
|
||
| left, right = 1, L | ||
| answer = L | ||
| while left <= right: | ||
| mid = (left + right) // 2 | ||
| if check(mid): | ||
| answer = mid | ||
| right = mid - 1 | ||
| else: | ||
| left = mid + 1 | ||
|
|
||
| cuts = 0 | ||
| last_cut = L | ||
| first_cut = None | ||
| for i in range(len(cut_points) - 1, 0, -1): | ||
| if last_cut - cut_points[i - 1] > answer: | ||
| cuts += 1 | ||
| last_cut = cut_points[i] | ||
| if C == cuts: | ||
| first_cut = cut_points[i] | ||
|
|
||
| if first_cut is None: | ||
| first_cut = cut_points[1] | ||
|
|
||
| print(answer, first_cut) |