oj.uz

Submission #833647

# Submission time Handle Problem Language Result Execution time Memory
833647 2023-08-22T07:25:14 Z maomao90 Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 97 ms 48872 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 300005;

int n, m;
ll ans;

struct thing {
    int v, u;
    bool operator< (const thing &o) const {
        return v < o.v;
    }
};

set<thing> adj[MAXN];
set<thing> iadj[MAXN];
set<int> adjp[MAXN];
int p[MAXN], sz[MAXN];
void init() {
    REP (i, 1, n + 1) {
        p[i] = i;
        sz[i] = 1;
    }
}
int findp(int i) {
    if (p[i] == i) {
        return i;
    }
    return p[i] = findp(p[i]);
}
bool join(int a, int b) {
    int pa = findp(a), pb = findp(b);
    if (pa == pb) {
        return 1;
    }
    if (sz[pa] < sz[pb]) {
        swap(pa, pb);
    }
    vii todo;
    ans -= (ll) SZ(adj[pa]) * sz[pa];
    ans -= (ll) SZ(adj[pb]) * sz[pb];
    adjp[pa].erase(pb);
    adjp[pb].erase(pa);
    for (auto [v, u] : adj[pb]) {
        if (findp(v) == pa) {
            iadj[pa].erase({u, v});
        } else {
            adj[pa].insert({v, u});
            adjp[pa].insert(findp(v));
            if (adjp[findp(v)].count(pa)) {
                todo.pb({findp(v), pa});
            }
        }
    }
    for (auto [v, u] : iadj[pb]) {
        if (findp(v) == pa) {
            adj[pa].erase({u, v});
        } else {
            iadj[pa].insert({v, u});
            adjp[findp(v)].erase(pb);
            adjp[findp(v)].insert(pa);
            if (adjp[pa].count(findp(v))) {
                todo.pb({findp(v), pa});
            }
        }
    }
    ans -= (ll) sz[pa] * (sz[pa] - 1);
    ans -= (ll) sz[pb] * (sz[pb] - 1);
    sz[pa] += sz[pb];
    ans += (ll) sz[pa] * (sz[pa] - 1);
    ans += (ll) SZ(adj[pa]) * sz[pa];
    p[pb] = pa;
    for (auto [x, y] : todo) {
        join(x, y);
    }
    return 1;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    init();
    REP (i, 0, m) {
        int a, b; cin >> a >> b;
        if (findp(a) != findp(b)) {
            bool gd = adj[findp(b)].insert({a, b}).SE;
            if (gd) {
                ans += sz[findp(b)];
            }
            iadj[findp(a)].insert({b, a});
            adjp[findp(b)].insert(findp(a));
            if (adjp[findp(a)].count(findp(b))) {
                cerr << "JOIN " << a << ' ' << b << '\n';
                join(a, b);
            }
        }
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 42580 KB Output is correct
2 Correct 19 ms 42580 KB Output is correct
3 Correct 19 ms 42580 KB Output is correct
4 Correct 19 ms 42568 KB Output is correct
5 Correct 20 ms 42580 KB Output is correct
6 Correct 20 ms 42580 KB Output is correct
7 Correct 20 ms 42580 KB Output is correct
8 Correct 20 ms 42540 KB Output is correct
9 Correct 20 ms 42580 KB Output is correct
10 Correct 19 ms 42544 KB Output is correct
11 Correct 19 ms 42608 KB Output is correct
12 Correct 19 ms 42580 KB Output is correct
13 Correct 21 ms 42480 KB Output is correct
14 Correct 32 ms 42748 KB Output is correct
15 Correct 20 ms 42580 KB Output is correct
16 Correct 20 ms 42580 KB Output is correct
17 Correct 19 ms 42580 KB Output is correct
18 Correct 22 ms 42580 KB Output is correct
19 Correct 22 ms 42644 KB Output is correct
20 Correct 20 ms 42600 KB Output is correct
21 Correct 21 ms 42580 KB Output is correct
22 Correct 21 ms 42580 KB Output is correct
23 Correct 21 ms 42580 KB Output is correct
24 Correct 21 ms 42580 KB Output is correct
25 Correct 20 ms 42580 KB Output is correct
26 Correct 27 ms 42544 KB Output is correct
27 Correct 22 ms 42552 KB Output is correct
28 Correct 21 ms 42580 KB Output is correct
29 Correct 20 ms 42580 KB Output is correct
30 Correct 20 ms 42580 KB Output is correct
31 Correct 21 ms 42580 KB Output is correct
32 Correct 21 ms 42580 KB Output is correct
33 Correct 21 ms 42580 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 42580 KB Output is correct
2 Correct 19 ms 42580 KB Output is correct
3 Correct 19 ms 42580 KB Output is correct
4 Correct 19 ms 42568 KB Output is correct
5 Correct 20 ms 42580 KB Output is correct
6 Correct 20 ms 42580 KB Output is correct
7 Correct 20 ms 42580 KB Output is correct
8 Correct 20 ms 42540 KB Output is correct
9 Correct 20 ms 42580 KB Output is correct
10 Correct 19 ms 42544 KB Output is correct
11 Correct 19 ms 42608 KB Output is correct
12 Correct 19 ms 42580 KB Output is correct
13 Correct 21 ms 42480 KB Output is correct
14 Correct 32 ms 42748 KB Output is correct
15 Correct 20 ms 42580 KB Output is correct
16 Correct 20 ms 42580 KB Output is correct
17 Correct 19 ms 42580 KB Output is correct
18 Correct 22 ms 42580 KB Output is correct
19 Correct 22 ms 42644 KB Output is correct
20 Correct 20 ms 42600 KB Output is correct
21 Correct 21 ms 42580 KB Output is correct
22 Correct 21 ms 42580 KB Output is correct
23 Correct 21 ms 42580 KB Output is correct
24 Correct 21 ms 42580 KB Output is correct
25 Correct 20 ms 42580 KB Output is correct
26 Correct 27 ms 42544 KB Output is correct
27 Correct 22 ms 42552 KB Output is correct
28 Correct 21 ms 42580 KB Output is correct
29 Correct 20 ms 42580 KB Output is correct
30 Correct 20 ms 42580 KB Output is correct
31 Correct 21 ms 42580 KB Output is correct
32 Correct 21 ms 42580 KB Output is correct
33 Correct 21 ms 42580 KB Output is correct
34 Correct 22 ms 42708 KB Output is correct
35 Correct 83 ms 46284 KB Output is correct
36 Incorrect 97 ms 48872 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 42580 KB Output is correct
2 Correct 19 ms 42580 KB Output is correct
3 Correct 19 ms 42580 KB Output is correct
4 Correct 19 ms 42568 KB Output is correct
5 Correct 20 ms 42580 KB Output is correct
6 Correct 20 ms 42580 KB Output is correct
7 Correct 20 ms 42580 KB Output is correct
8 Correct 20 ms 42540 KB Output is correct
9 Correct 20 ms 42580 KB Output is correct
10 Correct 19 ms 42544 KB Output is correct
11 Correct 19 ms 42608 KB Output is correct
12 Correct 19 ms 42580 KB Output is correct
13 Correct 21 ms 42480 KB Output is correct
14 Correct 32 ms 42748 KB Output is correct
15 Correct 20 ms 42580 KB Output is correct
16 Correct 20 ms 42580 KB Output is correct
17 Correct 19 ms 42580 KB Output is correct
18 Correct 22 ms 42580 KB Output is correct
19 Correct 22 ms 42644 KB Output is correct
20 Correct 20 ms 42600 KB Output is correct
21 Correct 21 ms 42580 KB Output is correct
22 Correct 21 ms 42580 KB Output is correct
23 Correct 21 ms 42580 KB Output is correct
24 Correct 21 ms 42580 KB Output is correct
25 Correct 20 ms 42580 KB Output is correct
26 Correct 27 ms 42544 KB Output is correct
27 Correct 22 ms 42552 KB Output is correct
28 Correct 21 ms 42580 KB Output is correct
29 Correct 20 ms 42580 KB Output is correct
30 Correct 20 ms 42580 KB Output is correct
31 Correct 21 ms 42580 KB Output is correct
32 Correct 21 ms 42580 KB Output is correct
33 Correct 21 ms 42580 KB Output is correct
34 Correct 22 ms 42708 KB Output is correct
35 Correct 83 ms 46284 KB Output is correct
36 Incorrect 97 ms 48872 KB Output isn't correct
37 Halted 0 ms 0 KB -