// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 300005;
int n, m;
int a[MAXN], b[MAXN];
int p[MAXN], sz[MAXN];
void init() {
REP (i, 1, n + 1) {
p[i] = i;
sz[i] = 1;
}
}
int findp(int i) {
if (p[i] == i) {
return i;
}
return p[i] = findp(p[i]);
}
bool join(int a, int b) {
int pa = findp(a), pb = findp(b);
if (pa == pb) {
return 1;
}
if (sz[pa] < sz[pb]) {
swap(pa, pb);
}
sz[pa] += sz[pb];
p[pb] = pa;
return 1;
}
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> n >> m;
init();
REP (i, 0, m) {
cin >> a[i] >> b[i];
bool scc = 0;
RREP (j, i - 1, 0) {
if (findp(a[j]) == findp(b[i]) && findp(a[i]) == findp(b[j])) {
scc = 1;
break;
}
}
if (scc) {
join(a[i], b[i]);
}
ll ans = 0;
set<ii> st;
RREP (j, i, 0) {
if (findp(a[j]) == findp(b[j])) {
continue;
}
int pa = findp(a[j]), pb = findp(b[j]);
if (st.find({pa, pb}) != st.end()) {
continue;
}
st.insert({pa, pb});
ans += sz[pb];
}
REP (j, 1, n + 1) {
if (findp(j) != j) {
continue;
}
ans += (ll) sz[j] * (sz[j] - 1);
}
cout << ans << '\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
