結果
| 問題 |
No.1170 Never Want to Walk
|
| コンテスト | |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-08-14 21:50:14 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 87 ms / 2,000 ms |
| コード長 | 8,055 bytes |
| コンパイル時間 | 2,119 ms |
| コンパイル使用メモリ | 180,832 KB |
| 実行使用メモリ | 9,544 KB |
| 最終ジャッジ日時 | 2024-11-14 23:20:06 |
| 合計ジャッジ時間 | 5,328 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 37 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#pragma region Template
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb(b);
if (__DIRECTED__ == false) g[b].pb(a);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb({b, c});
if (__DIRECTED__ == false) g[b].pb({a, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
rep(__j, w) { \
if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \
if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i][__j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << sp; \
if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \
if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
///*
// Speed
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native,arch=skylake-avx512")
#pragma GCC diagnostic pop
//*/
// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
#pragma endregion
struct UFS {
vector<ll> data;
UFS(ll N) : data(N, -1) {}
ll root(ll x) {
if (data[x] < 0) return x;
else
return data[x] = root(data[x]);
}
bool unite(ll x, ll y) {
ll root_x = root(x), root_y = root(y);
if (root_x != root_y) {
if (data[root_x] > data[root_y]) swap(root_x, root_y);
data[root_x] += data[root_y];
data[root_y] = root_x;
return true;
}
return false;
}
bool same(ll x, ll y) { return root(x) == root(y); }
bool isroot(ll x) { return x == root(x); }
ll size(ll x) { return -data[root(x)]; }
ll size() {
ll cnt = 0;
rep(i, data.size()) if (isroot(i)) cnt++;
return cnt;
}
};
signed main() {
ll N, A, B;
cin >> N >> A >> B;
ll X[N];
rep(i, N) cin >> X[i];
UFS uf(N);
ll imos[2 * N + 2];
rep(i, 2 * N + 2) imos[i] = 0;
rep(i, N) {
ll iter1 = lower_bound(X, X + N, X[i] - B) - X;
ll iter2 = lower_bound(X, X + N, X[i] - A + 1) - X;
if (iter1 != iter2) {
uf.unite(i, iter1), uf.unite(i, iter2 - 1);
imos[iter1 * 2]++, imos[iter2 * 2 - 1]--;
}
}
dec(i, N - 1, 0) {
ll iter1 = lower_bound(X, X + N, X[i] + A) - X;
ll iter2 = lower_bound(X, X + N, X[i] + B + 1) - X;
if (iter1 != iter2) {
uf.unite(i, iter1), uf.unite(i, iter2 - 1);
imos[iter1 * 2]++, imos[iter2 * 2 - 1]--;
}
}
rep(i, 2 * N + 1) imos[i + 1] += imos[i];
rep(i, N - 1) if (imos[i * 2 + 1] and imos[i * 2 + 2]) uf.unite(i, i + 1);
rep(i, N) cout << uf.size(i) << rt;
}