Quartz sync: Oct 12, 2025, 3:45 PM

Author: codeyoma

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/1162/1162.md

@@ -0,0 +1,141 @@
+---
+tags: ["ps/boj/platinum/5", "ps/boj/platinum", "cs/algorithms/dynamic-programming/ps","cs/algorithms/graph-theory/ps","cs/algorithms/shortest-path/ps","cs/algorithms/dijkstra's/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/1162](https://www.acmicpc.net/problem/1162)
+- [code on boj](https://www.acmicpc.net/status?problem_id=1162&user_id=hiatus4322)
+- [code on github](https://github.com/codeyoma/ps/tree/main/boj/1162)
+
+
+<br/>
+
+<!--
+# Logic
+
+### *분석*
+- 문제 유형 (알고리즘...)
+- 제약 조건 (인풋 크기, 예외 값, 시공간 복잡도...)
+
+### *설계*
+1. 알고리즘 선택
+2. 자료구조 선택
+3. 수도 코드 작성
+4. 정합판단
+  - `1 ~ 3`과정으로 도출된 로직이 문제를 해결하는가
+    - 그렇다 -> **구현**
+    - 잘 모르겠다 -> **구현**
+    - 아니다 -> 1번부터 다시 점검
+
+### *구현*
+- 로직 검증
+
+### *테스트*
+- 예외 케이스 고려
+
+<br/>
+
+-->
+
+# My Code
+
+## cpp
+```cpp title="boj/1162.cpp"
+// https://www.acmicpc.net/problem/1162
+#include <iostream>
+using namespace std;
+
+#ifdef LOCAL
+#    define LOG clog
+#else
+struct nullstream : ostream {
+    nullstream()
+        : ostream(nullptr) {}
+};
+nullstream LOG;
+#endif
+
+void fast_io() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+}
+
+//--------------------------------------------------------------------------------------------------
+
+#define MAX (1234567891)
+#define MIN (-1234567891)
+
+#include <algorithm>
+#include <iostream>
+#include <limits>
+#include <queue>
+#include <vector>
+
+typedef struct dijk {
+    unsigned long long dist;
+    int                v;
+    int                k;
+
+    bool operator<(const dijk& b) const {
+        if (dist != b.dist) {
+            return dist > b.dist;
+        }
+        return false;
+    }
+} D;
+
+int main() {
+    fast_io();
+
+    int n, m, k;
+    cin >> n >> m >> k;
+
+    vector<vector<pair<int, int>>> adj(n + 1);
+
+    for (int i = 0; i < m; ++i) {
+        int u, v, w;
+        cin >> u >> v >> w;
+        adj[u].push_back({ v, w });
+        adj[v].push_back({ u, w });
+    }
+
+    priority_queue<D, vector<D>>       pq;
+    vector<vector<unsigned long long>> dist(n + 1, vector<unsigned long long>(k + 1, numeric_limits<long long>::max()));
+
+    //   logic
+
+    pq.push({ 0, 1, 0 });
+    dist[1][0] = 0;
+
+    while (!pq.empty()) {
+        auto [d, v, used_k] = pq.top();
+        pq.pop();
+
+        if (dist[v][used_k] != d) {
+            continue;
+        }
+
+        for (const auto& [u, w]: adj[v]) {
+            // not take k
+            if (dist[u][used_k] > d + w) {
+                dist[u][used_k] = d + w;
+                pq.push({ dist[u][used_k], u, used_k });
+            }
+
+            // take k
+            if (used_k < k && dist[u][used_k + 1] > d) {
+                dist[u][used_k + 1] = d;
+                pq.push({ dist[u][used_k + 1], u, used_k + 1 });
+            }
+        }
+    }
+
+    unsigned long long answer = numeric_limits<long long>::max();
+
+    for (int i = 0; i <= k; ++i) {
+        answer = min(answer, dist[n][i]);
+    }
+    cout << answer;
+}
+
+```

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/33507/33507.md

@@ -0,0 +1,72 @@
+---
+tags: ["ps/boj/gold/5", "ps/boj/gold", "cs/algorithms/implementation/ps","cs/algorithms/greedy/ps","cs/algorithms/simulation/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/33507](https://www.acmicpc.net/problem/33507)
+- [code on boj](https://www.acmicpc.net/status?problem_id=33507&user_id=hiatus4322)
+- [code on github](https://github.com/codeyoma/ps/tree/main/boj/33507)
+
+
+<br/>
+
+# Logic
+
+### *분석*
+- 문제 유형 (알고리즘...)
+- 제약 조건 (인풋 크기, 예외 값, 시공간 복잡도...)
+
+### *설계*
+1. 알고리즘 선택
+2. 자료구조 선택
+3. 수도 코드 작성
+4. 정합판단
+  - `1 ~ 3`과정으로 도출된 로직이 문제를 해결하는가
+    - 그렇다 -> **구현**
+    - 잘 모르겠다 -> **구현**
+    - 아니다 -> 1번부터 다시 점검
+
+### *구현*
+- 로직 검증
+
+### *테스트*
+- 예외 케이스 고려
+
+<br/>
+
+# My Code
+
+## cpp
+```cpp title="boj/33507.cpp"
+// https://www.acmicpc.net/problem/33507
+#include <iostream>
+using namespace std;
+
+#ifdef LOCAL
+#define LOG clog
+#else
+struct nullstream : ostream {
+  nullstream() : ostream(nullptr) {}
+};
+nullstream LOG;
+#endif
+
+void fast_io() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(nullptr);
+}
+
+//--------------------------------------------------------------------------------------------------
+
+#define MAX (1234567891)
+#define MIN (-1234567891)
+
+#include <iostream>
+
+int main() {
+  fast_io();
+
+  //   logic
+}
+
+```

content/Computer Science/1 Foundations & Theory/Algorithms/ps/my_md_template.md

@@ -3,8 +3,10 @@
 
 # Problem
 
+
 <br/>
 
+<!--
 # Logic
 
 ### *분석*
@@ -29,4 +31,6 @@
 
 <br/>
 
+-->
+
 # My Code