#961509 (C++17) No.2690 A present from B (Hard)

提出ソース

結果

問題	No.2690 A present from B (Hard)
ユーザー	👑 potato167
提出日時	2024-03-17 23:42:19
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	524 ms / 2,000 ms
コード長	8,717 bytes
コンパイル時間	2,572 ms
コンパイル使用メモリ	213,684 KB
実行使用メモリ	14,568 KB
最終ジャッジ日時	2024-03-17 23:42:28
合計ジャッジ時間	9,359 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	3 ms 6,676 KB
testcase_05	AC	2 ms 6,676 KB
testcase_06	AC	495 ms 14,568 KB
testcase_07	AC	524 ms 14,568 KB
testcase_08	AC	498 ms 14,568 KB
testcase_09	AC	16 ms 6,676 KB
testcase_10	AC	17 ms 6,676 KB
testcase_11	AC	14 ms 6,676 KB
testcase_12	AC	2 ms 6,676 KB
testcase_13	AC	2 ms 6,676 KB
testcase_14	AC	2 ms 6,676 KB
testcase_15	AC	2 ms 6,676 KB
testcase_16	AC	2 ms 6,676 KB
testcase_17	AC	434 ms 8,960 KB
testcase_18	AC	221 ms 13,464 KB
testcase_19	AC	128 ms 13,560 KB
testcase_20	AC	439 ms 6,676 KB
testcase_21	AC	101 ms 13,664 KB
testcase_22	AC	86 ms 8,620 KB
testcase_23	AC	204 ms 13,760 KB
testcase_24	AC	254 ms 6,676 KB
testcase_25	AC	78 ms 13,008 KB
testcase_26	AC	358 ms 13,512 KB
testcase_27	AC	468 ms 14,568 KB
testcase_28	AC	462 ms 14,568 KB
testcase_29	AC	488 ms 14,568 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(ll)(a);i<(ll)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


namespace atcoder {

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

}  // namespace atcoder
using namespace atcoder;


struct lazy_S {
    ll val;
	ll A;
    ll B;
};

struct lazy_F{
    ll x;
    ll y;
};

lazy_S lazy_op(lazy_S l, lazy_S r) {
    return lazy_S{
        min(l.val,r.val),min(l.A,r.A),min(l.B,r.B)
    };
}

lazy_S lazy_e() { return lazy_S{INF,INF,INF}; }

lazy_S mapping(lazy_F l, lazy_S r) {
	chmin(r.val,r.A+l.x);
    chmin(r.val,r.B+l.y);
    return r;
}

//l(r(x))
lazy_F composition(lazy_F l, lazy_F r) {
	return {min(l.x,r.x),min(l.y,r.y)};
}

lazy_F lazy_id(){return {ILL,ILL};}

#define lazy_calc lazy_S,lazy_op,lazy_e,lazy_F,mapping,composition,lazy_id

void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N,M;
    cin>>N>>M;
    vector<ll> A(M);
    rep(i,0,M) cin>>A[i];
    lazy_segtree<lazy_calc> seg(N);
    rep(i,0,N) seg.set(i,{i,i,-i});
    auto f=[&](lazy_S a) -> void {
        seg.apply(a.A,N,{a.val-a.A,ILL});
        seg.apply(0,a.A,{ILL,a.val-a.B});
    };
    for(int i=M-1;i>=0;i--){
        A[i]--;
        auto tmp1=seg.get(A[i]);
        auto tmp2=seg.get(A[i]+1);
        seg.set(A[i],{INF,A[i],-A[i]});
        seg.set(A[i]+1,{INF,A[i]+1,-A[i]-1});
        swap(tmp1.val,tmp2.val);
        f(tmp1);
        f(tmp2);
        rep(j,A[i]-1,A[i]+1) if(0<=j&&j<N) f(seg.get(j));
    }
    rep(i,1,N){
        if(i!=1) cout<<" ";
        cout<<seg.get(i).val;
    }
    cout<<"\n";
    /*
    vector<int> ans(N,INF);
    ans[0]=0;
    auto f=[&]() -> void {
        rep(i,0,N-1) chmin(ans[i+1],ans[i]+1);
        for(int i=N-1;i>0;i--) chmin(ans[i-1],ans[i]+1);
    };
    for(int i=M-1;i>=0;i--) {
        f();
        swap(ans[A[i]-1],ans[A[i]]);
    }
    f();
    rep(i,1,N){
        if(i!=1) cout<<" ";
        cout<<ans[i];
    }
    cout<<"\n";
    return ;*/

}

yukicoder

結果

テストケース

ソースコード