結果
問題 | No.2218 Multiple LIS |
ユーザー | vwxyz |
提出日時 | 2023-11-21 04:24:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 366 ms / 3,000 ms |
コード長 | 3,311 bytes |
コンパイル時間 | 243 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 105,840 KB |
最終ジャッジ日時 | 2023-11-21 04:24:55 |
合計ジャッジ時間 | 11,360 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
88,688 KB |
testcase_01 | AC | 147 ms
88,688 KB |
testcase_02 | AC | 141 ms
88,688 KB |
testcase_03 | AC | 142 ms
88,688 KB |
testcase_04 | AC | 144 ms
88,688 KB |
testcase_05 | AC | 144 ms
88,688 KB |
testcase_06 | AC | 142 ms
88,688 KB |
testcase_07 | AC | 148 ms
88,688 KB |
testcase_08 | AC | 141 ms
88,688 KB |
testcase_09 | AC | 143 ms
88,688 KB |
testcase_10 | AC | 142 ms
88,688 KB |
testcase_11 | AC | 144 ms
88,688 KB |
testcase_12 | AC | 150 ms
89,200 KB |
testcase_13 | AC | 166 ms
89,840 KB |
testcase_14 | AC | 167 ms
89,840 KB |
testcase_15 | AC | 163 ms
89,840 KB |
testcase_16 | AC | 147 ms
88,816 KB |
testcase_17 | AC | 168 ms
89,840 KB |
testcase_18 | AC | 147 ms
88,688 KB |
testcase_19 | AC | 147 ms
88,816 KB |
testcase_20 | AC | 167 ms
89,840 KB |
testcase_21 | AC | 198 ms
92,912 KB |
testcase_22 | AC | 260 ms
96,240 KB |
testcase_23 | AC | 301 ms
100,080 KB |
testcase_24 | AC | 213 ms
93,040 KB |
testcase_25 | AC | 302 ms
101,360 KB |
testcase_26 | AC | 359 ms
105,840 KB |
testcase_27 | AC | 364 ms
105,456 KB |
testcase_28 | AC | 362 ms
105,328 KB |
testcase_29 | AC | 342 ms
105,328 KB |
testcase_30 | AC | 347 ms
105,328 KB |
testcase_31 | AC | 279 ms
105,072 KB |
testcase_32 | AC | 287 ms
105,200 KB |
testcase_33 | AC | 286 ms
104,816 KB |
testcase_34 | AC | 294 ms
104,688 KB |
testcase_35 | AC | 282 ms
104,816 KB |
testcase_36 | AC | 166 ms
101,616 KB |
testcase_37 | AC | 366 ms
105,456 KB |
testcase_38 | AC | 146 ms
88,688 KB |
testcase_39 | AC | 144 ms
88,688 KB |
testcase_40 | AC | 340 ms
104,560 KB |
testcase_41 | AC | 320 ms
104,560 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) class Prime: def __init__(self,N): assert N<=10**8 self.smallest_prime_factor=[None]*(N+1) for i in range(2,N+1,2): self.smallest_prime_factor[i]=2 n=int(N**.5)+1 for p in range(3,n,2): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p for i in range(p**2,N+1,2*p): if self.smallest_prime_factor[i]==None: self.smallest_prime_factor[i]=p for p in range(n,N+1): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]] def Factorize(self,N): assert N>=1 factors=defaultdict(int) if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] else: for p in self.primes: while N%p==0: N//=p factors[p]+=1 if N<p*p: if N!=1: factors[N]+=1 break if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] break else: if N!=1: factors[N]+=1 return factors def Divisors(self,N): assert N>0 divisors=[1] for p,e in self.Factorize(N).items(): pow_p=[1] for _ in range(e): pow_p.append(pow_p[-1]*p) divisors=[i*j for i in divisors for j in pow_p] return divisors def Is_Prime(self,N): return N==self.smallest_prime_factor[N] def Totient(self,N): for p in self.Factorize(N).keys(): N*=p-1 N//=p return N def Mebius(self,N): fact=self.Factorize(N) for e in fact.values(): if e>=2: return 0 else: if len(fact)%2==0: return 1 else: return -1 N=int(readline()) A=list(map(int,readline().split())) max_A=max(A) Pr=Prime(max_A) dp=[0]*(max_A+1) for a in A: le=0 for d in Pr.Divisors(a): le=max(le,dp[d]+1) dp[a]=le ans=max(dp) print(ans)