oj.uz

Submission #559487

# Submission time Handle Problem Language Result Execution time Memory
559487 2022-05-10T03:52:25 Z hoanghq2004 Keys (IOI21_keys) C++17
100 / 100
 1326 ms 127480 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "keys.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 3e5 + 10;

int n;
int par[N], sz[N];
map <int, vector <int> > g[N];
set <int> key[N];
vector <int> to[N];

int Find(int u) {
    return (u == par[u] ? u : par[u] = Find(par[u]));
}

void Union(int u, int v) {
    if ((u = Find(u)) == (v = Find(v))) return;
    if (sz[u] < sz[v]) swap(u, v);
    par[v] = u;
    sz[u] += sz[v];
    if (key[u].size() + to[u].size() < key[v].size() + to[v].size()) swap(key[u], key[v]), swap(to[u], to[v]);
    for (auto w: to[v]) to[u].push_back(w);
    to[v].clear();
    for (auto c: key[v]) {
        if (g[u].find(c) != g[u].end()) {
            for (auto w: g[u][c]) to[u].push_back(w);
            g[u].erase(c);
        }
    }
    for (auto [c, _]: g[v]) {
        if (key[u].find(c) != key[u].end()) {
            for (auto w: g[v][c]) to[u].push_back(w);
        } else for (auto w: g[v][c]) g[u][c].push_back(w);
    }
    g[v].clear();
    key[u].insert(key[v].begin(), key[v].end());
    key[v].clear();
}

int bad[N];
int state[N];
int last[N];

void dfs(int u) {
    state[u] = 0;
    while (1) {
        u = Find(u);
        if (to[u].empty()) break;
        int v = to[u].back();
        to[u].pop_back();
        v = Find(v);
        if (u == v) continue;
        if (state[v] == -1) {
            last[v] = u;
            dfs(v);
            if (Find(u) != Find(v)) bad[u] = 1;
        } else if (state[v] == 0) {
            int w = u;
            while (1) {
                if (Find(w) == Find(v)) break;
                Union(w, v);
                w = last[w];
            }
        } else bad[u] = 1;
    }
    state[u] = 1;
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	int n = r.size();
	int m = c.size();
	auto add_edge = [&](int u, int v, int c) {
        if (r[u] == c) to[u].push_back(v);
        else g[u][c].push_back(v);
	};
	for (int i = 0; i < m; ++i) {
        add_edge(u[i], v[i], c[i]);
        add_edge(v[i], u[i], c[i]);
	}
	for (int i = 0; i < n; ++i) par[i] = i, sz[i] = 1, key[i].insert(r[i]);

	memset(state, -1, sizeof(state));
    for (int i = 0; i < n; ++i) if (state[i] == -1) dfs(i);
    for (int i = 0; i < n; ++i) if (bad[i]) bad[Find(i)] = 1;
    vector <int> flag(n, 0);
    int ans = 1e9;
    for (int i = 0; i < n; ++i)
        if (i == Find(i) && !bad[i]) ans = min(ans, sz[i]);
    for (int i = 0; i < n; ++i)
        if (!bad[Find(i)] && sz[Find(i)] == ans) flag[i] = 1;
    return flag;
}

