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
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define e1 first
#define e2 second
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define float long double
#define size(x) (int)x.size()
#define satori int testCases; cin>>testCases; while(testCases--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(r) begin(r),end(r)
#define time chrono::high_resolution_clock().now().time_since_epoch().count()
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
mt19937 rng(chrono::high_resolution_clock().now().time_since_epoch().count());
///////////////////
#define debug if(1)
///////////////////

unordered_map<int,int> gp[2];

int32_t main()
{
	fastio;
	int n,res=0;
	cin>>n;
	for(int i=0;i<n;i++){
		int t,x,y;
		cin>>t>>x>>y;
		if(t==1)
			gp[0][x-y]++;
		if(t==2)
			gp[1][x-y]++;
	}
	for(auto x:gp[0]){
		int cost0=x.e2,cost1=gp[1][x.e1];
		if(cost0!=0&&cost1!=0){
			if(cost0<cost1)
				res+=gp[0][x.e1];
			else
				res+=gp[1][x.e1];
		}
	}
	cout<<res<<'\n';
}