CF1841F.Monocarp and a Strategic Game

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Monocarp plays a strategic computer game in which he develops a city. The city is inhabited by creatures of four different races — humans, elves, orcs, and dwarves.

Each inhabitant of the city has a happiness value, which is an integer. It depends on how many creatures of different races inhabit the city. Specifically, the happiness of each inhabitant is 00 by default; it increases by 11 for each other creature of the same race and decreases by 11 for each creature of a hostile race. Humans are hostile to orcs (and vice versa), and elves are hostile to dwarves (and vice versa).

At the beginning of the game, Monocarp's city is not inhabited by anyone. During the game, nn groups of creatures will come to his city, wishing to settle there. The ii -th group consists of aia_i humans, bib_i orcs, cic_i elves, and did_i dwarves. Each time, Monocarp can either accept the entire group of creatures into the city, or reject the entire group.

The game calculates Monocarp's score according to the following formula: m+km + k , where mm is the number of inhabitants in the city, and kk is the sum of the happiness values of all creatures in the city.

Help Monocarp earn the maximum possible number of points by the end of the game!

输入格式

The first line contains an integer nn ( 1n31051 \leq n \leq 3 \cdot 10^{5} ) — the number of groups of creatures that come to Monocarp's city.

Then nn lines follow. The ii -th of them contains four integers aia_i , bib_i , cic_i , and did_i ( 0ai,bi,ci,di1090 \leq a_i, b_i, c_i, d_i \leq 10^{9} ) — the number of humans, orcs, elves and dwarves (respectively) in the ii -th group.

输出格式

Output a single number — the maximum score Monocarp can have by the end of the game. Your answer will be considered correct if its absolute or relative error does not exceed 10910^{-9} . That is, if your answer is aa , and the jury's answer is bb , then the solution will be accepted if abmax(1,b)109\frac{|a-b|}{\max(1,|b|)} \le 10^{-9} .

Note that the correct answer is always an integer, but sometimes it doesn't fit in 6464 -bit integer types, so you are allowed to print it as a non-integer number.

输入输出样例

  • 输入#1

    5
    0 0 1 0
    1 3 4 2
    2 5 1 2
    4 5 4 3
    1 4 4 5

    输出#1

    85
  • 输入#2

    4
    3 3 1 5
    5 1 5 3
    4 4 4 1
    1 3 4 4

    输出#2

    41

说明/提示

In the first example, the best course of action is to accept all of the groups.

In the second example, the best course of action is to accept the groups 22 and 33 , and decline the groups 11 and 44 .

首页