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

struct dane
{
	int n=0,c=0,z=0;
}*tab;
int main()
{
	int n,l,r,k,m,wyn=0;
	cin>>n>>m;
	
	tab=new dane[n+2];
	
	while(m--)
	{
		cin>>l>>r>>k;
		
	    if(k==1)
	    {
	    	tab[r+1].z--;
	    	tab[l].z++;
	    }
		else if(k==2)
		{
			tab[r+1].n--;
			tab[l].n++;
		}
		else
		{
			tab[r+1].c--;
			tab[l].c++;
		}
	}
	
	int a=0,b=0,c=0;
	for(int i=1;i<=n;i++)
	{	
	    a+=tab[i].z;
	    b+=tab[i].n;
	    c+=tab[i].c;
	    
	    if(a>0 && b>0 && c==0)
	    wyn++;
	}
	
	cout<<wyn;
	
	delete [] tab;
	return 0;
}