結果

問題 No.318 学学学学学
ユーザー yuji9511yuji9511
提出日時 2020-09-28 22:51:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 163 ms / 2,000 ms
コード長 6,528 bytes
コンパイル時間 2,355 ms
コンパイル使用メモリ 215,920 KB
実行使用メモリ 19,512 KB
最終ジャッジ日時 2023-09-15 15:29:04
合計ジャッジ時間 7,565 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
6,724 KB
testcase_01 AC 25 ms
8,148 KB
testcase_02 AC 29 ms
8,396 KB
testcase_03 AC 20 ms
7,344 KB
testcase_04 AC 26 ms
8,200 KB
testcase_05 AC 163 ms
19,476 KB
testcase_06 AC 128 ms
14,612 KB
testcase_07 AC 116 ms
13,808 KB
testcase_08 AC 100 ms
12,952 KB
testcase_09 AC 85 ms
12,488 KB
testcase_10 AC 60 ms
11,372 KB
testcase_11 AC 161 ms
19,512 KB
testcase_12 AC 113 ms
14,728 KB
testcase_13 AC 91 ms
13,724 KB
testcase_14 AC 75 ms
12,868 KB
testcase_15 AC 60 ms
12,016 KB
testcase_16 AC 42 ms
11,300 KB
testcase_17 AC 95 ms
14,852 KB
testcase_18 AC 82 ms
14,652 KB
testcase_19 AC 93 ms
14,592 KB
testcase_20 AC 40 ms
11,284 KB
testcase_21 AC 3 ms
5,736 KB
testcase_22 AC 4 ms
5,856 KB
testcase_23 AC 4 ms
5,736 KB
testcase_24 AC 3 ms
5,732 KB
testcase_25 AC 4 ms
5,784 KB
testcase_26 AC 3 ms
5,720 KB
testcase_27 AC 4 ms
5,728 KB
testcase_28 AC 3 ms
5,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << "\n"

int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

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) {}
    lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = 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 >> 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();
    }
};

using S = ll;
ll ID = INF+1;
using F = ll;
S op(S a, S b){
    return a+b;
}

S e(){
    return 0;
}

S mapping(F f, S x){
    if(f == ID){
        return x;
    }else{
        return f;
    }
}

F composition(F f, F g){
    if(f == ID){
        return g;
    }else{
        return f;
    }
}

F id(){
    return ID;
}

void solve(){
    ll N;
    cin >> N;
    vector<ll> a(N);
    rep(i,0,N) cin >> a[i];
    vector<ll> x;
    x.push_back(-INF);
    x.push_back(INF);
    rep(i,0,N) x.push_back(a[i]);
    sort(x.begin(), x.end());
    map<ll,ll> mp;
    rep(i,0,N){
        ll idx = lower_bound(x.begin(), x.end(), a[i]) - x.begin();
        mp[idx] = a[i];
        a[i] = idx;
    }

    vector<ll> b[100010];
    rep(i,0,N) b[a[i]].push_back(i);
    lazy_segtree<S, op, e, F, mapping, composition, id> sg(a);
    rep(i,0,100001){
        if(b[i].size() >= 2){
            ll l = b[i][0], r = b[i][b[i].size()-1];
            sg.apply(l, r+1, mp[i]);
        }else if(b[i].size() == 1){
            ll l = b[i][0];
            sg.apply(l, l+1, mp[i]);
        }
    }
    rep(i,0,N){
        cout << sg.get(i) << " \n"[i==N-1];
    }

    
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}
0