oj.uz

Submission #951608

# Submission time Handle Problem Language Result Execution time Memory
951608 2024-03-22T07:27:36 Z Boycl07 Keys (IOI21_keys) C++17
100 / 100
 577 ms 57456 KB 
#include "keys.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define rep(i, n) for(int i = 1; i <= n; ++i)
#define forn(i, l, r) for(int i = l; i <= r; ++i)
#define ford(i, r, l) for(int i = r; i >= l; --i)
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task ""
#define sz(a) int(a.size())
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)

template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }

inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}


struct DSU
{
    vector<int> par;
    vector<int> sz;

    void init(int n)
    {
        par.assign(n + 1, 0);
        sz.assign(n + 1, 0);
        FOR(i, n) par[i] = i, sz[i] = 1;
    }

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

vector<int> find_reachable(vector<int> r, vector<int> u_, vector<int> v_, vector<int> c_)
{
    int n = sz(r), m = sz(c_);
    DSU dsu;
    dsu.init(n);
    vector<bool> ok(n, false);
    vector<vector<pii>> g(n);
    for(int i = 0; i < m; ++i)
    {
        int u = u_[i], v = v_[i], c = c_[i];
        g[u].pb({v, c});
        g[v].pb({u, c});
    }
    int Min = 1e9 + 1;
    vector<int> res;
    while(true)
    {
        bool flag = 0;

        vector<vector<int>> pot(n);
        vector<bool> vis(n, false);
        vector<bool> keys(n, false);
        vector<int> cur_keys;

        function<void(int)> bfs = [&](int s)
        {
            for(int x : cur_keys) keys[x] = 0, pot[x].clear();
            cur_keys.clear();
            queue<int> q;
            q.push(s);
            vis[s] = 1;
            vector<int> cur;
            int cnts = 0;
            while(sz(q))
            {
                ++cnts;
                int u = q.front(); q.pop();
                cur.pb(u);
                if(!keys[r[u]])
                {
                    keys[r[u]] = 1;
                    cur_keys.pb(r[u]);
                    for(int v : pot[r[u]])
                    {
                        int c = dsu.find_set(v);
                        if(c != s)
                        {
                            dsu.par[s] = c;
                            vis[c] = 1;
                            return;
                        }
                        if(vis[v]) continue;
                        vis[v] = 1;
                        q.push(v);
                    }
                    pot[r[u]].clear();
                }
                for(pii e : g[u])
                {
                    int v = e.fi, c = e.se;
                    if(!keys[c])
                    {
                        if(pot[c].empty()) cur_keys.pb(c);
                        pot[c].pb(v);
                    }
                    else
                    {
                        int c_ = dsu.find_set(v);
                        if(c_ != s)
                        {
                            dsu.par[s] = c_;
                            vis[c_] = 1;
                            return;
                        }
                        if(vis[v]) continue;
                        vis[v] = 1;
                        q.push(v);
                    }
                }
            }
            ok[s] = 1;
                if(minimize(Min, sz(cur))) res = move(cur);
                else if(Min == sz(cur)) for(int x : cur) res.pb(x);
        };

        FOR(i, n) if(dsu.find_set(i) == i && !ok[i] && !vis[i])
            bfs(i), flag = 1;
        if(!flag) break;
    }

    vector<int> out(n, 0);
    for(int x : res) out[x] = 1;


	return out;
}

//int main() {
//    int n, m;
//    freopen("keys.inp", "r", stdin);
//    freopen("keys.out", "w", stdout);
//    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 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 448 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 2 ms 600 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 604 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 159 ms 28728 KB Output is correct
11 Correct 171 ms 46960 KB Output is correct
12 Correct 31 ms 8124 KB Output is correct
13 Correct 196 ms 41360 KB Output is correct
14 Correct 162 ms 44552 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 448 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 2 ms 600 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 159 ms 28728 KB Output is correct
43 Correct 171 ms 46960 KB Output is correct
44 Correct 31 ms 8124 KB Output is correct
45 Correct 196 ms 41360 KB Output is correct
46 Correct 162 ms 44552 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 126 ms 45160 KB Output is correct
51 Correct 143 ms 47432 KB Output is correct
52 Correct 154 ms 37340 KB Output is correct
53 Correct 169 ms 34536 KB Output is correct
54 Correct 164 ms 34540 KB Output is correct
55 Correct 205 ms 30016 KB Output is correct
56 Correct 238 ms 47996 KB Output is correct
57 Correct 197 ms 50272 KB Output is correct
58 Correct 209 ms 57456 KB Output is correct
59 Correct 268 ms 42772 KB Output is correct
60 Correct 206 ms 37696 KB Output is correct
61 Correct 236 ms 40488 KB Output is correct
62 Correct 487 ms 35724 KB Output is correct
63 Correct 162 ms 35660 KB Output is correct
64 Correct 3 ms 1116 KB Output is correct
65 Correct 3 ms 956 KB Output is correct
66 Correct 477 ms 36024 KB Output is correct
67 Correct 17 ms 4760 KB Output is correct
68 Correct 25 ms 7612 KB Output is correct
69 Correct 301 ms 42776 KB Output is correct
70 Correct 52 ms 14748 KB Output is correct
71 Correct 158 ms 44796 KB Output is correct
72 Correct 320 ms 42736 KB Output is correct
73 Correct 577 ms 37984 KB Output is correct