Submission #2007268


Source Code Expand

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

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 1e5 + 5;

int n, m;
int par[MAXN], comp[MAXN], sz[MAXN];

int f(int x) {
  if(par[x] == x) return x;
  return par[x] = f(par[x]);
}

void unija(int x, int y) {
  x = f(x); y = f(y);
  if(x == y) return;

  sz[y] += sz[x];
  par[x] = y;
}

vector<int> e;

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);

  cin >> n >> m;

  REP(i, n) {
    par[i] = i;
    sz[i] = 1;
  }

  REP(i, m) {
    int x, y; cin >> x >> y;
    x --; y --;
    e.push_back(x);
    unija(x, y);
  }

  for(auto &x: e) {
    comp[f(x)] ++;
  }

  ll sol = n * n;
  int tonow = 0;

  REP(i, n) {
    if(f(i) == i) {
      sol -= (ll) sz[i] * sz[i] - 1;
      if(comp[i] == sz[i] - 1 && sz[i] > 1) {
        sol ++;
      }
      if(comp[i]) {
      sol -= (ll) tonow * sz[i] * 2 - 1;
      tonow += sz[i];}
    }
  }

  cout << sol;
}

Submission Info

Submission Time
Task C - Squared Graph
User jklepec
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1104 Byte
Status WA
Exec Time 47 ms
Memory 2168 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 1
WA × 1
AC × 4
WA × 28
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt WA 1 ms 256 KB
in10.txt WA 2 ms 1024 KB
in11.txt WA 1 ms 256 KB
in12.txt WA 12 ms 1788 KB
in13.txt WA 12 ms 1788 KB
in14.txt WA 22 ms 1912 KB
in15.txt WA 4 ms 1536 KB
in16.txt WA 17 ms 1784 KB
in17.txt WA 13 ms 1788 KB
in18.txt WA 31 ms 2168 KB
in19.txt WA 25 ms 1912 KB
in2.txt WA 1 ms 256 KB
in20.txt WA 25 ms 1912 KB
in21.txt WA 46 ms 2168 KB
in22.txt WA 33 ms 1528 KB
in23.txt WA 30 ms 1400 KB
in24.txt WA 2 ms 1408 KB
in25.txt WA 47 ms 2168 KB
in26.txt AC 1 ms 256 KB
in27.txt WA 1 ms 256 KB
in28.txt WA 47 ms 2168 KB
in3.txt AC 1 ms 256 KB
in4.txt WA 1 ms 256 KB
in5.txt WA 32 ms 2168 KB
in6.txt WA 3 ms 1536 KB
in7.txt WA 3 ms 1152 KB
in8.txt WA 5 ms 1536 KB
in9.txt WA 15 ms 1788 KB
sample1.txt WA 1 ms 256 KB
sample2.txt AC 1 ms 256 KB