[ICPC 2022 Xi'an R] Perfect Word

Luogu

IDLGP9364

Time1000ms

Memory512MB

DifficultyP4

2022O2优化ICPC西安

You are given $n$ strings and required to find the length of the longest *perfect word*. A string $t$ is called a *perfect word*, if and only if every non-empty substring of $t$ appears in the given strings. A string $s$ is called a substring of $t$ if and only if it can be obtained by removing several (possibly zero) characters from the beginning or end of $t$. ## Input The first line contains a single integer $n$ ($1 \leq n \leq 10 ^ 5$). Each of the next $n$ lines contains a string consisting of lowercase English letters. It is guaranteed that the total length of the given strings is no more than $10 ^ 5$. ## Output Output an integer, representing the length of the longest perfect word. [samples] ## Note **Source**: The 2022 ICPC Asia Xi'an Regional Contest Problem G. **Author**: MonkeyKing.

Samples

Input #1

4
a
t
b
ab

Output #1

API Response (JSON)

{
  "problem": {
    "name": "[ICPC 2022 Xi'an R] Perfect Word",
    "description": {
      "content": "You are given $n$ strings and required to find the length of the longest *perfect word*. A string $t$ is called a *perfect word*, if and only if every non-empty substring of $t$ appears in the given ",
      "description_type": "Markdown"
    },
    "platform": "Luogu",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 524288
    },
    "difficulty": {
      "LuoguStyle": "P4"
    },
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "LGP9364"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given $n$ strings and required to find the length of the longest *perfect word*.\n\nA string $t$ is called a *perfect word*, if and only if every non-empty substring of $t$ appears in the given ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments