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

using namespace std;
const int war = 1000005;
bool zol[war];
struct barwnik
{
    int p;
    int k;
};
bool compare(const barwnik &a, const barwnik &b)
{
    if (a.p == b.p)
        return a.k > b.k;
    return b.p > a.p;
}

vector<barwnik> zolty;
vector<barwnik> niebieski;
vector<barwnik> czerwony;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;

    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        if (c == 1)
            zolty.push_back({a, b});
        else if (c == 2)
            niebieski.push_back({a, b});
        else
            czerwony.push_back({a, b});
    }

    sort(zolty.begin(), zolty.end(), compare);
    sort(czerwony.begin(), czerwony.end(), compare);
    sort(niebieski.begin(), niebieski.end(), compare);

    int pom = 0;
    for (auto u : zolty)
    {
        if (u.k > pom)
        {

            pom = u.k;
            for (int i = u.p; i <= u.k; i++)
                zol[i] = 1;
        }
    }
    pom = 0;
    for (auto u : czerwony)
    {
        if (u.k > pom)
        {
            pom = u.k;
            for (int i = u.p; i <= u.k; i++)
                zol[i] = 0;
        }
    }
  
    int odp = 0;
    pom = 0;
    for (auto u : niebieski)
    {

        if (u.k > pom)
        {
            
            for (int i = u.p; i <= u.k; i++)
            {
                if (zol[i])
                    {odp++;
                    zol[i]=false;
                    }
            }
            pom = u.k;
        }
    }

    cout << odp;
    return 0;
}