C.cpp

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define F first
#define S second
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define pr(x) cout<<x<<'\n'; return ;
#define pry  cout<<"YES\n";return ;
#define prn  cout<<"NO\n"; return ;
#define all(v) v.begin(),v.end()
#define  loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
    double x,l,r;
    int n;
    cin>>n;
    pair<double,double> p[n];
    loop(i,0,n)
    {
        cin>>x>>l>>r;
        if(x==2 || x==4)
        r=r-0.1;
        if(x==3 || x==4)
        l=l+0.1;
        p[i].first=l;
        p[i].second=r;
    }
    sort(p,p+n);
    int ans=0;
    for(int i=0;i<n;i++)
    {
        l=p[i].first;
        r=p[i].second;
        for(int j=i+1;j<n;j++)
        {
            if(l>p[j].second || r<p[j].first)
            ans=ans;
            else
            ans++;
        }
    }
    cout<<ans;
} 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    solve();
    return 0;
}