Submission #897171

#	Time	Username	Problem	Language	Result	Execution time	Memory
897171		GrindMachine	Making Friends on Joitter is Fun (JOI20_joitter2)	C++17	0 / 100	1 ms	2652 KiB

joitter2

#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;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct DSU {
    vector<int> par, rankk, siz;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

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

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
    }
};

vector<ll> adj[N];

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    set<pll> st;
    DSU dsu(n+5);
    vector<pll> pending;
    vector<pll> edges;

    rep1(id,m){
        ll u,v; cin >> u >> v;
        pending.pb({u,v});
        edges.pb({u,v});
        u = dsu.find(u), v = dsu.find(v);

        if(st.count({v,u})){
            dsu.merge(u,v);
            pending.pop_back();
            st.clear();

            while(true){
                st.clear();
                vector<pll> pending2;
                bool good = false;

                for(auto [u,v] : pending){
                    ll cu = dsu.find(u);
                    ll cv = dsu.find(v);
                    if(st.count({cv,cu})){
                        dsu.merge(u,v);
                        good = true;
                    }
                    else{
                        pending2.pb({u,v});
                    }
                    st.insert({cu,cv});
                }

                pending = pending2;
                if(!good){
                    st.clear();
                    break;
                }
            }

            for(auto [u,v] : edges){
                ll cu = dsu.find(u);
                ll cv = dsu.find(v);
                st.insert({cu,cv});
            }
        }
        else{
            st.insert({u,v});
        }

        adj[u].pb(v);

        ll ans = 0;

        rep1(u,n){
            if(dsu.find(u) == u){
                ll siz = dsu.siz[u];
                ans += siz*(siz-1);
            }

            set<ll> ccs;

            trav(v,adj[u]){
                if(dsu.same(u,v)) conts;
                ccs.insert(dsu.find(v));
            }

            trav(cc,ccs){
                ans += dsu.siz[cc];
            }
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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