#PU1190. USACO 2022 January Contest, Platinum — Problem 3. Multiple Choice Test
USACO 2022 January Contest, Platinum — Problem 3. Multiple Choice Test
USACO 2022 January Contest, Platinum — Problem 3. Multiple Choice Test
题目描述
The cows are taking a multiple choice test. But instead of a standard test where your selected choices are scored for each question individually and then summed, in this test your selected choices are summed before being scored. Specifically, you are given () groups of integer vectors on the 2D plane, where each vector is denoted by an ordered pair . Choose one vector from each group such that the sum of the vectors is as far away from the origin as possible. It is guaranteed that the total number of vectors is at most . Each group has size at least , and within a group, all vectors are distinct. It is also guaranteed that every and coordinate has absolute value at most .
输入格式
The first line contains , the number of groups. Each group starts with , the number of vectors in the group, followed by lines containing the vectors in that group. Consecutive groups are separated by newlines.
输出格式
The maximum possible squared Euclidean distance.
数据范围
In test cases 1-5, the total number of vectors is at most . In test cases 6-9, every group has size exactly two. Test cases 10-17 satisfy no additional constraints. Problem credits: Benjamin Qi
样例
样例 1
3
2
-2 0
1 0
2
0 -2
0 1
3
-5 -5
5 1
10 10
242
It is optimal to select $(1,0)$ from the first group, $(0,1)$ from the second
group, and $(10,10)$ from the third group. The sum of these vectors is
$(11,11)$, which is squared distance $11^2+11^2=242$ from the origin.