CF610D.Vika and Segments

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Vika has an infinite sheet of squared paper. Initially all squares are white. She introduced a two-dimensional coordinate system on this sheet and drew nn black horizontal and vertical segments parallel to the coordinate axes. All segments have width equal to 11 square, that means every segment occupy some set of neighbouring squares situated in one row or one column.

Your task is to calculate the number of painted cells. If a cell was painted more than once, it should be calculated exactly once.

输入格式

The first line of the input contains a single integer nn ( 1<=n<=1000001<=n<=100000 ) — the number of segments drawn by Vika.

Each of the next nn lines contains four integers x1x_{1} , y1y_{1} , x2x_{2} and y2y_{2} ( 109<=x1,y1,x2,y2<=109-10^{9}<=x_{1},y_{1},x_{2},y_{2}<=10^{9} ) — the coordinates of the endpoints of the segments drawn by Vika. It is guaranteed that all the segments are parallel to coordinate axes. Segments may touch, overlap and even completely coincide.

输出格式

Print the number of cells painted by Vika. If a cell was painted more than once, it should be calculated exactly once in the answer.

输入输出样例

  • 输入#1

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

    输出#1

    8
    
  • 输入#2

    4
    -2 -1 2 -1
    2 1 -2 1
    -1 -2 -1 2
    1 2 1 -2
    

    输出#2

    16
    

说明/提示

In the first sample Vika will paint squares (0,1)(0,1) , (1,1)(1,1) , (2,1)(2,1) , (1,2)(1,2) , (1,3)(1,3) , (1,4)(1,4) , (0,3)(0,3) and (2,3)(2,3) .

首页