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 <map>

using namespace std;

typedef map<int, int> cmap;

int N, M;
cmap c[3], is, mn;

void add(cmap &k, int l, int r) {
	auto lm = k.upper_bound(l);
	auto rm = k.upper_bound(r);

	if (rm != k.begin()) {
		rm--;
		if (rm->second > r) {
			r = rm->second;
		}
		rm++;

		if (lm != k.begin()) {
			lm--;
			if (lm->second >= l) {
				l = lm->first;
			} else {
				lm++;
			}
		}
	}

	k.erase(lm, rm);

	k[l] = r;
}

void iszn(cmap &k1, cmap &k2) {
	auto it1 = k1.begin();
	auto it2 = k2.begin();

	while (it1 != k1.end() && it2 != k2.end()) {
		if (it1->first <= it2->first) {
			if (it1->second >= it2->first) {
				if (it1->second <= it2->second) {
					is[it2->first] = it1->second;
					it1++;
				} else {
					is[it2->first] = it2->second;
					it2++;
				}
			} else {
				it1++;
			}
		} else { // it1->first > it2->first
			if (it2->second >= it1->first) {
				if (it2->second <= it1->second) {
					is[it1->first] = it2->second;
					it2++;
				} else {
					is[it1->first] = it1->second;
					it1++;
				}
			} else {
				it2++;
			}
		}
	}
}

void mnc(cmap &k1, cmap &k2) {
	auto it1 = k1.begin();
	auto it2 = k2.begin();
	int b = 0;

	while (it1 != k1.end() && it2 != k2.end()) {
		if (b < it1->first) {
			b = it1->first;
		}
		if (b < it2->first) {
			if (it1->second >= it2->first) {
				mn[b] = it2->first - 1;
				if (it1->second <= it2->second) {
					it1++;
				} else {
					b = it2->second + 1;
					it2++;
				}
			} else {
				mn[b] = it1->second;
				it1++;
			}
		} else { // b >= it2->first
			if (it2->second >= b) {
				if (it2->second < it1->second) {
					b = it2->second + 1;
					it2++;
				} else {
					it1++;
				}
			} else {
				it2++;
			}
		}
	}

	while (it1 != k1.end()) {
		if (b < it1->first) {
			b = it1->first;
		}
		mn[b] = it1->second;
		it1++;
	}
}

int cn(cmap &k) {
	int cn = 0;

	for (auto it = k.begin(); it != k.end(); ++it) {
		cn += it->second - it->first + 1;
	}

	return cn;
}

int main() {
	int l, r, k;
	cmap c[3];

	scanf("%d %d", &N, &M);

	for (int i = 0; i < M; ++i) {
		scanf ("%d %d %d", &l, &r, &k);
		add(c[k-1], l, r);
	}

	iszn(c[0], c[1]);
	mnc(is, c[2]);

	printf("%d\n", cn(mn));
	return 0;
}