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
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>

using namespace std;

const int nax = 1e6 + 5;

int a[4][nax];

void solve()
{
    int n,m; cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int l,r,k; cin>>l>>r>>k;
        a[k][l]++;
        a[k][r + 1]--;
    }

    int ac = 0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=3;j++) a[j][i] += a[j][i - 1];

        if(a[1][i] > 0 && a[2][i] > 0 && a[3][i] == 0) ac++;
    }

    cout<<ac<<"\n";

}

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