Problem p02573 (C++) — buggy submission, verdict: Runtime Error


// Problem : D - Friends
// Contest : AtCoder - AtCoder Beginner Contest 177
// URL : https://atcoder.jp/contests/abc177/tasks/abc177_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define nl "\\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define sz(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof a)
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr << #x << " = " << x << "\\n"
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x)                                                                   \\
  int x;                                                                       \\
  cin >> x;                                                                    \\
  while (x--)
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define len(s) s.length()
#define watch(x) cout << #x << " = " << x << endl
#define trace(x) cerr << #x << " = " << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    pbds; // for storing unique elements
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set; // for repeating elements

int power(int a, int b, int m = mod) {
  int ans = 1;
  while (b > 0) {
    if (b & 1)
      ans = (ans * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return ans;
}

void babuBhaiya() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}

const int N = 1e5 + 1;
const double pi = acos(-1);

int parent[200005];
int R[200005];

int find(int a) {
  if (parent[a] == a)
    return a;
  return parent[a] = find(parent[a]);
}

void merge(int a, int b) {
  a = find(a);
  b = find(b);

  if (a == b)
    return;

  if (R[a] > R[b]) {
    parent[b] = a;
    R[a] += R[b];
  } else {
    parent[a] = b;
    R[b] += R[a];
  }
}

void solve() {

  int n, m;
  cin >> n >> m;
  rep(i, 1, n + 1) {
    parent[i] = i;
    R[i] = 1;
  }
  rep(i, 0, m) {
    int a, b;
    cin >> a >> b;
    if (find(a) == find(b))
      continue;
    else
      merge(a, b);
  }
  int mx = 0;
  for (int i = 1; i <= n; i++) {
    mx = max(mx, R[find(i)]);
  }
  cout << mx;
}

int32_t main() {
  babuBhaiya();

  int t;

  t = 1;
  // cin>>t;

  while (t--) {
    solve();
  }

  return 0;
}

Error: WA

Fixed submission:


// Problem : D - Friends
// Contest : AtCoder - AtCoder Beginner Contest 177
// URL : https://atcoder.jp/contests/abc177/tasks/abc177_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define nl "\\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define sz(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof a)
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr << #x << " = " << x << "\\n"
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x)                                                                   \\
  int x;                                                                       \\
  cin >> x;                                                                    \\
  while (x--)
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define len(s) s.length()
#define watch(x) cout << #x << " = " << x << endl
#define trace(x) cerr << #x << " = " << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    pbds; // for storing unique elements
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set; // for repeating elements

int power(int a, int b, int m = mod) {
  int ans = 1;
  while (b > 0) {
    if (b & 1)
      ans = (ans * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return ans;
}

void babuBhaiya() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}

const int N = 1e5 + 1;
const double pi = acos(-1);

int parent[100005];
int R[100005];

int find(int a) {
  if (parent[a] == a)
    return a;
  return parent[a] = find(parent[a]);
}

void merge(int a, int b) {
  a = find(a);
  b = find(b);

  if (a == b)
    return;

  if (R[a] > R[b]) {
    parent[b] = a;
    R[a] += R[b];
  } else {
    parent[a] = b;
    R[b] += R[a];
  }
}

void solve() {

  int n, m;
  cin >> n >> m;
  rep(i, 1, n + 1) {
    parent[i] = i;
    R[i] = 1;
  }
  rep(i, 0, m) {
    int a, b;
    cin >> a >> b;
    if (find(a) == find(b))
      continue;
    else
      merge(a, b);
  }
  int mx = 0;
  for (int i = 1; i <= n; i++) {
    mx = max(mx, R[find(i)]);
  }
  cout << mx;
}

int32_t main() {
  babuBhaiya();

  int t;

  t = 1;
  // cin>>t;

  while (t--) {
    solve();
  }

  return 0;
}