結果

問題 No.1170 Never Want to Walk
ユーザー satashun
提出日時 2020-08-14 21:34:41
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 546 ms / 2,000 ms
コード長 2,642 bytes
コンパイル時間 2,713 ms
コンパイル使用メモリ 214,524 KB
最終ジャッジ日時 2025-01-12 23:23:33
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
int main() {
    int N, A, B;
    cin >> N >> A >> B;
    V<int> x(N);
    set<int> st;
    rep(i, N) {
        cin >> x[i];
        st.insert(x[i]);
    }
    map<int, int> ans;
    rep(i, N) {
        if (!st.count(x[i])) {
            cout << ans[x[i]] << endl;
            continue;
        }
        queue<int> que;
        que.push(x[i]);
        V<int> used;
        while (!que.empty()) {
            int v = que.front();
            que.pop();
            st.erase(v);
            used.pb(v);
            for (auto it = st.lower_bound(v - B); it != st.end();) {
                if (*it > v - A) break;
                que.push(*it);
                it = st.erase(it);
            }
            for (auto it = st.lower_bound(v + A); it != st.end();) {
                if (*it > v + B) break;
                que.push(*it);
                it = st.erase(it);
            }
        }
        sort(ALL(used));
        used.erase(unique(ALL(used)), used.end());
        int num = used.size();
        for (int x : used) {
            ans[x] = num;
        }
        cout << num << endl;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0