oj.uz

Submission #873931

# Submission time Handle Problem Language Result Execution time Memory
873931 2023-11-16T02:52:27 Z noiaint Marshmallow Molecules (CCO19_day2problem2) C++17
25 / 25
 129 ms 53688 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, m;
set<int> adj[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        if (u > v) swap(u, v);
        adj[u].insert(v);
    }

    long long ans = 0;

    for (int u = 1; u <= n; ++u) if (adj[u].size()) {        
        ans += adj[u].size();

        int v = *adj[u].begin();
        adj[u].erase(adj[u].begin());
        if (adj[u].size() > adj[v].size()) swap(adj[u], adj[v]);
        for (int x : adj[u]) adj[v].insert(x);

        adj[u].clear();

        /*
        int node a, find b such that a > b -> adj[a].begin()
        merge a and b
        */
    }

    cout << ans << '\n';

    return 0;
}

/*

*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 47196 KB Output is correct
2 Correct 10 ms 47428 KB Output is correct
3 Correct 11 ms 47452 KB Output is correct
4 Correct 10 ms 47536 KB Output is correct
5 Correct 10 ms 47452 KB Output is correct
6 Correct 11 ms 47452 KB Output is correct
7 Correct 10 ms 47452 KB Output is correct
8 Correct 11 ms 47452 KB Output is correct
9 Correct 10 ms 47196 KB Output is correct
10 Correct 10 ms 47452 KB Output is correct
11 Correct 11 ms 47316 KB Output is correct
12 Correct 11 ms 47548 KB Output is correct
13 Correct 11 ms 47588 KB Output is correct
14 Correct 10 ms 47448 KB Output is correct
15 Correct 10 ms 47196 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 47196 KB Output is correct
2 Correct 10 ms 47428 KB Output is correct
3 Correct 11 ms 47452 KB Output is correct
4 Correct 10 ms 47536 KB Output is correct
5 Correct 10 ms 47452 KB Output is correct
6 Correct 11 ms 47452 KB Output is correct
7 Correct 10 ms 47452 KB Output is correct
8 Correct 11 ms 47452 KB Output is correct
9 Correct 10 ms 47196 KB Output is correct
10 Correct 10 ms 47452 KB Output is correct
11 Correct 11 ms 47316 KB Output is correct
12 Correct 11 ms 47548 KB Output is correct
13 Correct 11 ms 47588 KB Output is correct
14 Correct 10 ms 47448 KB Output is correct
15 Correct 10 ms 47196 KB Output is correct
16 Correct 57 ms 53332 KB Output is correct
17 Correct 45 ms 52828 KB Output is correct
18 Correct 44 ms 52828 KB Output is correct
19 Correct 43 ms 53016 KB Output is correct
20 Correct 55 ms 52820 KB Output is correct
21 Correct 12 ms 47452 KB Output is correct
22 Correct 45 ms 53052 KB Output is correct
23 Correct 45 ms 52828 KB Output is correct
24 Correct 45 ms 52828 KB Output is correct
25 Correct 43 ms 52828 KB Output is correct
26 Correct 44 ms 53012 KB Output is correct
27 Correct 11 ms 47452 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 53124 KB Output is correct
2 Correct 76 ms 53092 KB Output is correct
3 Correct 53 ms 53076 KB Output is correct
4 Correct 58 ms 53116 KB Output is correct
5 Correct 56 ms 53220 KB Output is correct
6 Correct 56 ms 53216 KB Output is correct
7 Correct 57 ms 53076 KB Output is correct
8 Correct 55 ms 53228 KB Output is correct
9 Correct 53 ms 53240 KB Output is correct
10 Correct 58 ms 53116 KB Output is correct
11 Correct 63 ms 53332 KB Output is correct
12 Correct 53 ms 53076 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 47196 KB Output is correct
2 Correct 10 ms 47428 KB Output is correct
3 Correct 11 ms 47452 KB Output is correct
4 Correct 10 ms 47536 KB Output is correct
5 Correct 10 ms 47452 KB Output is correct
6 Correct 11 ms 47452 KB Output is correct
7 Correct 10 ms 47452 KB Output is correct
8 Correct 11 ms 47452 KB Output is correct
9 Correct 10 ms 47196 KB Output is correct
10 Correct 10 ms 47452 KB Output is correct
11 Correct 11 ms 47316 KB Output is correct
12 Correct 11 ms 47548 KB Output is correct
13 Correct 11 ms 47588 KB Output is correct
14 Correct 10 ms 47448 KB Output is correct
15 Correct 10 ms 47196 KB Output is correct
16 Correct 57 ms 53332 KB Output is correct
17 Correct 45 ms 52828 KB Output is correct
18 Correct 44 ms 52828 KB Output is correct
19 Correct 43 ms 53016 KB Output is correct
20 Correct 55 ms 52820 KB Output is correct
21 Correct 12 ms 47452 KB Output is correct
22 Correct 45 ms 53052 KB Output is correct
23 Correct 45 ms 52828 KB Output is correct
24 Correct 45 ms 52828 KB Output is correct
25 Correct 43 ms 52828 KB Output is correct
26 Correct 44 ms 53012 KB Output is correct
27 Correct 11 ms 47452 KB Output is correct
28 Correct 55 ms 53124 KB Output is correct
29 Correct 76 ms 53092 KB Output is correct
30 Correct 53 ms 53076 KB Output is correct
31 Correct 58 ms 53116 KB Output is correct
32 Correct 56 ms 53220 KB Output is correct
33 Correct 56 ms 53216 KB Output is correct
34 Correct 57 ms 53076 KB Output is correct
35 Correct 55 ms 53228 KB Output is correct
36 Correct 53 ms 53240 KB Output is correct
37 Correct 58 ms 53116 KB Output is correct
38 Correct 63 ms 53332 KB Output is correct
39 Correct 53 ms 53076 KB Output is correct
40 Correct 129 ms 52820 KB Output is correct
41 Correct 69 ms 53076 KB Output is correct
42 Correct 72 ms 53332 KB Output is correct
43 Correct 72 ms 53064 KB Output is correct
44 Correct 65 ms 53256 KB Output is correct
45 Correct 64 ms 53264 KB Output is correct
46 Correct 45 ms 53200 KB Output is correct
47 Correct 51 ms 53196 KB Output is correct
48 Correct 43 ms 53020 KB Output is correct
49 Correct 45 ms 53084 KB Output is correct
50 Correct 56 ms 53112 KB Output is correct
51 Correct 56 ms 53012 KB Output is correct
52 Correct 53 ms 53060 KB Output is correct
53 Correct 51 ms 53076 KB Output is correct
54 Correct 57 ms 53168 KB Output is correct
55 Correct 65 ms 53044 KB Output is correct
56 Correct 54 ms 53688 KB Output is correct
57 Correct 47 ms 52796 KB Output is correct