1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 300002
#define INF 987654321
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
ll seg[MAX_N * 4], _seg[MAX_N * 4];
void update(ll node, ll s, ll e, ll l, ll r, ll v) {
if(r < s || e < l) return;
if(l <= s && e <= r) {
_seg[node] += v;
} else {
ll m = (s + e) >> 1;
update(node * 2, s, m, l, r, v);
update(node * 2 + 1, m + 1, e, l, r, v);
}
if(_seg[node]) seg[node] = e - s + 1;
else if(s == e) seg[node] = 0;
else seg[node] = seg[node * 2] + seg[node * 2 + 1];
}
ll query(ll u, ll s, ll e, ll l, ll r) {
if(r < s or e < l) return 0ll;
if(l <= s and e <= r) return seg[u];
ll m = s + (e - s) / 2;
return query(u * 2, s, m, l, r) + query(u * 2 + 1, m + 1, e, l, r);
}
struct Line {
ll x, y1, y2;
bool eof;
};
vector<Line> l;
ll n;
ll solve() {
sort(all(l), [](const Line& l1, const Line& l2) {
return l1.x < l2.x;
});
ll res = 0, x = l[0].x;
for(auto& line : l) {
res += (line.x - x) * query(1, 1, MAX_N, 1, MAX_N);
update(1, 1, MAX_N, line.y1, line.y2, line.eof ? -1 : 1);
x = line.x;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(8);
cin >> n;
for (ll i = 0, x1, y1, x2, y2; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2;
l.push_back({x1, y1 + 1, y2, false});
l.push_back({x2, y1 + 1, y2, true});
}
cout << solve() << '\n';
return 0;
}
|
