diff --git a/storage/ucpc/kt/2025-1-c.kt b/storage/ucpc/kt/2025-1-c.kt
new file mode 100644
index 0000000..c3183f1
--- /dev/null
+++ b/storage/ucpc/kt/2025-1-c.kt
@@ -0,0 +1,20 @@
+fun minCostAvoid(intervals: List<Pair<Int, Int>>, laserRanges: List<Pair<Int, Int>>): List<Pair<Int, Int>> {
+    val (n: Int, q: Int) = Pair(intervals.size, laserRanges.size)
+
+    
+}
+
+fun main() = with(System.`in`.bufferedReader()) {
+    val (n, q) = this.readLine().split(' ').map { it.toInt() }
+
+    val intervals = (1..n).map {
+        val split = this.readLine().split(' ').map { it.toInt() }
+        Pair(split[0], split[1])
+    }
+
+    val laserRanges = (1..q).map {
+        val split = this.readLine().split(' ').map { it.toInt() }
+        Pair(split[0], split[1])
+    }
+
+}
\ No newline at end of file
diff --git a/storage/ucpc/kt/completed/2025-1-i.kt b/storage/ucpc/kt/completed/2025-1-i.kt
new file mode 100644
index 0000000..bd4f2cc
--- /dev/null
+++ b/storage/ucpc/kt/completed/2025-1-i.kt
@@ -0,0 +1,85 @@
+import java.io.StreamTokenizer
+
+const val K: Long = 1_000_000_007
+
+fun find(parents: IntArray, a: Int): Int {
+    if (parents[a] == a) {
+        return a
+    }
+
+    parents[a] = find(parents, parents[a]);
+
+    return parents[a]
+}
+
+fun union(parents: IntArray, a: Int, b: Int) {
+    val ra = find(parents, a)
+    val rb = find(parents, b)
+
+    if (ra == rb) {
+        return
+    } else if (ra < rb) {
+        parents[rb] = ra
+    } else {
+        parents[ra] = rb
+    }
+
+}
+
+
+fun intervalPollutionArea(polluted: List<Long>): Pair<Int, Int> {
+    val parents = IntArray(polluted.size)
+
+    val poses = mutableListOf<Long>()
+
+    var now_x = 1L
+    var before_y = 0L
+
+
+
+    for ((i, p) in polluted.withIndex()) {
+        if (p <= before_y) {
+            now_x++
+        }
+        before_y = p
+
+        val now_pos: Long = K * now_x + p
+
+        poses.add(now_pos)
+
+        parents[i] = i
+    }
+
+    for ((i, p) in poses.withIndex()) {
+        val px = p / K
+        val py = p % K
+        val dx = listOf(
+            K * (px + 1) + py,
+            p + 1,
+        )
+
+        for (x in dx) {
+            val findPos = poses.binarySearch(x)
+            if (findPos > 0) {
+                union(parents, i, findPos)
+            }
+        }
+    }
+
+    return Pair(parents.map { find(parents, it) }.distinct().count(), polluted.size)
+}
+
+fun main() = with(StreamTokenizer(System.`in`.bufferedReader())) {
+    nextToken()
+    val n = nval.toInt()
+
+    val polluted = (1..n).map {
+        nextToken()
+        this.nval.toLong()
+    }
+
+    intervalPollutionArea(polluted).run {
+        println(this.first)
+        println(this.second)
+    }
+}
\ No newline at end of file