How to find minimum dot product from given n points?

Revision en1, by AreluF, 2020-07-06 17:32:16

How to solve this problem?

Given n points in a plane and q queries in each query a point P is given, and for each query we have to find the minimum of the dot product of point P taken with given n points.

1 <= n,q <= 10^5

0 <= |x|,|y| <= 10^9

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English AreluF 2020-07-06 17:37:09 4 Tiny change: 'aken with given n p' -> 'aken with the given n p'
en1 English AreluF 2020-07-06 17:32:16 305 Initial revision (published)