제출 #936107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
936107		GrindMachine	늑대인간 (IOI18_werewolf)	C++17	15 / 100	4046 ms	103200 KiB

werewolf

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int B = 511;

#include "werewolf.h"

struct DSU {
    vector<int> par, rankk, siz;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

    int find(int u) {
        if (u == par[u]) return u;
        else return find(par[u]);
    }

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    pii merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return {-1,-1};

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
        return {u,v};
    }
};

std::vector<int> check_validity(int n, std::vector<int> X, std::vector<int> Y,
                                std::vector<int> S, std::vector<int> E,
                                std::vector<int> L, std::vector<int> R) {

    int m = sz(X), q = sz(S);
    rep(i,m){
        if(X[i] > Y[i]){
            swap(X[i],Y[i]);
        }
    }

    vector<int> here1[n], here2[n];
    rep(i,m){
        here1[X[i]].pb(Y[i]);
        here2[Y[i]].pb(X[i]);
    }

    vector<int> queries1[n], queries2[n];
    rep(i,q){
        queries1[L[i]].pb(i);
        queries2[R[i]].pb(i);
    }

    vector<int> cc1(q), cc2(q);
    vector<pii> upd1[n], upd2[n];
    DSU dsu(n);

    rev(u,n-1,0){
        trav(v,here1[u]){
            if(!dsu.same(u,v)){
                auto p = dsu.merge(u,v);
                upd1[u].pb(p);
            }
        }
        trav(id,queries1[u]){
            cc1[id] = dsu.find(S[id]);
        }
    }

    dsu = DSU(n);

    rep(u,n){
        trav(v,here2[u]){
            if(!dsu.same(u,v)){
                auto p = dsu.merge(u,v);
                upd2[u].pb(p);
            }
        }
        trav(id,queries2[u]){
            cc2[id] = dsu.find(E[id]);
        }
    }

    vector<int> ans(q);
    vector<bitset<B>> dp(n), qlb(q), qrb(q);

    rep(b,ceil2(n,B)){
        rep(i,n) dp[i] = 0;
        for(int i = b*B; i < n and i < (b+1)*B; ++i){
            dp[i][i-b*B] = 1;
        }

        rev(u,n-1,0){
            for(auto [x,y] : upd1[u]){
                dp[x] |= dp[y];
            }
            trav(id,queries1[u]){
                qlb[id] = dp[cc1[id]];
            }
        }

        rep(i,n) dp[i] = 0;
        for(int i = b*B; i < n and i < (b+1)*B; ++i){
            dp[i][i-b*B] = 1;
        }

        rep(u,n){
            for(auto [x,y] : upd2[u]){
                dp[x] |= dp[y];
            }
            trav(id,queries2[u]){
                qrb[id] = dp[cc2[id]];
            }
        }

        rep(i,q){
            if((qlb[i]&qrb[i]).count()){
                ans[i] = 1;
            }
        }
    }

    return ans;
}

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