Codeforces Round 162 (Div. 1)
C
Choosing Balls
Codeforces
2000
原题
← BD →
翻译中…

There are $*n*$ balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the $*i*$-th ball is $*c*_{*i*}$ and the value of the $*i*$-th ball is $*v*_{*i*}$.

翻译中…

Squirrel Liss chooses some balls and makes a new sequence without changing the relative order of the balls. She wants to maximize the value of this sequence.

翻译中…

The value of the sequence is defined as the sum of following values for each ball (where $*a*$ and $*b*$ are given constants):

翻译中…
  • If the ball is not in the beginning of the sequence and the color of the ball is same as previous ball's color, add (the value of the ball) $×$ $*a*$.
  • Otherwise, add (the value of the ball) $×$ $*b*$.
翻译中…

You are given $*q*$ queries. Each query contains two integers $*a*_{*i*}$ and $*b*_{*i*}$. For each query find the maximal value of the sequence she can make when $*a* = *a*_{*i*}$ and $*b* = *b*_{*i*}$.

翻译中…

Note that the new sequence can be empty, and the value of an empty sequence is defined as zero.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*q*$ ($1 ≤ *n* ≤ 10^{5}; 1 ≤ *q* ≤ 500$). The second line contains $*n*$ integers: $*v*_{1}, *v*_{2}, ..., *v*_{*n*}$ ($|*v*_{*i*}| ≤ 10^{5}$). The third line contains $*n*$ integers: $*c*_{1}, *c*_{2}, ..., *c*_{*n*}$ ($1 ≤ *c*_{*i*} ≤ *n*$).

翻译中…

The following $*q*$ lines contain the values of the constants $*a*$ and $*b*$ for queries. The $*i*$-th of these lines contains two integers $*a*_{*i*}$ and $*b*_{*i*}$ ($|*a*_{*i*}|, |*b*_{*i*}| ≤ 10^{5}$).

翻译中…

In each line integers are separated by single spaces.

翻译中…

Output

翻译中…

For each query, output a line containing an integer — the answer to the query. The $*i*$-th line contains the answer to the $*i*$-th query in the input order.

翻译中…

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

翻译中…

Note

翻译中…

In the first example, to achieve the maximal value:

翻译中…
  • In the first query, you should select 1st, 3rd, and 4th ball.
  • In the second query, you should select 3rd, 4th, 5th and 6th ball.
  • In the third query, you should select 2nd and 4th ball.
翻译中…

Note that there may be other ways to achieve the maximal value.

翻译中…

样例

Input #1
6 3
1 -2 3 4 0 -1
1 2 1 2 1 1
5 1
-2 1
1 0
Output #1
20
9
4
InputCopy OutputCopy
Input #2
4 1
-3 6 -1 2
1 2 3 1
1 -1
Output #2
5
InputCopy OutputCopy
题目信息
题号
264C
时间限制
5 s
内存限制
256 MB
标签
动态规划

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。