Scribd
Upload
19 views

Code 2

Alexey is traveling by train to station n. Due to weather delays, the train is running slower than scheduled. The document provides the scheduled arrival and departure times for each station (ai, bi) as well as the estimated additional time needed (tmi) to travel between each station. It asks to calculate the arrival time for Alexey at the final station n.

Uploaded by

Md.Amdad Hossain
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Code 2

Alexey is traveling by train to station n. Due to weather delays, the train is running slower than scheduled. The document provides the scheduled arrival and departure times for each station (ai, bi) as well as the estimated additional time needed (tmi) to travel between each station. It asks to calculate the arrival time for Alexey at the final station n.

Uploaded by

Md.Amdad Hossain
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Alexey is travelling on a train.

Unfortunately, due to the bad weather, the train moves slower that it
should!

Alexey took the train at the railroad terminal. Let's say that the train starts from the terminal at the
moment 00. Also, let's say that the train will visit nn stations numbered from 11 to nn along its way,
and that Alexey destination is the station nn.
Alexey learned from the train schedule nn integer pairs (ai,bi)(ai,bi) where aiai is the expected time
of train's arrival at the ii-th station and bibi is the expected time of departure.
Also, using all information he has, Alexey was able to calculate nn integers tm1,tm2,
…,tmntm1,tm2,…,tmn where tmitmi is the extra time the train need to travel from the
station i−1i−1 to the station ii. Formally, the train needs exactly ai−bi−1+tmiai−bi−1+tmi time to
travel from station i−1i−1 to station ii (if i=1i=1 then b0b0 is the moment the train leave the
terminal, and it's equal to 00).
The train leaves the station ii, if both conditions are met:
1. it's on the station for at least ⌈bi−ai2⌉⌈bi−ai2⌉ units of time (division with ceiling);

2. current time ≥bi≥bi.
Since Alexey spent all his energy on prediction of time delays, help him to calculate the time
of arrival at the station nn.
Input
The first line contains one integer tt (1≤t≤1001≤t≤100) — the number of test cases.
The first line of each test case contains the single integer nn (1≤n≤1001≤n≤100) — the number of
stations.
Next nn lines contain two integers each: aiai and bibi (1≤ai<bi≤1061≤ai<bi≤106). It's guaranteed
that bi<ai+1bi<ai+1.
Next line contains nn integers tm1,tm2,…,tmntm1,tm2,…,tmn (0≤tmi≤1060≤tmi≤106).
Output

For each test case, print one integer — the time of Alexey's arrival at the last station.

You might also like