S5. RMT
의견: 0
Time limit: 5 seconds
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 \(\ell\) 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.
\((1 \le M \le N \le 150\,000; 1 \le Q \le 150\,000)\)
\((1 \le A_i \le 7\,000)\)
\(1 \le \ell \le r \le N\)
\(1 \le x \le M\)
\(N \le 1\,000\)
\(Q \le 1\,000\)
\(L_i \le L_{i+1}\)
\((1 \le i < N)\)
\(M \le 200\)
The first line will contain three space-separated integers \(N\), \(M\), and \(Q\) \((1 \le M \le N \le 150\,000; 1 \le Q \le 150\,000)\). The second line will
contain the subway line numbers that each station from \(1\) to \(N\) belongs to: \(L_1, L_2, \ldots, L_N\). The third line
will contain \(N\) integers \(A_1, A_2, \ldots, A_N\) \((1 \le A_i \le 7\,000)\) representing the
initial number of passengers at each station from \(1\) to \(N\).
The next \(Q\) lines will each have
one of the following forms:
-
1\(\ell\)r, which represents a survey (\(1 \le \ell \le r \le N\)). -
2\(x\), which represents RMT operating line \(x\) (\(1 \le x \le M\)).
For 2 of the 15 available marks, \(N \le 1\,000\) and \(Q \le 1\,000\).
For an additional 2 of the 15 available marks, \(L_i \le L_{i+1}\) \((1 \le i < N)\).
For an additional 3 of the 15 available marks, \(M \le 200\).
For an additional 3 of the 15 available marks, there will be no more
than \(200\) trains on any single
line.
For every survey, output the answer to the survey on a separate
line.
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 315
10
9The 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\).
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 1114
109
101
114The 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\}\).
평가 및 의견
S5. RMT
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
S5. RMT