2021.01.15

Author: seono

python/gold3/2836.py

@@ -0,0 +1,24 @@
+import sys
+input = sys.stdin.readline
+
+N, M = map(int,input().split())
+arr = []
+for i in range(N):
+    start,end = map(int,input().split())
+    if start<end:continue
+    arr.append([end,start])
+arr.sort()
+ped = arr[0][1]
+ans = M
+pst = arr[0][0]
+arr.append([1e9+1,1e9+1])
+for st,ed in arr:
+    if ed<=ped:continue
+    else:
+        if st>ped:
+            ans+=(ped-pst)*2
+            pst = st
+            ped = ed
+        else:
+            ped = ed
+print(ans)

python/plat2/7626.py

@@ -0,0 +1,63 @@
+import sys
+import bisect
+input = sys.stdin.readline
+
+sys.setrecursionlimit(100000)
+n = int(input())
+arr = []
+M_y = 200000
+lenT = [0]*(M_y*4)
+tmp = []
+for _ in range(n):
+    x1,x2,y1,y2 = map(int,input().split())
+    arr.append([x1,y1,y2,1])
+    arr.append([x2,y1,y2,-1])
+    tmp.append(y1)
+    tmp.append(y2)
+
+tmp = sorted(set(tmp))
+M = len(tmp)
+for i in range(M-1):
+    lenT[i+M] = tmp[i+1]-tmp[i]
+for i in range(M-1,0,-1):
+    lenT[i] = lenT[i<<1]+lenT[i<<1 | 1]
+
+def update(left, right, diff):
+    def apply(i,v):
+        lazy[i]+=v
+        segTree[i]=lenT[i] if lazy[i] else segTree[i<<1]+segTree[i<<1|1] if i<M else 0
+
+    start,end = left,right
+    while left!=right:
+        if left & 1:
+            apply(left,diff)
+            left+=1
+        if right & 1:
+            right-=1
+            apply(right,diff)
+        left>>=1;right>>=1;
+    segTree[start] = lenT[start] if lazy[start] else 0
+    segTree[end] = lenT[end] if lazy[end] else 0
+    idx = end>>1
+    while idx:
+        segTree[idx]=lenT[idx] if lazy[idx] else segTree[idx<<1]+segTree[idx<<1|1]
+        idx>>=1
+    idx = start>>1
+    while idx:
+        segTree[idx]=lenT[idx] if lazy[idx] else segTree[idx<<1]+segTree[idx<<1|1]
+        idx>>=1
+arr.sort()
+px = arr[0][0]
+ans = 0
+lazy = [0]*(M_y*4)
+segTree = [0]*(M_y*4)
+for i in range(2*n):
+    arr[i][1] = bisect.bisect_left(tmp,arr[i][1])+M
+    arr[i][2] = bisect.bisect_left(tmp,arr[i][2])+M
+
+for x,y1,y2,check in arr:
+    dx = x-px
+    px = x
+    ans+=dx*segTree[1]
+    update(y1,y2,check)
+print(ans)

python/plat3/3392.py

@@ -0,0 +1,37 @@
+import sys
+input = sys.stdin.readline
+
+sys.setrecursionlimit(100000)
+n = int(input())
+arr = []
+for _ in range(n):
+    x1,y1,x2,y2 = map(int,input().split())
+    arr.append((x1,y1,y2-1,1))
+    arr.append((x2,y1,y2-1,-1))
+
+def update(idx, left, right, start, end, diff):
+    if end<left or right<start: return
+    #대표 구간 == 범위가 모두 포함되는 곳
+    if start<=left and right<=end:
+        lazy[idx]+=diff
+    else:
+        mid = (left+right)//2
+        update(idx*2,left,mid,start,end,diff)
+        update(idx*2+1,mid+1,right,start,end,diff)
+    if lazy[idx]:segTree[idx]=right-left+1
+    else:
+        if left==right: segTree[idx]=0
+        else: segTree[idx]=segTree[idx*2]+segTree[idx*2+1]
+
+arr.sort()
+px = arr[0][0]
+ans = 0
+M_y = 30000
+lazy = [0]*(M_y*4)
+segTree = [0]*(M_y*4)
+for x,y1,y2,check in arr:
+    dx = x-px
+    px = x
+    ans+=dx*segTree[1]
+    update(1,0,M_y,y1,y2,check)
+print(ans)

python/plat4/2261.py

@@ -0,0 +1,39 @@
+import sys
+input = sys.stdin.readline
+
+N = int(input())
+def dist(a,b):
+    return (b[0]-a[0])**2 + (b[1]-a[1]) ** 2
+
+
+def sol(left, right):
+    if right-left==2:return dist(arr[left],arr[left+1])
+    elif right-left==3:
+        return min(dist(arr[left],arr[left+1]),dist(arr[left+1],arr[left+2]),dist(arr[left],arr[left+2]))
+    
+    mid = (right+left)//2
+    d = min(sol(left,mid),sol(mid,right))
+    tmp = []
+    mid = arr[mid][0]
+    for i in range(left,right):
+        xdist = arr[i][0]-mid
+        xdist*=xdist
+        if xdist>d:continue
+        tmp.append(arr[i])
+    tmp.sort(key=lambda x:x[1])
+    tmp_len = len(tmp)
+    if tmp_len>1:
+        for i in range(tmp_len-1):
+            for j in range(i+1,tmp_len):
+                if (tmp[i][1] - tmp[j][1]) **2 > d:
+                    break
+                d = min(d, dist(tmp[i],tmp[j]))
+    return d
+
+arr = [list(map(int,input().split())) for _ in range(N)]
+arr = list(set(map(tuple,arr)))
+if len(arr)!=N:
+    print(0)
+else:
+    arr.sort()
+    print(sol(0,len(arr)))