CF 976 Div 2 - D

#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define NeedForSpeed                  \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define int long long
#define all(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vpi;
#define f first
#define s second
#define endl "\n"
const int mod = 1000000007;
const int MAXN = 200010;
int parent[MAXN], component_size[MAXN];
int components;
int find(int x)
{
    if (parent[x] != x)
    {
        parent[x] = find(parent[x]);
    }
    return parent[x];
}
void unite(int x, int y)
{
    int rootX = find(x);
    int rootY = find(y);
    if (rootX != rootY)
    {
        if (component_size[rootX] < component_size[rootY])
        {
            swap(rootX, rootY);
        }
        parent[rootY] = rootX;
        component_size[rootX] += component_size[rootY];
        components--;
    }
}
void reset(int n)
{
    components = n;
    for (int i = 0; i < n; i++)
    {
        parent[i] = i;
        component_size[i] = 1;
    }
}


signed main()
{
    NeedForSpeed;
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        reset(n);
        if (m == 0)
        {
            cout << n << endl;
            return;
        }
        for (int i = 0; i < m; i++)
        {
            int a, d, k;
            cin >> a >> d >> k;
            a -= 1;
            for (int j = 0; j < k; j++)
            {
                int u = a + j * d;
                int v = a + (j + 1) * d;
                if (v >= n)
                {
                    break;
                }
                unite(u, v);
            }
        }
        cout << components << endl;
    }
    return 0;
}