oj.uz

답안 #979412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979412 2024-05-10T21:54:40 Z alontanay 열쇠 (IOI21_keys) C++17
100 / 100
 625 ms 305024 KB 
#include "keys.h"
#include <bits/stdc++.h>

#define f first
#define s second
#define NEW_STATE 0
#define ACTIVE_STATE 1
#define OLD_STATE 2
#define NO_POS -1

using namespace std;
using pi = pair<int,int>;

const int MAX_N = 3e5+5;
namespace dsu {
    int sz[MAX_N], root[MAX_N], L[MAX_N];
    int PTR_pos[MAX_N];
    stack<int> pos[MAX_N];
    int PTR_ord_future[MAX_N];
    priority_queue<pi> ord_future[MAX_N];
    void init(int n) {
        for(int i = 0; i < n; i ++) {
            sz[i] = 1;
            root[i] = i;
            PTR_pos[i] = i;
            PTR_ord_future[i] = i;
        }
    }
    int get_root(int node) {
        if(root[node] == node) {return node;}
        return root[node] = get_root(root[node]);
    }
    void add_pos(int node, int ne) {
        pos[PTR_pos[get_root(node)]].push(ne);
    }
    int poll_pos(int node) {
        int ptr = PTR_pos[get_root(node)];
        if(pos[ptr].empty()) { return NO_POS; }
        int top = pos[ptr].top();
        pos[ptr].pop();
        return top;
    }
    bool are_joined(int a, int b) {
        return get_root(a) == get_root(b);
    }
    int merge(int a, int b) {
        a = get_root(a);
        b = get_root(b);
        if(a == b) { return a; }
        if(sz[a] < sz[b]) {
            swap(a,b);
        }
        L[a] = min(L[a],L[b]);
        root[b] = a;
        {
            int big_ptr = PTR_pos[a];
            int small_ptr = PTR_pos[b];
            if(pos[big_ptr].size() < pos[small_ptr].size()) {
                swap(big_ptr,small_ptr);
            }
            PTR_pos[a] = big_ptr;
            stack<int> &big_pos = pos[big_ptr];
            stack<int> &small_pos = pos[small_ptr];
            while(!small_pos.empty()) {
                big_pos.push(small_pos.top());
                small_pos.pop();
            }
        }
        {
            int big_ptr = PTR_ord_future[a];
            int small_ptr = PTR_ord_future[b];
            if(ord_future[big_ptr].size() < ord_future[small_ptr].size()) {
                swap(big_ptr,small_ptr);
            }
            PTR_ord_future[a] = big_ptr;
            priority_queue<pi> &big_ord_future = ord_future[big_ptr];
            priority_queue<pi> &small_ord_future = ord_future[small_ptr];
            while(!small_ord_future.empty()) {
                big_ord_future.push(small_ord_future.top());
                small_ord_future.pop();
            }
            while(!big_ord_future.empty() && big_ord_future.top().f >= L[a]) {
                pos[PTR_pos[a]].push(big_ord_future.top().s);
                big_ord_future.pop();
            }
        }
        return a;
    }
}

