oj.uz

Submission #712494

# Submission time Handle Problem Language Result Execution time Memory
712494 2023-03-18T21:20:06 Z danikoynov Keys (IOI21_keys) C++17
100 / 100
 1270 ms 247540 KB 
#include <bits/stdc++.h>
#include "keys.h"

using namespace std;


const int maxn = 3e5 + 10;


struct union_find
{
    vector < int > data, rnk;

    union_find(int n)
    {
        data.resize(n);
        rnk.resize(n);
        for (int i = 0; i < n; i ++)
        {
            data[i] = i;
            rnk[i] = 1;
        }
    }
    int find_leader(int v)
    {
        return (v == data[v]) ? v : (data[v] = find_leader(data[v]));
    }

    int unite(int v, int u)
    {
        v = find_leader(v);
        u = find_leader(u);
        if (v != u)
        {
            if (rnk[v] < rnk[u])
                swap(v, u);
            rnk[v] += rnk[u];
            data[u] = v;
        }
        return v;
    }
};

struct component
{
    vector < int > open;
    map < int, vector < int > > locked;
    set < int > keys;

    void add_edge(int v, int key)
    {
        if (keys.find(key) != keys.end())
            open.push_back(v);
        else
            locked[key].push_back(v);
    }

    void add_key(int key)
    {
        while(!locked[key].empty())
        {
            open.push_back(locked[key].back());
            locked[key].pop_back();
        }
        keys.insert(key);
    }
};

int n, m;
int status[maxn], toward[maxn], reach[maxn];
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c)
{
    n = r.size();
    m = u.size();
    for (int i = 0; i < n; i ++)
        reach[i] = n + 1;
    union_find dsu(n);
    vector < component > data(n);
    for (int i = 0; i < n; i ++)
    data[i].add_key(r[i]);
    for (int i = 0; i < m; i ++)
    {
        data[u[i]].add_edge(v[i], c[i]);
        data[v[i]].add_edge(u[i], c[i]);
    }

    for (int cur = 0; cur < n; cur ++)
    {
        if (status[cur] == 1)
            continue;

        vector < int > ver_list;
        int u = cur;
        while(status[u] != 1)
        {
            if (status[u] == 0)
            {
                status[u] = -1;
                ver_list.push_back(u);
            }

            if (data[u].open.empty())
            {
                vector < int > same;
                for (int v : ver_list)
                    if (dsu.find_leader(v) == u)
                    same.push_back(v);
                    same.push_back(u);
                for (int v : same)
                    reach[v] = same.size();
                break;
            }

            toward[u] = dsu.find_leader(data[u].open.back());
            data[u].open.pop_back();

            if (status[toward[u]] == -1)
            {
                int v = u;
                while(true)
                {
                    v = dsu.find_leader(toward[v]);
                    if (v == u)
                        break;

                    int r = dsu.unite(u, v);
                    int to_move = u;
                    if (r == u)
                        to_move = v;
                    u = r;
                    for (int x : data[to_move].open)
                        data[u].open.push_back(x);

                    for (int x : data[to_move].keys)
                        data[u].add_key(x);

                    for (pair < int, vector < int > > it : data[to_move].locked)
                    {
                        for (int x : it.second)
                            data[u].add_edge(x, it.first);
                    }
                }
            }
            else
            {
                u = toward[u];
            }
        }
        for (int v : ver_list)
            status[v] = 1;
    }

    int min_reach = n + 1;
    for (int i = 0; i < n; i ++)
        min_reach = min(min_reach, reach[i]);
    vector < int > ans(n, 0);
    for (int i = 0; i < n; i ++)
    {
            ans[i] = (reach[i] == min_reach);
    }
    return ans;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:105:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  105 |                 for (int v : ver_list)
      |                 ^~~
keys.cpp:108:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  108 |                     same.push_back(u);
      |                     ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 2 ms 688 KB Output is correct
36 Correct 3 ms 1236 KB Output is correct
37 Correct 3 ms 1236 KB Output is correct
38 Correct 3 ms 1364 KB Output is correct
39 Correct 3 ms 1364 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Correct 3 ms 1108 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 635 ms 82788 KB Output is correct
11 Correct 413 ms 102716 KB Output is correct
12 Correct 112 ms 28444 KB Output is correct
13 Correct 628 ms 136100 KB Output is correct
14 Correct 219 ms 103264 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 2 ms 688 KB Output is correct
36 Correct 3 ms 1236 KB Output is correct
37 Correct 3 ms 1236 KB Output is correct
38 Correct 3 ms 1364 KB Output is correct
39 Correct 3 ms 1364 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Correct 3 ms 1108 KB Output is correct
42 Correct 635 ms 82788 KB Output is correct
43 Correct 413 ms 102716 KB Output is correct
44 Correct 112 ms 28444 KB Output is correct
45 Correct 628 ms 136100 KB Output is correct
46 Correct 219 ms 103264 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 217 ms 103152 KB Output is correct
51 Correct 217 ms 102512 KB Output is correct
52 Correct 443 ms 95724 KB Output is correct
53 Correct 441 ms 95728 KB Output is correct
54 Correct 444 ms 95828 KB Output is correct
55 Correct 807 ms 99560 KB Output is correct
56 Correct 515 ms 127060 KB Output is correct
57 Correct 428 ms 122352 KB Output is correct
58 Correct 710 ms 131724 KB Output is correct
59 Correct 1225 ms 138112 KB Output is correct
60 Correct 601 ms 104564 KB Output is correct
61 Correct 1046 ms 132388 KB Output is correct
62 Correct 1134 ms 247516 KB Output is correct
63 Correct 295 ms 124092 KB Output is correct
64 Correct 4 ms 2004 KB Output is correct
65 Correct 4 ms 2128 KB Output is correct
66 Correct 1136 ms 247528 KB Output is correct
67 Correct 22 ms 10580 KB Output is correct
68 Correct 37 ms 17472 KB Output is correct
69 Correct 1253 ms 137956 KB Output is correct
70 Correct 90 ms 34320 KB Output is correct
71 Correct 230 ms 103192 KB Output is correct
72 Correct 1270 ms 138016 KB Output is correct
73 Correct 1136 ms 247540 KB Output is correct