oj.uz

답안 #796442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796442 2023-07-28T11:45:39 Z caganyanmaz 열쇠 (IOI21_keys) C++17
100 / 100
 844 ms 56440 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

constexpr static int SIZE = 300000;
constexpr static int MX = 1e6;
vector<array<int, 2>> g[SIZE];
vector<int> pending_nodes[SIZE];
bitset<SIZE> processed;
int visited[SIZE];
int keys[SIZE];
vector<int> pending_keys;
int counts[SIZE];
vector<int> visited_list;
vector<int> r;

int min_count = MX;

int bfs(int node)
{
        queue<int> q;
        q.push(node);
        int counter = 0;
        while (q.size())
        {
                int j = q.front();
                q.pop();
                counter++;
                visited[j] = node;
                visited_list.pb(j);
                if (processed[j] || counter > min_count)
                        return MX;
                if (keys[r[j]] != node)
                {
                        keys[r[j]] = node;
                        for (int c : pending_nodes[r[j]])
                        {
                                if (visited[c] != node)
                                {
                                        visited[c] = node;
                                        q.push(c);
                                }
                        }
                }
                for (auto [c, k] : g[j])
                {
                        if (visited[c] == node)
                                continue;
                        if (keys[k] != node)
                        {
                                if (pending_nodes[k].empty())
                                        pending_keys.pb(k);
                                pending_nodes[k].pb(c);
                        }
                        else
                        {
                                visited[c] = node;
                                q.push(c);
                        }
                }
        }
        return counter;
}

void process(int node)
{
        int res = bfs(node);
        processed[node] = true;
        for (int i : pending_keys)
                pending_nodes[i].clear();
        pending_keys.clear();
        min_count = min(res, min_count);
        for (int i : visited_list)
                counts[i] = min(counts[i], res);
        visited_list.clear();
}

