### 2017 Canadian Computing Competition

## Problem S5: RMT

The Rail Metro Transit (RMT) operates a very unusual subway system. There are `N` subway stations numbered from 1 to `N`. There are `M` subway lines numbered from 1 to `M`, with each station belonging to exactly one line and at least one station per line. The subway lines are circular. That is, if a station is numbered `S`, the next station after `S` is the station on the same line with the next largest number, unless `S` is the greatest number of a station in the line, in which case the next station after `S` is the station on the same line with the least number.

RMT is conducting a load test of their system using volunteer passengers to ride the subway trains. The test begins with one subway train in each station and for every `i`, there are `A _{i}` passengers in the train at station

`i`. The volunteers do not leave their assigned trains throughout the entire duration of the load test.

Throughout the test, RMT will perform `Q` actions. Each of the `Q` actions is one of two types: either they will survey the total number of passengers in the trains at the stations numbered from `l` to `r`; or they will operate all the trains on some line `x`. When a train on line `x` is operated, it goes to the next station in that line.

You are RMT's biggest fan, so you have generously volunteered to keep track of RMT's actions and report the answers to their surveys.

### Input Format

The first line will contain three space-separated integers `N`, `M`, and `Q` (1 ≤ `M` ≤ `N` ≤ 150 000; 1 ≤ `Q` ≤ 150 000). The second line will contain the subway line numbers that each station from 1 to `N` belongs to: `L`_{1}, `L`_{2}, …, `L _{N}`. The third line will contain

`N`integers

`A`

_{1},

`A`

_{2}, …,

`A`(1 ≤

_{N}`A`≤ 7 000) representing the initial number of passengers at each station from 1 to

_{i}`N`.

The next `Q` lines will each have one of the following forms:

- 1
`l``r`, which represents a survey (1 ≤`l`≤`r`≤`N`). - 2
`x`, which represents RMT operating line`x`(1 ≤`x`≤`M`).

For 2 of the 15 available marks, `N` ≤ 1 000 and `Q` ≤ 1 000.

For an additional 2 of the 15 available marks, `L _{i}` ≤

`L`

_{i + 1}(1 ≤

`i`<

`N`).

For an additional 3 of the 15 available marks,

`M`≤ 200.

For an additional 3 of the 15 available marks, there will be no more than 200 trains on any single line.

### Output Specification

For every survey, output the answer to the survey on a separate line.

### Sample Input 1

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

### Sample Output 1

15 10 9

### Explanation 1

The subway system is illustrated below, with the stations numbered from 1 to 5 and the lines connecting stations marked as either being line 1 or line 2:

Initially, the number of passengers at each station is {1, 2, 3, 4, 5}.

The answer to the first survey is 1 + 2 + 3 + 4 + 5 = 15.

After line 1 is operated, the number of passengers at each station is {3, 2, 1, 4, 5}.

The answer to the second survey is 1 + 4 + 5 = 10.

After line 2 is operated, the number of passengers at each station is {3, 5, 1, 2, 4}.

The answer to the third survey is 3 + 5 + 1 = 9.

### Sample Input 2

3 1 7 1 1 1 114 101 109 1 1 1 2 1 1 1 1 2 1 1 1 1 2 1 1 1 1

### Sample Output 2

114 109 101 114

### Explanation 2

The subway system is illustrated below, with the stations numbered from 1 to 3 and the lines connecting stations marked as all being line 1:

Just before the first survey, the number of passengers at each station is {114, 101, 109}.

Just before the second survey, the number of passengers at each station is {109, 114, 101}.

Just before the third survey, the number of passengers at each station is {101, 109, 114}.

Just before the fourth survey, the number of passengers at each station is {114, 101, 109}.

All Submissions

Best Solutions

**Point Value:** 20 (partial)

**Time Limit:** 10.00s

**Memory Limit:** 256M

**Added:** Aug 08, 2017

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

It's quiet in here...