oj.uz

답안 #963711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963711 2024-04-15T14:04:52 Z GrindMachine 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 596 ms 96560 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
 
/*
 
read some solutions some time ago, remember some ideas from there
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

ll ans = 0;

struct DSU {
    vector<int> par, rankk, siz;
    vector<set<int>> inc, out;
    vector< map<int,set<int>> > inc_nodes;
    vector<vector<int>> nodes;
    vector<ll> inc_deg;

    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);
        inc = vector<set<int>>(n + 1);
        out = vector<set<int>>(n + 1);
        inc_nodes = vector< map<int,set<int>> >(n + 1);
        nodes = vector<vector<int>>(n + 1);
        inc_deg = vector<ll>(n + 1);
        rep(i, n + 1) create(i);
    }
 
    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
        nodes[u].pb(u);
    }
 
    int find(int u) {
        return 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];
        // if(sz(inc_nodes[u]) < sz(inc_nodes[v])){
        //     swap(inc_nodes[u],inc_nodes[v]);
        // }

        // trav(x,inc_nodes[v]){
        //     inc_nodes[u].insert(x);
        // }
 
        // inc_nodes[v].clear();
    }
 
    void merge_sets(set<int> &st1, set<int> &st2){
        if(sz(st1) < sz(st2)) swap(st1,st2);
        trav(x,st2) st1.insert(x);
        st2.clear();
    }

    void go(int u, int v){
        // merge u and v
        if(same(u,v)) return;

        if(sz(inc[u])+sz(out[u])+sz(nodes[u]) < sz(inc[v])+sz(out[v])+sz(nodes[v])){
            swap(u,v);
        }

        ans += siz[u]*siz[v]*2;
        ans -= inc_deg[u]*siz[u];
        ans -= inc_deg[v]*siz[v];
        siz[u] += siz[v];
        ans += inc_deg[u]*siz[u];
        inc_deg[v] = 0;

        for(auto &[cc,st] : inc_nodes[v]){
            if(cc == u) conts;

            ans -= inc_deg[u]*siz[u];
            inc_deg[u] -= sz(inc_nodes[u][cc]);

            if(sz(inc_nodes[u][cc]) < sz(st)){
                swap(inc_nodes[u][cc],st);
            }

            trav(x,st){
                inc_nodes[u][cc].insert(x);
            }

            inc_deg[u] += sz(inc_nodes[u][cc]);
            ans += inc_deg[u]*siz[u];
        }

        ans -= inc_deg[u]*siz[u];
        inc_deg[u] -= sz(inc_nodes[u][v]);
        ans += inc_deg[u]*siz[u];

        inc_nodes[u].erase(v);
        inc_nodes[v].clear();

        out[u].erase(v);
        inc[u].erase(v);
        out[v].erase(u);
        inc[v].erase(u);
 
        vector<pii> pending;
 
        trav(x,out[v]){
            out[u].insert(x);
            if(inc[u].count(x)){
                pending.pb({u,x});
            }
            inc[x].erase(v);
            inc[x].insert(u);
            merge_sets(inc_nodes[x][u],inc_nodes[x][v]);
        }
 
        trav(x,inc[v]){
            inc[u].insert(x);
            if(out[u].count(x)){
                pending.pb({u,x});
            }
            out[x].erase(v);
            out[x].insert(u);
        }

        trav(x,nodes[v]){
            nodes[u].pb(x);
            par[x] = u;
        }

        out[v].clear();
        inc[v].clear();
        nodes[v].clear();

        for(auto [x,y] : pending){
            go(x,y);
        }
    }
 
    void add_edge(int u, int v){
        int pu = find(u), pv = find(v);
        if(pu != pv){
            ll add = !inc_nodes[pv][pu].count(u);
            inc_deg[pv] += add;
            ans += add*siz[pv];
            if(add){
                inc_nodes[pv][pu].insert(u);
            }
        }

        u = pu, v = pv;
 
        if(u == v or out[u].count(v)) return;
 
        out[u].insert(v);
        inc[v].insert(u);
 
        if(inc[u].count(v)){
            // merge
            go(u,v);
        }
    }
};
 
void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    DSU dsu(n+5);
 
    rep1(i,m){
        ll u,v; cin >> u >> v;
        dsu.add_edge(u,v);
        
        // rep1(i,n){
        //     debug(dsu.find(i));
        // }

        cout << ans << endl;
        
        // rep1(i,n){
        //     debug(dsu.find(i));
        //     debug(dsu.inc_deg[i]);
        // }

        // ll add = 0;
        // rep1(j,n){
        //     if(dsu.find(j) != j) conts;
        //     ll s = dsu.siz[j];
        //     for(auto [cc,st] : dsu.inc_nodes[j]){
        //         add += sz(st)*s;
        //     }
        // }

        // ans += add;
        // cout << ans << endl;
        // ans -= add;
    }
}
 
int main()
{
    fastio;
 
    int t = 1;
    // cin >> t;
 
    rep1(i, t) {
        solve(i);
    }
 
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 65 ms 6420 KB Output is correct
36 Correct 98 ms 10736 KB Output is correct
37 Correct 92 ms 10836 KB Output is correct
38 Correct 94 ms 10140 KB Output is correct
39 Correct 2 ms 856 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 4 ms 1116 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 5 ms 1116 KB Output is correct
44 Correct 3 ms 1116 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 2 ms 912 KB Output is correct
47 Correct 4 ms 1116 KB Output is correct
48 Correct 4 ms 1232 KB Output is correct
49 Correct 11 ms 2396 KB Output is correct
50 Correct 102 ms 10840 KB Output is correct
51 Correct 7 ms 1380 KB Output is correct
52 Correct 76 ms 8176 KB Output is correct
53 Correct 10 ms 2148 KB Output is correct
54 Correct 83 ms 9436 KB Output is correct
55 Correct 6 ms 1880 KB Output is correct
56 Correct 6 ms 1880 KB Output is correct
57 Correct 7 ms 2396 KB Output is correct
58 Correct 6 ms 2140 KB Output is correct
59 Correct 3 ms 940 KB Output is correct
60 Correct 62 ms 4712 KB Output is correct
61 Correct 5 ms 1368 KB Output is correct
62 Correct 95 ms 9812 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 452 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 65 ms 6420 KB Output is correct
36 Correct 98 ms 10736 KB Output is correct
37 Correct 92 ms 10836 KB Output is correct
38 Correct 94 ms 10140 KB Output is correct
39 Correct 2 ms 856 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 4 ms 1116 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 5 ms 1116 KB Output is correct
44 Correct 3 ms 1116 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 2 ms 912 KB Output is correct
47 Correct 4 ms 1116 KB Output is correct
48 Correct 4 ms 1232 KB Output is correct
49 Correct 11 ms 2396 KB Output is correct
50 Correct 102 ms 10840 KB Output is correct
51 Correct 7 ms 1380 KB Output is correct
52 Correct 76 ms 8176 KB Output is correct
53 Correct 10 ms 2148 KB Output is correct
54 Correct 83 ms 9436 KB Output is correct
55 Correct 6 ms 1880 KB Output is correct
56 Correct 6 ms 1880 KB Output is correct
57 Correct 7 ms 2396 KB Output is correct
58 Correct 6 ms 2140 KB Output is correct
59 Correct 3 ms 940 KB Output is correct
60 Correct 62 ms 4712 KB Output is correct
61 Correct 5 ms 1368 KB Output is correct
62 Correct 95 ms 9812 KB Output is correct
63 Correct 596 ms 96360 KB Output is correct
64 Correct 559 ms 96352 KB Output is correct
65 Correct 539 ms 96560 KB Output is correct
66 Correct 129 ms 25876 KB Output is correct
67 Incorrect 391 ms 38948 KB Output isn't correct
68 Halted 0 ms 0 KB -