WC '18 Contest 3 S3 - Counterpicking

View as PDF

Submit solution


Points: 15 (partial)
Time limit: 4.5s
Memory limit: 64M

Author:
Problem type
Woburn Challenge 2018-19 Round 3 - Senior Division

Jessie's been training hard, and is ready to go out there and claim some new Pokémon for Team Rocket fair and square! Or at least, by beating some Pokémon trainers in battles fair and square, and then proceeding to steal their Pokémon.

Jessie has N (1 \le N \le 300\,000) Pokémon at her disposal, with the i-th one having two traits of interest — a Strength of A_i and a Speed of B_i (1 \le A_i, B_i \le 10^9).

She'll be battling against M (1 \le M \le 300\,000) trainers, one after another, each with a single Pokémon. In each battle, Jessie will choose one of her N Pokémon to use in it. There are no restrictions regarding her choices — for example, she may choose to use any of her Pokémon either in multiple battles, or not at all.

Each trainer's Pokémon is vulnerable against the Strength and Speed traits to various degrees, based on the values X_i and Y_i (1 \le X_i, Y_i \le 10^9). Battle Effectiveness is a measure of how effective Jessie's chosen Pokémon is against a trainer's Pokémon. If Jessie chooses to use her j-th Pokémon in the i-th battle, the resulting Battle Effectiveness will be X_i \times A_j + Y_i \times B_j.

For each of the M battles, help Jessie determine the maximum possible Battle Effectiveness that she can achieve by choosing an optimal Pokémon to use. Please note that the answer may not fit within a 32-bit signed integer.

Subtasks

In test cases worth 6/26 of the points, N \le 2\,000 and M \le 2\,000.

Input Specification

The first line of input consists of a single integer, N.
N lines follow, the i-th of which consists of two space-separated integers, A_i and B_i, for i = 1 \dots N.
The next line consists of a single integer, M.
M lines follow, the i-th of which consists of two space-separated integers, X_i and Y_i, for i = 1 \dots M.

Output Specification

M lines, the i-th of which is the maximum Battle Effectiveness which Jessie can achieve in the i-th battle.

Sample Input

2
1 10
8 2
2
10 1
1 10

Sample Output

82
101

Sample Explanation

In the first battle, Jessie should use her second Pokémon for a Battle Effectiveness of 10 \times 8 + 1 \times 2 = 82. In the second battle, she should instead use her first Pokémon for a Battle Effectiveness of 1 \times 1 + 10 \times 10 = 101.


Comments

There are no comments at the moment.