vector<int> find_reachable(vector<int> rr, vector<int> u, vector<int> v, vector<int> c)
{
        r = rr;
        int n = r.size(), m = u.size();
        for (int i = 0; i < m; i++)
        {
                g[v[i]].pb({u[i], c[i]});
                g[u[i]].pb({v[i], c[i]});
        }
        for (int i = 0; i < n; i++)
        {
                visited[i] = -1;
                keys[i] = -1;
                counts[i] = MX;
        }
        vector<int> ordering(2*m);
        for (int i = 0; i < m; i++)
        {
                ordering[i*2] = u[i];
                ordering[i*2+1] = v[i];
        }
        shuffle(ordering.begin(), ordering.end(), default_random_engine(42));
        for (int i : ordering)
                if (!processed[i])
                        process(i);
        for (int i = 0; i < n; i++)
                if (!processed[i])
                        process(i);
        vector<int> res(n, 0);
        for (int i = 0; i < n; i++)
                if (counts[i] == min_count)
                        res[i] = 1;
        return res;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 8 ms 14408 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 6 ms 14412 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 6 ms 14292 KB Output is correct
7 Correct 7 ms 14404 KB Output is correct
8 Correct 6 ms 14408 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 8 ms 14408 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 6 ms 14412 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 6 ms 14292 KB Output is correct
7 Correct 7 ms 14404 KB Output is correct
8 Correct 6 ms 14408 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 6 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 6 ms 14420 KB Output is correct
13 Correct 6 ms 14292 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 6 ms 14408 KB Output is correct
16 Correct 6 ms 14404 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 6 ms 14408 KB Output is correct
20 Correct 6 ms 14404 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 6 ms 14420 KB Output is correct
23 Correct 7 ms 14404 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 6 ms 14436 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 8 ms 14408 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 6 ms 14412 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 6 ms 14292 KB Output is correct
7 Correct 7 ms 14404 KB Output is correct
8 Correct 6 ms 14408 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 6 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 6 ms 14420 KB Output is correct
13 Correct 6 ms 14292 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 6 ms 14408 KB Output is correct
16 Correct 6 ms 14404 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 6 ms 14408 KB Output is correct
20 Correct 6 ms 14404 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 6 ms 14420 KB Output is correct
23 Correct 7 ms 14404 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 6 ms 14436 KB Output is correct
27 Correct 7 ms 14676 KB Output is correct
28 Correct 8 ms 14676 KB Output is correct
29 Correct 9 ms 14676 KB Output is correct
30 Correct 7 ms 14532 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 9 ms 14420 KB Output is correct
33 Correct 7 ms 14420 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 11 ms 14640 KB Output is correct
37 Correct 8 ms 14548 KB Output is correct
38 Correct 9 ms 14676 KB Output is correct
39 Correct 8 ms 14644 KB Output is correct
40 Correct 8 ms 14416 KB Output is correct
41 Correct 9 ms 14552 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 8 ms 14408 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 6 ms 14412 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 6 ms 14292 KB Output is correct
7 Correct 7 ms 14404 KB Output is correct
8 Correct 6 ms 14408 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 149 ms 37584 KB Output is correct
11 Correct 237 ms 47504 KB Output is correct
12 Correct 39 ms 20812 KB Output is correct
13 Correct 243 ms 41576 KB Output is correct
14 Correct 295 ms 44260 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 8 ms 14408 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 6 ms 14412 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 6 ms 14292 KB Output is correct
7 Correct 7 ms 14404 KB Output is correct
8 Correct 6 ms 14408 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 6 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 6 ms 14420 KB Output is correct
13 Correct 6 ms 14292 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 6 ms 14408 KB Output is correct
16 Correct 6 ms 14404 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 6 ms 14408 KB Output is correct
20 Correct 6 ms 14404 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 6 ms 14420 KB Output is correct
23 Correct 7 ms 14404 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 6 ms 14436 KB Output is correct
27 Correct 7 ms 14676 KB Output is correct
28 Correct 8 ms 14676 KB Output is correct
29 Correct 9 ms 14676 KB Output is correct
30 Correct 7 ms 14532 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 9 ms 14420 KB Output is correct
33 Correct 7 ms 14420 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 11 ms 14640 KB Output is correct
37 Correct 8 ms 14548 KB Output is correct
38 Correct 9 ms 14676 KB Output is correct
39 Correct 8 ms 14644 KB Output is correct
40 Correct 8 ms 14416 KB Output is correct
41 Correct 9 ms 14552 KB Output is correct
42 Correct 149 ms 37584 KB Output is correct
43 Correct 237 ms 47504 KB Output is correct
44 Correct 39 ms 20812 KB Output is correct
45 Correct 243 ms 41576 KB Output is correct
46 Correct 295 ms 44260 KB Output is correct
47 Correct 8 ms 14404 KB Output is correct
48 Correct 8 ms 14496 KB Output is correct
49 Correct 7 ms 14292 KB Output is correct
50 Correct 230 ms 46564 KB Output is correct
51 Correct 244 ms 45880 KB Output is correct
52 Correct 273 ms 41868 KB Output is correct
53 Correct 315 ms 42692 KB Output is correct
54 Correct 329 ms 42392 KB Output is correct
55 Correct 226 ms 38884 KB Output is correct
56 Correct 427 ms 48940 KB Output is correct
57 Correct 314 ms 45932 KB Output is correct
58 Correct 367 ms 56440 KB Output is correct
59 Correct 844 ms 53320 KB Output is correct
60 Correct 808 ms 52444 KB Output is correct
61 Correct 819 ms 52672 KB Output is correct
62 Correct 591 ms 46120 KB Output is correct
63 Correct 189 ms 46204 KB Output is correct
64 Correct 10 ms 14896 KB Output is correct
65 Correct 10 ms 14948 KB Output is correct
66 Correct 562 ms 46072 KB Output is correct
67 Correct 25 ms 17876 KB Output is correct
68 Correct 44 ms 20072 KB Output is correct
69 Correct 776 ms 53288 KB Output is correct
70 Correct 70 ms 25800 KB Output is correct
71 Correct 244 ms 48636 KB Output is correct
72 Correct 815 ms 53340 KB Output is correct
73 Correct 507 ms 46000 KB Output is correct