It Rains Againhttps://acs.jxnu.edu.cn/problem/ICPCJX2021L

Suppose that in a Cartesian coordinate system on an infinite plane, the x-axis represents the ground and there are n rainscreens (We don't consider their thickness.) in the sky.

Every rainscreen can be described as a segment which starts from the (x1,y1)and ends at (x2,y2). Now if it starts to rain from the infinite high sky, I want you to tell me how many units of the x-axis will not get rained on.

To simplify the problem,the rain can only move vertically whenever it falls.

Note that two rainscreens can overlap and intersect with each other, and there is no rainscreen which is placed vertically.

输入：

The first line contains one positive integer n(1≤n≤100000).

Each of the next nn lines contains four positive integers x1,y1,x2,y2(1≤x1<x2≤100000,1≤y1,y2≤100000), representing a rainscreen which starts from the(x1,y1) and ends at (x2,y2).

输出：

The only one integer - the number of units of the x-axis which will not get rained on.

翻译：假设在一个无穷平面的笛卡尔坐标系中，x轴表示地面并且天空中有一个雨幕（我们不考虑它的厚度）.

每个雨幕能被描述为从（x1,y1）到（x2,y2）的一个部分.现在如果它从无穷高的天空开始下雨，我想你告诉我x轴有几个部分不会淋雨.

为了简化这个问题，雨只能够垂直移动.

注意两个雨幕能够彼此重叠和镶嵌，并且没有雨幕是垂直的.

输入：第一行包含一个正整数.n(1≤n≤100000)

n行接下来每一行包含四个正整数.x1,y1,x2,y2(1≤x1<x2≤100000,1≤y1,y2≤100000)代表从（x1,y1）到（x2,y2）的雨幕

输出：唯一一个整数──代表x轴不会淋雨部分的数量