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
#include <iostream>
#include <map>
using namespace std;
int kolizje;
map <int,int> m1;
map <int,int> m2;
int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
    int w = 0;
    for(int i = 0 ; i < n; i++){
        int a,b,c; cin >> a >> b >> c;
        w -= min(m1[b-c],m2[b-c]);
        if(a == 1){
            m1[b - c]++;
        }
        else{
            m2[b - c]++;
        }
        w += min(m1[b-c],m2[b-c]);
    }
    cout << w << '\n';
}