Submission

Status:

(PPPPPP)(-SSSSS)(PPPPPP)(-SSSSSSS)(-SSSSS)(-SSSSSSSSSSSS)

Subtask/Task Score:

{13/13}{0/11}{10/10}{0/16}{0/18}{0/32}

Score: 23

User: kungarooo

Problemset: Tech Sprites

Language: cpp

Time: 1.210 second

Submitted On: 2025-11-01 14:27:48

#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> adj(1000001);
tuple<int,int,int> p[1000001];
vector<bool> vis(1000001,false);
void dfs(int node,int& g){
    if(vis[node])return;
    vis[node]=1;
    //cout<<node<<"::\n";
    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(){
    ios_base::sync_with_stdio(0),cin.tie(NULL);
    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-1].push_back(v-1);
        adj[v-1].push_back(u-1);
    }
    int cnt=1;
    for(int i=0;i<n;i++){
        auto [a,b,g]=p[i];
        if(g==-1){
            //cout<<i<<":\n";
            dfs(i,cnt);
            cnt++;
        }
    }

    cout<<cnt-2;
    return 0;
}