Submission #968718

#	Time	Username	Problem	Language	Result	Execution time	Memory
968718		shadow_sami	Making Friends on Joitter is Fun (JOI20_joitter2)	C++17	0 / 100	71 ms	143288 KiB

joitter2

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll sr,de;

typedef struct Disjoint_Set_Union{
	vi sz,par;
	set<ll> st[mx];
	queue<pi> q;
	set<ll> adj[mx];
	set<ll> radj[mx];
	pi pt;
	void init(ll k){
		k += 5;
		sz.resize(k);
		par.resize(k);
		fip(1,k+1){
			sz[i] = 1;
			par[i] = i;
			st[i].insert(i);
		}
		return;
	}
	ll find(ll k){
		return ((par[k]==k)?k:par[k]=find(par[k]));
	}
	ll get(ll x){
		return st[x].size() + adj[x].size() + radj[x].size();
	}
	void aa(ll u,ll v){
		adj[u].insert(v);
		radj[v].insert(u);
		if(adj[v].find(u)!=adj[v].end())
			q.push({u,v});		
		return;
	}
	void bb(ll u,ll v){
		u = find(u);
		v = find(v);
		if(u==v)
			return;
		if(get(u) < get(v))
			swap(u,v);
		ans += sz[u] * st[v].size();
		ans += sz[v] * st[u].size();
		sz[u] += sz[v];
		par[v] = u;
		fx(st[v]){
			if(st[u].find(x)!=st[u].end())
				ans -= sz[u];
			else
				st[u].insert(x);
		}
		adj[u].erase(v);
		adj[v].erase(u);
		radj[u].erase(v);
		radj[v].erase(u);
		fx(adj[v]){
			radj[x].erase(v);
			aa(u,x);
		}
		fx(radj[v]){
			adj[x].erase(v);
			aa(x,u);
		}
	}
	void unite(ll u,ll v){
		v = find(v);		
		if(st[v].find(u)==st[v].end() && find(u)!=v){
			st[v].insert(u);
			u = find(u);
			ans += sz[v];
			aa(u,v);
			while(q.size()){
				pt = q.front();
				q.pop();				
				bb(pt.ff,pt.ss);
			}
		}
	}
}DSU;

DSU dsu;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        dsu.init(n);
        ans = 0;
        while(m--){
        	cin>>sr>>de;
        	dsu.unite(sr,de);
        	cout<<ans<<nli;
        }
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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