feat:구현

Author: Suxxxxhyun

Week6/공통/주차요금계산/suhyun1.py

@@ -0,0 +1,50 @@
+# 딕셔너리.keys()의 반환값은 리스트가 아니다.
+import math
+def getTime(t):
+    h, m = t.split(":")
+    return int(h) * 60 + int(m)
+
+def solution(fees, records):
+    answer = []
+    #누적시간을 기록하는 해시맵
+    time = dict()
+    #들어오는 차량을 기록하는 해시맵
+    in_list = dict()
+    for re in records:
+        t, num, a = re.split(" ")
+        t = getTime(t)
+        if a == "IN":
+            in_list[num] = t
+        elif a == "OUT":
+            if num in in_list:
+                if num in time:
+                    time[num] = time[num] + (t - in_list[num])
+                else:
+                    time[num] = (t - in_list[num])
+                del in_list[num]
+    
+    # print(time)
+    # print(in_list)
+    s = getTime("23:59")
+    for n in in_list.keys():
+        if n in time:
+            time[n] = time[n] + (s - in_list[n])
+        else:
+            time[n] = s - in_list[n]
+    
+    nums = sorted(list(time.keys()))
+    for n in nums:
+        if time[n] > fees[0]:
+            fee = fees[1] + ((math.ceil((time[n] - fees[0]) / fees[2])) * fees[3])
+            answer.append(fee)
+        else:
+            answer.append(fees[1])
+    return answer
+
+# fees = [1, 461, 1, 10]
+# records = ["00:00 1234 IN"]
+# fees = [180, 5000, 10, 600]
+# records = ["05:34 5961 IN", "06:00 0000 IN", "06:34 0000 OUT", "07:59 5961 OUT", "07:59 0148 IN", "18:59 0000 IN", "19:09 0148 OUT", "22:59 5961 IN", "23:00 5961 OUT"]
+fees = [120, 0, 60, 591]
+records = ["16:00 3961 IN", "17:00 2541 IN"]
+print(solution(fees, records))

Week6/공통/주차요금계산/test.java

@@ -0,0 +1,37 @@
+from itertools import combinations
+def calculation(eq1, eq2):
+    x1, y1, c1 = eq1
+    x2, y2, c2 = eq2
+    
+    if x1 * y2 == y1 * x2:
+        return
+    
+    x = (y1*c2 - c1*y2) / (x1*y2 - y1 * x2)
+    y = (c1 * x2- x1 * c2) / (x1*y2 - y1*x2)
+    
+    if x == int(x) and y == int(y):
+        return [int(x), int(y)]
+
+def solution(line):
+    answer = []
+    points = []
+    for eq1, eq2 in combinations(line, 2):
+        point = calculation(eq1, eq2)
+        if point:
+            points.append(point)
+    
+    # 그림의 시작점과 마지막점 찾기
+    print(points)
+    w1, w2 = min(points, key=lambda x:x[0])[0], max(points, key=lambda x:x[0])[0] + 1
+    h1, h2 = min(points, key=lambda x:x[1])[1], max(points, key=lambda x:x[1])[1] + 1
+    print(w1, w2, h1, h2)
+    
+    answer = [['.'] * (w2 - w1) for _ in range(h2- h1)]
+    
+    for x, y in points:
+        answer[y-h1][x-w1] = '*'
+    # print([''.join(a) for a in answer])
+    answer.reverse()
+    return [''.join(a) for a in answer]
+
+print(solution([[2, -1, 4], [-2, -1, 4], [0, -1, 1], [5, -8, -12], [5, 8, 12]]))