Doctoral Thesis | MatCom Online Grader

The 2025 ICPC Caribbean Finals (Qualifier) - Real Contest

Ended

Overview
Problems
Standing
Submissions
Submit
Clarifications
Virtual participation

Register

Are you sure you want to participate in this contest ? If you select a team then virtual participation for other team members will be disabled. So, pick one if and only if your teammates are ready to compete with you.

D - Doctoral Thesis

Languages: C, C++, Java, Python, Kotlin

Time & Memory limits: (details)

<div style="text-align: justify">
Professor Jun, at a prestigious Caribbean university, is currently pursuing his doctoral research in secure and reliable data transmission. Although simple at first glance, the **anagrams** are among the core elements in which he has placed great confidence to advance his work.

Two strings $X$ and $Y$ are anagrams if and only if $X$ can be obtained by rearranging the characters of $Y$; for example, $X = aaabbbccca$ and $Y = abcabcabac$ are anagrams. In particular, a string $X$ is an anagram of itself.

Accustomed to the traditional academic hierarchy followed in universities during research, Professor Jun has proposed several topics suitable for bachelor's and master's theses. He would like to share these topics with ICPC contestants to identify potential students with the right skills to collaborate on the very complex topics he is involved in. Those who are selected will, of course, benefit from working closely with him.

Taking advantage of the *The 2025 ICPC Caribbean Finals (Qualifier)*, Professor Jun has rewritten one of the subproblems from his doctoral project as a typical ICPC problem. Can you prove your skills by solving it here, in this contest? The description is as follows:

You are given a string **s**. With the simple goal of learning a little about that string, you must process several queries of two types:

</div>

* **INSIDE**: Given two indices $l$ and $r$, and a non-empty string $w$, determine whether $w$ is an anagram of the substring $s[l..r]$.
* **COUNT**: Given two indices $l$ and $r$, compute the number of distinct anagrams of the substring $s[l..r]$.

<div style="text-align: justify">
Here $s[l..r]$ denotes the substring of $s$ starting at index $l$ and ending at index $r$, inclusive. Indices $l$ and $r$ are 1-based.
</div>

Input

Output

Sample test(s)

Input

4 iktljylbfiufyfcaancewszq 3 INSIDE 11 14 uyff COUNT 7 18 COUNT 17 21 corklxhpqiooexbjuimbqvla 2 INSIDE 1 3 ocr COUNT 9 10 dcaqusosnkwdqpklhflemxeq 2 INSIDE 5 10 wlxaet INSIDE 10 13 dqkw pavfjnmlgsdciimwdlxvtuejsdth 3 COUNT 16 28 INSIDE 11 13 idc COUNT 6 6

--- Showing first 30 lines (click "Copy" to get full content) ---

Output

YES 39916800 120 YES 2 NO YES 558510847 YES 1

--- Showing first 30 lines (click "Copy" to get full content) ---

Input

4 xsiqusxuqbytnwahjmazia 2 COUNT 15 22 INSIDE 7 13 btquynx nttcyymqmauhekmsyevkixyzqgen 3 COUNT 1 12 INSIDE 14 18 ykmse COUNT 18 23 yooaxejnjjiaflzefgck 3 INSIDE 1 1 u INSIDE 11 13 wox INSIDE 6 6 u arunbkdrjzmrimtsbjatyihsjccptl 2 COUNT 9 14 INSIDE 22 24 hsi

--- Showing first 30 lines (click "Copy" to get full content) ---

Output

6720 YES 59875200 YES 720 NO NO NO 360 YES

--- Showing first 30 lines (click "Copy" to get full content) ---

Matcom Online Grader

The 2025 ICPC Caribbean Finals (Qualifier) - Real Contest

Ended

D - Doctoral Thesis

Languages: C, C++, Java, Python, Kotlin

Time & Memory limits: (details)

Input

Output

Sample test(s)