結果

問題 No.979 Longest Divisor Sequence
ユーザー KeroruKeroru
提出日時 2020-07-17 18:57:58
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,648 ms / 2,000 ms
コード長 3,692 bytes
コンパイル時間 377 ms
コンパイル使用メモリ 81,792 KB
実行使用メモリ 149,632 KB
最終ジャッジ日時 2024-05-07 01:03:46
合計ジャッジ時間 5,867 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 143 ms
91,264 KB
testcase_01 AC 151 ms
91,288 KB
testcase_02 AC 148 ms
91,364 KB
testcase_03 AC 152 ms
91,520 KB
testcase_04 AC 141 ms
91,392 KB
testcase_05 AC 143 ms
91,136 KB
testcase_06 AC 150 ms
91,296 KB
testcase_07 AC 148 ms
91,264 KB
testcase_08 AC 146 ms
91,136 KB
testcase_09 AC 144 ms
91,392 KB
testcase_10 AC 181 ms
94,208 KB
testcase_11 AC 181 ms
94,208 KB
testcase_12 AC 187 ms
94,208 KB
testcase_13 AC 229 ms
144,128 KB
testcase_14 AC 1,648 ms
149,632 KB
testcase_15 AC 815 ms
114,280 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()

########################################################################################################################################################################

## return prime factors of N as dictionary {prime p:power of p}
## within 2 sec for N = 2*10**20+7
def primeFactor(N):
    i,n=2,N
    ret={}
    d,sq=2,99
    while i<=sq:
        k=0
        while n%i==0:
            n,k,ret[i]=n//i,k+1,k+1
        if k>0 or i==97:
            sq=int(n**(1/2)+0.5)
        if i<4:
            i=i*2-1
        else:
            i,d=i+d,d^6
    if n>1:
        ret[n]=1
    return ret

show_flg=False
show_flg=True

n,*a=map(int,open(0).read().split())

div=dict()
for i in rep(n):
    if a[i] in div:
        continue
    if a[i]==1:
        s=[]
    else:
        s=[1]
    for j in rep(2,int(a[i]**0.5+1)):
        if a[i]%j==0:
            s.append(j)
            if j*j!=a[i]:s.append(a[i]//j)
    div[a[i]]=s

l=[0]*-~max(a)
for i in range(n):
    l[a[i]]=max([l[d] for d in div[a[i]]]+[0])+1
#    show(i,l)
print(max(l))
0