oj.uz

Submission #259745

# Submission time Handle Problem Language Result Execution time Memory
259745 2020-08-08T12:48:32 Z amoo_safar Making Friends on Joitter is Fun (JOI20_joitter2) C++14
0 / 100
 4 ms 5760 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 1e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

ll ans;
int n, m;
map<pll, int> mp;

int par[N], sz[N];
set<int> st[N];

vector<pll> U;


ll Calc(int com){
	ll res = 0;
	res = 1ll * sz[com] * st[com].size();
	res -= sz[com];
	return res;
}

int Find(int u){
	if(par[u] == u) return u;
	return par[u] = Find(par[u]);
}

void AddE(int u, int v){
	ans -= Calc(Find(v));
	st[Find(v)].insert(u);
	ans += Calc(Find(v));

	u = Find(u); v = Find(v);
	mp[{u, v}] = 1;
	if(mp.count({v, u})){
		U.pb({u, v});
	}
}
void Unite(int u, int v){
	u = Find(u); v = Find(v);
	if(u == v) return ;
	if(st[u].size() > st[v].size()) swap(u, v);
	
	ans -= Calc(u); ans -= Calc(v);
	for(auto x : st[u]){
		//AddE(x, v);
		st[v].insert(x);
	}
	for(auto x : st[u]){
		if(mp.count({v, Find(x)})){
			U.pb({v, Find(x)});
		}
	}
	st[u].clear();
	//st[u].shrink_to_fit();

	par[u] = v;
	sz[v] += sz[u];
	ans += Calc(v);
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	iota(par, par + N, 0);
	fill(sz, sz + N, 1);
	cin >> n >> m;
	for(int i = 1; i <= n; i++) st[i].insert(i);

	int u, v;
	for(int i = 0; i < m; i++){
		cin >> u >> v;
		AddE(u, v);
		int f1, f2;
		while(!U.empty()){
			f1 = U.back().F; f2 = U.back().S;
			U.pop_back();
			Unite(f1, f2);
			//cerr << "# " << f1 << ' ' << f2 << '\n';
		}
		cout << ans << '\n';
	}
	return 0;
}
/*
4 6
1 2
2 1
3 4
4 3
1 3
4 2

*/

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Incorrect 4 ms 5760 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Incorrect 4 ms 5760 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Incorrect 4 ms 5760 KB Output isn't correct
4 Halted 0 ms 0 KB -