poj 1177

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <math.h>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

const int maxn = 20006;
struct T {
	int sum, num, len;
	bool l, r;
}t[maxn * 4];

void work(int p, int l, int r) {
	if (t[p].sum) {
		t[p].num = t[p].l = t[p].r = 1;
		t[p].len = r - l + 1;
	}
	else if (l == r)
		t[p].len = t[p].num = t[p].l = t[p].r = 0;
	else {
		t[p].len = t[p << 1].len + t[p << 1 | 1].len;
		t[p].num = t[p << 1].num + t[p << 1 | 1].num;
		if (t[p << 1].r&&t[p << 1 | 1].l) --t[p].num;
		t[p].l = t[p << 1].l;
		t[p].r = t[p << 1 | 1].r;
	}
}

void change(int p, int l, int r, int L, int R, int k) {
	if (l >= L && r <= R) {
		t[p].sum += k;
		work(p, l, r);
		return;
	}
	int mid = (l + r) >> 1;
	if (L <= mid)change(p << 1, l, mid, L, R, k);
	if (R > mid)change(p << 1 | 1, mid + 1, r, L, R, k);
	work(p, l, r);
}

int n, maxx = -INF, minn = INF, tot, ans, pre;
struct P {
	int l, r, h, k;
	bool operator<(const P& p)const {
		return h < p.h || (h == p.h&&k > p.k);
	}
}a[maxn];

void add(int l, int r, int h, int k) {
	a[++tot].l = l;
	a[tot].r = r;
	a[tot].h = h;
	a[tot].k = k;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		int x1, y1, x2, y2;
		scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
		maxx = max(maxx, max(x2, x1));
		minn = min(minn, min(x1, x2));
		add(x1, x2, y1, 1);
		add(x1, x2, y2, -1);
	}
	if (minn <= 0) {
		for (int i = 1; i <= tot; i++) {
			a[i].l += 1 - minn;
			a[i].r += 1 - minn;
		}
		maxx -= minn;
	}
	sort(a + 1, a + 1 + tot);
	for (int i = 1; i <= tot; i++) {
		change(1, 1, maxx, a[i].l, a[i].r - 1, a[i].k);
		while (a[i].h == a[i + 1].h &&a[i].k == a[i + 1].k) {
			i++; change(1, 1, maxx, a[i].l, a[i].r - 1, a[i].k);
		}
		ans += abs(t[1].len - pre);
		pre = t[1].len;
		ans += t[1].num*(a[i + 1].h - a[i].h) << 1;
	}
	printf("%d\n", ans);
	return 0;
}