2021.01.27

Author: seono

python/kakao/2021_4.py

@@ -0,0 +1,34 @@
+import sys
+input = sys.stdin.readline
+
+n, s, a, b = map(int,input().split())
+INF = 1e10
+fares = []
+tmp = []
+for idx,row in enumerate(list(map(str,input().split(',')))):
+    row = row.replace("[","").replace("[","")
+    row = row.replace("]","").replace("]","")
+    if idx>1 and idx%3==0:
+        fares.append(tmp)
+        tmp = [int(row)]
+    else:
+        tmp.append(int(row))
+
+adj = [[INF]*(n+1) for _ in range(n+1)]
+print(fares)
+for c,d,f in fares:
+    adj[c][d]=f
+    adj[d][c]=f
+
+print("\n".join(map(str,adj)))
+for i in range(1,n+1):
+    for j in range(1,n+1):
+        for k in range(1,n+1):
+            if i==j or j==k or i==k:continue
+            if adj[i][k]+adj[k][j]<adj[i][j]:
+                adj[i][j]=adj[i][k]+adj[k][j]
+ans = INF
+print("\n".join(map(str,adj)))
+for i in range(1,n+1):
+    ans = min(ans,adj[s][i]+adj[i][a]+adj[i][b])
+print(ans)

python/kakao/2021_6.py

@@ -0,0 +1,51 @@
+import sys
+input = sys.stdin.readline
+def solution(sales, links):
+    adj = [[] for _ in range(len(sales))]
+    for a,b in links:
+        adj[a-1].append(b-1)
+    dp_arr = [[-1,-1] for _ in range(len(sales))]
+    def dp(now,check):
+        if len(adj[now])==0:
+            return 0
+        if dp_arr[now][check]!=-1:return dp_arr[now][check]
+        #check True -> 팀원들 맘대로
+        #check False -> 팀원이 다안가면 팀중에 최소매출인원 무조건 보냄
+        res = 0
+        if check:
+            for nx in adj[now]:
+                res+=min(dp(nx,False),dp(nx,True)+sales[nx])
+        else:
+            flag = False
+            tmp = sales[now]
+            for nx in adj[now]:
+                m1 = dp(nx,False)
+                m2 = dp(nx,True)+sales[nx]
+                if m2<=m1:
+                    flag=True
+                    res+=m2
+                else:
+                    if m2-m1<tmp:
+                        tmp = m2-m1
+                    res+=m1
+            if not flag:
+                res+=tmp
+        dp_arr[now][check]=res
+        return res
+    answer = dp(0,False)
+    return answer
+
+r,c=map(int,input().split())
+
+board = []
+tmp = []
+for idx,row in enumerate(list(map(str,input().split(',')))):
+    row = row.replace("[","").replace("[","")
+    row = row.replace("]","").replace("]","")
+    if idx>1 and idx%4==0:
+        board.append(tmp)
+        tmp = [int(row)]
+    else:
+        tmp.append(int(row))
+board.append(tmp)
+print(solution(board,r,c))

python/plat3/1395.py

@@ -0,0 +1,46 @@
+import sys
+
+input = sys.stdin.readline
+output = sys.stdout.write
+
+N, M = map(int,input().split())
+
+tree = [0]*(4*N)
+lazy = [0]*(4*N)
+
+def propagate(node,now_s,now_e):
+    if lazy[node]:
+        tree[node]=(now_e-now_s+1)-tree[node]
+        if now_s!=now_e:
+            lazy[node<<1]^=1
+            lazy[node<<1|1]^=1
+        lazy[node]=0
+
+def update(now_s,now_e,s,e,node):
+    propagate(node,now_s,now_e)
+    if now_s>e or now_e<s:return
+    if s<=now_s and now_e<=e:
+        tree[node]=(now_e-now_s+1)-tree[node]
+        if now_s!=now_e:
+            lazy[node<<1]^=1
+            lazy[node<<1|1]^=1
+        return
+    mid = (now_e+now_s)>>1
+    update(now_s,mid,s,e,node<<1)
+    update(mid+1,now_e,s,e,node<<1|1)
+    tree[node]=tree[node<<1] + tree[node<<1|1]
+
+def query(now_s,now_e,s,e,node):
+    propagate(node,now_s,now_e)
+    if e<now_s or s>now_e:return 0
+    if s<=now_s and now_e<=e:return tree[node]
+    mid = (now_e+now_s)>>1
+    return query(now_s,mid,s,e,node<<1)+query(mid+1,now_e,s,e,node<<1|1)
+
+for _ in range(M):
+    cmd, i, j = map(int,input().split())
+    if cmd==0:
+        update(1,N,i,j,1)
+    else:
+        output("%d\n"%query(1,N,i,j,1))
+    #print(tree[:2*N])

python/plat3/1671.py

@@ -0,0 +1,36 @@
+import sys
+input = sys.stdin.readline
+output = sys.stdout.write
+
+N = int(input())
+#상어 네트워크 그래프 만들고(먹는놈->먹힐놈)
+#이분탐색두번
+#N-이분탐색두번결과
+adj = [[] for _ in range(N)]
+arr = []
+def dfs(idx):
+    visited[idx]=True
+    for nx in adj[idx]:
+        if p[nx]==-1 or (not visited[p[nx]] and dfs(p[nx])):
+            p[nx]=idx
+            return True
+    return False
+
+p = [-1]*N
+for j in range(N):
+    a,b,c = map(int,input().split())
+    for i,n in enumerate(arr):
+        na,nb,nc = n
+        if na<=a and nb<=b and nc<=c:
+            adj[j].append(i)
+        elif a<=na and b<=nb and c<=nc:
+            adj[i].append(j)
+    arr.append((a,b,c))
+ans = 0
+for i in range(N):
+    visited = [False]*N
+    if dfs(i):ans+=1
+for i in range(N):
+    visited = [False]*N
+    if dfs(i):ans+=1
+print(N-ans)

python/plat3/7469.py

@@ -0,0 +1,46 @@
+import sys
+import bisect
+input = sys.stdin.readline
+output = sys.stdout.write
+n, m = map(int,input().split())
+st = 1
+while st<n:
+    st*=2
+tree = [[] for _ in range(4*n)]
+arr = list(map(int,input().split()))
+tmp = {}
+tmp2 = {}
+for i,x in enumerate(sorted(arr)):
+    tmp[x]=i
+    tmp2[i]=x
+for idx,num in enumerate(arr,st):
+    tree[idx]=[tmp[num]]
+tmp = st
+while tmp>1:
+    ed = tmp
+    tmp = tmp//2
+    for i in range(tmp,ed):
+        left,right = 0,0
+        l,r = len(tree[i<<1]),len(tree[i<<1|1])
+        while left<l or right<r:
+            if right==r or (left<l and tree[i<<1][left]<tree[i<<1|1][right]):
+                tree[i].append(tree[i<<1][left])
+                left+=1
+            else:
+                tree[i].append(tree[i<<1|1][right])
+                right+=1
+def find(s,e,node,ns,ne,x):
+    if ne<s or ns>e:return 0
+    if s<=ns and ne<=e:return bisect.bisect_right(tree[node],x)
+    mid = (ns+ne)>>1
+    return find(s,e,node<<1,ns,mid,x) + find(s,e,node<<1|1,mid+1,ne,x)
+for _ in range(m):
+    i,j,k = map(int,input().split())
+    l,r = 0,n
+    while l<=r:
+        mid = (l+r)>>1
+        if find(i,j,1,1,st,mid)<k:
+            l=mid+1
+        else:
+            r=mid-1
+    output("%d\n"%tmp2[l])