hsy scofe2 (#50)

* 5557

* 16953

* 1012

* 2644

* 11909

* 11909,11909-2 fix

* 그래프 이론 실전문제

* 스타트업 코딩 페스티벌 1차

* 5,6

* scofe2

* .ds_store

Author: dia312

.DS_Store

@@ -0,0 +1,38 @@
+
+import sys
+input = sys.stdin.readline
+
+N, time = map(str,input().split())
+N = int(N)
+h = int(time[0:2])
+m = int(time[3:5])
+s = int(time[6:8])
+times = h*60*60+ m*60 + s 
+
+timeList = [0 for _ in range(N)]
+dp= [0 for _ in range(N+1)]
+
+maxSongIdx= -1
+maxSong=-1
+#플레이리스트 입력 
+for i in range(N):
+    tmp = input()
+    timeList[i]=int(tmp[0:2])*60+int(tmp[3:5])
+
+start = 0
+sum = 0
+cnt = 0
+for i in range(N):
+    sum+=timeList[i]
+    cnt+=1
+    if sum >=times:
+        if maxSong<cnt:
+            maxSong = cnt 
+            maxSongIdx = start
+        while sum>=times:
+            sum-=timeList[start]
+            start+=1
+            cnt -= 1
+
+        
+print(maxSong,maxSongIdx+1,end=' ')  

syheo/.DS_Store

@@ -0,0 +1,43 @@
+import sys 
+sys.setrecursionlimit(10**7)
+input = sys.stdin.readline
+
+N = int(input())
+
+def find_path(last,visited):
+    if visited == (1<<n)-1:  
+        return info[country[last]][0] or INF  
+    if DP[last][visited] is not None:  
+        return DP[last][visited] 
+    tmp=INF
+    for city in range(n):
+        if visited & (1 << city) == 0 and info[country[last]][city] != 0:
+            tmp=min(tmp,find_path(city,visited|(1<<city)) + info[country[last]][city])
+    DP[last][visited]=tmp
+    return tmp
+
+country = []
+info = dict()
+INF = int(10000)
+
+for i in range(N): 
+    c1, c2,cost = map(str,input().split())
+    if c1 not in info.keys():
+        country.append(c1)
+        info[c1]=[0 for _ in range(6)]
+    if c2 not in info.keys():
+        country.append(c2)
+        info[c2]=[0 for _ in range(6)]
+    info[c1][country.index(c2)]=int(cost)
+    info[c2][country.index(c1)]=int(cost)
+n = len(country)
+
+DP=[[None]*(1<<n) for _ in range(n)]
+
+
+print(find_path(0,1<<0))
+
+
+
+    
+

syheo/codingTest1/.DS_Store

@@ -0,0 +1,20 @@
+import re
+
+N = int(input())
+indexList = []
+for i in range(N):
+    indexList.append(input())
+Q = int(input())
+
+for i in range(Q):
+    tmp = input()
+    cnt = 0
+    r = re.compile('.(%s).'%tmp)
+    tmpList = list(filter(r.match, indexList)) 
+    print(tmpList)
+    for j in indexList:
+        match = re.findall(re.escape(tmp), j)
+        #print('match',match)
+        cnt+=len(match)
+    #print(cnt)
+