김현정 / 17주차

hyunjung/week16/나무자르기.js

@@ -0,0 +1,34 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+
+const [n, m] = input[0].split(" ").map(Number)
+const arr = input[1].split(" ").map(Number)
+
+function solution(n, m, trees) {
+  arr.sort((a, b) => a - b)
+  let height = 0
+  start = 0
+  end = Math.max(...trees)
+
+  for (let i = 0; i < n; i++) {
+    while (start <= end) {
+      let mid = Math.floor((start + end) / 2)
+      let woodSum = 0
+      trees.forEach((tree) => {
+        let wood = tree - mid
+        if (wood > 0) woodSum += wood
+      })
+      if (woodSum >= m) {
+        if (mid > height) height = mid
+        start = mid + 1
+      } else {
+        end = mid - 1
+      }
+    }
+  }
+  return height
+}
+//제출
+const answer = solution(n, m, arr)
+console.log(answer)

hyunjung/week16/예산.js

@@ -0,0 +1,31 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+
+let [n, arr, budget] = [+input[0], input[1].split(" ").map(Number), +input[2]]
+
+const solution = (n, arr, budget) => {
+  arr = arr.sort((a, b) => a - b)
+
+  let start = 0
+  let end = arr.at(-1)
+
+  while (start <= end) {
+    let mid = parseInt((start + end) / 2)
+    let sum = 0
+    for (let i = 0; i < n; i++) {
+      if (arr[i] > mid) {
+        //요청금액 > 상한액
+        sum += mid //상한액 더하기
+      } else {
+        //요청금액 < 상한액
+        sum += arr[i] //요청금액 더하기
+      }
+    }
+    sum <= budget ? (start = mid + 1) : (end = mid - 1) //총액이 예산보다 작으면 최소금액 증가, 크면 최소금액 감소
+  }
+  return end
+}
+
+const answer = solution(n, arr, budget)
+console.log(answer)

hyunjung/week16/용돈관리.js

@@ -0,0 +1,54 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+
+let [n, m] = input[0].split(" ")
+const arr = input.slice(1).map(Number)
+
+n = +n
+m = +m
+
+const solution = (days, withdrawal, A) => {
+  let start = Math.min(...A)
+  let end = A.reduce((a, c) => a + c, 0)
+  let K = Infinity
+
+  while (start <= end) {
+    let min = 0
+    let mid = Math.floor((start + end) / 2)
+    let sum = mid
+    let cnt = 0
+
+    for (let i = 0; i < days; i++) {
+      if (sum - A[i] >= 0) {
+        sum -= A[i]
+      } else {
+        cnt++
+        sum = mid - A[i]
+        if (sum < 0) {
+          min = A[i]
+          break
+        }
+      }
+    }
+    if (min > 0) {
+      start = min
+      continue
+    }
+
+    if (sum < mid) cnt++
+    if (cnt <= withdrawal) {
+      if (K > mid) {
+        K = mid
+      }
+      end = mid - 1
+    } else {
+      start = mid + 1
+    }
+  }
+  return K
+}
+
+// 제출
+const answer = solution(n, m, arr)
+console.log(answer)

hyunjung/week17/DOM.js

@@ -0,0 +1,42 @@
+//시간 초과
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+const [n, m, p] = input[0].split(" ").map(Number)
+const channels = input.slice(1).map((el) => el.split(" ").map(Number))
+
+const solution = (n, m, p, channels) => {
+  let curChannel = p
+  let cnt = 0
+  let searched = new Array(m + 1).fill(false)
+
+  const changeChannel = (channels, curChannel) => {
+    if (searched[curChannel]) {
+      return (cnt = -1)
+    }
+    searched[curChannel] = true
+
+    for (let i = 0; i < channels.length; i++) {
+      if (channels[i][1] === curChannel) {
+        //현재 채널이 싫어하는 채널이면
+        curChannel = channels[i][0] //좋아하는 채널로 변경
+
+        if (searched[curChannel]) {
+          // 변경한 채널이 검색한 채널이면 리턴
+          return (cnt = -1)
+        } else {
+          cnt++
+          return changeChannel(channels, curChannel)
+        }
+      }
+    }
+  }
+
+  changeChannel(channels, curChannel)
+
+  return cnt
+}
+
+//제출
+const answer = solution(n, m, p, channels)
+console.log(answer)

hyunjung/week17/DOM_2.js

