結果
| 問題 |
No.1170 Never Want to Walk
|
| コンテスト | |
| ユーザー |
 kcvlex
|
| 提出日時 | 2020-08-14 22:46:00 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 164 ms / 2,000 ms |
| コード長 | 8,553 bytes |
| コンパイル時間 | 1,761 ms |
| コンパイル使用メモリ | 158,652 KB |
| 最終ジャッジ日時 | 2025-01-13 00:22:02 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 37 |
ソースコード
#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T, std::size_t Head, std::size_t... Tail>
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head>
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;
#ifdef CPP17
template <typename T, typename F, typename... Args>
void fill_seq(T &t, F f, Args... args) {
if constexpr (std::is_invocable<F, Args...>::value) {
t = f(args...);
} else {
for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i);
}
}
#endif
template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }
template <typename T, typename... Tail>
auto make_v(size_type hs, Tail&&... ts) {
auto v = std::move(make_v<T>(std::forward<Tail>(ts)...));
return vec<decltype(v)>(hs, v);
}
namespace init__ {
struct InitIO {
InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); }
} init_io;
}
#define CPP17
namespace tree {
struct UnionFind {
vec<ll> rank, par;
vec<ssize_t> sz;
UnionFind(ll n) : rank(n), par(n), sz(n) {
init();
}
void init() {
std::fill(ALL(rank), 1);
std::iota(ALL(par), 0);
std::fill(ALL(sz), 1);
}
ll find(ll n) {
return (n == par[n] ? n : par[n] = find(par[n]));
}
bool unit(ll x, ll y) {
ll px = find(x), py = find(y);
if (px == py) return false;
if (rank[px] < rank[py]) std::swap(px, py);
par[py] = px;
rank[px] += (rank[px] == rank[py]);
sz[px] += sz[py];
return true;
}
bool same(ll x, ll y) {
return find(x) == find(y);
}
ssize_t size(ll n) {
return sz[find(n)];
}
};
}
namespace utility {
template <typename T>
using validate_integer = typename std::enable_if<std::is_integral<T>::value, ll>::type;
template <typename T>
auto popcount(T n) -> validate_integer<T> {
return __builtin_popcountll(n);
}
// 0 indexed
template <typename T>
auto msb(T n) -> validate_integer<T> {
return 64 - __builtin_clzll(n) - 1;
}
template <typename T>
constexpr auto ceil_pow2(T s) -> validate_integer<T> {
ll ret = 1;
while (ret < s) ret *= 2;
return ret;
}
}
namespace segtree {
template <typename M, typename Op>
class LazySegmentTree {
struct segment {
M m;
Op op;
bool has_lazy;
segment(M m = M()) : m(m), op(Op()), has_lazy(false) { }
void update_op(Op o) {
m.apply(o);
op = Op::merge(op, o);
has_lazy = true;
}
void init_op() {
op = Op();
has_lazy = false;
}
};
vec<segment> segs;
size_type height;
void push(size_type idx) {
auto &s = segs[idx];
if (!s.has_lazy) return;
for (int i = 0; i < 2; i++) {
auto cidx = 2 * idx + i;
if (segs.size() <= cidx) break;
auto &cs = segs[cidx];
cs.update_op(s.op);
}
s.init_op();
}
void propagate_from_top(size_type idx) {
for (int i = height; 1 <= i; i--) push(idx >> i);
}
void update_from_bottom(size_type idx) {
while (true) {
auto pidx = idx / 2;
if (pidx == 0) break;
size_type c0 = 2 * pidx + 0,
c1 = 2 * pidx + 1;
push(c0); push(c1);
segs[pidx].m = M::merge(segs[c0].m, segs[c1].m);
idx = pidx;
}
}
size_type get_endpoint_seg(size_type i) {
i += size();
return i / (i & -i);
}
public:
template <typename F>
LazySegmentTree(F f, size_type sz) {
size_type sz2 = utility::ceil_pow2(sz);
segs.resize(sz2 * 2);
height = utility::msb(sz2);
for (size_type i = 0; i < sz; i++) segs[i + sz2] = f(i);
for (size_type i = sz2 - 1; 1 <= i; i--) segs[i] = M::merge(segs[2 * i].m, segs[2 * i + 1].m);
}
template <typename T>
LazySegmentTree(const vec<T> &v)
: LazySegmentTree([&](size_type i) { return v[i]; }, v.size()) { }
size_type size() const {
return segs.size() / 2;
}
template <typename T>
void update_query(size_type ql, size_type qr, const T &t) {
Op op(t);
auto l0 = get_endpoint_seg(ql);
auto r0 = get_endpoint_seg(qr);
propagate_from_top(l0);
propagate_from_top(r0);
size_type lnode = ql + size(), rnode = qr + size();
while (lnode < rnode) {
if (lnode & 1) {
segs[lnode].update_op(op);
push(lnode);
lnode++;
}
if (rnode & 1) {
rnode--;
segs[rnode].update_op(op);
push(rnode);
}
lnode /= 2;
rnode /= 2;
}
update_from_bottom(l0);
update_from_bottom(r0);
}
M get_query(ll ql, ll qr) {
auto ret = M();
auto l0 = get_endpoint_seg(ql);
auto r0 = get_endpoint_seg(qr);
propagate_from_top(l0);
propagate_from_top(r0);
size_type lnode = ql + size(), rnode = qr + size();
while (lnode < rnode) {
if (lnode & 1) {
push(lnode);
ret = M::merge(segs[lnode].m, ret);
lnode++;
}
if (rnode & 1) {
rnode--;
push(rnode);
ret = M::merge(ret, segs[rnode].m);
}
lnode /= 2;
rnode /= 2;
}
return ret;
}
};
}
const ll inf = 5e15;
struct Op {
ll val;
Op(ll val = inf) : val(val) { }
static Op merge(Op a, Op b) {
return Op(std::min(a.val, b.val));
}
};
struct M {
ll val;
M(ll val = inf) : val(val) { }
static M merge(M a, M b) {
return M(std::min(a.val, b.val));
}
void apply(Op o) {
chmin(val, o.val);
}
};
int main() {
ll n, a, b;
std::cin >> n >> a >> b;
vec<ll> xv(n);
for (ll &e : xv) std::cin >> e;
segtree::LazySegmentTree<M, Op> seg([&](ll i) { return M(); }, n);
tree::UnionFind uf(n);
for (ll i = 0; i < n; i++) {
ll e = xv[i];
ll l = std::distance(xv.begin(), std::lower_bound(ALL(xv), e + a));
ll r = std::distance(xv.begin(), std::upper_bound(ALL(xv), e + b));
if (l == r) continue;
uf.unit(i, l);
uf.unit(i, r - 1);
seg.update_query(l, r, i);
}
for (ll i = 0; i < n; i++) {
ll e = seg.get_query(i, i + 1).val;
if (e != inf) uf.unit(i, e);
}
for (ll i = 0; i < n; i++) std::cout << uf.size(i) << "\n";
return 0;
}