oj.uz

답안 #1091081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091081 2024-09-19T17:16:53 Z steveonalex 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
100 / 100
 572 ms 68440 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

pair<int, int> make_edge(int u, int v){
    if (u <= v) return make_pair(u, v);
    return make_pair(v, u);
}

struct DSU{
    int n;
    vector<int> parent, sz;
    vector<vector<int>> ver;
    vector<set<int>> S1, S2, drake;
    set<pair<int, int>> pending_merge;
    ll ans;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        S1.resize(n+1); S2.resize(n+1); drake.resize(n+1);
        ver.resize(n+1);
        for(int i = 1; i<=n; ++i) {
            parent[i] = i;
            ver[i].push_back(i);
        }
        ans = 0;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u == v) return false;
        ans += 2LL * sz[u] * sz[v];
        S1[u].erase(v); S2[u].erase(v); 
        S1[v].erase(u); S2[v].erase(u);
        ans -= 1LL * sz[v] * drake[v].size() + 1LL * sz[u] * drake[u].size();
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            vector<pair<int, int>> pending;
            for(int i: S1[v]) {
                S2[i].erase(v); S2[i].insert(u);
                S1[u].insert(i);
                if (S2[u].find(i) != S2[u].end()) pending_merge.insert({u, i});
            }
            for(int i: S2[v]){
                S1[i].erase(v); S1[i].insert(u);
                S2[u].insert(i);
                if (S1[u].find(i) != S1[u].end()) pending_merge.insert({u, i}); 
            }
            for(int i: ver[v]) drake[u].erase(i);
            ans += 1LL * sz[u] * drake[u].size();
            for(int i: drake[v]) if (!same_set(u, i)) add_drake(u, i);

            for(int i: ver[v]) ver[u].push_back(i);
            return true;
    }

    void add_drake(int u, int v){
        if (drake[u].insert(v).second) {
            ans += get_size(u);
        }
    }

    int get_size(int u){return sz[find_set(u)];}
    ll get_ans(){return ans;}

    void add_edge(int u, int v){
        int _u = u;
        u = find_set(u), v = find_set(v);
        S1[u].insert(v); S2[v].insert(u);
        add_drake(v, _u);
        if (S2[u].find(v) != S2[u].end()) pending_merge.insert({u, v});

        while(pending_merge.size()){
            int x, y; tie(x, y) = *pending_merge.begin();
            pending_merge.erase(pending_merge.begin());
            join_set(x, y);
        }
    }
};

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    // freopen("input.inp", "r", stdin);

    int n, m; cin >> n >> m;

    DSU mst(n);
    for(int i = 0; i<m; ++i){
        int u, v; cin >> u >> v;

        if (!mst.same_set(u, v)) mst.add_edge(u, v);
        ll ans = mst.get_ans();

        cout << ans << "\n";
    }

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 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 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 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 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 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 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 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 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 608 KB Output is correct
35 Correct 50 ms 6320 KB Output is correct
36 Correct 70 ms 9224 KB Output is correct
37 Correct 68 ms 9388 KB Output is correct
38 Correct 73 ms 8932 KB Output is correct
39 Correct 2 ms 856 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 2 ms 1116 KB Output is correct
42 Correct 2 ms 980 KB Output is correct
43 Correct 3 ms 1116 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 3 ms 1116 KB Output is correct
48 Correct 3 ms 1116 KB Output is correct
49 Correct 12 ms 2040 KB Output is correct
50 Correct 71 ms 9460 KB Output is correct
51 Correct 5 ms 1368 KB Output is correct
52 Correct 57 ms 7668 KB Output is correct
53 Correct 7 ms 1880 KB Output is correct
54 Correct 64 ms 8488 KB Output is correct
55 Correct 4 ms 1372 KB Output is correct
56 Correct 4 ms 1372 KB Output is correct
57 Correct 4 ms 1496 KB Output is correct
58 Correct 4 ms 1372 KB Output is correct
59 Correct 2 ms 856 KB Output is correct
60 Correct 44 ms 5880 KB Output is correct
61 Correct 4 ms 1116 KB Output is correct
62 Correct 69 ms 8720 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 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 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 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 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 608 KB Output is correct
35 Correct 50 ms 6320 KB Output is correct
36 Correct 70 ms 9224 KB Output is correct
37 Correct 68 ms 9388 KB Output is correct
38 Correct 73 ms 8932 KB Output is correct
39 Correct 2 ms 856 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 2 ms 1116 KB Output is correct
42 Correct 2 ms 980 KB Output is correct
43 Correct 3 ms 1116 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 3 ms 1116 KB Output is correct
48 Correct 3 ms 1116 KB Output is correct
49 Correct 12 ms 2040 KB Output is correct
50 Correct 71 ms 9460 KB Output is correct
51 Correct 5 ms 1368 KB Output is correct
52 Correct 57 ms 7668 KB Output is correct
53 Correct 7 ms 1880 KB Output is correct
54 Correct 64 ms 8488 KB Output is correct
55 Correct 4 ms 1372 KB Output is correct
56 Correct 4 ms 1372 KB Output is correct
57 Correct 4 ms 1496 KB Output is correct
58 Correct 4 ms 1372 KB Output is correct
59 Correct 2 ms 856 KB Output is correct
60 Correct 44 ms 5880 KB Output is correct
61 Correct 4 ms 1116 KB Output is correct
62 Correct 69 ms 8720 KB Output is correct
63 Correct 341 ms 68436 KB Output is correct
64 Correct 334 ms 68432 KB Output is correct
65 Correct 317 ms 68440 KB Output is correct
66 Correct 96 ms 30152 KB Output is correct
67 Correct 181 ms 38452 KB Output is correct
68 Correct 96 ms 30148 KB Output is correct
69 Correct 234 ms 33992 KB Output is correct
70 Correct 93 ms 30152 KB Output is correct
71 Correct 101 ms 30092 KB Output is correct
72 Correct 226 ms 37496 KB Output is correct
73 Correct 225 ms 37580 KB Output is correct
74 Correct 572 ms 64972 KB Output is correct
75 Correct 330 ms 40904 KB Output is correct
76 Correct 451 ms 52816 KB Output is correct
77 Correct 456 ms 52680 KB Output is correct
78 Correct 117 ms 35820 KB Output is correct
79 Correct 181 ms 39628 KB Output is correct
80 Correct 140 ms 34764 KB Output is correct
81 Correct 201 ms 38092 KB Output is correct
82 Correct 454 ms 54484 KB Output is correct
83 Correct 451 ms 54480 KB Output is correct
84 Correct 413 ms 53868 KB Output is correct
85 Correct 395 ms 53708 KB Output is correct
86 Correct 113 ms 34184 KB Output is correct
87 Correct 133 ms 36424 KB Output is correct
88 Correct 238 ms 37836 KB Output is correct
89 Correct 408 ms 50376 KB Output is correct