CF985F Isomorphic Strings

You are given a string $ s $ of length $ n $ consisting of lowercase English letters. For two given strings $ s $ and $ t $ , say $ S $ is the set of distinct characters of $ s $ and $ T $ is the set of distinct characters of $ t $ . The strings $ s $ and $ t $ are isomorphic if their lengths are equal and there is a one-to-one mapping (bijection) $ f $ between $ S $ and $ T $ for which $ f(s_{i})=t_{i} $ . Formally: 1. $ f(s_{i})=t_{i} $ for any index $ i $ , 2. for any character  there is exactly one character  that $ f(x)=y $ , 3. for any character  there is exactly one character  that $ f(x)=y $ . For example, the strings "aababc" and "bbcbcz" are isomorphic. Also the strings "aaaww" and "wwwaa" are isomorphic. The following pairs of strings are not isomorphic: "aab" and "bbb", "test" and "best". You have to handle $ m $ queries characterized by three integers $ x,y,len $ ( $ 1

N/A

N/A

The queries in the example are following: 1. substrings "a" and "a" are isomorphic: $ f(a)=a $ ; 2. substrings "ab" and "ca" are isomorphic: $ f(a)=c $ , $ f(b)=a $ ; 3. substrings "bac" and "aba" are not isomorphic since $ f(b) $ and $ f(c) $ must be equal to $ a $ at same time; 4. substrings "bac" and "cab" are isomorphic: $ f(b)=c $ , $ f(a)=a $ , $ f(c)=b $ .