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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>

using namespace std;

typedef vector<int> VI;
typedef long long LL;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(LL x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int main() {
	ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<vector<int> > data(2);
    REP(i, n) {
        int r, w, t;
        cin >> r >> w >> t;
        data[--r].PB(t - w);
    }
    sort(data[0].begin(), data[0].end());
    sort(data[1].begin(), data[1].end());

    int i = 0; int j = 0;
    int res = 0;
    while(i < data[0].size() && j < data[1].size()) {
        while(i < data[0].size() && j < data[1].size() && data[0][i] != data[1][j]) {
            if(data[0][i] < data[1][j]) i++;
            else j++;
        }
        if(i < data[0].size() && j < data[1].size()) {
            int ii = i + 1;
            while(ii < data[0].size() && data[0][ii] == data[0][i]) ii++;
            int jj = j + 1;
            while(jj < data[1].size() && data[1][jj] == data[1][j]) jj++;
            res += min(ii - i, jj - j);
            i = ii;
            j = jj;
        }
    }
    cout << res << '\n';
    return 0;
}