Submission #1307100

#	Time	Username	Problem	Language	Result	Execution time	Memory
1307100		fafnir	늑대인간 (IOI18_werewolf)	C++20	100 / 100	773 ms	80332 KiB

werewolf

#include <bits/stdc++.h>
#include "werewolf.h"
using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)


struct Tree2D {
    vector<pair<int,int>> pts;
    vector<vector<int>> nodes;
    int n = 0;

    Tree2D(const vector<pair<int,int>>& points) {
        pts = points;
        sort(pts.begin(), pts.end());

        n = pts.size();
        nodes.resize(4*n);

        build(0, 0, n-1);
    }

    void build(int u, int l, int r) {
        if (l == r) {
            nodes[u].push_back(pts[l].second);
        } else {
            int m = (l + r) / 2;
            build(2*u+1, l, m);
            build(2*u+2, m+1, r);
            nodes[u].reserve(r - l + 1);
            merge(nodes[2*u+1].begin(), nodes[2*u+1].end(),
                  nodes[2*u+2].begin(), nodes[2*u+2].end(),
                  back_inserter(nodes[u]));
        }
    }

    int countNode(int u, int yl, int yr) {
        // it0 --> First point at >= yl
        auto it0 = lower_bound(nodes[u].begin(), nodes[u].end(), yl);
        // it1 --> First element > yr
        auto it1 = upper_bound(nodes[u].begin(), nodes[u].end(), yr);
        return distance(it0, it1);
    }

    // qxl, qxr: Range of nodes in tree
    int query(int u, int l, int r, int qxl, int qxr, int qyl, int qyr) {
        if (r < qxl || l > qxr) {return 0;}
        if (l >= qxl && r <= qxr) {
            return countNode(u, qyl, qyr);
        }
        
        int m = (l + r) / 2;
        return query(2 * u + 1, l, m, qxl, qxr, qyl, qyr) +
               query(2 * u + 2, m + 1, r, qxl, qxr, qyl, qyr);
    }

    int query(int qxl, int qxr, int qyl, int qyr) {
        return query(0, 0, n-1, qxl, qxr, qyl, qyr);
    }

};


int fufind(vector<int>& fu, int x) {
    if (fu[x] < 0) {return x;}      // x is root
    fu[x] = fufind(fu, fu[x]);
    return fu[x];
}


// fu[u] := Parent node of u in DSU (or -1 if u is single node)
// tree[v] := left/right child nodes of v in Kruskal Reconstruction Tree
void fujoin(vector<int>& fu, vector<pair<int,int>>& tree, int x, int y) {
    x = fufind(fu, x);
    y = fufind(fu, y);
    if (x != y) {
        int p = fu.size();
        fu[y] = p;
        fu[x] = p;
        fu.push_back(-1);
        tree.push_back(make_pair(y,x));
    }
}


pair<int,int> dfs(vector<pair<int,int>>& tree, int v, int N, int& label) {
    // One of original nodes
    if (v < N) {
        tree[v].first = tree[v].second = label;
        label++;
    } else {
        pair<int,int> A = dfs(tree, tree[v].first, N, label);
        pair<int,int> B = dfs(tree, tree[v].second, N, label);
        tree[v].first = min(A.first, B.first);
        tree[v].second = max(A.second, B.second);
    }

    return make_pair(tree[v].first, tree[v].second);
}


vector<int> check_validity(int N, vector<int> X, vector<int> Y,
                            vector<int> S, vector<int> E,
                            vector<int> L, vector<int> R) {

    int Q = S.size();
    int M = X.size();
    
    vector<int> A(Q);
    vector<vector<int> > adj(N);
    REP(i, M) {
        adj[X[i]].push_back(Y[i]);
        adj[Y[i]].push_back(X[i]);
    }

    vector<pair<int,int>> Lrange(Q);
    vector<pair<int,int>> Rrange(Q);
    vector<pair<int,int>> pts(N);

    L.push_back(0);
    R.push_back(N-1);
    S.push_back(0);
    E.push_back(0);
    

    // Compute Lrange
    {
        vector<int> fu(N);
        vector<int> idx(Q+1);
        vector<int> leads(Q+1);
        vector<pair<int,int>> tree(N, {-1,-1});

        REP(i, N) {fu[i] = -1;}
        REP(i, Q+1) {idx[i] = i;}
        sort(idx.begin(), idx.end(), [&](int i0, int i1) {
            return L[i0] > L[i1];
        });
        int u = N-1;
        REP(i, Q+1) {
            int limit = L[idx[i]];
            for (; u >= limit; --u) {
                for (int v : adj[u]) {
                    if (v >= limit) {
                        fujoin(fu, tree, u, v);
                    }
                }
            }
            int lead = fufind(fu, S[idx[i]]);
            leads[idx[i]] = lead;
        }    

        int label = 0;
        dfs(tree, tree.size()-1, N, label);
        REP(i, Q) {Lrange[i] = tree[leads[i]];}
        REP(i, N) {pts[i].first = tree[i].first;}
    }

    // Rrange
    {
        vector<int> fu(N);
        vector<int> idx(Q+1);
        vector<int> leads(Q+1);
        vector<pair<int,int>> tree(N, {-1,-1});

        REP(i, N) {fu[i] = -1;}
        REP(i, Q+1) {idx[i] = i;}
        sort(idx.begin(), idx.end(), [&](int i0, int i1) {
            return R[i0] < R[i1];
        });
        int u = 0;
        REP(i, Q+1) {
            int limit = R[idx[i]];
            for (; u <= limit; ++u) {
                for (int v : adj[u]) {
                    if (v <= limit) {
                        fujoin(fu, tree, u, v);
                    }
                }
            }
            int lead = fufind(fu, E[idx[i]]);
            leads[idx[i]] = lead;
        }    

        int label = 0;
        dfs(tree, tree.size()-1, N, label);
        REP(i, Q) {Rrange[i] = tree[leads[i]];}
        REP(i, N) {pts[i].second = tree[i].first;}
    }

    Tree2D tree_2d(pts);
    REP(i, Q) {
        A[i] = tree_2d.query(Lrange[i].first, Lrange[i].second,
                             Rrange[i].first, Rrange[i].second) > 0;
    }

    return A;
}

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 34 / 34
• Subtask 4: 51 / 51