34605번 - Tower of Hanoi 다국어

문제

While visiting Hanoi to compete in The ICPC Asia Pacific Championship last year, you learned about the famous Tower of Hanoi problem. In the problem, there are three rods and several disks of distinct radii, which can slide onto any rod. The rods are numbered from 1ドル$ to 3ドル$. At any point in time, each disk must be stacked on one of the rods, and the disks stacked on each rod must be arranged in increasing order of radius from top to bottom. In one step, you can move the disk on top of one rod to the top of another rod, provided this move does not violate the restriction above. The goal is to move all the disks to rod 1ドル$ in the minimum number of steps.

You are solving an extension of this famous problem. You have a sequence of $n$ integers $p_1, p_2, \dots , p_n,ドル the initial values of which are given to you.

You are also given $q$ operations. Each operation is either of the following:

Change operation: Two integers $x$ and $y$ are given. This operation requires you to change the value of $p_x$ to $y$.

Solve operation: Two integers $l$ and $r$ are given. This operation requires you to solve the Tower of Hanoi problem with $r − l + 1$ disks of radii $l, l + 1, \dots , r,ドル where the disk of radius $i$ is initially stacked on rod $p_i,ドル for each $l ≤ i ≤ r$. The order of the disks initially stacked on each rod satisfies the restriction explained earlier. You need to find the minimum number of steps to move all disks to rod 1ドル$ modulo 998ドル,円 244,円 353$.

Your task is to perform all the given operations sequentially.

입력

The first line of input contains two integers $n$ and $q$ (1ドル ≤ n ≤ 100,円 000$; 1ドル ≤ q ≤ 100,円 000$). The second line contains $n$ integers representing the initial values of $p_1, p_2, \dots , p_n$ (1ドル ≤ p_i ≤ 3$). The next $q$ lines represent the operations in the order they are to be performed. Each line is in one of the following formats:

1. “$c$ $x$ $y$” (1ドル ≤ x ≤ n$; 1ドル ≤ y ≤ 3$) to apply a Change operation for the specified integers $x$ and $y$.
2. “$s$ $l$ $r$” (1ドル ≤ l ≤ r ≤ n$) to apply a Solve operation for the specified integers $l$ and $r$.

The input contains at least one Solve operation.

출력

For each Solve operation, in order, output the minimum number of steps to solve the Tower of Hanoi problem with disks of radii $l, l + 1, \dots , r$ modulo 998ドル,円 244,円 353$.

제한

노트