2957.py TLE (2021.01.08)

Author: seono

python/plat5/1086.py

@@ -0,0 +1,42 @@
+import sys
+input = sys.stdin.readline
+
+N = int(input())
+
+
+def gcd(n1,n2):
+    while n2!=0:
+        if n1<n2:
+            n1,n2=n2,n1
+        n1,n2=n2,n1%n2
+    return n1
+
+arr = [int(input()) for _ in range(N)]
+K = int(input())
+dp_arr = [[-1]*((1<<N)+1) for _ in range(100)]
+#나머지가 rest만큼 남았을 때 i번째 수를 뒤에 붙인 값을 다시 나눈 나머지
+rest_list = [[-1] * 16 for _ in range(100)]
+def dp(rest,bit):
+    if bit==(1<<N)-1:
+        if rest==0:return 1
+        else: return 0
+    if dp_arr[rest][bit]!=-1:
+        return dp_arr[rest][bit]
+    dp_arr[rest][bit]=0
+
+
+    for i in range(N):
+        if 1<<i & bit:continue
+        if rest_list[rest][i]==-1:
+            rest_list[rest][i] = (rest*(10**len(str(arr[i])))+arr[i])%K
+        dp_arr[rest][bit]+=dp(rest_list[rest][i],bit|1<<i)
+    return dp_arr[rest][bit]
+total = 1
+for x in range(1,N+1):
+    total*=x
+ans = dp(0,0)
+if ans==0:
+    print("0/1")
+else:
+    g = gcd(ans,total)
+    print("{}/{}".format(ans//g,total//g))

python/plat5/1849.py

@@ -0,0 +1,32 @@
+import sys
+input=sys.stdin.readline
+N = int(input())
+tree = [0]*(N+1)
+
+def get(n):
+    def getIdx(idx):
+        ans = 0
+        while idx>0:
+            ans+=tree[idx]
+            idx-=(idx&-idx)
+        return ans
+    st = n
+    ed = N
+    while st<=ed:
+        mid = (st+ed)//2
+        if getIdx(mid)<=mid-n:
+            ed = mid-1
+        else:
+            st = mid+1
+    update(st,1)
+    return st
+    
+def update(idx, diff):
+    while idx<=N:
+        tree[idx]+=diff
+        idx+=(idx&-idx)
+ans = [0]*N
+for i in range(1,N+1):
+    n = int(input())
+    ans[get(n+1)-1] = i
+print('\n'.join(map(str,ans)))

python/plat5/2957.py

@@ -0,0 +1,56 @@
+import sys
+import bisect
+input= sys.stdin.readline
+print = sys.stdout.write
+N = int(input())
+end_max = N*2+1
+arr = [0]*(end_max+1)
+arr[end_max//2]=int(input())
+cnt = 0
+print("%d\n"%cnt)
+ans = [0]
+for _ in range(N-1):
+    n = int(input())
+    st,ed = 0,end_max
+    mid = (st+ed)//2
+    dep = 0
+    while arr[mid]:
+        if arr[mid]>n:
+            ed = mid-1
+        else:
+            st = mid+1
+        mid = (st+ed)//2
+        dep+=1
+    arr[mid]=n
+    cnt+=dep
+    print("%d\n"%cnt)
+
+#N(logN) 시간 초과 실패
+
+
+def sol():
+    N = int(sys.stdin.readline().rstrip())
+    MAX_N = 300000
+    left = [0] * (MAX_N + 2)
+    right = [0] * (MAX_N + 2)
+    lev = [0] * (MAX_N + 2)
+    data = [0] * (MAX_N + 1)
+    C = 0
+    result = []
+    for i in range(1, N + 1):
+        data[i] = int(sys.stdin.readline().rstrip())
+        left[i] = i - 1
+        right[i] = i + 1
+    for i in range(N, -1, -1):
+        right[left[data[i]]] = right[data[i]]
+        left[right[data[i]]] = left[data[i]]
+    lev[0] = lev[N + 1] = -1
+    for i in range(1, N + 1):
+        lev[data[i]] = max(lev[left[data[i]]], lev[right[data[i]]]) + 1
+        C += lev[data[i]]
+        result.append(str(C))
+    print('\n'.join(result))
+
+
+if __name__ == "__main__":
+    sol()

python/plat5/3955.py

@@ -0,0 +1,39 @@
+import sys
+input = sys.stdin.readline
+
+
+def gcd(n1,n2):
+    while n2!=0:
+        if n1<n2:
+            n1,n2=n2,n1
+        n1,n2=n2,n1%n2
+    return n1
+
+def extension_gcd(n1,n2):
+    tmp = n1
+    t,t1,t2=0,0,1
+    while n2!=0:
+        q = n1//n2
+        r = n1%n2
+        t = t1 - q*t2
+        n1 = n2
+        n2 = r
+        t1 = t2
+        t2 = t
+    while t1<0:t1+=tmp
+    return t1
+
+T = int(input())
+while T:
+    T-=1
+    a,b=map(int,input().split())
+    if b==1:
+        if a+1>1e9:print("IMPOSSIBLE")
+        else:print(a+1)
+    elif a==1:
+        print(1)
+    elif gcd(a,b)!=1:print("IMPOSSIBLE")
+    else:
+        ans = extension_gcd(a,b)
+        if ans>1e9:print("IMPOSSIBLE")
+        else:print(ans)