verify/AI/palindromic_tree_test.nim

View this file on GitHub
Last update: 2026-09-04 08:24:17+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/problems/ITP1_1_A

Depends on

Code

# verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/ITP1_1_A
echo "Hello World"

import algorithm, sequtils
import cplib/str/palindromic_tree

var pt = initPalindromicTree("ababa")
let lens = pt.nodes.mapIt(it[].len).sorted
assert lens == @[-1, 0, 1, 1, 3, 3, 5]
let longest = pt.nodes.filterIt(it[].len == 5)[0]
assert longest[].id >= 0
assert longest[].count == 1
assert pt.get_palindrome(longest) == @[0, 1, 0, 1, 0]
pt.update_count()
let aNode = pt.nodes.filterIt(it[].len == 1 and pt.get_palindrome(it) == @[0])[0]
assert aNode[].count == 3

let intPt = initPalindromicTree(@[0, 2, 0])
let intLongest = intPt.nodes.filterIt(it[].len == 3)[0]
assert intPt.get_palindrome(intLongest) == @[0, 2, 0]

let charPt = initPalindromicTree(['a', 'b', 'a'])
let charLongest = charPt.nodes.filterIt(it[].len == 3)[0]
assert charPt.get_palindrome(charLongest) == @[0, 1, 0]

let emptyPt = initPalindromicTree(newSeq[int]())
assert emptyPt.nodes.mapIt(it[].len) == @[-1, 0]

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/onlinejudge_verify/languages/nim.py", line 86, in bundle
    raise NotImplementedError
NotImplementedError