F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Taking Bus

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1643    Accepted Submission(s): 569


Problem Description
Bestland has a very long road and there are \(n\) bus station along the road, which are numbered 1 to \(n\) from left to right. There are \(m\) persons wanting to take the bus to some other station. You task is to find the time needed for each person. Note: All the other information you need is below. Please read the statment carefully.
 

Input
There are multiple test cases. The first line of input contains an integer \(T\ (1 \le T \le 60)\), indicating the number of test cases. For each test case: The first line contains two integers \(n \text{ and } m \ (2 \le n, m \le 10^5)\), indicating the number of bus stations and number of people. In the next line, there are \(n - 1\) integers, \(d_1, d_2, \dots, d_{n-1}\) (\(1 \le d_i \le 10^9\)). The \(i\)-th integer means the distance between bus station \(i\) and \(i + 1\) is \(d_i\) (\(1 \le i < n\)). In the next \(m\) lines, each contains two integers \(x_i\) and \(y_i\) (\(1 \le x_i, y_i \le n, x_i \ne y_i\)), which means \(i\)-th person is in bus station \(x_i\) and wants goto bus station \(y_i\). \((1 \le i \le m)\)

What else you should know is that for the \(i\)-th person, the bus starts at bus station \(((i - 1)\text{ mod } n) + 1\) and drives to right. When the bus arrives at station \(n\), it will turn around and drive from right to left. Similarly, When the bus arrives at station \(1\), it will turn around and drive from left to right. You can assume that the bus drives one meter per second. And you should only consider the time that the bus drives and ignore the others.
 

Output
For each person, you should output one integer which is the minimum time needed before arriving bus station \(y_i\).
 

Sample Input
1 7 3 2 3 4 3 4 5 1 7 4 5 5 4
 

Sample Output
21 10 28
 

Hint
For the first person, the bus starts at bus station 1, and the person takes in bus at time 0. After 21 seconds, the bus arrives at bus station 7. So the time needed is 21 seconds. For the second person, the bus starts at bus station 2. After 7 seconds, the bus arrives at bus station 4 and the person takes in the bus. After 3 seconds, the bus arrives at bus station 5. So the time needed is 10 seconds. For the third person, the bus starts at bus station 3. After 7 seconds, the bus arrives at bus station 5 and the person takes in the bus. After 9 seconds, the bus arrives at bus station 7 and the bus turns around. After 12 seconds, the bus arrives at bus station 4. So the time needed is 28 seconds.
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-12 01:54:45, Gzip enabled