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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{
    int n;
    //cin>>n;
    scanf("%d",&n);

    vector<long long> pion;
    vector<long long> poziom;

    for(int i=0;i<n;i++)
    {
        int r;
        long long w,t;

        //cin>>r>>w>>t;
        scanf("%d",&r);
        scanf("%lld",&w);
        scanf("%lld",&t);

        if(r==1)
        {
            poziom.push_back(t-w);
        }
        else
        {
            pion.push_back(t-w);
        }  
    }

    if(!poziom.empty())
    {

    sort(poziom.begin(),poziom.end());

    }

    if(!pion.empty())
    {
    sort(pion.begin(),pion.end());
    }

    vector<pair<long long,long long>> cross;

    long long p;
    long long counter;

    if(!poziom.empty())
    {

    long long p=poziom[0];
    long long counter=1;

    for(int i=1;i<poziom.size();i++)
    {
        //cout<<p<<" "<<counter<<endl;

        if(poziom[i]==p)
        {
            counter++;
        }
        else
        {
            cross.push_back(make_pair(p,counter));
            p=poziom[i];
            counter=1;
        } 
    }

    //cout<<p<<" "<<counter<<endl;

    cross.push_back(make_pair(p,counter));

    }

    if(!pion.empty())
    {

    p=pion[0];
    counter=1;

    for(int i=1;i<pion.size();i++)
    {
        //cout<<p<<" "<<counter<<endl;

        if(pion[i]==p)
        {
            counter++;
        }
        else
        {
            cross.push_back(make_pair(p,counter));
            p=pion[i];
            counter=1;
        } 
    }

    //cout<<p<<" "<<counter<<endl;

    cross.push_back(make_pair(p,counter));

    }

    //cout<<"#"<<endl;

    sort(cross.begin(),cross.end());
    long long sum=0;

    for(int i=0;i<cross.size();i++)
    {
        if((i!=cross.size()-1)&&(cross[i+1].first==cross[i].first))
        {
            sum+=cross[i].second;
        }

        //cout<<cross[i].first<<" "<<cross[i].second<<endl;
    }

    //cout<<sum<<endl;
    printf("%lld",sum);

    return 0;
}