Problem:
Score : 600 points

Problem Statement

We have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.

You are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?

Constraints

1\leq N,Q \leq 5 \times 10^5

1\leq c_i \leq N

1\leq l_i \leq r_i \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N Q
c_1 c_2 \cdots c_N
l_1 r_1
l_2 r_2
:
l_Q r_Q

Output

Print Q lines. The i-th line should contain the response to the i-th query.

Sample Input 1

4 3
1 2 1 3
1 3
2 4
3 3

Sample Output 1

2
3
1

The 1-st, 2-nd, and 3-rd balls from the left have the colors 1, 2, and 1 - two different colors.

The 2-st, 3-rd, and 4-th balls from the left have the colors 2, 1, and 3 - three different colors.

The 3-rd ball from the left has the color 1 - just one color.

Sample Input 2

10 10
2 5 6 5 2 1 7 9 7 2
5 5
2 4
6 7
2 2
7 8
7 9
1 8
6 9
8 10
6 8

Sample Output 2

1
2
2
1
2
2
6
3
3
3

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

// ---------- begin Mo algorithm ----------
pub trait MoOperatorLR {
    type Value;
    type Query;
    type Answer;
    fn init(&mut self);
    fn insert_left(&mut self, v: &Self::Value);
    fn insert_right(&mut self, v: &Self::Value);
    fn delete_left(&mut self, v: &Self::Value);
    fn delete_right(&mut self, v: &Self::Value);
    fn answer(&mut self, q: &Self::Query) -> Self::Answer;
}

pub trait MoOperator {
    type Value;
    type Query;
    type Answer;
    fn init(&mut self);
    fn insert(&mut self, v: &Self::Value);
    fn delete(&mut self, v: &Self::Value);
    fn answer(&mut self, q: &Self::Query) -> Self::Answer;
}

impl<T> MoOperatorLR for T
where
    T: MoOperator,
{
    type Value = T::Value;
    type Query = T::Query;
    type Answer = T::Answer;
    fn init(&mut self) {
        self.init();
    }
    fn insert_left(&mut self, v: &Self::Value) {
        self.insert(v);
    }
    fn insert_right(&mut self, v: &Self::Value) {
        self.insert(v);
    }
    fn delete_left(&mut self, v: &Self::Value) {
        self.delete(v);
    }
    fn delete_right(&mut self, v: &Self::Value) {
        self.delete(v);
    }
    fn answer(&mut self, q: &Self::Query) -> Self::Answer {
        self.answer(q)
    }
}

pub struct MoSolver<State: MoOperatorLR> {
    state: State,
    array: Vec<State::Value>,
    query: Vec<(usize, usize, State::Query)>,
}

impl<State: MoOperatorLR> MoSolver<State> {
    fn new(state: State, array: Vec<State::Value>) -> Self {
        MoSolver {
            state: state,
            array: array,
            query: vec![],
        }
    }
    fn add(&mut self, l: usize, r: usize, q: State::Query) {
        assert!(l < r && r <= self.array.len());
        self.query.push((l, r, q));
    }
    #[allow(dead_code)]
    fn solve(&mut self, answer: &mut [State::Answer]) {
        assert!(self.query.len() <= answer.len());
        if self.query.is_empty() {
            return;
        }
        let batch = (self.array.len() as f64 / (2.0 * self.query.len() as f64).sqrt()).ceil() as usize;
        self.solve_with_size(answer, batch);
    }
    fn solve_with_size(&mut self, answer: &mut [State::Answer], batch: usize) {
        assert!(self.query.len() <= answer.len());
        assert!(batch > 0);
        if self.query.is_empty() {
            return;
        }
        let size = self.array.len();
        let batch = (size as f64 / (self.query.len() as f64).sqrt()).ceil() as usize;
        let mut q = (0..(size / batch + 1)).map(|_| vec![]).collect::<Vec<_>>();
        let mut query = vec![];
        std::mem::swap(&mut query, &mut self.query);
        for (k, (l, r, op)) in query.into_iter().enumerate() {
            q[l / batch].push((r, l, k, op));
        }
        let state = &mut self.state;
        state.init();
        let mut x = 0;
        let mut y = 0;
        for (i, q) in q.iter_mut().enumerate() {
            q.sort_by_key(|p| p.0);
            if i % 2 == 1 {
                q.reverse();
            }
            for p in q.iter() {
                let (r, l, k) = (p.0, p.1, p.2);
                for v in self.array[std::cmp::min(y, r)..r].iter() {
                    state.insert_left(v);
                    y = r;
                }
                for v in self.array[std::cmp::min(l, x)..x].iter().rev() {
                    state.insert_right(v);
                    x = l;
                }
                for v in self.array[std::cmp::min(r, y)..y].iter().rev() {
                    state.delete_right(v);
                    y = r;
                }
                for v in self.array[std::cmp::min(x, l)..l].iter() {
                    state.delete_left(v);
                    x = l;
                }
                answer[k] = state.answer(&p.3);
            }
        }
    }
}
// ---------- end Mo algorithm ----------

use proconio::*;
use proconio::marker::*;

struct State {
    cnt: Vec<u32>,
    ans: u32,
}

impl MoOperator for State {
    type Value = usize;
    type Query = ();
    type Answer = u32;
    fn init(&mut self) {
        self.cnt.iter_mut().for_each(|c| *c = 0);
        self.ans = 0;
    }
    fn insert(&mut self, v: &Self::Value) {
        let c = &mut self.cnt[*v];
        *c += 1;
        if *c == 1 {
            self.ans += 1;
        }
    }
    fn delete(&mut self, v: &Self::Value) {
        let c = &mut self.cnt[*v];
        *c -= 1;
        if *c == 0 {
            self.ans -= 1;
        }
    }
    fn answer(&mut self, _q: &Self::Query) -> Self::Answer {
        self.ans
    }
}

#[fastout]
fn run() {
    input! {
        n: usize,
        q: usize,
        c: [Usize1; n],
        ask: [(Usize1, usize); q],
    }
    let state = State {
        cnt: vec![0; n],
        ans: 0,
    };
    let mut solver = MoSolver::new(state, c);
    for (l, r) in ask {
        solver.add(l, r, ());
    }
    let mut ans = vec![0; q];
    solver.solve_with_size(&mut ans, 1024);
    for a in ans {
        println!("{}", a);
    }
}

fn main() {
    run();
}