Submission #3415201

---

Source Code Expand

import strutils
import sequtils
import algorithm
import math
import queues
import tables
import sets
import logging
import future

const INF* = int(1e18 + 373)

proc readSeq*(): seq[string] = stdin.readLine().strip().split()
proc readSeq*(n: Natural): seq[string] =
  result = newSeq[string](n)
  for i in 0..<n:
    result[i] = stdin.readLine().strip()

proc readInt1*(): int = readSeq().map(parseInt)[0]
proc readInt2*(): (int, int) =
  let a = readSeq().map(parseInt)
  return (a[0], a[1])
proc readInt3*(): (int, int, int) =
  let a = readSeq().map(parseInt)
  return (a[0], a[1], a[2])
proc readInt4*(): (int, int, int, int) =
  let a = readSeq().map(parseInt)
  return (a[0], a[1], a[2], a[3])

type seq2*[T] = seq[seq[T]]
proc newSeq2*[T](n1, n2: Natural): seq2[T] = newSeqWith(n1, newSeq[T](n2))

#------------------------------------------------------------------------------#

proc main() =
  let s = stdin.readLine().map(it => it.ord() - 'a'.ord())
  let n = s.len()

  var cum = newSeq[int](n + 1)
  for i in 0..<n:
    cum[i + 1] = cum[i] xor (1 shl s[i])

  let alphabet = 'z'.ord() - 'a'.ord() + 1
  var firstIndexOf = newSeq[int32](1 shl alphabet)
  firstIndexOf.fill(1000000000)
  for i in 0..n:
    firstIndexOf[cum[i]] = min(firstIndexOf[cum[i]], i.int32())

  var dp = newSeq[int](n + 1)
  dp[0] = 0
  for i in 1..n:
    var opt = dp[i - 1] + 1

    let j = firstIndexOf[cum[i]]
    if j < i:
      opt = min(opt, dp[j] + 1)

    for c in 0..<alphabet:
      let j = firstIndexOf[cum[i] xor (1 shl c)]
      if j < i:
        opt = min(opt, dp[j] + 1)

    dp[i] = opt

  echo dp[n]

main()

Submission Info

Compile Error

Hint: system [Processing]
Hint: Main [Processing]
Hint: strutils [Processing]
Hint: parseutils [Processing]
Hint: sequtils [Processing]
Hint: algorithm [Processing]
Hint: math [Processing]
Hint: times [Processing]
Hint: queues [Processing]
Hint: tables [Processing]
Hint: hashes [Processing]
Hint: etcpriv [Processing]
Hint: sets [Processing]
Hint: os [Processing]
Hint: posix [Processing]
Hint: logging [Processing]
lib/pure/logging.nim(128, 22) Hint: 'Exception' is declared but not used [XDeclaredButNotUsed]
Hint: future [Processing]
Hint: macros [Processing]
Hint:  [Link]
Hint: operation successful (24855 lines compiled; 2.574 sec total; 24.250MB; Release Build) [SuccessX]

Judge Result