#include <iostream> //cin, cout
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
//usings
using namespace std;
using namespace __gnu_pbds;
// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// maps
#define mii map<int, int>
#define mll map<ll, ll>
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)
int an = 0;
vi dsu;
vector<set<int>> v;
int get(int x){return dsu[x] < 0 ? x : dsu[x] = get(dsu[x]);}
void merge(int x, int y){
x = get(x), y = get(y);
if(x == y) return;
int sum = 0;
A(u, v[x]) if(v[y].find(u) == v[y].end() && get(u) != y) sum++;
an += -dsu[y] * sum;
sum = 0;
A(u, v[y]) if(v[x].find(u) == v[x].end() && get(u) != x) sum++;
an += -dsu[x] * sum;
if(dsu[y] > dsu[x]) swap(x, y);
if(sz(v[y]) > sz(v[x])) swap(v[y], v[x]);
A(u, v[y]) v[x].in(u);
dsu[x] += dsu[y];
dsu[y] = x;
}
int main(){
int n, m; cin >> n >> m;
dsu = vi(n, -1);
v = vector<set<int>>(n);
F(i, m){
int x, y; cin >> x >> y; x--; y--;
if(get(x) == get(y)) {cout << an << endl; continue;}
int ty = get(y), tx = get(x);
if(v[ty].find(x) == v[ty].end()) an -= dsu[ty], v[ty].in(x);
if(v[tx].find(y) != v[tx].end()) merge(x, y);
cout << an << endl;
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
