oj.uz

Submission #551951

# Submission time Handle Problem Language Result Execution time Memory
551951 2022-04-22T00:53:01 Z i_am_noob Making Friends on Joitter is Fun (JOI20_joitter2) C++17
0 / 100
 11 ms 19156 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")

#define ll long long
#define int ll
#define ull unsigned ll
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define chkmin(a,b) (a=min(a,b))
#define chkmax(a,b) (a=max(a,b))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
//#define inf 1010000000
#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define print0(a) cout << (a) << ' '
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

const int mod=1000000007;
const int maxn=100005,maxm=26,maxk=7777714;

//i_am_noob
int n,m,res=0;

int par[maxn];
vector<vector<int>> has(maxn);
unordered_set<int> from[maxn],to[maxn],from2[maxn];

int Find(int x){return x==par[x]?x:par[x]=Find(par[x]);}

void orzck(){
    cin >> n >> m;
    rep(n) par[i]=i,has[i].pb(i);
    rep1(_,m){
        int u,v;
        cin >> u >> v;
        u--,v--;
        if(Find(u)==Find(v)){
            cout << res << "\n";
            continue;
        }
        res-=sz(has[Find(v)])*sz(from2[Find(v)]);
        from[Find(v)].insert(Find(u));
        to[Find(u)].insert(Find(v));
        from2[Find(v)].insert(u);
        res+=sz(has[Find(v)])*sz(from2[Find(v)]);
        u=Find(u),v=Find(v);
        if((!to[u].count(v))||(!to[v].count(u))){
            cout << res << "\n";
            continue;
        }
        queue<int> q;
        while(1){
            res-=sz(has[u])*sz(from2[u]);
            res-=sz(has[v])*sz(from2[v]);
            res-=sz(has[u])*(sz(has[u])-1);
            res-=sz(has[v])*(sz(has[v])-1);
            if(sz(has[u])<sz(has[v])) swap(u,v);
            for(auto i: has[v]) from2[u].erase(i);
            vector<int> tmp;
            for(auto i: from2[v]) if(Find(i)==u) tmp.pb(i);
            for(auto i: tmp) from2[v].erase(i);
            from[u].erase(v),to[u].erase(v);
            from[v].erase(u),to[v].erase(u);
            for(auto i: from[v]) to[i].erase(v),to[i].insert(u);
            for(auto i: to[v]) from[i].erase(v),from[i].insert(u);
            for(auto i: from[v]){
                if(to[u].count(i)) q.push(i);
                else from[u].insert(i);
            }
            for(auto i: to[v]){
                if(from[u].count(i)) q.push(i);
                else to[u].insert(i);
            }
            for(auto i: has[v]) has[u].pb(i);
            for(auto i: from2[v]) from2[u].insert(i);
            par[v]=u;
            res+=sz(has[u])*sz(from2[u]);
            res+=sz(has[u])*(sz(has[u])-1);
            if(q.empty()) break;
            v=q.front();
            q.pop();
        }
        cout << res << "\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    orzck();
    return 0;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19032 KB Output is correct
3 Correct 10 ms 19132 KB Output is correct
4 Correct 10 ms 19064 KB Output is correct
5 Correct 11 ms 19156 KB Output is correct
6 Correct 11 ms 19104 KB Output is correct
7 Incorrect 11 ms 19136 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19032 KB Output is correct
3 Correct 10 ms 19132 KB Output is correct
4 Correct 10 ms 19064 KB Output is correct
5 Correct 11 ms 19156 KB Output is correct
6 Correct 11 ms 19104 KB Output is correct
7 Incorrect 11 ms 19136 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19032 KB Output is correct
3 Correct 10 ms 19132 KB Output is correct
4 Correct 10 ms 19064 KB Output is correct
5 Correct 11 ms 19156 KB Output is correct
6 Correct 11 ms 19104 KB Output is correct
7 Incorrect 11 ms 19136 KB Output isn't correct
8 Halted 0 ms 0 KB -