oj.uz

Submission #897172

# Submission time Handle Problem Language Result Execution time Memory
897172 2024-01-02T16:44:22 Z GrindMachine Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 5000 ms 5108 KB 
#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;
        adj[u].pb(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});
        }

        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
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2808 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 36 ms 2928 KB Output is correct
8 Correct 36 ms 2940 KB Output is correct
9 Correct 35 ms 2908 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2804 KB Output is correct
16 Correct 1 ms 2816 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2804 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 36 ms 2908 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 8 ms 2652 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 29 ms 2908 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2904 KB Output is correct
28 Correct 1 ms 2904 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2804 KB Output is correct
31 Correct 26 ms 2908 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 24 ms 2904 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2808 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 36 ms 2928 KB Output is correct
8 Correct 36 ms 2940 KB Output is correct
9 Correct 35 ms 2908 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2804 KB Output is correct
16 Correct 1 ms 2816 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2804 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 36 ms 2908 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 8 ms 2652 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 29 ms 2908 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2904 KB Output is correct
28 Correct 1 ms 2904 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2804 KB Output is correct
31 Correct 26 ms 2908 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 24 ms 2904 KB Output is correct
34 Correct 541 ms 3156 KB Output is correct
35 Execution timed out 5031 ms 5108 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2808 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 36 ms 2928 KB Output is correct
8 Correct 36 ms 2940 KB Output is correct
9 Correct 35 ms 2908 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2804 KB Output is correct
16 Correct 1 ms 2816 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2804 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 36 ms 2908 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 8 ms 2652 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 29 ms 2908 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2904 KB Output is correct
28 Correct 1 ms 2904 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2804 KB Output is correct
31 Correct 26 ms 2908 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 24 ms 2904 KB Output is correct
34 Correct 541 ms 3156 KB Output is correct
35 Execution timed out 5031 ms 5108 KB Time limit exceeded
36 Halted 0 ms 0 KB -