-
Notifications
You must be signed in to change notification settings - Fork 23
/
Copy path1177.cpp
141 lines (132 loc) · 2.66 KB
/
1177.cpp
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <cstdio>
#include <algorithm>
using namespace std;
struct RECT
{
int x1, x2, y1, y2;
}rect[5003];
struct NODE
{
int l, r, length, cover;
}node[160013];
struct EDGE
{
int y, x1, x2;
bool low;
}edge[10003];
int rectnum;
void buildtree(int l ,int r, int p)
{
node[p].l = l;
node[p].r = r;
node[p].length = node[p].cover = 0;
if (r-l > 1)
{
buildtree(l, (l+r)/2, p*2);
buildtree((l+r)/2, r, p*2+1);
}
}
bool cmp(const EDGE &e1, const EDGE &e2)
{
if (e1.y == e2.y) return e1.low;
return e1.y < e2.y;
}
void add(int l, int r, int p)
{
if (l == node[p].l && r == node[p].r)
{
node[p].cover++;
node[p].length = r-l;
}
else
{
int mid = (node[p].l+node[p].r)/2;
if (l < mid) add(l, min(mid, r), p*2);
if (r > mid) add(max(mid, l), r, p*2+1);
if (node[p*2].length+node[p*2+1].length > node[p].length)
{
node[p].length = node[p*2].length+node[p*2+1].length;
}
}
}
void del(int l, int r, int p)
{
if (l == node[p].l && r == node[p].r)
{
node[p].cover--;
}
else
{
int mid = (node[p].l+node[p].r)/2;
if (l < mid) del(l, min(mid, r), p*2);
if (r > mid) del(max(mid, l), r, p*2+1);
}
if (!node[p].cover)
{
node[p].length = node[p*2].length+node[p*2+1].length;
}
}
int main()
{
int i, answer = 0;
scanf("%d", &rectnum);
for (i = 0; i < rectnum; i++)
{
scanf("%d %d %d %d", &(rect[i].x1), &(rect[i].y1), &(rect[i].x2), &(rect[i].y2));
}
buildtree(-10000, 10000, 1);
for (i = 0; i < rectnum; i++)
{
edge[2*i].y = rect[i].y1;
edge[2*i+1].y = rect[i].y2;
edge[2*i+1].x1 = edge[2*i].x1 = rect[i].x1;
edge[2*i+1].x2 = edge[2*i].x2 = rect[i].x2;
edge[2*i].low = true;
edge[2*i+1].low = false;
}
sort(edge, edge+2*rectnum, cmp);
for (i = 0; i < rectnum*2; i++)
{
int temp = node[1].length;
if (edge[i].low)
{
add(edge[i].x1, edge[i].x2, 1);
answer += node[1].length-temp;
}
else
{
del(edge[i].x1, edge[i].x2, 1);
answer += temp-node[1].length;
}
}
for (i = 0; i <= 160012; i++)
{
node[i].length = node[i].cover = 0;
}
for (i = 0; i < rectnum; i++)
{
edge[2*i].y = rect[i].x1;
edge[2*i+1].y = rect[i].x2;
edge[2*i+1].x1 = edge[2*i].x1 = rect[i].y1;
edge[2*i+1].x2 = edge[2*i].x2 = rect[i].y2;
edge[2*i].low = true;
edge[2*i+1].low = false;
}
sort(edge, edge+2*rectnum, cmp);
for (i = 0; i < rectnum*2; i++)
{
int temp = node[1].length;
if (edge[i].low)
{
add(edge[i].x1, edge[i].x2, 1);
answer += node[1].length-temp;
}
else
{
del(edge[i].x1, edge[i].x2, 1);
answer += temp-node[1].length;
}
}
printf("%d", answer);
return 0;
}