로봇 프로젝트

LEEHYUNDONG · LEEHYUNDONG · commit 20d3cd97924c · 2022-08-22T09:12:11.000+09:00
diff --git a/[Week18 - Search]/&#51060;&#54788;&#46041;/3649.py b/[Week18 - Search]/&#51060;&#54788;&#46041;/3649.py
@@ -9,4 +9,45 @@
 &#53580;&#49828;&#53944;&#51032; &#44060;&#49688;
 &#47112;&#44256; &#51312;&#44033;&#51032; &#49688;
 &#44396;&#47693;&#51032; &#45320;&#48708; x
-'''
+1 &#49468;&#54000;&#48120;&#53552; = 10000000 &#45208;&#45432;&#48120;&#53552;
+'''
+
+import sys
+input = sys.stdin.readline
+
+SIZE = 10000000 # &#45800;&#50948;, &#45208;&#45432;&#48120;&#53552; 1&#49468;&#54000;&#48120;&#53552;
+
+def findRightHole(N, hole, target):
+    l, r = 0, N-1
+
+    while l < r:
+        tmp = (hole[l] + hole[r])
+        
+        if tmp == target:
+            return [hole[l], hole[r]]
+        elif tmp < target:
+            l += 1
+        else:
+            r -= 1
+    
+    return [0, 0]
+
+while True:
+    try:
+        x = int(input())
+        N = int(input())
+        hole = []
+        x *= SIZE
+        for _ in range(N):
+            hole.append(int(input()))
+        
+        hole.sort()
+
+
+        ret = findRightHole(N, hole, x)
+        if ret == [0, 0]:
+            print("danger")
+        else:
+            print("yes {} {}".format(ret[0], ret[1]))
+    except:
+        break
