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

int n;
unordered_map<int, int> vDiffs, hDiffs;

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

    cin >> n;
    for (int i = 0; i < n; i++) {
        int r, w, t;
        cin >> r >> w >> t;
        if (r == 1)
            hDiffs[w - t]++;
        else
            vDiffs[w - t]++;
    }
    int sum = 0;
    for (auto && [ val, cnt ] : vDiffs) {
        if (hDiffs.find(val) == hDiffs.end())
            sum += cnt;
        else
            sum += std::max(cnt, hDiffs[val]);
    }
    for (auto && [ val, cnt ] : hDiffs)
        if (vDiffs.find(val) == vDiffs.end())
            sum += cnt;

    cout << n - sum;
}