Quartz sync: Jun 10, 2025, 6:15 PM

Author: codeyoma

content/Computer Science/1 Foundations & Theory/Algorithms/DP 유형.md

@@ -28,6 +28,13 @@ modified: 2025/5/05 21:04:32
 		- 트리/그래프 구조 → 트리 DP, 비트마스크 DP
 	- 선형, 2D, 구간, 트리, 상태, 그리디, 케이스-분할(분기형)
 
+- 최적 부분 구조, 중복 부분 문제 파악
+- 상태 정의
+- 점화식 도출
+	- 최종 목표 설정
+	- 경우의 수
+- 초기 상태 설정
+
 # 선형 DP (1D)
 - 순서대로 누적 / 선택
 - 피보나치, 최대 연속합, 계단 오르기

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

@@ -0,0 +1,60 @@
+---
+tags: ["ps/boj/silver/1", "ps/boj/silver", "cs/algorithms/dynamic-programming/ps","cs/algorithms/prefix-sum/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/11660](https://www.acmicpc.net/problem/11660)
+
+# Logic
+- psum 구하고
+- 행 기준으로 구간합 더하기
+
+# My Code
+
+```cpp title="boj/11660.cpp"
+
+#include <vector>
+void solution()
+{
+    int n, m;
+    cin >> n >> m;
+
+    vector<vector<int>> t(n, vector<int>(n));
+    vector<vector<int>> psum_t(n, vector<int>(n + 1, 0));
+
+    for (int y = 0; y < n; ++y) {
+        for (int x = 0; x < n; ++x) {
+            cin >> t[y][x];
+            psum_t[y][x + 1] = t[y][x];
+        }
+    }
+
+    for (int y = 0; y < n; ++y) {
+        for (int x = 1; x <= n; ++x) {
+            psum_t[y][x] += psum_t[y][x - 1];
+
+            log(psum_t[y][x], " ");
+        }
+        log("\n");
+    }
+
+    while (m--) {
+        int s_x, s_y, e_x, e_y;
+
+        cin >> s_x >> s_y >> e_x >> e_y;
+
+        int sum = 0;
+
+        // for (int y = s_y - 1; y < e_y; ++y) {
+        //     sum += psum_t[y][e_x] - psum_t[y][s_x - 1];
+        // }
+        for (int x = s_x - 1; x < e_x; ++x) {
+            sum += psum_t[x][e_y] - psum_t[x][s_y - 1];
+        }
+
+        cout << sum << '\n';
+    }
+}
+
+
+```

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

@@ -0,0 +1,54 @@
+---
+tags: ["ps/boj/bronze/1", "ps/boj/bronze", "cs/algorithms/mathematics/ps","cs/algorithms/implementation/ps","cs/algorithms/bruteforcing/ps","cs/algorithms/arithmetic/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/14626](https://www.acmicpc.net/problem/14626)
+
+# Logic
+- 자리별 bias 곱하고 더하기
+- 체크자리 포함해서 비교
+
+# My Code
+
+```cpp title="boj/14626.cpp"
+
+#include <vector>
+void solution()
+{
+    string s;
+    cin >> s;
+
+    int answer_bias = 1;
+    int sum = 0;
+
+    for (size_t i = 0; i < s.length(); ++i) {
+        if (s[i] == '*') {
+            if (i & 1) {
+                answer_bias = 3;
+            }
+            continue;
+        }
+
+        if (i & 1) {
+            sum += (s[i] - '0') * 3;
+        } else {
+            sum += (s[i] - '0');
+        }
+    }
+
+    int remain = 10 - (sum % 10);
+    if (answer_bias == 1) {
+        cout << remain % 10;
+    } else {
+        for (int i = 0; i <= 9; ++i) {
+            if ((i * 3 + sum) % 10 == 0) {
+                cout << i;
+                break;
+            }
+        }
+    }
+}
+
+
+```

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

@@ -6,6 +6,12 @@ tags: ["ps/boj/silver/2", "ps/boj/silver", "cs/algorithms/bruteforcing/ps","cs/a
 - [https://www.acmicpc.net/problem/18111](https://www.acmicpc.net/problem/18111)
 
 # Logic
+- bruteforce
+  - $m * n * 256 < 1억 $ = bruteforce
+  - 모든 높이에 대해서 최소 도출
+- optimize
+  - 평균을 기준으로 이동
+    - 구현이 많아서 비추천
 
 # My Code
 
@@ -14,6 +20,44 @@ tags: ["ps/boj/silver/2", "ps/boj/silver", "cs/algorithms/bruteforcing/ps","cs/a
 #include <vector>
 void solution()
 {
+    int n, m, b;
+    cin >> n >> m >> b;
+    vector<vector<int>> map(n, vector<int>(m));
+
+    for (int i = 0; i < n; ++i) {
+        for (int j = 0; j < m; ++j) {
+            cin >> map[i][j];
+        }
+    }
+
+    int answer = C_MAX;
+    int height = 256;
+
+    for (int test = 0; test <= 256; ++test) {
+        int time = 0;
+        int temp_b = b;
+
+        for (const auto& y : map) {
+            for (const auto& x : y) {
+                int gap = abs(test - x);
+
+                if (test >= x) {
+                    time += gap;
+                    temp_b -= gap;
+                } else {
+                    time += (2 * gap);
+                    temp_b += gap;
+                }
+            }
+        }
+
+        if (temp_b >= 0 && time <= answer) {
+            answer = time;
+            height = test;
+        }
+    }
+
+    cout << answer << " " << height;
 }
 
 

quartz.layout.ts

@@ -61,7 +61,11 @@ export const defaultContentPageLayout: PageLayout = {
         },
         { Component: Component.Darkmode() },
         { Component: Component.Mindmap({ mode: "button", localOptions: {} }) },
-        { Component: Component.Slide() }
+        {
+          Component: Component.Slide({
+            tags: false
+          })
+        }
       ],
     },
     ),
@@ -120,7 +124,11 @@ export const defaultListPageLayout: PageLayout = {
         },
         { Component: Component.Darkmode() },
         { Component: Component.Mindmap({ mode: "button", localOptions: {} }) },
-        { Component: Component.Slide() }
+        {
+          Component: Component.Slide({
+            tags: false
+          })
+        }
       ],
     }),
     Component.Explorer({

quartz/components/Slide.tsx

@@ -18,6 +18,8 @@ export interface SlideOptions {
     enabled: boolean,
   },
   includePresenterNotes: boolean,
+  tags: boolean,
+  index: boolean
 }
 
 const defaultOptions: SlideOptions = {
@@ -33,6 +35,8 @@ const defaultOptions: SlideOptions = {
     enabled: true,
   },
   includePresenterNotes: true,
+  tags: true,
+  index: true,
 }
 
 export default ((opts?: Partial<SlideOptions>) => {

quartz/components/scripts/slide.inline.ts

@@ -181,9 +181,64 @@ function handleFootnote(data: string, separator: string) {
     }
   )
 
+  return slides.join(separator)
+}
+
+function handleIndex(data: string, separator: string, option: SlideOptions, index: string) {
+  const slides = data.split(separator)
+
+  if (!option.index) return slides.join("\n---\n");
+  slides.splice(1, 0, index)
+
+  const indexMap = new Map<string, number>()
+  const regex = /<h1[^>]*id="[^"]*"[^>]*>(.*?)<\/h1>/g;
+  const tempDiv = document.createElement('div');
+
+  slides.forEach((slide, index) => {
+    let match
+    while ((match = regex.exec(slide)) !== null) {
+      const fullH1Html = match[0];
+      tempDiv.innerHTML = fullH1Html;
+      const h1Element = tempDiv.querySelector('h1');
+
+      if (h1Element && h1Element.firstChild) {
+        const content = h1Element.firstChild.textContent?.trim();
+
+        if (content) {
+          indexMap.set(content, index + 1);
+        }
+      }
+    }
+  })
+
+  if (slides.length > 2) {
+    slides[1] = slides[1].replace(
+      /<a\s+([^>]*?)data-href="([^"]*)" ([^>]*)>/g,
+      (fullMatch, beforeHref, dataHref, afterHref) => {
+        if (indexMap.has(dataHref)) {
+          return `<a ${beforeHref}href="#${indexMap.get(dataHref)}"${afterHref}>`
+        }
+        return fullMatch
+      }
+    )
+  }
+
   return slides.join("\n---\n")
 }
 
