Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Farmer John is growing N ( 1 < = N < = 2 1 0 5 ) plants of asparagus on his farm! However some

Farmer John is growing N
(1<=N<=2105
) plants of asparagus on his farm! However some of his plants have genetic differences, so some plants will grow faster than others. The initial height of the i
th plant is hi
inches, and after each day, the i
th plant grows by ai
inches.
FJ likes some of his plants more than others, and he wants some specific plants to be taller than others. He gives you an array of distinct values t1,...,tN
containing all integers from 0
to N1
and he wants the i
th plant to have exactly ti
other plants that are taller than it. Find the minimum number of days so that FJ's request is satisfied, or determine that it is impossible.
INPUT FORMAT (pipe stdin):
The first will consist of an integer T
, denoting the number of independent test cases (1<=T<=10)
.
The first line of each test case consists of an integer N
.
The second line consists of N
integers hi
(1<=hi<=109)
denoting the initial height of the i
th plant in inches.
The third line consists of N
integers ai
(1<=ai<=109)
denoting the number of inches the i
th plant grows each day.
The fourth line consists of N
distinct integers ti
denoting the array that FJ gives you.
It is guaranteed that the sum of N
over all test cases does not exceed 2105
.
OUTPUT FORMAT (pipe stdout):
Output T
lines, the answer to each test case on a different line. If it is not possible, output 1
.
Note that the large size of integers involved in this problem may require the use of 64-bit integer data types (e.g., a "long long" in C/C++).
SAMPLE INPUT:
6
1
10
1
0
2
73
810
10
2
36
108
01
2
73
89
10
2
77
88
01
2
01

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Database Management

Authors: Fred R. McFadden, Jeffrey Slater, Mary B. Prescott

5th Edition

0805360549, 978-0805360547

More Books

Students also viewed these Databases questions

Question

Describe the rationale behind short-selling.

Answered: 1 week ago

Question

Is it clear what happens if an employee violates the policy?

Answered: 1 week ago