Submission #486709

#	Time	Username	Problem	Language	Result	Execution time	Memory
486709		urosk	Making Friends on Joitter is Fun (JOI20_joitter2)	C++14	100 / 100	1547 ms	109168 KiB

joitter2

//https://oj.uz/problem/view/JOI20_joitter2
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
//#include "bits/stdc++.h"
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"---------------------------\n"
#define ceri(a,l,r) {for(ll i = l;i<=r;i++) cerr<<a[i]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}

void setIO(string inoutname)
{
	freopen((inoutname+".in").c_str(),"r",stdin);
    	freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
   if(b==0) return a;
   if(a==0) return b;
   if(a>=b)  return gcd(a%b,b);
   return  gcd(a,b%a);
}
ll lcm(ll a,ll b){
   return (a/gcd(a,b))*b;
}
ll add(ll a,ll b){
	a+=b;
	a+=mod;
	if(a>=mod) a%=mod;
	return a;
}
ll mul(ll a,ll b){return(a*b)%mod;}
#define maxn 100005
ll n,m,ans = 0;
ll dsu[maxn];
ll sizi[maxn];
set<ll> g[maxn],rg[maxn],v[maxn];
queue<pll> tomrg;
ll root(ll x){
    while(x!=dsu[x]) x = dsu[x];
    return x;
}
ll dsu_siz(ll x){x = root(x);return sz(g[x])+sz(rg[x])+sz(v[x]);}
void updweak(ll x,ll y){
    g[x].insert(y);
    rg[y].insert(x);
    if(g[y].count(x)) tomrg.push({x,y});
}
void mrg(ll x,ll y){
    if(x==y) return;
    if(dsu_siz(x)<dsu_siz(y)) swap(x,y);
    ans+=sizi[x]*sz(v[y]) + sizi[y]*sz(v[x]);
    dsu[y] = x;
    sizi[x]+=sizi[y];
    for(ll z : v[y]){
        if(v[x].count(z)) ans-=sizi[x];
        else v[x].insert(z);
    }

    rg[x].erase(y); g[x].erase(y);
    rg[y].erase(x); g[y].erase(x);
    for(ll z : g[y]){
        rg[y].erase(z);
        updweak(x,z);
    }
    for(ll z : rg[y]){
        rg[x].erase(z);
        updweak(z,x);
    }
}
void tc(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
    cin >> n >> m;
    iota(dsu+1,dsu+n+1,1);
    fill(sizi+1,sizi+n+1,1);
    for(ll i = 1;i<=n;i++) v[i].insert(i);
    for(ll ii = 1;ii<=m;ii++){
        ll x,y; cin >> x >> y;
        y = root(y);
        if(root(x)!=y&&!v[y].count(x)){
            v[y].insert(x);
            ans+=sizi[y];
            x = root(x);
            updweak(x,y);
        }
        while(!tomrg.empty()){
            pll p = tomrg.front();
            tomrg.pop();
            x = p.fi;
            y = p.sc;
            mrg(root(x),root(y));
        }
        cout<<ans<<endl;
    }
}
int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
	//setIO("lol");
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}

Compilation message (stderr)

joitter2.cpp: In function 'void setIO(std::string)':
joitter2.cpp:68:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:69:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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