+function makeIndex() {
+
+  const headers = document.querySelectorAll('article.popover-hint h1[id]');
+  const index = Array.from(headers).map(head => `<li><a data-href="${head.textContent}" class="">${head.textContent}</a></li>`).join('')
+
+  return `
+    <h1 class="slide-index-title">Index</h1>
+    <ul class="slide-index-list" >
+      ${index}
+    </ul>
+  `
+}
+
 function appendRemark(option: SlideOptions) {
 
   const header = `${document.querySelector(".page-header h1.article-title")?.outerHTML}`
@@ -202,9 +257,12 @@ function appendRemark(option: SlideOptions) {
     anchorBlank(
       unwrapSlideNote(
         unwrapFootnotesSection(
-          handleFootnote(
-            injectSeparators(header + tags + body, separator),
-            separator
+          handleIndex(
+            handleFootnote(
+              injectSeparators(header + (option.tags ? tags : "") + body, separator),
+              separator
+            ),
+            separator, option, makeIndex()
           )
         )
       )
@@ -256,6 +314,8 @@ function paramOption(defaultOption: SlideOptions) {
       enabled: getBool("enabled", defaultOption.timer.enabled),
     },
     includePresenterNotes: getBool("includePresenterNotes", defaultOption.includePresenterNotes),
+    tags: getBool("tags", defaultOption.tags),
+    index: getBool("index", defaultOption.index),
   } as SlideOptions)
 }
 

quartz/styles/custom.scss

@@ -383,6 +383,13 @@ hr {
 .remark-slide-content {
   background-color: var(--light);
 
+  &:first-of-type {
+    padding: 0rem 4rem;
+    display: flex;
+    flex-direction: column;
+    height: 100%;
+  }
+
   h1,
   h2,
   h3,
@@ -408,9 +415,27 @@ hr {
     }
   }
 
+  .slide-index-list {
+    font-size: x-large;
+    margin: 0 auto;
+    margin-top: 1rem;
+  }
+
+  .slide-index-title {
+    display: grid;
+    justify-content: center;
+
+    &:before {
+      content: ""
+    }
+  }
+
   .article-title {
     display: grid;
     justify-content: center;
+    margin: 0;
+    padding: 0;
+    flex-grow: 1;
 
     &:before {
       content: ""