vector<pi> nei[MAX_N];
vector<pi> need_key[MAX_N];
int state[MAX_N];
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(), m = u.size();
    dsu::init(n);
    for(int i = 0;i < m; i ++) {
        int a = u[i], b = v[i], t = c[i];
        nei[a].push_back({b,t});
        nei[b].push_back({a,t});
    }
    vector<int> last_occ(n);
    int cidx = 0;
    vector<int> res;
    int opt_score = n;
    vector<int> once(n);
    for(int i = 0; i < n; i ++) {
        if(state[i] != NEW_STATE) { continue; }
        stack<int> UPD_need_key;
        stack<int> reached_nodes;
        bool reached_old = false;
        int node = i;
        stack<int> comp_stack;
        while(true) {
            cidx++;

            assert((once[node]++) == 0);
            reached_nodes.push(node);
            int key = r[node];
            dsu::L[node] = cidx;
            comp_stack.push(node);
            last_occ[key] = cidx;
            state[node] = ACTIVE_STATE;
            for(auto &[ne, req] : nei[node]) {
                UPD_need_key.push(req);
                need_key[req].push_back({node,ne});
                dsu::ord_future[node].push({last_occ[req],ne});
            }
            for(pi edge : need_key[key]) {
                dsu::add_pos(edge.f,edge.s);
            }
            need_key[key].clear();

            int next_node;
            bool converged = false;
            while(true) {
                next_node = dsu::poll_pos(node);
                if(next_node == NO_POS) {
                    converged = true;
                    break;
                }
                if(state[next_node] == OLD_STATE) {
                    reached_old = true;
                    break;
                }
                if(state[next_node] == NEW_STATE) {
                    break;
                }

                while(comp_stack.size() >= 2 && !dsu::are_joined(node,next_node)) {
                    int top = comp_stack.top();
                    comp_stack.pop();
                    int bef = comp_stack.top();
                    comp_stack.pop();
                    int new_root = dsu::merge(top,bef);
                    comp_stack.push(new_root);
                }
            }
            if(reached_old || converged) {
                break;
            }
            node = next_node;
        }
        vector<int> base_comp;
        base_comp.reserve(reached_nodes.size());
        while(!reached_nodes.empty()) {
            int top = reached_nodes.top();
            if(!reached_old && dsu::are_joined(node, top)) {
                base_comp.push_back(top);
            }
            reached_nodes.pop();
            state[top] = OLD_STATE;
        }
        if(!reached_old) {
            int score = base_comp.size();
            if(score < opt_score) {
                opt_score = score;
                res.clear();
            }
            if(score == opt_score) {
                for(int b : base_comp) {
                    res.push_back(b);
                }
            }
        }
        while(!UPD_need_key.empty()) {
            int key = UPD_need_key.top();
            UPD_need_key.pop();
            need_key[key].clear();
        }
    }
    vector<int> ans(n);
    for(int r : res) {
        ans[r] = 1;
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 232056 KB Output is correct
2 Correct 97 ms 232020 KB Output is correct
3 Correct 104 ms 232276 KB Output is correct
4 Correct 100 ms 232232 KB Output is correct
5 Correct 100 ms 232016 KB Output is correct
6 Correct 102 ms 232248 KB Output is correct
7 Correct 103 ms 232108 KB Output is correct
8 Correct 97 ms 232016 KB Output is correct
9 Correct 98 ms 232272 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 232056 KB Output is correct
2 Correct 97 ms 232020 KB Output is correct
3 Correct 104 ms 232276 KB Output is correct
4 Correct 100 ms 232232 KB Output is correct
5 Correct 100 ms 232016 KB Output is correct
6 Correct 102 ms 232248 KB Output is correct
7 Correct 103 ms 232108 KB Output is correct
8 Correct 97 ms 232016 KB Output is correct
9 Correct 98 ms 232272 KB Output is correct
10 Correct 100 ms 232024 KB Output is correct
11 Correct 102 ms 232100 KB Output is correct
12 Correct 107 ms 232136 KB Output is correct
13 Correct 102 ms 232020 KB Output is correct
14 Correct 97 ms 232020 KB Output is correct
15 Correct 112 ms 232204 KB Output is correct
16 Correct 98 ms 232084 KB Output is correct
17 Correct 99 ms 232152 KB Output is correct
18 Correct 101 ms 232016 KB Output is correct
19 Correct 99 ms 232532 KB Output is correct
20 Correct 97 ms 232248 KB Output is correct
21 Correct 102 ms 232220 KB Output is correct
22 Correct 96 ms 232016 KB Output is correct
23 Correct 97 ms 232236 KB Output is correct
24 Correct 105 ms 232272 KB Output is correct
25 Correct 97 ms 232272 KB Output is correct
26 Correct 97 ms 232208 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 232056 KB Output is correct
2 Correct 97 ms 232020 KB Output is correct
3 Correct 104 ms 232276 KB Output is correct
4 Correct 100 ms 232232 KB Output is correct
5 Correct 100 ms 232016 KB Output is correct
6 Correct 102 ms 232248 KB Output is correct
7 Correct 103 ms 232108 KB Output is correct
8 Correct 97 ms 232016 KB Output is correct
9 Correct 98 ms 232272 KB Output is correct
10 Correct 100 ms 232024 KB Output is correct
11 Correct 102 ms 232100 KB Output is correct
12 Correct 107 ms 232136 KB Output is correct
13 Correct 102 ms 232020 KB Output is correct
14 Correct 97 ms 232020 KB Output is correct
15 Correct 112 ms 232204 KB Output is correct
16 Correct 98 ms 232084 KB Output is correct
17 Correct 99 ms 232152 KB Output is correct
18 Correct 101 ms 232016 KB Output is correct
19 Correct 99 ms 232532 KB Output is correct
20 Correct 97 ms 232248 KB Output is correct
21 Correct 102 ms 232220 KB Output is correct
22 Correct 96 ms 232016 KB Output is correct
23 Correct 97 ms 232236 KB Output is correct
24 Correct 105 ms 232272 KB Output is correct
25 Correct 97 ms 232272 KB Output is correct
26 Correct 97 ms 232208 KB Output is correct
27 Correct 101 ms 232400 KB Output is correct
28 Correct 98 ms 232532 KB Output is correct
29 Correct 97 ms 232536 KB Output is correct
30 Correct 99 ms 232272 KB Output is correct
31 Correct 100 ms 232388 KB Output is correct
32 Correct 110 ms 232152 KB Output is correct
33 Correct 99 ms 232276 KB Output is correct
34 Correct 100 ms 232320 KB Output is correct
35 Correct 104 ms 232376 KB Output is correct
36 Correct 108 ms 232300 KB Output is correct
37 Correct 97 ms 232416 KB Output is correct
38 Correct 99 ms 232352 KB Output is correct
39 Correct 108 ms 232576 KB Output is correct
40 Correct 97 ms 232188 KB Output is correct
41 Correct 96 ms 232320 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 232056 KB Output is correct
2 Correct 97 ms 232020 KB Output is correct
3 Correct 104 ms 232276 KB Output is correct
4 Correct 100 ms 232232 KB Output is correct
5 Correct 100 ms 232016 KB Output is correct
6 Correct 102 ms 232248 KB Output is correct
7 Correct 103 ms 232108 KB Output is correct
8 Correct 97 ms 232016 KB Output is correct
9 Correct 98 ms 232272 KB Output is correct
10 Correct 340 ms 260756 KB Output is correct
11 Correct 442 ms 273796 KB Output is correct
12 Correct 147 ms 239028 KB Output is correct
13 Correct 395 ms 265756 KB Output is correct
14 Correct 276 ms 272932 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 232056 KB Output is correct
2 Correct 97 ms 232020 KB Output is correct
3 Correct 104 ms 232276 KB Output is correct
4 Correct 100 ms 232232 KB Output is correct
5 Correct 100 ms 232016 KB Output is correct
6 Correct 102 ms 232248 KB Output is correct
7 Correct 103 ms 232108 KB Output is correct
8 Correct 97 ms 232016 KB Output is correct
9 Correct 98 ms 232272 KB Output is correct
10 Correct 100 ms 232024 KB Output is correct
11 Correct 102 ms 232100 KB Output is correct
12 Correct 107 ms 232136 KB Output is correct
13 Correct 102 ms 232020 KB Output is correct
14 Correct 97 ms 232020 KB Output is correct
15 Correct 112 ms 232204 KB Output is correct
16 Correct 98 ms 232084 KB Output is correct
17 Correct 99 ms 232152 KB Output is correct
18 Correct 101 ms 232016 KB Output is correct
19 Correct 99 ms 232532 KB Output is correct
20 Correct 97 ms 232248 KB Output is correct
21 Correct 102 ms 232220 KB Output is correct
22 Correct 96 ms 232016 KB Output is correct
23 Correct 97 ms 232236 KB Output is correct
24 Correct 105 ms 232272 KB Output is correct
25 Correct 97 ms 232272 KB Output is correct
26 Correct 97 ms 232208 KB Output is correct
27 Correct 101 ms 232400 KB Output is correct
28 Correct 98 ms 232532 KB Output is correct
29 Correct 97 ms 232536 KB Output is correct
30 Correct 99 ms 232272 KB Output is correct
31 Correct 100 ms 232388 KB Output is correct
32 Correct 110 ms 232152 KB Output is correct
33 Correct 99 ms 232276 KB Output is correct
34 Correct 100 ms 232320 KB Output is correct
35 Correct 104 ms 232376 KB Output is correct
36 Correct 108 ms 232300 KB Output is correct
37 Correct 97 ms 232416 KB Output is correct
38 Correct 99 ms 232352 KB Output is correct
39 Correct 108 ms 232576 KB Output is correct
40 Correct 97 ms 232188 KB Output is correct
41 Correct 96 ms 232320 KB Output is correct
42 Correct 340 ms 260756 KB Output is correct
43 Correct 442 ms 273796 KB Output is correct
44 Correct 147 ms 239028 KB Output is correct
45 Correct 395 ms 265756 KB Output is correct
46 Correct 276 ms 272932 KB Output is correct
47 Correct 101 ms 232248 KB Output is correct
48 Correct 96 ms 232016 KB Output is correct
49 Correct 97 ms 232272 KB Output is correct
50 Correct 275 ms 276416 KB Output is correct
51 Correct 303 ms 275652 KB Output is correct
52 Correct 353 ms 263584 KB Output is correct
53 Correct 344 ms 263372 KB Output is correct
54 Correct 341 ms 263372 KB Output is correct
55 Correct 353 ms 262644 KB Output is correct
56 Correct 436 ms 276216 KB Output is correct
57 Correct 347 ms 280584 KB Output is correct
58 Correct 385 ms 286696 KB Output is correct
59 Correct 594 ms 281572 KB Output is correct
60 Correct 460 ms 274780 KB Output is correct
61 Correct 595 ms 283920 KB Output is correct
62 Correct 608 ms 304560 KB Output is correct
63 Correct 277 ms 276664 KB Output is correct
64 Correct 99 ms 233040 KB Output is correct
65 Correct 102 ms 232916 KB Output is correct
66 Correct 587 ms 304736 KB Output is correct
67 Correct 112 ms 236908 KB Output is correct
68 Correct 123 ms 240200 KB Output is correct
69 Correct 570 ms 280940 KB Output is correct
70 Correct 159 ms 247796 KB Output is correct
71 Correct 282 ms 279980 KB Output is correct
72 Correct 607 ms 281108 KB Output is correct
73 Correct 625 ms 305024 KB Output is correct