Submission #6068092

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define FOR(i,a) for (int i=0;i<(a);++i)
#define FORD(i,a) for (int i=(a)-1;i>=0;i--)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORTD(i,b,a) for (int i=(b);i>=(a);--i)
#define trav(i,v) for (auto i : v)
#define all(v) v.begin(),v.end()
#define ad push_back
#define fr first
#define sc second
#define mpr(a,b) make_pair(a,b)
#define pir pair<int,int>
#define all(v) v.begin(),v.end()
#define make_unique(v) v.erase(unique(all(v),v.end()))
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define dbg(x);
#define dbgv(v);
#define srng mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define y1 EsiHancagorcRepa
#ifdef ALEXPC
#define dbg(x); cout<<#x<<" = "<<x<<endl
#define dbgv(v); cout<<#v<<" = ["; trav(tv,v)cout<<"tv,";cout<<"]"<<endl
#endif

//const int N=100,M=N*N;
const ll MOD=1000*1000*1000+7;

const int N=1e5+6;

vector<int> g[2*N];
ll qan1[2*N],qan2[2*N];
bool col[2*N];
void dfs(int v,int comp){
    if (v>N) qan1[comp]++;
    else qan2[comp]++;
    col[v]=true;
    trav(to,g[v]){
        if (!col[to])dfs(to,comp);
    }
}

int main(){
    fastio;
    srng;
    int m;
    cin>>m;
    FOR(i,m){
        int a,b;
        cin>>a>>b;
        a+=N;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    int cmp=1;
    ll ans=0;
    FOR(i,2*N){
        if (!col[i]){
            dfs(i,cmp);
            ans+=qan1[cmp]*qan2[cmp];
            cmp++;
        }
    }
    cout<<ans-m<<endl;
    return 0;
}

Submission Info

Judge Result