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

using namespace std;

int input[3][500500];
unordered_map<int, int> tabx;
unordered_map<int, int> taby;

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

    int n;
    cin >> n;

    for(int i = 1; i <= n; i++) {
        cin >> input[0][i] >> input[1][i] >> input[2][i];
        if(input[0][i]-1) {
            tabx[input[1][i]-input[2][i]]++;
        } else {
            taby[input[1][i]-input[2][i]]++;
        }
    }

    int c = 0;
    for(auto i: tabx) {
        int w = i.first;
        c += min(tabx[w], taby[w]);
    }

    cout << c << "\n";

    return 0;
}