Submission

Score: 100

User: Nagornz

Problemset: Tech Sprites

Language: cpp

Time: 1.726 second

Submitted On: 2025-05-24 19:46:17

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>

#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));

const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 1e6 + 5;
const int M = 3e6 + 5;

int n, m, par[N], sz[N], cnt[N], mp[N];
tiii a[N];

int dsu(int a){
    return par[a] = (a == par[a] ? a : dsu(par[a]));
}

void unite(int u, int v){
    int uu = dsu(u), vv = dsu(v);
    if (uu != vv) {
        sz[vv] += sz[uu];
        cnt[vv] += cnt[uu];
        par[uu] = vv;
    }
}

int32_t main(){
    iShowSpeed;
    for (auto &e : sz) e = 1;
    iota(par, par + N, 0ll);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        auto &[x, y, idx] = a[i];
        cin >> x >> y; idx = i;
    }
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) {
        auto &[x, y, idx] = a[i];
        mp[idx] = i;
    }
    for (int i = 1; i <= m; i++) {
        int u, v; cin >> u >> v;
        unite(mp[u], mp[v]);
    }
    // for (int i = 1; i <= n; i++) cout << dsu(i) << " "; cout << "\n";
    int ans = 0;
    for (int i = 1; i < n; i++) {
        cnt[dsu(i)]++;
        if (cnt[dsu(i)] == sz[dsu(i)]) continue;
        if (dsu(i + 1) != dsu(i)) {
            ans++;
            unite(i, i + 1);
        }
    }
    cout << ans;
}