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
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 1000005;

int tab[3][maxn];

int main()
{
    ios_base::sync_with_stdio(0);

    int m, n;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int l, r, k;
        cin >> l >> r >> k;
        l--; r--; k--;
        tab[k][l]++;
        tab[k][r + 1]--;
    }

    int sum[3] = {};
    int res = 0;
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < 3; k++)
            sum[k] += tab[k][i];
        if (sum[0] > 0 && sum[1] > 0 && sum[2] == 0)
            res++;
    }

    cout << res << "\n";

    return 0;
}