IOI '05 P2 - Mountain - DMOJ: Modern Online Judge

IOI '05 P2 - Mountain

Points: 20 (partial)

Time limit: 1.4s

Memory limit: 256M

Problem type

The Mountain Amusement Park has opened a brand-new simulated roller coaster. The simulated track consists of $n$ $n$ rails attached end-to-end with the beginning of the first rail fixed at elevation $0$ $0$ . Byteman, the operator, can reconfigure the track at will by adjusting the elevation change over a number of consecutive rails. The elevation change over other rails is not affected. Each time rails are adjusted, the following track is raised or lowered as necessary to connect the track while maintaining the start at elevation $0$ $0$ . The figure on the next page illustrates two example track reconfigurations.

Each ride is initiated by launching the car with sufficient energy to reach height $h$ $h$ . That is, the car will continue to travel as long as the elevation of the track does not exceed $h$ $h$ , and as long as the end of the track is not reached.

Given the record for all the day's rides and track configuration changes, compute for each ride the number of rails traversed by the car before it stops.

Internally, the simulator represents the track as a sequence of $n$ $n$ elevation changes, one for each rail. The $i$ $i$ -th number $d_i$ $d_{i}$ represents the elevation change (in centimetres) over the $i$ $i$ -th rail. Suppose that after traversing $i-1$ $i - 1$ rails the car has reached an elevation of $h$ $h$ centimetres. After traversing $i$ $i$ rails the car will have reached an elevation of $h+d_i$ $h + d_{i}$ centimetres.

Initially the rails are horizontal; that is, $d_i = 0$ $d_{i} = 0$ for all $i$ $i$ . Rides and reconfigurations are interleaved throughout the day. Each reconfiguration is specified by three numbers: $a, b$ $a, b$ and $D$ $D$ . The segment to be adjusted consists of rails $a$ $a$ through $b$ $b$ (inclusive). The elevation change over each rail in the segment is set to $D$ $D$ . That is, $d_i = D$ $d_{i} = D$ for all $a \le i \le b$ $a \leq i \leq b$ .

Each ride is specified by one number $h$ $h$ — the maximum height that the car can reach.

Task

Write a program that:

reads from the standard input a sequence of interleaved reconfigurations and rides,
for each ride computes the number of rails traversed by the car,
writes the results to the standard output.

Input

The first line of input contains one positive integer $n$ $n$ — the number of rails, $1 \le n \le 1\,000\,000\,000$ $1 \leq n \leq 1 000 000 000$ . The following lines contain reconfigurations interleaved with rides, followed by an end marker. Each line contains one of:

Reconfiguration — a single letter I, and integers $a,b$ $a, b$ and $D$ $D$ , all separated by single spaces $(1 \le a \le b \le n, -1\,000\,000\,000 \le D \le 1\,000\,000\,000)$ $(1 \leq a \leq b \leq n, - 1 000 000 000 \leq D \leq 1 000 000 000)$ .
Ride — a single letter Q, and an integer $h$ $h$ $(0 \le h \le 1\,000\,000\,000)$ $(0 \leq h \leq 1 000 000 000)$ separated by a single space;
A single letter E — the end marker, indicating the end of the input data.

You may assume that at any moment the elevation of any point in the track is in the interval $[0,1\,000\,000\,000]$ $[0, 1 000 000 000]$ centimetres.

The input contains no more than $100\,000$ $100 000$ lines.

In $50\%$ $50 %$ of test cases $n$ $n$ satisfies $1 \le n \le 20\,000$ $1 \leq n \leq 20 000$ and there are no more than $1\,000$ $1 000$ lines of input.

Output

The $i$ $i$ -th line of output should consist of one integer — the number of rails traversed by the car during the $i$ $i$ -th ride.

Sample Input

Copy

4
Q 1
I 1 4 2
Q 3
Q 1
I 2 2 -1
Q 3
E

Sample Output

Copy

$\text{[math]}$

Views of the track before and after each reconfiguration. The $x$ $x$ axis denotes the rail number. The $y$ $y$ axis and the numbers over points denote elevation. The numbers over segments denote elevation changes.

Comments

0

timshnayder commented on Nov. 13, 2024, 10:14 p.m.

Isn't this supposed to be problem 3 and Mean Sequence is supposed to be problem 2?

0

can definitely solve contest problems in 4 seconds commented on Oct. 13, 2023, 9:48 p.m.

just saying this problem isnt even worth an attempt in python3 or pypy3

1

BalintR commented on Oct. 14, 2023, 1:18 a.m.

The problem is solvable in Python 3: https://dmoj.ca/problem/ioi05p2/rank/?language=PY3

0

can definitely solve contest problems in 4 seconds commented on Oct. 14, 2023, 2:13 a.m.

intersting i will look more into it