Submission #1143682

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143682		steveonalex	Keys (IOI21_keys)	C++20	100 / 100	728 ms	147544 KiB

keys

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        for(int i = 1; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }

    int get_size(int u){return sz[find_set(u)];}
};

struct DSUPlus{
    int n;
    vector<int> parent, sz;
    vector<vector<int>> edge;
    vector<set<int>> present_color;
    vector<set<pair<int, int>>> inactive_edge;

    DSUPlus(int _n){
        n = _n;
        parent.resize(n); sz.resize(n, 1);
        for(int i = 0; i<n; ++i) parent[i] = i;

        edge.resize(n);
        inactive_edge.resize(n);
        present_color.resize(n);
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];

            for(int e: edge[v]){
                if (find_set(e) != u) edge[u].push_back(e);
            }
            for(int c: present_color[v]){
                while(true){
                    auto it = inactive_edge[u].lower_bound(make_pair(c, -1));
                    if (it == inactive_edge[u].end() || (*it).first != c) break;
                    pair<int, int> cur = *it;
                    inactive_edge[u].erase(it);
                    edge[u].push_back(cur.second);
                }
                present_color[u].insert(c);
            }
            for(pair<int, int> e: inactive_edge[v]){
                add_edge(u, e);
            }

            return true;
        }
        return false;
    }

    int get_size(int u){return sz[find_set(u)];}

    int get_edge(int u){
        u = find_set(u);
        if (edge[u].empty()) return -1;
        return edge[u].back();
    }

    void extract_edge(int u){
        u = find_set(u);
        if (edge[u].size()) edge[u].pop_back();
    }

    void add_edge(int u, pair<int, int> e){
        u = find_set(u);
        if (present_color[u].find(e.first) != present_color[u].end()){
            edge[u].push_back(e.second);
        }
        else{
            inactive_edge[u].insert(e);
        }
    }
};

const int N = 3e5 + 69, INF = 1e9 + 69;
int n, m;
vector<pair<int, int>> graph[N];

vector<int> find_reachable(vector<int> r, vector<int> U, vector<int> V, vector<int> C) {
    n = r.size(), m = U.size();

    DSU mst(n);
    DSUPlus functional_graph(n);

    for(int i = 0; i < n; ++i) functional_graph.present_color[i].insert(r[i]);

    for(int i = 0; i < m; ++i){
        int u= U[i], v = V[i], c = C[i];
        functional_graph.add_edge(u, make_pair(c, v));
        functional_graph.add_edge(v, make_pair(c, u));
    }

    for(int i = 0; i < n; ++i){
        while(functional_graph.get_edge(i) != -1){
            int j = functional_graph.get_edge(i);
            if (mst.join_set(i, j)) break;
            functional_graph.extract_edge(i);
            if (functional_graph.same_set(i, j)) continue;
            j = functional_graph.find_set(j);

            vector<int> beast = {i};
            while(!functional_graph.same_set(i, j)){
                beast.push_back(j);
                int k = functional_graph.get_edge(j);
                functional_graph.extract_edge(j);
                j = functional_graph.find_set(k);
            }
            for(int j: beast) functional_graph.join_set(i, j);
        }
    }

    int mi = n + 1;
    for(int i =0; i < n; ++i) {
        if (functional_graph.get_edge(i) == -1) minimize(mi, functional_graph.get_size(i));
    }



    vector<int> ans(n);
    for(int i = 0; i < n; ++i){
        if (functional_graph.get_edge(i) == -1)
            ans[i] = (functional_graph.get_size(i) == mi);
    }

    return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 17 / 17
• Subtask 4: 30 / 30
• Subtask 5: 33 / 33