Submission #359285

#	Time	Username	Problem	Language	Result	Execution time	Memory
359285		Return_0	Making Friends on Joitter is Fun (JOI20_joitter2)	C++17	100 / 100	1623 ms	80108 KiB

joitter2

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1);
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
	return out << '(' << a.first << ", " << a.second << ')';    }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7;

ll sz [N], par [N], n, m;
set <ll> in [N], out [N], frfr [N], comp [N];
long long ans;

ll root (cl &v) { return par[v] = (par[v] == v ? v : root(par[v])); }
void unite (ll v, ll u) {
	v = root(v), u = root(u);
	if (v == u)	return;
	if (SZ(in[v]) + SZ(out[v]) + SZ(frfr[v]) + SZ(comp[v]) > SZ(in[u]) + SZ(out[u]) + SZ(frfr[u]) + SZ(comp[u])) swap(u, v);

	//!			v bere tu u

	for (auto &it : comp[v]) if (!frfr[u].count(it)) ans += sz[u];

	ans += 1LL * sz[u] * sz[v];
	for (auto &it : frfr[v]) if (comp[u].count(it)) ans -= sz[v];

	ll t = SZ(frfr[u]);
	for (auto &it : comp[v])	if (frfr[u].count(it))	t--;
	for (auto &it : frfr[v])	if (frfr[u].count(it))	t--;
	ans += t * sz[v];

	t = SZ(frfr[v]);
	for (auto &it : frfr[v])	if (comp[u].count(it))	t--;
	for (auto &it : frfr[v])	if (frfr[u].count(it))	t--;
	ans += t * sz[u];

	vector <pll> vec;
	for (auto &it : out[v]) if (in[u].count(it) && !in[v].count(it))	vec.push_back({it, u});
	for (auto &it : in[v])	if (!in[u].count(it) && out[u].count(it))	vec.push_back({it, u});

	for (auto &it : in[v]) {
		in[u].insert(it);
		out[it].erase(v);
		out[it].insert(u);
	}

	for (auto &it : out[v]) {
		out[u].insert(it);
		in[it].erase(v);
		in[it].insert(u);
	}

	for (auto &it : comp[v])	comp[u].insert(it),		frfr[u].erase(it);
	for (auto &it : frfr[v])	if (!comp[u].count(it))	frfr[u].insert(it);

	par[v] = u; sz[u] += sz[v];
	in[v].clear(); out[v].clear();

	for (auto &it : vec) if (out[it.sc].count(it.fr)) unite(it.fr, it.sc);
}

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

	iota(par, par + N, 0);
	fill(sz, sz + N, 1);
	for (ll i = 0; i < N; i++)	comp[i].insert(i);

	cin>> n >> m;

	for (ll v, u, pu, pv; m--;) {
		cin>> u >> v;
		pu = root(u), pv = root(v);

		if (pu ^ pv && !frfr[pv].count(u)) {
			out[pu].insert(pv);
			in[pv].insert(pu);
			frfr[pv].insert(u);
			ans += sz[pv];

			if (out[pv].count(pu)) unite(pu, pv);
		}

		cout<< ans << '\n';
	}

	return 0;
}
/*
4 6
1 2
2 3
3 2
1 3
3 4
4 3

6 10
1 2
2 3
3 4
4 5
5 6
6 5
5 4
4 3
3 2
2 1

*/

Compilation message (stderr)

joitter2.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
joitter2.cpp:44:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |  ^~
joitter2.cpp:44:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |                                ^~~

• Subtask 1: 1 / 1
• Subtask 2: 16 / 16
• Subtask 3: 83 / 83