codetree.ai 삼성전자 2025 상반기 오후 2번 문제 여왕 개미

문제 링크: https://www.codetree.ai/ko/frequent-problems/all/problems/queen-ant

Author: skysign

codetree.ai 삼성전자 2025 상반기 오후 2번 문제 여왕 개미/main.py

@@ -0,0 +1,53 @@
+def solve():
+    houses_pos = [0]  # 여왕 개미의 집
+    houses_deleted = [False]  # 여왕 개미의 집
+
+    Q = int(input())
+
+    for _ in range(Q):
+        cmds = list(map(int, input().split()))
+        cmd = cmds[0]
+
+        if cmd == 100:
+            for pos in cmds[2:]:
+                houses_pos.append(pos)
+                houses_deleted.append(False)
+        elif cmd == 200:
+            pos_new = cmds[1]
+            houses_pos.append(pos_new)
+            houses_deleted.append(False)
+        elif cmd == 300:
+            pos_deleted = cmds[1]
+            houses_deleted[pos_deleted] = True
+        elif cmd == 400:
+            cnt_ant = cmds[1]
+
+            mn_time, mx_time = 0, 1000000000
+            min_time = 0
+
+            while mn_time <= mx_time:
+                mid_time = (mn_time + mx_time) // 2
+
+                intervals = 0
+                last_pos = -1000000000
+
+                for idx in range(1, len(houses_pos)):
+                    if houses_deleted[idx]: # 삭제된 집인 경우 skip
+                        continue
+
+                    crnt_pos = houses_pos[idx]
+
+                    if crnt_pos - last_pos > mid_time:
+                        last_pos = crnt_pos
+                        intervals += 1
+
+                if intervals <= cnt_ant:
+                    min_time = mid_time
+                    mx_time = mid_time - 1
+                else:
+                    mn_time = mid_time + 1
+
+            print(min_time)
+
+if __name__ == '__main__':
+    solve()

codetree.ai 삼성전자 2025 상반기 오후 2번 문제 여왕 개미/test1.txt

@@ -0,0 +1,8 @@
+7
+100 5 2 4 7 8 15
+400 1
+400 2
+200 50
+400 2
+300 5
+400 3

codetree.ai 삼성전자 2025 상반기 오후 2번 문제 여왕 개미/test1_answer.txt

@@ -0,0 +1,4 @@
+13
+6
+13
+2

codetree.ai 삼성전자 2025 상반기 오후 2번 문제 여왕 개미/test_main.py

@@ -0,0 +1,23 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')