@@ -0,0 +1,37 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+const [n, m, p] = input[0].split(" ").map(Number)
+const channels = input.slice(1).map((el) => el.split(" ").map(Number))
+
+const solution = (n, m, first, channels) => {
+  let A = []
+  let cnt = 0
+
+  let visited = [...Array(m + 1)].fill(false)
+  for (let i = 1; i <= m; i++) {
+    A[i] = []
+  }
+
+  for (let i = 0; i < n; i++) {
+    let [like, hate] = channels[i]
+    if (A[hate].length === 0) A[hate] = like
+  }
+
+  const DFS = (node) => {
+    if (visited[node]) return -1
+    visited[node] = true
+    for (let i = 1; i <= m; i++) {
+      if (A[node] === i) {
+        cnt++
+        return DFS(i)
+      }
+    }
+  }
+
+  if (DFS(first) === -1) return -1
+  return cnt
+}
+
+const answer = solution(n, m, p, channels)
+console.log(answer)

hyunjung/week17/경로찾기.js

@@ -0,0 +1,29 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+let n = input[0]
+n = +n
+const graph = input.slice(1).map((el) => el.split(" ").map(Number))
+
+const solution = (n, graph) => {
+  const result = [...Array(n)].map(() => Array(n).fill(0)) // 답을 저장할 2차원 배열
+
+  const DFS = (edge, line, visited) => {
+    for (let i = 0; i < n; i++) {
+      if (graph[edge][i] && !visited[i]) {
+        visited[i] = true
+        result[line][i] = 1
+        DFS(i, line, visited) //line은 계속 고정
+      }
+    }
+  }
+
+  for (let i = 0; i < n; i++) {
+    const visited = new Array(n).fill(false)
+    DFS(i, i, visited)
+  }
+  return result.map((v) => v.join(" ")).join("\n")
+}
+
+const answer = solution(n, graph)
+console.log(answer)

hyunjung/week17/안전영역.js

@@ -0,0 +1,48 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+let n = input[0]
+n = +n
+const map = input.slice(1).map((el) => el.split(" ").map(Number))
+
+const solution = (n, area) => {
+  let max = 0
+
+  const DFS = (row, col, h, visited) => {
+    let dx = [0, 1, 0, -1]
+    let dy = [1, 0, -1, 0]
+
+    for (let i = 0; i < 4; i++) {
+      let ax = row + dx[i],
+        ay = col + dy[i]
+      if (ax >= 0 && ay >= 0 && ax < n && ay < n) {
+        if (!visited[ax][ay]) {
+          visited[ax][ay] = true
+          DFS(ax, ay, h, visited)
+        }
+      }
+    }
+  }
+
+  for (let h = 0; h <= 100; h++) {
+    let cnt = 0
+    const visited = [...Array(n)].map((_, x) =>
+      [...Array(n)].map((_, y) => area[x][y] <= h)
+    )
+    for (let row = 0; row < n; row++) {
+      for (let col = 0; col < n; col++) {
+        if (!visited[row][col]) {
+          visited[row][col] = true
+          DFS(row, col, h, visited)
+          cnt++
+        }
+      }
+    }
+    max = Math.max(max, cnt)
+  }
+
+  return max
+}
+
+const answer = solution(n, map)
+console.log(answer)

hyunjung/week17/연결요소의개수.js

@@ -0,0 +1,46 @@
+const fs = require("fs")
+const readFileSyncAddress = "/dev/stdin"
+const input = fs.readFileSync(readFileSyncAddress).toString().trim().split("\n")
+const [n, m] = input[0].split(" ").map(Number)
+
+const solution = (n, m, input) => {
+  let A = []
+  let cnt = 0
+  let visited = new Array(n + 1).fill(false)
+
+  for (let i = 1; i < n + 1; i++) {
+    A[i] = []
+  }
+
+  //A 인접 리스트에 그래프 데이터 저장하기
+  for (let i = 0; i < m; i++) {
+    let [from, to] = input[i + 1].split(" ").map(Number)
+    A[from].push(to)
+    A[to].push(from)
+  }
+
+  const DFS = (start) => {
+    if (visited[start]) return
+    visited[start] = true //방문처리
+
+    for (let i = 0; i < A[start].length; i++) {
+      const next = A[start][i]
+      if (!visited[next]) {
+        DFS(next) //방문하지 않은 노드만 탐색
+      }
+    }
+  }
+
+  for (let i = 1; i <= n; i++) {
+    if (!visited[i]) {
+      DFS(i) //방문하지 않은 노드가 있으면 dfs실행
+      cnt++ //연결 요소 개수++
+    }
+  }
+
+  return cnt
+}
+
+//제출
+const answer = solution(n, m, input)
+console.log(answer)