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
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e4 + 50;
int n, m, dy[2 * maxn], dz[2 * maxn], kind[4];
struct node1 {
int x1_, y1_, h1_, x2_, y2_, h2_;
} arr[maxn];
struct node2 {
int x_, y1_, y2_, flag_;
bool operator<(node2 &x) { return x_ < x.x_; }
} line[2 * maxn];
struct node3 {
ll cnt_, sum_;
} seg[4 * 2 * maxn];
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define cnt(x) seg[x].cnt_
#define sum(x) seg[x].sum_
void up(int rt, int l, int r) {
sum(rt) = cnt(rt) ? dy[r + 1] - dy[l] : (l == r ? 0 : sum(lson) + sum(rson));
}
void update(int rt, int l, int r, int L, int R, int v) {
if (L <= l && r <= R) {
cnt(rt) += v;
up(rt, l, r);
return;
}
int mid = (l + r) / 2;
if (L <= mid) update(lson, l, mid, L, R, v);
if (R > mid) update(rson, mid + 1, r, L, R, v);
up(rt, l, r);
}
ll work() {
cin >> n >> m;
ll volume = 0, ytot = 0, ztot = 0;
int x1, y1, x2, y2, c;
for (int i = 1; i <= m; ++i) cin >> kind[i];
for (int i = 1; i <= n; ++i) {
cin >> x1 >> y1 >> x2 >> y2 >> c;
arr[i] = {x1, y1, 0, x2, y2, kind[c]};
dy[++ytot] = y1, dy[++ytot] = y2;
dz[++ztot] = kind[c];
}
dz[++ztot] = 0;
sort(dy + 1, dy + 1 + ytot), sort(dz + 1, dz + 1 + ztot);
ytot = unique(dy + 1, dy + 1 + ytot) - 1 - dy;
ztot = unique(dz + 1, dz + 1 + ztot) - 1 - dz;
for (int i = 1; i < ztot; ++i) {
ll area = 0, ltot = 0;
memset(seg, 0, 8 * n * sizeof(node3));
for (int j = 1; j <= n; ++j) {
if (arr[j].h1_ <= dz[i] && arr[j].h2_ > dz[i]) {
y1 = lower_bound(dy + 1, dy + 1 + ytot, arr[j].y1_) - dy;
y2 = lower_bound(dy + 1, dy + 1 + ytot, arr[j].y2_) - dy;
line[++ltot] = {arr[j].x1_, y1, y2, 1};
line[++ltot] = {arr[j].x2_, y1, y2, -1};
}
}
sort(line + 1, line + 1 + ltot);
for (int j = 1; j < ltot; ++j) {
update(1, 1, ytot - 1, line[j].y1_, line[j].y2_ - 1, line[j].flag_);
area += (line[j + 1].x_ - line[j].x_) * sum(1);
}
volume += area * (dz[i + 1] - dz[i]);
}
return volume;
}
int main() {
int t;
cin >> t;
for (int i = 1; i <= t; ++i) printf("Case %d: %lld\n", i, work());
return 0;
}
|
