結果

問題 No.390 最長の数列
ユーザー dot_haraaidot_haraai
提出日時 2021-05-29 13:14:00
言語 Nim
(2.0.2)
結果
AC  
実行時間 93 ms / 5,000 ms
コード長 1,360 bytes
コンパイル時間 3,661 ms
コンパイル使用メモリ 87,896 KB
実行使用メモリ 14,176 KB
最終ジャッジ日時 2024-11-07 21:21:31
合計ジャッジ時間 5,146 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
11,776 KB
testcase_01 AC 16 ms
11,776 KB
testcase_02 AC 17 ms
11,776 KB
testcase_03 AC 17 ms
11,776 KB
testcase_04 AC 17 ms
11,776 KB
testcase_05 AC 30 ms
14,172 KB
testcase_06 AC 93 ms
14,080 KB
testcase_07 AC 15 ms
11,748 KB
testcase_08 AC 14 ms
11,776 KB
testcase_09 AC 15 ms
11,776 KB
testcase_10 AC 41 ms
14,080 KB
testcase_11 AC 41 ms
14,172 KB
testcase_12 AC 39 ms
14,176 KB
testcase_13 AC 35 ms
13,184 KB
testcase_14 AC 59 ms
13,180 KB
testcase_15 AC 13 ms
11,776 KB
testcase_16 AC 13 ms
11,768 KB
testcase_17 AC 13 ms
11,776 KB
testcase_18 AC 16 ms
11,776 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]

ソースコード

diff #

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




proc solve():int=
  var
    n = scan()
    mx = 10^6
    v = newseqwith(mx+1,false)
    dpt = newseqwith(mx+1,0)
    add1 = false
  for i in 0..<n:
    v[scan()] = true
  if v[1] == false:
    v[1]=true
    add1 = true
  
  proc bfs(s:int)=
    var
      # 一回素朴なBFS
      # (p,cost)
      q = initDeque[(int,int)]()
    q.addLast((s,1))
    while q.len>0:
      var (p,cost) = q.popFirst()
      if dpt[p] > cost:continue
      dpt[p] = cost
      var m = 2
      while p*m <= mx:
        if v[p*m]:
          q.addLast((p*m,cost+1))
          break
        m+=1
  #bfs(1)
  dpt[1]=1
  for i in 1..mx:
    var m = 2
    if v[i]:
      while i*m<=mx:
        if v[i*m]:
          dpt[i*m].max=dpt[i]+1
        m+=1
  #echo dpt[0..12]
  if add1:
    return dpt.max()-1
  else:
    return dpt.max()




  
  
echo solve()
0