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

using namespace std;

const int N = 1000002;
int colors[N][3];

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int l, r, k;
        cin >> l >> r >> k;
        l--;
        r--;
        k--;
        colors[l][k]++;
        colors[r+1][k]--;
    }
    vector<int> cc(3);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < 3; k++) {
            cc[k] += colors[i][k];
        }
        if (cc[0] > 0 && cc[1] > 0 && cc[2] == 0) {
            ans++;
        }
    }
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cout.precision(15);
    cout << fixed;
    cin.tie(0);

    int T = 1;
    //cin >> T;
    for (int tst = 0; tst < T; tst++) {
        solve();
    }

    return 0;
}