Alice and Bob, after played enough and completely figured out the game
with colored strip, decided to ride bikes around the fountain on a
circular path of length L. Alice rides with a speed vA,
Bob — with a speed vB, and they have started in different
directions. At the initial moment the kids were in the same point. When they
“meet” (i.e., at some moment they are in the same point as in the
previous were not), they joyfully exclaim (“Oh, Bob!” or “Oh, Alice!”
respectively). But sometimes along the way, the kids stop to feed the
squirrels. Find, how many times Alice and Bob “have met”.
The first line contains integers L, T, vA, and vB that are the
length of the path, the riding time and the speed of Alice and Bob,
respectively (1 ≤ L ≤ 109; 1 ≤ T ≤ 106; 1 ≤ vA,vB
The next line contains a single integer n, that is the number of
intervals in which children were feeding squirrels (0 ≤ n ≤ 105).
The next n lines describe those intervals. Each description consists of
three integers: typei ti di, meaning who was feeding (1 for
Alice and 2 for Bob), at what moment the feeding started and how much time
it lasted, respectively (0 ≤ ti, di ≤ T; ti + di ≤
It is guaranteed that for one kid any two intervals intersect in no more than one point.
The intervals are given in order of non-decreasing ti.
Output the number of “meetings” of Alice and Bob.
10 10 2 1
1 1 1
1 2 2
2 2 1
Problem Author: Nikita Sivukhin
Problem Source: Ural FU Junior Championship 2016