Submission

Score: 0

User: kungarooo

Problemset: Tech Sprites

Language: cpp

Time: 1.914 second

Submitted On: 2025-11-01 14:20:17

#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> adj(1000001);
tuple<int,int,int> p[1000001];
vector<bool> vis(1000001);
void dfs(int node,int& g){
    if(vis[node])return;
    vis[node]=1;
    auto [a,b,gg]=p[node];
    p[node]={a,b,g};
    for(auto i:adj[node]){
        if(vis[i])continue;
        dfs(i,g);
    }
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        int u,v;
        cin>>u>>v;
        p[i]={u,v,-1};
    }
    for(int i=0;i<m;i++){
        int u,v;
        cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    int cnt=1;
    for(int i=0;i<n;i++){
        auto [a,b,g]=p[i];
        if(g==-1){
            dfs(i,cnt);
            cnt++;
        }
    }
    cout<<cnt-2;
    return 0;
}