시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
4 초 1024 MB 0 0 0 0.000%

문제

Having recently moved into a new house, Eustace the Sheep has decided to renovate his lavatory as he simply cannot stand the sight of its drab interior. At the moment, the toilet floor consists of a 3 by N grid of black and white squares in some initial pattern.

Eustace notices that he has a very large number of identical rectangular 1 by 2 tiles at his disposal. To preserve the aesthetic appeal of his washroom, each tile can be rotated but must be placed parallel to the walls of the toilet. Furthermore, the glue that he uses to secure the tiles in place cannot be applied to the black squares, meaning that tiles can only be placed on white squares.

Alas, the successful renovation of Eustace’s bathroom is contingent on the availability of his contractor, who has unilaterally postponed their plans. In the midst of daydreaming, Eustace gazes wistfully at a section of his bathroom floor that spans columns a to b, wondering how many different patterns he can make by placing down some or none of the tiles within that region. Two patterns are considered different if two squares that share a tile in one pattern do not share a tile in the other.

Just as he has finished calculating the total number of possible patterns, he realises that some squares have been discoloured due to a variety of factors such as mould, mildew and the like. In particular, sometimes a single square in row x and column y may have its colour flipped from black to white and vice versa.

Help Eustace answer his questions by determining the number of possible patterns of tiles amid the ever-changing colour scheme of his bathroom floor!

As the answer may be large, output the remainder when the answer is divided by 1 000 000 007.

입력

Your program must read from standard input.

The first line of the input contains 2 integers N and Q denoting the length of Eustace’s bathroom floor and the total number of queries and updates.

3 lines will follow, representing the initial pattern of squares. Each line contains a string of length N consisting solely of dots ‘.’ and crosses ‘x’. Here, a dot denotes a white square while a cross denotes a black square.

Q lines then follow, with each line taking on one of the following forms:

  • 1 x y which indicates an update where the colour of the square at row x and column y has been flipped.
  • 2 a b which represents a query for the number of patterns that can be formed if tiles are confined to columns a to b. Not placing any tiles also forms a pattern.

출력

Your program must print to standard output.

For each query, output on a new line the remainder when the number of possible patterns is divided by 1 000 000 007.

제한

  • 1 ≤ N, Q ≤ 30000
  • 1 ≤ x ≤ 3
  • 1 ≤ y ≤ N
  • 1 ≤ a ≤ b ≤ N

서브태스크

번호 배점 제한
1 17

1 ≤ N, Q ≤ 8

2 23

There will never be any black squares.

3 26

1 ≤ N, Q ≤ 7000

4 34

예제 입력 1

4 5
.x.x
xx..
...x
2 1 4
2 3 3
1 2 3
2 1 4
2 3 3

예제 출력 1

11
3
3
1

Using −− to denote a tile, the 11 patterns for the first query are:

.x.x    .x.x    .x.x    .x.x
xx..    xx..    xx--    xx|.
...x    .--x    --.x    ..|x

.x.x    .x.x    .x|x    .x|x
xx..    xx--    xx|.    xx|.
--.x    .--x    .--x    ...x

.x.x    .x.x    .x|x
xx--    xx|.    xx|.
...x    --|x    --.x

For the second query, tiles are restricted to column 3. These are the 3 patterns:

.    .    |
.    |    |
.    |    .

After the first update, the bathroom floor will look like this:

.x.x
xxx.
...x

There are only 3 possible patterns now for the third query:

.x.x    .x.x    .x.x
xxx.    xxx.    xxx.
...x    --.x    .--x

For the last query, no tile can be placed in column 3 alone. There is only one pattern, the current one.

예제 입력 2

2 1
..
..
xx
2 1 2

예제 출력 2

7

Using −− to denote a tile, the 7 patterns are:

..    ..    .|    --    |.    --    ||
..    --    .|    ..    |.    --    ||

예제 입력 3

14 2
..............
..............
..............
2 2 11
2 1 14

예제 출력 3

47177097
254767228

채점 및 기타 정보

  • 예제는 채점하지 않는다.