point (r1,c1) it is feasible to arrive at the point (r2,c2), in case there is a way between them just from enacted edges. For instance, in the image above, there is a way from (1,1) to (3,2), however there is no way from (2,1) to (1,1). At first, you are at the point (1,1). For each turn, you can:
Correct answer will be upvoted else downvoted. Computer science.
point (r1,c1) it is feasible to arrive at the point (r2,c2), in case there is a way between them just from enacted edges. For instance, in the image above, there is a way from (1,1) to (3,2), however there is no way from (2,1) to (1,1).
At first, you are at the point (1,1). For each turn, you can:
Trade initiated edge for point (r,c). That is assuming the edge forthright (r+1,c) is initiated, rather than it, the edge direct (r+1,c+1) becomes enacted, in any case in the event that the edge forthright (r+1,c+1), all things being equal if it, the edge forthright (r+1,c) becomes actuated. This activity builds the expense of the way by 1;
Move from the current highlight one more by following the enacted edge. This activity doesn't build the expense of the way.
You are given a succession of n points of an endless triangle (r1,c1),(r2,c2),… ,(rn,cn). Track down the base expense way from (1,1), going through all n focuses in self-assertive request.
Input
The main line contains one integer t (1≤t≤104) is the number of experiments. Then, at that point, t experiments follow.
Each experiment starts with a line containing one integer n (1≤n≤2⋅105) is the number of focuses to visit.
The subsequent line contains n numbers r1,r2,… ,rn (1≤ri≤109), where ri is the number of the layer wherein I-th point is found.
The third line contains n numbers c1,c2,… ,cn (1≤ci≤ri), where ci is the number of the I-th point in the ri layer.
It is ensured that all n focuses are unmistakable.
It is ensured that there is consistently somewhere around one way of crossing all n focuses.
It is ensured that the amount of n over all experiments doesn't surpass 2⋅105.
Output
For each experiment, output the base expense of a way going through all focuses in the comparing experiment.
Step by step
Solved in 3 steps with 1 images
