{"problem":{"name":"Compress Strings","description":{"content":"You are given $N$ strings $S_1, S_2, \\ldots, S_N$. Find the minimum length of a string that contains all these strings as substrings. Here, a string $S$ contains a string $T$ as a substring if $T$ can","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":5000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc343_g"},"statements":[{"statement_type":"Markdown","content":"You are given $N$ strings $S_1, S_2, \\ldots, S_N$.\nFind the minimum length of a string that contains all these strings as substrings.\nHere, a string $S$ contains a string $T$ as a substring if $T$ can be obtained by deleting zero or more characters from the beginning and zero or more characters from the end of $S$.\n\n## Constraints\n\n*   $N$ is an integer.\n*   $1 \\leq N \\leq 20$\n*   $S_i$ is a string consisting of lowercase English letters whose length is at least $1$.\n*   The total length of $S_1, S_2, \\dots, S_N$ is at most $2\\times 10^5$.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$S_2$\n$\\vdots$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc343_g","tags":[],"sample_group":[["3\nsnuke\nkensho\nuk","9\n\nThe string `snukensho` of length $9$ contains all of $S_1$, $S_2$, and $S_3$ as substrings.\nSpecifically, the first to fifth characters of `snukensho` correspond to $S_1$, the fourth to ninth correspond to $S_2$, and the third to fourth correspond to $S_3$.\nNo shorter string contains all of $S_1$, $S_2$, and $S_3$ as substrings. Thus, the answer is $9$."],["3\nabc\nabc\narc","6"],["6\ncmcmrcc\nrmrrrmr\nmrccm\nmmcr\nrmmrmrcc\nccmcrcmcm","27"]],"created_at":"2026-03-03 11:01:14"}}