結果

問題 No.2650 [Cherry 6th Tune *] セイジャク
ユーザー k1suxuk1suxu
提出日時 2024-02-23 21:48:21
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 336 ms / 2,500 ms
コード長 7,583 bytes
コンパイル時間 3,406 ms
コンパイル使用メモリ 260,272 KB
実行使用メモリ 23,296 KB
最終ジャッジ日時 2024-02-23 21:48:50
合計ジャッジ時間 13,281 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge16
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,676 KB
testcase_01 AC 2 ms
6,676 KB
testcase_02 AC 145 ms
8,228 KB
testcase_03 AC 30 ms
6,676 KB
testcase_04 AC 175 ms
14,732 KB
testcase_05 AC 140 ms
13,452 KB
testcase_06 AC 69 ms
8,440 KB
testcase_07 AC 143 ms
13,820 KB
testcase_08 AC 60 ms
6,676 KB
testcase_09 AC 309 ms
23,296 KB
testcase_10 AC 312 ms
23,296 KB
testcase_11 AC 310 ms
23,296 KB
testcase_12 AC 336 ms
23,296 KB
testcase_13 AC 313 ms
23,296 KB
testcase_14 AC 328 ms
23,296 KB
testcase_15 AC 310 ms
23,296 KB
testcase_16 AC 293 ms
23,296 KB
testcase_17 AC 292 ms
23,292 KB
testcase_18 AC 317 ms
23,296 KB
testcase_19 AC 293 ms
23,296 KB
testcase_20 AC 302 ms
23,296 KB
testcase_21 AC 291 ms
23,296 KB
testcase_22 AC 294 ms
23,296 KB
testcase_23 AC 269 ms
23,296 KB
testcase_24 AC 280 ms
23,296 KB
testcase_25 AC 268 ms
23,296 KB
testcase_26 AC 267 ms
23,296 KB
testcase_27 AC 281 ms
23,296 KB
testcase_28 AC 275 ms
23,296 KB
testcase_29 AC 270 ms
23,296 KB
testcase_30 AC 291 ms
23,296 KB
testcase_31 AC 283 ms
23,296 KB
testcase_32 AC 191 ms
9,336 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

namespace internal {

// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
constexpr int bsf_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

template <class S,
          S (*op)(S, S),
          S (*e)(),
          class F,
          S (*mapping)(F, S),
          F (*composition)(F, F),
          F (*id)()>
struct lazy_segtree {
  public:
    lazy_segtree() : lazy_segtree(0) {}
    explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    explicit lazy_segtree(const std::vector<S>& v) : _n(v.size()) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }

        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    template <bool (*g)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return g(x); });
    }
    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= _n);
        assert(g(e()));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (g(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*g)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return g(x); });
    }
    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= _n);
        assert(g(e()));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
};

//ref: https://atcoder.github.io/ac-library/document_ja/lazysegtree.html
using S = int;
S op(S x, S y) {
    return max(x, y);
}
S e() {
    return -1;
}
using F = int;
S mapping(F f, S x) {
    if(f == -1) return x;
    return f;
}
F composition(F f, F g) {
    if(f == -1) return g;
    return f;
}
F id() {
    return -1;
}

void solve() {
    int n, a;
    cin >> n >> a;
    vi x(n);
    FOR(n) cin >> x[i];
    int t;
    cin >> t;
    vi l(t), r(t);
    FOR(t) {
        cin >> l[i] >> r[i];
        ++r[i];
    }

    vi val;
    for(auto e : x) val.push_back(e);
    for(auto e : l) val.push_back(e);
    for(auto e : r) val.push_back(e);
    sort(all(val));
    val.erase(unique(all(val)), val.end());
    for(auto &e : x) e = (int)(lower_bound(all(val), e) - val.begin());
    for(auto &e : l) e = (int)(lower_bound(all(val), e) - val.begin());
    for(auto &e : r) e = (int)(lower_bound(all(val), e) - val.begin());

    lazy_segtree<S, op, e, F, mapping, composition, id> seg((int)val.size());
    FOR(t) seg.apply(l[i], r[i], i+1);

    FOR(n) cout << seg.get(x[i]) << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}
0