Sheokand and String
All submissions for this problem are available.
Read problems statements in Mandarin chinese, Russian and Vietnamese as well.Sheokand loves strings. Chef has $N$ strings $S_1, S_2, \dots, S_N$ which he wants to give to Sheokand; however, he doesn't want to give them away for free, so Sheokand must first correctly answer $Q$ queries Chef asks him. In each query, Chef tells Sheokand an integer $R$ and a string $P$. Consider Chef's strings $S_1$ through $S_R$. Out of these strings, consider all strings such that their longest common prefix with $P$ is maximum possible. Sheokand should find the lexicographically smallest of these strings. Sheokand is busy with his exams. Can you solve the queries for him? ### Input - The first line of the input contains a single integer $N$. - $N$ lines follow. For each valid $i$, the $i$-th of these lines contains Chef's string $S_i$. - The next line contains a single integer $Q$. - The following $Q$ lines describe queries. Each of these lines contains an interger $R$, followed by a space and a string $P$. ### Output For each query, print a single line containing the string that satisfies the required conditions — the answer to that query. ### Constraints - $1 \le N \le 100,000$ - $1 \le |S_i| \le 10$ for each valid $i$ - $1 \le Q \le 100,000$ - $1 \le R \le N$ - $1 \le |P| \le 10$ ### Subtasks **Subtask #1 (30 points):** $1 \le N, R \le 1,000$ **Subtask #2 (70 points):** original constraints ### Example Input ``` 4 abcd abce abcdex abcde 3 3 abcy 3 abcde 4 abcde ``` ### Example Output ``` abcd abcdex abcde ``` ### Explanation **Query 1:** For strings $S_1$ through $S_3$, the longest common prefix is always "abc", but "abcd" is the lexicographically smallest of these three strings. **Query 2:** For strings $S_1$ through $S_3$, the longest common prefix with maximum length is "abcde" and the only string for which it is the LCP is "abcdex", so this is the answer. **Query 3:** For strings $S_1$ through $S_4$, the longest common prefix with maximum length is "abcde"; it is the LCP for strings "abcdex" and "abcde", but "abcde" is the lexicographically smaller string, so it is the answer.
|Tags||easy-medium, jitendersheora, jitendersheora, june18, likecs, offline, tries|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.