{"problem":{"name":"Substring of Sorted String","description":{"content":"You are given a string $S$ of length $N$ consisting of lowercase English letters, and $Q$ queries. Process the queries in order. Each query is of one of the following two kinds: *   `1 x c` : replace","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc285_f"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ of length $N$ consisting of lowercase English letters, and $Q$ queries. Process the queries in order.\nEach query is of one of the following two kinds:\n\n*   `1 x c` : replace the $x$\\-th character of $S$ by the character $c$.\n*   `2 l r` : let $T$ be the string obtained by sorting the characters of $S$ in ascending order. Print `Yes` if the string consisting of the $l$\\-th through $r$\\-th characters of $S$ is a substring of $T$; print `No` otherwise.\n\nWhat is a substring? A **substring** of $S$ is a string obtained by removing $0$ or more initial characters and $0$ or more final characters of $S$. For example, `ab` is a substring of `abc`, while `ac` is not a substring of `abc`.\n\n## Constraints\n\n*   $1\\leq N \\leq 10^5$\n*   $S$ is a string of length $N$ consisting of lowercase English letters.\n*   $1 \\leq Q \\leq 10^5$\n*   For each query of the first kind, $1 \\leq x \\leq N$.\n*   For each query of the first kind, $c$ is a lowercase English letter.\n*   For each query of the second kind, $1 \\leq l \\leq r \\leq N$.\n\n## Input\n\nThe input is given from Standard Input in the following format, where $\\text{query}_i$ denotes the $i$\\-th query:\n\n$N$\n$S$\n$Q$\n$\\text{query}_1$\n$\\text{query}_2$\n$\\vdots$\n$\\text{query}_Q$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc285_f","tags":[],"sample_group":[["6\nabcdcf\n4\n2 1 3\n2 2 6\n1 5 e\n2 2 6","Yes\nNo\nYes\n\n*   In the $1$\\-st query, `abccdf` is the string $T$ obtained by sorting the characters of $S$ in ascending order. The string `abc`, consisting of the $1$\\-st through $3$\\-rd characters of $S$, is a substring of $T$, so `Yes` should be printed.\n*   In the $2$\\-nd query, `abccdf` is the string $T$ obtained by sorting the characters of $S$ in ascending order. The string `bcdcf`, consisting of the $2$\\-nd through $6$\\-th characters of $S$, is not a substring of $T$, so `No` should be printed.\n*   The $3$\\-rd query sets the $5$\\-th character of $S$ to `e`, making $S$ `abcdef`.\n*   In the $4$\\-th query, `abcdef` is the string $T$ obtained by sorting the characters of $S$ in ascending order. The string `bcdef`, consisting of the $2$\\-nd through $6$\\-th characters of $S$, is a substring of $T$, so `Yes` should be printed."]],"created_at":"2026-03-03 11:01:13"}}