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
#include <iostream>

using namespace std;

const int treec = 1048576;
int tree[2*treec];

void add(int a, int b, int value) {
    a+= treec;
    b+= treec;
    if (a==b) {
        tree[a] |= value;
    }
    tree[a] |= value;
    tree[b] |= value;
    while (a/2 != b/2) {
        if (a % 2 == 0) {
            tree[a+1] |= value;
        }
        if (b % 2 == 1) {
            tree[b-1] |= value;
        }
        a /= 2;
        b /= 2;
    }
}
int get(int a) {
    a += treec;
    int result = tree[a];
    while(a != 0) {
        result |= tree[a];
        a /= 2;
    }

    return result;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    int a,b,v;
    cin >> n >> m;
    for (int i=0; i<m; i++) {
        cin >> a >> b >> v;
        add(a, b, (1 << v));
    }

    int result = 0;
    for (int i=1; i<=n; i++) {
        if (get(i) == 6) result++;
    }

    cout << result;
}