[소병희] 겹치는 건 싫어, 쉬운 최단거리, 회전 초밥

src/main/kotlin/byeonghee/week43/겹치는 건 싫어.kt

@@ -0,0 +1,37 @@
+package byeonghee.week43
+
+import java.io.BufferedReader
+import java.io.InputStreamReader
+
+class 소병희_겹치는건싫어 {
+
+    companion object {
+        fun solve(): Unit = with(BufferedReader(InputStreamReader(System.`in`))) {
+            val (n, k) = readLine().split(" ").map { it.toInt() }
+            val nums = IntArray(n)
+            val count = IntArray(100001)
+            var p1 = 0
+            var p2 = 0
+            var ans = 0
+
+            readLine().split(" ").forEachIndexed { i, v ->
+                nums[i] = v.toInt()
+            }
+
+            while(p2 < n) {
+                count[nums[p2]]++
+                while(count[nums[p2]] > k && p1 < p2)
+                    count[nums[p1++]]--
+
+                p2++
+                ans = ans.coerceAtLeast(p2 - p1)
+            }
+
+            println(ans)
+        }
+    }
+}
+
+fun main() {
+    소병희_겹치는건싫어.solve()
+}

src/main/kotlin/byeonghee/week43/쉬운 최단거리.kt

@@ -0,0 +1,69 @@
+package byeonghee.week43
+
+import java.io.BufferedReader
+import java.io.InputStreamReader
+
+class 소병희_쉬운최단거리 {
+
+    companion object {
+        val dr = intArrayOf(1, 0, -1, 0)
+        val dc = intArrayOf(0, 1, 0, -1)
+
+        fun solve(): Unit = with(BufferedReader(InputStreamReader(System.`in`))) {
+            val (n, m) = readLine().split(" ").map { it.toInt() }
+            val ground = Array(n) { IntArray(m) { -1 } }
+            val sb = StringBuilder()
+
+            val q = ArrayDeque<IntArray>()
+
+            repeat(n) { i ->
+                readLine().split(" ").forEachIndexed { j, v ->
+                    if (v.toInt() == 2) {
+                        q.add(intArrayOf(i, j, 0))
+                        ground[i][j] = 0
+                    }
+                    else if (v.toInt() == 0) {
+                        ground[i][j] = 0
+                    }
+                }
+            }
+
+            var nr = 0
+            var nc = 0
+            var r = 0
+            var c = 0
+            var v = 0
+
+            while(q.isNotEmpty()) {
+                q.removeFirst().let {
+                    r = it[0]
+                    c = it[1]
+                    v = it[2]
+                }
+
+                for(d in 0 until 4) {
+                    nr = r + dr[d]
+                    nc = c + dc[d]
+                    if (nr !in 0 until n || nc !in 0 until m) continue
+                    if (ground[nr][nc] == 0) continue
+                    if (ground[nr][nc] != -1) continue
+                    ground[nr][nc] = v + 1
+                    q.add(intArrayOf(nr, nc, v + 1))
+                }
+            }
+
+            repeat(n) { i ->
+                repeat(m) { j ->
+                    sb.append("${ground[i][j]} ")
+                }
+                sb.appendLine()
+            }
+
+            print(sb)
+        }
+    }
+}
+
+fun main() {
+    소병희_쉬운최단거리.solve()
+}

src/main/kotlin/byeonghee/week43/회전 초밥.kt

@@ -0,0 +1,35 @@
+package byeonghee.week43
+
+import java.io.BufferedReader
+import java.io.InputStreamReader
+
+class 소병희_회전초밥 {
+
+    companion object {
+        fun solve(): Unit = with(BufferedReader(InputStreamReader(System.`in`))) {
+            val (n, d, k, c) = readLine().split(" ").map { it.toInt() }
+            val sushi = IntArray(n) { readLine().toInt() }
+            val eaten = IntArray(3001)
+
+            var kind = 1
+            var ans = 0
+            var p1 = 0
+            eaten[c]++
+
+            for(p2 in 0 until n + k - 1) {
+                if (eaten[sushi[p2%n]]++ == 0) kind++
+                if (p2 - p1 + 1 < k) continue
+
+                ans = ans.coerceAtLeast(kind)
+                if (--eaten[sushi[p1%n]] == 0) kind--
+                p1++
+            }
+
+            println(ans)
+        }
+    }
+}
+
+fun main() {
+    소병희_회전초밥.solve()
+}