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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <iostream>
#include <vector>
using namespace std;

#define matrix vector<vector<int>>

int hn(int n, int *T);
int ln(int n, int *T);

void input(int n, int *T) {
  for (int i = 0; i < n; i++) {
    scanf("%d", &T[i]);
  }
}
int main() {
  int n, d = 0;
  cin >> n;
  int *r = new int[n], *w = new int[n], *t = new int[n];
  for (int i = 0; i < n; i++) {
    scanf("%d %d %d", &r[i], &w[i], &t[i]);
  }
  int ww = ln(n, w);
  int hh = hn(n, w);
  matrix mat(hh, vector<int>(ww, 0));

  if (r[0] == 1) {
    int k = w[0] - 1;
    int j = 0;
    while (j < ww) {
      j++; t[0]++;
    }
    mat[k][j - 1] = 1;
  } else {
    int k = w[0] - 1;
    int j = 0;
    while (j < hh) {
      j++; t[0]++;
    }
    mat[j - 1][k] = 1;
  }

  for (int i = 1; i < n; i++) {
    if (r[i] == 1) {
      int k = w[i] - 1;
      int j = 0;
      while (j < ww) {
        j++; t[i]++;
        if (t[i - 1] == t[i] && mat[k][j - 1] != 0) {
          d++;
          continue;
        }
      }
      mat[k][j - 1] = 1;
    } else {
      int k = w[i] - 1;
      int j = 0;
      while (j < hh) {
        j++; t[i]++;
        if (t[i - 1] == t[i] && mat[j - 1][k] != 0) {
          d++;
          continue;
        }
      }
      mat[j - 1][k] = 1;
    }
  }
  cout << d << "\n";
  return 0;
}

int hn(int n, int *T) {
  int k = T[0];
  for (int i = 1; i < n; i++) {
    if (k < T[i]) k = T[i];
  }
  return k;
}
int ln(int n, int *T) {
  int k = T[0];
  for (int i = 1; i < n; i++) {
    if (k > T[i]) k = T[i];
  }
  return k;
}