Submission #1370355

---

Source Code Expand

#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long 
#define ull unsigned long long 
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
 
#define y1 what

using namespace std;
 
const int N = (int) 1e5 + 10;
const int M = (int) 101;
const ll big =  (1LL << 51);
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const int INF1 = (int) 1e9 + 3;
const double EPS = (double) 1e-6;
const double PI =  3.14159265359;

int n, m;
vector<int> v[N];
bool u[N];

void dfs(int x) {
  u[x] = 1;
  for (auto it : v[x]) {
    if (!u[it]) dfs(it);
  }
}

int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    srand(time(0));
    cin >> n >> m;
    vector<pii> e;
    while (m--) {
      int x, y;
      cin >> x >> y;
      --x, --y;
      e.pb({x, y});
      e.pb({y, x});
    }
    for (int i = 0; i < sz(e); i++) {
      for (int j = 0; j < sz(e); j++) {
        v[e[i].f * n + e[j].f].pb(e[i].s * n + e[j].s);
      }
    }
    int comp = 0;
    for (int i = 0; i < n * n; i++) {
      if (!u[i]) {
        dfs(i);
        ++comp;
      }
    }
    cout << comp;
    return 0;
}

Submission Info

Judge Result