Problem:
Score : 500 points

Problem Statement

You are given a string S of length N consisting of lowercase English letters.

Process Q queries of the following two types:

Type 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)

Type 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).

Constraints

N, Q, i_q, l_q, and r_q are integers.

S is a string consisting of lowercase English letters.

c_q is a lowercase English letter.

1 \leq N \leq 500000

1 \leq Q \leq 20000

|S| = N

1 \leq i_q \leq N

1 \leq l_q \leq r_q \leq N

There is at least one query of type 2 in each testcase.

Input

Input is given from Standard Input in the following format:

N
S
Q
Query_1
\vdots
Query_Q

Here, Query_i in the 4-th through (Q+3)-th lines is one of the following:

1 i_q c_q

2 l_q r_q

Output

For each query of type 2, print a line containing the answer.

Sample Input 1

7
abcdbbd
6
2 3 6
1 5 z
2 1 1
1 4 a
1 7 d
2 1 7

Sample Output 1

3
1
5

In the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.

In the second query, S is modified to abcdzbd.

In the third query, a contains one kind of letter: a, so we print 1.

In the fourth query, S is modified to abcazbd.

In the fifth query, S does not change and is still abcazbd.

In the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.

Solution in Rust (1.15.1) (judge verdict: Accepted)

#[allow(dead_code)]
fn is_whitespace(c: &char) -> bool {
    c.is_whitespace()
}

#[allow(dead_code)]
fn is_eol(c: &char) -> bool {
    ['\r', '\n'].contains(c)
}

#[allow(unused_macros)]
macro_rules! input {
    ($var:ident, $($r:tt)*) => {
        input_inner!{$var, $($r)*}
    };

    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        #[allow(unused_mut, unused_variables, bare_trait_objects)]
        let mut next = move |f: &Fn(&char)->bool| -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|f(&c))
                .take_while(|c|!f(&c))
                .collect()
        };
        input_inner!{next, $($r)*};
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; eol ]) => {
        $next(&is_eol).split(' ').map(|x| x.parse::<$t>().unwrap()).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, parser) => {
        $next
    };

    ($next:expr, $t:ty) => {
        $next(&is_whitespace).parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap, HashSet};

#[allow(dead_code)]
struct Edge {
    from: usize,
    to: usize,
}

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;
#[allow(dead_code)]
const M: usize = 1_000_000_007;

struct SegmentTree {
    n: usize,
    data: Vec<i64>,
}

fn gcd(a: usize, b: usize) -> usize {
    if b != 0 {
        gcd(b, a % b)
    } else {
        a
    }
}

impl SegmentTree {
    fn f(&self, a: i64, b: i64) -> i64 {
        a | b
    }

    pub fn initial() -> i64 {
        0
    }

    fn new(size: usize) -> Self {
        let n = {
            let mut res = 1;
            while res < size {
                res <<= 1
            }
            res
        };
        let data = vec![Self::initial(); n * 2 - 1];
        SegmentTree { n: n, data: data }
    }

    fn update(&mut self, k: usize, a: i64) {
        let mut index = k + self.n - 1;
        self.data[index] = a;
        while index > 0 {
            index = (index - 1) / 2;
            self.data[index] = self.f(self.data[index * 2 + 1], self.data[index * 2 + 2]);
        }
    }

    // [a, b)
    fn query(&mut self, a: usize, b: usize) -> i64 {
        let (l, r) = (0, self.n);
        self.query_iter(a, b, 0, l, r)
    }

    fn query_iter(&mut self, a: usize, b: usize, k: usize, l: usize, r: usize) -> i64 {
        if r <= a || b <= l {
            Self::initial()
        } else if a <= l && r <= b {
            self.data[k]
        } else {
            let vl = self.query_iter(a, b, k * 2 + 1, l, (l + r) / 2);
            let vr = self.query_iter(a, b, k * 2 + 2, (l + r) / 2, r);
            self.f(vl, vr)
        }
    }
}

fn main() {
    input! {
        n: usize,
        s: chars,
        q: usize,
        mut parser: parser,
    }

    let mut segtree = SegmentTree::new(n + 1);

    for i in 0..n {
        let c = s[i];
        segtree.update(i, 1 << (c as u8 - b'a'));
    }

    for _ in 0..q {
        input! {
            parser,
            t: usize,
        }
        if t == 1 {
            input! {
                parser,
                x: usize1,
                s: chars,
            }
            segtree.update(x, 1 << (s[0] as u8 - b'a'));
        } else {
            input! {
                parser,
                l: usize1,
                r: usize,
            }
            let v = segtree.query(l, r);
            println!("{}", (v as usize).count_ones());
        }
    }
}