oj.uz

Submission #930287

# Submission time Handle Problem Language Result Execution time Memory
930287 2024-02-19T09:18:59 Z Kanon Keys (IOI21_keys) C++17
100 / 100
 1078 ms 129084 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 (key[u].size() + to[u].size() < key[v].size() + to[v].size()) {
      swap(key[u], key[v]);
      swap(to[u], to[v]); 
      swap(g[u], g[v]);
    } 
    par[v] = u;
    sz[u] += sz[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(v, w);
                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 (i == Find(i)) assert(state[i] == 1);
      else assert(state[i] == 0);
    }
    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 9 ms 39260 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39260 KB Output is correct
4 Correct 9 ms 39260 KB Output is correct
5 Correct 9 ms 39256 KB Output is correct
6 Correct 9 ms 39260 KB Output is correct
7 Correct 9 ms 39260 KB Output is correct
8 Correct 10 ms 39400 KB Output is correct
9 Correct 9 ms 39256 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39260 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39260 KB Output is correct
4 Correct 9 ms 39260 KB Output is correct
5 Correct 9 ms 39256 KB Output is correct
6 Correct 9 ms 39260 KB Output is correct
7 Correct 9 ms 39260 KB Output is correct
8 Correct 10 ms 39400 KB Output is correct
9 Correct 9 ms 39256 KB Output is correct
10 Correct 10 ms 39260 KB Output is correct
11 Correct 10 ms 39260 KB Output is correct
12 Correct 9 ms 39256 KB Output is correct
13 Correct 9 ms 39260 KB Output is correct
14 Correct 10 ms 39372 KB Output is correct
15 Correct 11 ms 39428 KB Output is correct
16 Correct 9 ms 39260 KB Output is correct
17 Correct 9 ms 39260 KB Output is correct
18 Correct 10 ms 39460 KB Output is correct
19 Correct 9 ms 39260 KB Output is correct
20 Correct 9 ms 39424 KB Output is correct
21 Correct 9 ms 39460 KB Output is correct
22 Correct 10 ms 39260 KB Output is correct
23 Correct 9 ms 39348 KB Output is correct
24 Correct 10 ms 39260 KB Output is correct
25 Correct 9 ms 39392 KB Output is correct
26 Correct 9 ms 39260 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39260 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39260 KB Output is correct
4 Correct 9 ms 39260 KB Output is correct
5 Correct 9 ms 39256 KB Output is correct
6 Correct 9 ms 39260 KB Output is correct
7 Correct 9 ms 39260 KB Output is correct
8 Correct 10 ms 39400 KB Output is correct
9 Correct 9 ms 39256 KB Output is correct
10 Correct 10 ms 39260 KB Output is correct
11 Correct 10 ms 39260 KB Output is correct
12 Correct 9 ms 39256 KB Output is correct
13 Correct 9 ms 39260 KB Output is correct
14 Correct 10 ms 39372 KB Output is correct
15 Correct 11 ms 39428 KB Output is correct
16 Correct 9 ms 39260 KB Output is correct
17 Correct 9 ms 39260 KB Output is correct
18 Correct 10 ms 39460 KB Output is correct
19 Correct 9 ms 39260 KB Output is correct
20 Correct 9 ms 39424 KB Output is correct
21 Correct 9 ms 39460 KB Output is correct
22 Correct 10 ms 39260 KB Output is correct
23 Correct 9 ms 39348 KB Output is correct
24 Correct 10 ms 39260 KB Output is correct
25 Correct 9 ms 39392 KB Output is correct
26 Correct 9 ms 39260 KB Output is correct
27 Correct 11 ms 39924 KB Output is correct
28 Correct 10 ms 39772 KB Output is correct
29 Correct 11 ms 39768 KB Output is correct
30 Correct 11 ms 39516 KB Output is correct
31 Correct 9 ms 39516 KB Output is correct
32 Correct 11 ms 39772 KB Output is correct
33 Correct 11 ms 39516 KB Output is correct
34 Correct 11 ms 39512 KB Output is correct
35 Correct 11 ms 39512 KB Output is correct
36 Correct 11 ms 40028 KB Output is correct
37 Correct 11 ms 39948 KB Output is correct
38 Correct 11 ms 40028 KB Output is correct
39 Correct 12 ms 40028 KB Output is correct
40 Correct 12 ms 39516 KB Output is correct
41 Correct 11 ms 39772 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39260 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39260 KB Output is correct
4 Correct 9 ms 39260 KB Output is correct
5 Correct 9 ms 39256 KB Output is correct
6 Correct 9 ms 39260 KB Output is correct
7 Correct 9 ms 39260 KB Output is correct
8 Correct 10 ms 39400 KB Output is correct
9 Correct 9 ms 39256 KB Output is correct
10 Correct 553 ms 110688 KB Output is correct
11 Correct 333 ms 100044 KB Output is correct
12 Correct 70 ms 53804 KB Output is correct
13 Correct 463 ms 107852 KB Output is correct
14 Correct 166 ms 110148 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39260 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39260 KB Output is correct
4 Correct 9 ms 39260 KB Output is correct
5 Correct 9 ms 39256 KB Output is correct
6 Correct 9 ms 39260 KB Output is correct
7 Correct 9 ms 39260 KB Output is correct
8 Correct 10 ms 39400 KB Output is correct
9 Correct 9 ms 39256 KB Output is correct
10 Correct 10 ms 39260 KB Output is correct
11 Correct 10 ms 39260 KB Output is correct
12 Correct 9 ms 39256 KB Output is correct
13 Correct 9 ms 39260 KB Output is correct
14 Correct 10 ms 39372 KB Output is correct
15 Correct 11 ms 39428 KB Output is correct
16 Correct 9 ms 39260 KB Output is correct
17 Correct 9 ms 39260 KB Output is correct
18 Correct 10 ms 39460 KB Output is correct
19 Correct 9 ms 39260 KB Output is correct
20 Correct 9 ms 39424 KB Output is correct
21 Correct 9 ms 39460 KB Output is correct
22 Correct 10 ms 39260 KB Output is correct
23 Correct 9 ms 39348 KB Output is correct
24 Correct 10 ms 39260 KB Output is correct
25 Correct 9 ms 39392 KB Output is correct
26 Correct 9 ms 39260 KB Output is correct
27 Correct 11 ms 39924 KB Output is correct
28 Correct 10 ms 39772 KB Output is correct
29 Correct 11 ms 39768 KB Output is correct
30 Correct 11 ms 39516 KB Output is correct
31 Correct 9 ms 39516 KB Output is correct
32 Correct 11 ms 39772 KB Output is correct
33 Correct 11 ms 39516 KB Output is correct
34 Correct 11 ms 39512 KB Output is correct
35 Correct 11 ms 39512 KB Output is correct
36 Correct 11 ms 40028 KB Output is correct
37 Correct 11 ms 39948 KB Output is correct
38 Correct 11 ms 40028 KB Output is correct
39 Correct 12 ms 40028 KB Output is correct
40 Correct 12 ms 39516 KB Output is correct
41 Correct 11 ms 39772 KB Output is correct
42 Correct 553 ms 110688 KB Output is correct
43 Correct 333 ms 100044 KB Output is correct
44 Correct 70 ms 53804 KB Output is correct
45 Correct 463 ms 107852 KB Output is correct
46 Correct 166 ms 110148 KB Output is correct
47 Correct 9 ms 39440 KB Output is correct
48 Correct 9 ms 39260 KB Output is correct
49 Correct 9 ms 39256 KB Output is correct
50 Correct 158 ms 107612 KB Output is correct
51 Correct 167 ms 110284 KB Output is correct
52 Correct 235 ms 98104 KB Output is correct
53 Correct 243 ms 98112 KB Output is correct
54 Correct 222 ms 98040 KB Output is correct
55 Correct 628 ms 119460 KB Output is correct
56 Correct 305 ms 115796 KB Output is correct
57 Correct 223 ms 108012 KB Output is correct
58 Correct 444 ms 116116 KB Output is correct
59 Correct 1065 ms 127012 KB Output is correct
60 Correct 710 ms 129044 KB Output is correct
61 Correct 740 ms 129084 KB Output is correct
62 Correct 763 ms 124236 KB Output is correct
63 Correct 215 ms 106480 KB Output is correct
64 Correct 11 ms 40536 KB Output is correct
65 Correct 12 ms 40536 KB Output is correct
66 Correct 735 ms 124328 KB Output is correct
67 Correct 27 ms 46380 KB Output is correct
68 Correct 35 ms 51332 KB Output is correct
69 Correct 1048 ms 127060 KB Output is correct
70 Correct 63 ms 63000 KB Output is correct
71 Correct 164 ms 110788 KB Output is correct
72 Correct 1078 ms 126780 KB Output is correct
73 Correct 727 ms 123748 KB Output is correct