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

using namespace std;

const int SIZE = 1000*1001;

vector<pair<int, int>> in[3];
bool clrd[3][SIZE];

int main() {
    int n, m;
    scanf("%i %i", &n, &m);
    
    for (int i = 0; i < m; ++i) {
        int l, r, k;
        scanf("%i %i %i", &l, &r, &k);
        in[k-1].push_back(make_pair(l-1, r-1));
    }
    
    for (int i = 0; i < 3; ++i) {
        sort(in[i].begin(), in[i].end());
        fill(clrd[i], clrd[i]+SIZE, 0);
    }
    
    for (int i = 0; i < 3; ++i) {
        int idx = 0;
        for (int j = 0; j < in[i].size(); ++j) {
            int f = in[i][j].first;
            int s = in[i][j].second;
            
            if (f > idx)
                idx = f;
            while (idx <= s) {
                clrd[i][idx] = 1;
                ++idx;
            }
        }
    }
    
    int res = 0;
    for (int i = 0; i < n; ++i)
        if (clrd[0][i] == 1 && clrd[1][i] == 1 && clrd[2][i] == 0)
            ++res;
    
    printf("%i\n", res);
        
    return 0;
}