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

int tab[1000003];
int next_ok[1000003];

int bez_zol[1000003];
int bez_ziel[1000003];

set <int> barwnik[1000003];

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

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

    for (int i = 0; i <= n; i ++) {
        
        bez_ziel[i] = i + 1;
        bez_zol[i] = i + 1;   
        next_ok[i] = i + 1;

    }

    for (int i = 0; i < m; i ++){

        int l, r, k;
        cin >> l >> r >> k;

        if (k == 1){

            for (int j = l; j <= r;){

                int next = max(bez_ziel[j], next_ok[j]);
                bez_ziel[j] = bez_ziel[r];

                barwnik[j].insert(k);

                j = next;

            }

        }

        if (k == 2){

            for (int j = l; j <= r;){

                int next = max(bez_zol[j], next_ok[j]);
                bez_zol[j] = bez_zol[r];

                barwnik[j].insert(k);
                
                j = next;

            }

        }

        if (k == 3){

            for (int j = l; j <= r;){

                int next = next_ok[j];
                next_ok[j] = next_ok[r];

                barwnik[j].insert(k);
                j = next;

            }

        }

    }

    int ans = 0;

    for (int i = 1; i <= n; i ++){

        if (barwnik[i].count(1) > 0 && barwnik[i].count(2) > 0 && barwnik[i].count(3) == 0) ans ++;

    }

    cout << ans << "\n";
}