Problem:
Score : 300 points

Problem Statement

You are given strings S and T consisting of lowercase English letters.

You can perform the following operation on S any number of times:

Operation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.

Determine if S and T can be made equal by performing the operation zero or more times.

Constraints

1 \leq |S| \leq 2 \times 10^5

|S| = |T|

S and T consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T

Output

If S and T can be made equal, print Yes; otherwise, print No.

Sample Input 1

azzel
apple

Sample Output 1

Yes

azzel can be changed to apple, as follows:

Choose e as c_1 and l as c_2. azzel becomes azzle.

Choose z as c_1 and p as c_2. azzle becomes apple.

Sample Input 2

chokudai
redcoder

Sample Output 2

No

No sequences of operation can change chokudai to redcoder.

Sample Input 3

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu

Sample Output 3

Yes

Solution in Rust (1.15.1) (judge verdict: Time Limit Exceeded)

use std::collections::HashMap;

fn main() {
    let mut s1 = {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        s.trim_right().to_owned()
    };

    let mut s2 = {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        s.trim_right().to_owned()
    };


    let mut map1: HashMap<char, Vec<usize>> = HashMap::new();
    let mut map2: HashMap<char, Vec<usize>> = HashMap::new();
    for i in 0..26 {
        map1.insert((i + b'a') as char, Vec::new());
        map2.insert((i + b'a') as char, Vec::new());
    }

    let mut vs1 = Vec::new();
    let mut vs2 = Vec::new();

    let mut k = 0;
    while let Some(c1) = s1.pop() {
        if let Some(c2) = s2.pop() {
            if let Some(v) = map1.get_mut(&c1) {
                v.push(k.clone());
            }
            vs1.push(c1);
            vs2.push(c2);
        }
        k += 1;
    }

    for i in 0..vs1.len() {
        if vs1[i] != vs2[i] {
            let tmp_vc1 = vs1[i].clone();
            let tmp_vc2 = vs2[i].clone();
            let mut remaind_vc1 = Vec::new();
            let mut remaind_vc2 = Vec::new();

            if let Some(v) = map1.get_mut(&tmp_vc1) {
                while let Some(j) = v.pop() {
                    remaind_vc1.push(j.clone() as usize);
                }
            }
            if let Some(v) = map1.get_mut(&tmp_vc2) {
                while let Some(j) = v.pop() {
                    remaind_vc2.push(j.clone() as usize);
                }
            }

            for rv in remaind_vc1 {
                vs1[rv] = tmp_vc2.clone();
                if let Some(v) = map1.get_mut(&tmp_vc2) {
                    v.push(rv.clone());
                }
            }
            for rv in remaind_vc2 {
                if let Some(v) = map1.get_mut(&tmp_vc1) {
                    v.push(rv.clone());
                }
                vs1[rv] = tmp_vc1.clone();
            }
        }
    }

    if vs1 == vs2 {
        println!("Yes");
    } else {
        println!("No");
    }
}