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
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>

using namespace std;

const int N_MAX = 1000000;
vector< pair<int, int> > v[3];
int dane[3][N_MAX];
int puszki[N_MAX][3];

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	int l_max = -1;
	for (int i = 0; i < m; ++i) {
		int l, r, k;
		scanf("%d %d %d", &l, &r, &k);
		dane[k-1][l-1] = max(dane[k-1][l-1], r);
		l_max = max(l_max, l-1);
	}
	for (int i = 0; i < 3; ++i) {
		for (int j = 0; j <= l_max; ++j) {
			if (dane[i][j] > 0) {
				v[i].push_back(make_pair(j, dane[i][j] - 1));
			}
		}
	}
	for (int i = 0; i < 3 && v[i].size() > 0; ++i) {
		int j = 0;
		int act = v[i][0].first; // act = l[0];
		int liczba_op = v[i].size();
		
		while (act < n && j < liczba_op) {
			while (act <= v[i][j].second) {
				puszki[act][i] = 1;
				++act;
			}
			// act = r[j] + 1;
			++j;
			while (j < liczba_op && v[i][j].second < act) ++j;
			// act <= r[j]
			if (j >= liczba_op) {
				break;
			}
			act = max(act, v[i][j].first);
		// act >= l[j];
		}
	}
	int ile = 0;
	for (int i = 0; i < n; ++i) {
		if (puszki[i][0] && puszki[i][1] && !puszki[i][2]) ++ile;
	}
	printf("%d\n", ile);
	return 0;
}