//int main() {
//    freopen("IOI21_keys.inp", "r", stdin);
////    freopen("IOI21_keys.out", "w", stdout);
//    int n, m;
//    assert(2 == scanf("%d%d", &n, &m));
//    std::vector<int> r(n), u(m), v(m), c(m);
//    for(int i=0; i<n; i++) {
//        assert(1 == scanf("%d", &r[i]));
//    }
//    for(int i=0; i<m; i++) {
//        assert(3 == scanf("%d %d %d", &u[i], &v[i], &c[i]));
//    }
//    fclose(stdin);
//
//    std::vector<int> ans = find_reachable(r, u, v, c);
//
//    for (int i = 0; i < (int) ans.size(); ++i) {
//        if(i) putchar(' ');
//        putchar(ans[i]+'0');
//    }
//    printf("\n");
//    return 0;
//}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 36692 KB Output is correct
2 Correct 19 ms 36696 KB Output is correct
3 Correct 19 ms 36644 KB Output is correct
4 Correct 26 ms 36680 KB Output is correct
5 Correct 22 ms 36704 KB Output is correct
6 Correct 20 ms 36692 KB Output is correct
7 Correct 21 ms 36692 KB Output is correct
8 Correct 21 ms 36728 KB Output is correct
9 Correct 19 ms 36692 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 36692 KB Output is correct
2 Correct 19 ms 36696 KB Output is correct
3 Correct 19 ms 36644 KB Output is correct
4 Correct 26 ms 36680 KB Output is correct
5 Correct 22 ms 36704 KB Output is correct
6 Correct 20 ms 36692 KB Output is correct
7 Correct 21 ms 36692 KB Output is correct
8 Correct 21 ms 36728 KB Output is correct
9 Correct 19 ms 36692 KB Output is correct
10 Correct 20 ms 36724 KB Output is correct
11 Correct 20 ms 36692 KB Output is correct
12 Correct 19 ms 36692 KB Output is correct
13 Correct 20 ms 36692 KB Output is correct
14 Correct 20 ms 36620 KB Output is correct
15 Correct 20 ms 36648 KB Output is correct
16 Correct 21 ms 36684 KB Output is correct
17 Correct 19 ms 36696 KB Output is correct
18 Correct 19 ms 36692 KB Output is correct
19 Correct 20 ms 36716 KB Output is correct
20 Correct 22 ms 36824 KB Output is correct
21 Correct 20 ms 36668 KB Output is correct
22 Correct 20 ms 36692 KB Output is correct
23 Correct 20 ms 36692 KB Output is correct
24 Correct 21 ms 36692 KB Output is correct
25 Correct 20 ms 36692 KB Output is correct
26 Correct 20 ms 36696 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 36692 KB Output is correct
2 Correct 19 ms 36696 KB Output is correct
3 Correct 19 ms 36644 KB Output is correct
4 Correct 26 ms 36680 KB Output is correct
5 Correct 22 ms 36704 KB Output is correct
6 Correct 20 ms 36692 KB Output is correct
7 Correct 21 ms 36692 KB Output is correct
8 Correct 21 ms 36728 KB Output is correct
9 Correct 19 ms 36692 KB Output is correct
10 Correct 20 ms 36724 KB Output is correct
11 Correct 20 ms 36692 KB Output is correct
12 Correct 19 ms 36692 KB Output is correct
13 Correct 20 ms 36692 KB Output is correct
14 Correct 20 ms 36620 KB Output is correct
15 Correct 20 ms 36648 KB Output is correct
16 Correct 21 ms 36684 KB Output is correct
17 Correct 19 ms 36696 KB Output is correct
18 Correct 19 ms 36692 KB Output is correct
19 Correct 20 ms 36716 KB Output is correct
20 Correct 22 ms 36824 KB Output is correct
21 Correct 20 ms 36668 KB Output is correct
22 Correct 20 ms 36692 KB Output is correct
23 Correct 20 ms 36692 KB Output is correct
24 Correct 21 ms 36692 KB Output is correct
25 Correct 20 ms 36692 KB Output is correct
26 Correct 20 ms 36696 KB Output is correct
27 Correct 26 ms 37288 KB Output is correct
28 Correct 19 ms 37204 KB Output is correct
29 Correct 21 ms 37212 KB Output is correct
30 Correct 20 ms 36940 KB Output is correct
31 Correct 21 ms 36936 KB Output is correct
32 Correct 21 ms 36692 KB Output is correct
33 Correct 20 ms 36964 KB Output is correct
34 Correct 20 ms 36948 KB Output is correct
35 Correct 21 ms 36948 KB Output is correct
36 Correct 22 ms 37296 KB Output is correct
37 Correct 20 ms 37260 KB Output is correct
38 Correct 27 ms 37392 KB Output is correct
39 Correct 24 ms 37420 KB Output is correct
40 Correct 20 ms 36952 KB Output is correct
41 Correct 22 ms 37204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 36692 KB Output is correct
2 Correct 19 ms 36696 KB Output is correct
3 Correct 19 ms 36644 KB Output is correct
4 Correct 26 ms 36680 KB Output is correct
5 Correct 22 ms 36704 KB Output is correct
6 Correct 20 ms 36692 KB Output is correct
7 Correct 21 ms 36692 KB Output is correct
8 Correct 21 ms 36728 KB Output is correct
9 Correct 19 ms 36692 KB Output is correct
10 Correct 543 ms 104984 KB Output is correct
11 Correct 411 ms 96388 KB Output is correct
12 Correct 97 ms 51476 KB Output is correct
13 Correct 485 ms 107580 KB Output is correct
14 Correct 215 ms 108952 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 36692 KB Output is correct
2 Correct 19 ms 36696 KB Output is correct
3 Correct 19 ms 36644 KB Output is correct
4 Correct 26 ms 36680 KB Output is correct
5 Correct 22 ms 36704 KB Output is correct
6 Correct 20 ms 36692 KB Output is correct
7 Correct 21 ms 36692 KB Output is correct
8 Correct 21 ms 36728 KB Output is correct
9 Correct 19 ms 36692 KB Output is correct
10 Correct 20 ms 36724 KB Output is correct
11 Correct 20 ms 36692 KB Output is correct
12 Correct 19 ms 36692 KB Output is correct
13 Correct 20 ms 36692 KB Output is correct
14 Correct 20 ms 36620 KB Output is correct
15 Correct 20 ms 36648 KB Output is correct
16 Correct 21 ms 36684 KB Output is correct
17 Correct 19 ms 36696 KB Output is correct
18 Correct 19 ms 36692 KB Output is correct
19 Correct 20 ms 36716 KB Output is correct
20 Correct 22 ms 36824 KB Output is correct
21 Correct 20 ms 36668 KB Output is correct
22 Correct 20 ms 36692 KB Output is correct
23 Correct 20 ms 36692 KB Output is correct
24 Correct 21 ms 36692 KB Output is correct
25 Correct 20 ms 36692 KB Output is correct
26 Correct 20 ms 36696 KB Output is correct
27 Correct 26 ms 37288 KB Output is correct
28 Correct 19 ms 37204 KB Output is correct
29 Correct 21 ms 37212 KB Output is correct
30 Correct 20 ms 36940 KB Output is correct
31 Correct 21 ms 36936 KB Output is correct
32 Correct 21 ms 36692 KB Output is correct
33 Correct 20 ms 36964 KB Output is correct
34 Correct 20 ms 36948 KB Output is correct
35 Correct 21 ms 36948 KB Output is correct
36 Correct 22 ms 37296 KB Output is correct
37 Correct 20 ms 37260 KB Output is correct
38 Correct 27 ms 37392 KB Output is correct
39 Correct 24 ms 37420 KB Output is correct
40 Correct 20 ms 36952 KB Output is correct
41 Correct 22 ms 37204 KB Output is correct
42 Correct 543 ms 104984 KB Output is correct
43 Correct 411 ms 96388 KB Output is correct
44 Correct 97 ms 51476 KB Output is correct
45 Correct 485 ms 107580 KB Output is correct
46 Correct 215 ms 108952 KB Output is correct
47 Correct 22 ms 36684 KB Output is correct
48 Correct 21 ms 36616 KB Output is correct
49 Correct 19 ms 36640 KB Output is correct
50 Correct 195 ms 106392 KB Output is correct
51 Correct 218 ms 109112 KB Output is correct
52 Correct 268 ms 97264 KB Output is correct
53 Correct 281 ms 97324 KB Output is correct
54 Correct 273 ms 97368 KB Output is correct
55 Correct 695 ms 117372 KB Output is correct
56 Correct 347 ms 115840 KB Output is correct
57 Correct 284 ms 105876 KB Output is correct
58 Correct 517 ms 115020 KB Output is correct
59 Correct 1246 ms 126024 KB Output is correct
60 Correct 845 ms 127084 KB Output is correct
61 Correct 799 ms 127480 KB Output is correct
62 Correct 667 ms 106116 KB Output is correct
63 Correct 289 ms 104832 KB Output is correct
64 Correct 26 ms 37848 KB Output is correct
65 Correct 23 ms 37836 KB Output is correct
66 Correct 641 ms 106084 KB Output is correct
67 Correct 39 ms 43968 KB Output is correct
68 Correct 50 ms 48852 KB Output is correct
69 Correct 1326 ms 126000 KB Output is correct
70 Correct 93 ms 61016 KB Output is correct
71 Correct 208 ms 109692 KB Output is correct
72 Correct 1290 ms 125948 KB Output is correct
73 Correct 645 ms 106032 KB Output is correct