Geometry + Graph Problems?

Revision en2, by Tutituti, 2019-12-07 07:14:24

You are given n circles (n <= 35000) and m points (m <= 35000). No pair of circles intersect each other. In one turn, you can move a point into or out of a circle, each time it costs amount of given variable which go with each circle. So which you try to find is the minimum cost to gather all point into one region which are divided by the perimeter of circles.

Absolute value of coordinate does not exceed 10^6 Featured cost of each circle does not exceed 10^6, too.

Actually this problem originates from my training test, but I cannot find any solution in contest's t. So I will be really appreciated if you consider to give me any idea.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Tutituti 2019-12-07 07:14:24 41 Tiny change: '= 35000). In one t' -> '= 35000). No pair of circles intersect each other. In one t'
en1 English Tutituti 2019-12-05 13:54:12 632 Initial revision (published)