This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub packer-jp/kyopro-lib-cpp
#include "graph/offline_dag_reachability.hpp"
#pragma once #include "../template.hpp" #include "../util/dynamic_bitset.hpp" #include "khan.hpp" struct offline_dag_reachability { khan ts; offline_dag_reachability(ll n) : ts(n) {} void add_edge(ll from, ll to) { ts.add_edge(from, to); } vector<bool> get(const vector<pair<ll, ll>> &q) { vector<bool> ret(q.size()); vector<pll> edges; for (ll from : ts.get()) { for (ll to : ts.g[from]) edges.emplace_back(from, to); } for (ll i = 0; i < q.size(); i += 64) { ll m = min(64ll, (ll)q.size() - i); vector<ull> dp(ts.g.size()); for (ll j : rep(m)) dp[q[i + j].first] |= bit(j); for (auto [from, to] : edges) dp[to] |= dp[from]; for (ll j : rep(m)) ret[i + j] = (dp[q[i + j].second] >> j) & 1; } return ret; } };
#line 2 "graph/offline_dag_reachability.hpp" #line 2 "template.hpp" #include <bits/stdc++.h> using namespace std; #define all(a) begin(a), end(a) #define rall(a) rbegin(a), rend(a) #define uniq(a) (a).erase(unique(all(a)), (a).end()) #define t0 first #define t1 second using ll = long long; using ull = unsigned long long; using pll = pair<ll, ll>; using vll = vector<ll>; constexpr double pi = 3.14159265358979323846; constexpr ll dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; constexpr ll dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0}; constexpr ll sign(ll a) { return (a > 0) - (a < 0); } constexpr ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); } constexpr ll cdiv(ll a, ll b) { return -fdiv(-a, b); } constexpr ll pw(ll n) { return 1ll << n; } constexpr ll flg(ll n) { return 63 - __builtin_clzll(n); } constexpr ll clg(ll n) { return n == 1 ? 0 : flg(n - 1) + 1; } constexpr ll safemod(ll x, ll mod) { return (x % mod + mod) % mod; } template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>; template <typename T> constexpr T sq(const T &a) { return a * a; } template <typename T, typename U> constexpr bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; } template <typename T, typename U> constexpr bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) { os << "(" << a.first << ", " << a.second << ")"; return os; } template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) { os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : ""); os << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : ""); os << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : ""); os << ")"; return os; } template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : ""); os << ")"; return os; } #ifdef ONLINE_JUDGE #define dump(...) (void(0)) #else void debug() { cerr << endl; } template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) { cerr << head; if (sizeof...(Tail)) cerr << ", "; debug(tail...); } #define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__) #endif struct rep { struct itr { ll v; itr(ll v) : v(v) {} void operator++() { ++v; } ll operator*() const { return v; } bool operator!=(itr i) const { return v < *i; } }; ll l, r; rep(ll l, ll r) : l(l), r(r) {} rep(ll r) : rep(0, r) {} itr begin() const { return l; }; itr end() const { return r; }; }; struct per { struct itr { ll v; itr(ll v) : v(v) {} void operator++() { --v; } ll operator*() const { return v; } bool operator!=(itr i) const { return v > *i; } }; ll l, r; per(ll l, ll r) : l(l), r(r) {} per(ll r) : per(0, r) {} itr begin() const { return r - 1; }; itr end() const { return l - 1; }; }; struct io_setup { static constexpr int PREC = 20; io_setup() { cout << fixed << setprecision(PREC); cerr << fixed << setprecision(PREC); }; } iOS; #line 2 "util/dynamic_bitset.hpp" #line 4 "util/dynamic_bitset.hpp" struct dynamic_bitset { using db = dynamic_bitset; vector<ull> val; struct ref { ull &p; ll i; ref(ull &p, ll i) : p(p), i(i) {} ref &operator=(bool a) { if (a) { p |= pw(i); } else p &= ~pw(i); return *this; } ref &operator=(const ref &a) { return *this = a; } operator bool() const { return (p & pw(i)) != 0; } bool operator~() const { return !*this; } ref &flip() { p ^= pw(i); return *this; } }; ref operator[](ll i) { if (val.size() <= i >> 4) val.resize((i >> 4) + 1); return {val[i >> 4], i & 63}; } db &operator&=(const db &a) { if (a.val.size() < val.size()) val.resize(a.val.size()); for (ll i : rep(a.val.size())) val[i] &= a.val[i]; return *this; } db &operator|=(const db &a) { if (a.val.size() > val.size()) val.resize(a.val.size()); for (ll i : rep(a.val.size())) val[i] |= a.val[i]; return *this; } db &operator^=(const db &a) { if (a.val.size() > val.size()) val.resize(a.val.size()); for (ll i : rep(a.val.size())) val[i] ^= a.val[i]; return *this; } ll count() const { ll ret = 0; for (ull p : val) ret += __builtin_popcountll(p); return ret; } friend bool operator==(const db &a, const db &b) { return (a ^ b).count() == 0; } friend bool operator!=(const db &a, const db &b) { return rel_ops::operator!=(a, b); } friend bool operator<(const db &a, const db &b) { for (ll i : per(max(a.val.size(), b.val.size()))) { ull pa = i < a.val.size() ? a.val[i] : 0; ull pb = i < b.val.size() ? b.val[i] : 0; if (pa < pb) return true; if (pa > pb) return false; } return false; } friend bool operator>(const db &a, const db &b) { return rel_ops::operator>(a, b); } friend bool operator<=(const db &a, const db &b) { return rel_ops::operator<=(a, b); } friend bool operator>=(const db &a, const db &b) { return rel_ops::operator>=(a, b); } friend db operator&(const db &a, const db &b) { return db(a) &= b; } friend db operator|(const db &a, const db &b) { return db(a) |= b; } friend db operator^(const db &a, const db &b) { return db(a) ^= b; } }; #line 2 "graph/khan.hpp" #line 4 "graph/khan.hpp" struct khan { vector<vector<ll>> g; vector<ll> indeg; khan(ll n) : g(n), indeg(n) {} void add_edge(ll from, ll to) { g[from].push_back(to), ++indeg[to]; } vector<ll> get() { vector<ll> _indeg(indeg), ret; for (ll i : rep(g.size())) { if (_indeg[i] == 0) ret.push_back(i); } for (ll i : rep(g.size())) { if (i >= ret.size()) return {}; for (ll to : g[ret[i]]) { if (--_indeg[to] == 0) ret.push_back(to); } } return ret; } }; #line 6 "graph/offline_dag_reachability.hpp" struct offline_dag_reachability { khan ts; offline_dag_reachability(ll n) : ts(n) {} void add_edge(ll from, ll to) { ts.add_edge(from, to); } vector<bool> get(const vector<pair<ll, ll>> &q) { vector<bool> ret(q.size()); vector<pll> edges; for (ll from : ts.get()) { for (ll to : ts.g[from]) edges.emplace_back(from, to); } for (ll i = 0; i < q.size(); i += 64) { ll m = min(64ll, (ll)q.size() - i); vector<ull> dp(ts.g.size()); for (ll j : rep(m)) dp[q[i + j].first] |= bit(j); for (auto [from, to] : edges) dp[to] |= dp[from]; for (ll j : rep(m)) ret[i + j] = (dp[q[i + j].second] >> j) & 1; } return ret; } };