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
85
86
87
88
89
90
91
92
93
//Marcin Krzewiński

#include <iostream>
#include <vector>

using namespace std;

struct sami
{
    int r = 0;
    int x = 0;
    int a = 0;
    bool b = true;
};

int main()
{
    vector<sami> dost;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int r, w, t;
        cin >> r >> w >> t;
        sami x = sami();
        x.r = r;
        x.x = (w-t);
        dost.push_back(x);
    }
    int colisions = 10;
    int del = 0;
    while (colisions != 0)
    {
        colisions = 0;
        int iter = 0;
        for (sami x : dost)
        {
            
            if (!x.b)
            {
                continue;
            }
            for (sami y : dost)
            {
                
                if (!y.b)
                {
                    continue;
                }
                if (x.r != y.r && x.x == y.x)
                {
                    colisions++;
                    dost[iter].a++;

                }
            }
            iter++;
        }
        if (colisions > 0)
        {
            int biggest = 0;
            int biggest_int = 0;
            int i = 0;
            for (sami x : dost)
            {
                if (x.b)
                {
                    biggest = i;
                    break;
                }
                i++;
            }
            i = 0;
            for (sami xx : dost)
            {
                if (xx.a > biggest_int && xx.b)
                {
                    biggest_int = xx.a;
                    biggest = i;
                }
                xx.a = 0;
                i++;
            }
            dost[biggest].b = false;
            del++;
        }
        else
        {
            break;
        }
    }
    cout << del;
}