oj.uz

답안 #963715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963715 2024-04-15T14:07:10 Z GrindMachine 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
100 / 100
 1236 ms 97112 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;
    vector<ll> 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<ll>(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_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);
        cout << ans << endl;
    }
}
 
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 348 KB Output is correct
2 Correct 0 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 1 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 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 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 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 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 1 ms 348 KB Output is correct
29 Correct 0 ms 456 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 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 1 ms 348 KB Output is correct
2 Correct 0 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 1 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 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 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 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 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 1 ms 348 KB Output is correct
29 Correct 0 ms 456 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 3 ms 600 KB Output is correct
35 Correct 67 ms 6480 KB Output is correct
36 Correct 87 ms 11044 KB Output is correct
37 Correct 101 ms 11092 KB Output is correct
38 Correct 85 ms 10576 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 4 ms 1112 KB Output is correct
41 Correct 3 ms 1116 KB Output is correct
42 Correct 2 ms 984 KB Output is correct
43 Correct 5 ms 1116 KB Output is correct
44 Correct 3 ms 1192 KB Output is correct
45 Correct 2 ms 972 KB Output is correct
46 Correct 3 ms 860 KB Output is correct
47 Correct 5 ms 1116 KB Output is correct
48 Correct 4 ms 1112 KB Output is correct
49 Correct 15 ms 2396 KB Output is correct
50 Correct 90 ms 11428 KB Output is correct
51 Correct 7 ms 1880 KB Output is correct
52 Correct 71 ms 8388 KB Output is correct
53 Correct 11 ms 2548 KB Output is correct
54 Correct 87 ms 9836 KB Output is correct
55 Correct 6 ms 1880 KB Output is correct
56 Correct 7 ms 1884 KB Output is correct
57 Correct 6 ms 2140 KB Output is correct
58 Correct 6 ms 2140 KB Output is correct
59 Correct 2 ms 860 KB Output is correct
60 Correct 56 ms 5416 KB Output is correct
61 Correct 4 ms 1116 KB Output is correct
62 Correct 88 ms 10096 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 1 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 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 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 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 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 1 ms 348 KB Output is correct
29 Correct 0 ms 456 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 3 ms 600 KB Output is correct
35 Correct 67 ms 6480 KB Output is correct
36 Correct 87 ms 11044 KB Output is correct
37 Correct 101 ms 11092 KB Output is correct
38 Correct 85 ms 10576 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 4 ms 1112 KB Output is correct
41 Correct 3 ms 1116 KB Output is correct
42 Correct 2 ms 984 KB Output is correct
43 Correct 5 ms 1116 KB Output is correct
44 Correct 3 ms 1192 KB Output is correct
45 Correct 2 ms 972 KB Output is correct
46 Correct 3 ms 860 KB Output is correct
47 Correct 5 ms 1116 KB Output is correct
48 Correct 4 ms 1112 KB Output is correct
49 Correct 15 ms 2396 KB Output is correct
50 Correct 90 ms 11428 KB Output is correct
51 Correct 7 ms 1880 KB Output is correct
52 Correct 71 ms 8388 KB Output is correct
53 Correct 11 ms 2548 KB Output is correct
54 Correct 87 ms 9836 KB Output is correct
55 Correct 6 ms 1880 KB Output is correct
56 Correct 7 ms 1884 KB Output is correct
57 Correct 6 ms 2140 KB Output is correct
58 Correct 6 ms 2140 KB Output is correct
59 Correct 2 ms 860 KB Output is correct
60 Correct 56 ms 5416 KB Output is correct
61 Correct 4 ms 1116 KB Output is correct
62 Correct 88 ms 10096 KB Output is correct
63 Correct 583 ms 97036 KB Output is correct
64 Correct 551 ms 97112 KB Output is correct
65 Correct 514 ms 97108 KB Output is correct
66 Correct 141 ms 26536 KB Output is correct
67 Correct 349 ms 39700 KB Output is correct
68 Correct 133 ms 26312 KB Output is correct
69 Correct 397 ms 37868 KB Output is correct
70 Correct 144 ms 26100 KB Output is correct
71 Correct 129 ms 26156 KB Output is correct
72 Correct 389 ms 38244 KB Output is correct
73 Correct 428 ms 38580 KB Output is correct
74 Correct 1236 ms 65784 KB Output is correct
75 Correct 504 ms 46008 KB Output is correct
76 Correct 789 ms 58024 KB Output is correct
77 Correct 824 ms 58324 KB Output is correct
78 Correct 205 ms 36948 KB Output is correct
79 Correct 326 ms 39536 KB Output is correct
80 Correct 227 ms 39168 KB Output is correct
81 Correct 340 ms 41668 KB Output is correct
82 Correct 950 ms 72756 KB Output is correct
83 Correct 935 ms 72700 KB Output is correct
84 Correct 809 ms 94536 KB Output is correct
85 Correct 811 ms 94672 KB Output is correct
86 Correct 185 ms 30772 KB Output is correct
87 Correct 163 ms 32272 KB Output is correct
88 Correct 413 ms 38520 KB Output is correct
89 Correct 850 ms 55968 KB Output is correct