#939309 (C++17) No.2592 おでぶなおばけさん 2

提出ソース

結果

問題	No.2592 おでぶなおばけさん 2
ユーザー	👑 Nachia
提出日時	2023-12-20 00:41:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	10,275 bytes
コンパイル時間	1,216 ms
コンパイル使用メモリ	116,164 KB
実行使用メモリ	10,264 KB
最終ジャッジ日時	2024-09-27 09:17:37
合計ジャッジ時間	15,128 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	27 ms 6,944 KB
testcase_02	AC	39 ms 6,944 KB
testcase_03	AC	15 ms 6,944 KB
testcase_04	AC	17 ms 6,940 KB
testcase_05	AC	63 ms 10,080 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	AC	94 ms 6,944 KB
testcase_14	AC	95 ms 6,944 KB
testcase_15	AC	78 ms 6,940 KB
testcase_16	AC	94 ms 6,940 KB
testcase_17	AC	103 ms 9,812 KB
testcase_18	AC	78 ms 6,944 KB
testcase_19	AC	66 ms 6,944 KB
testcase_20	AC	96 ms 6,940 KB
testcase_21	AC	71 ms 6,940 KB
testcase_22	AC	112 ms 9,848 KB
testcase_23	AC	102 ms 9,944 KB
testcase_24	AC	88 ms 6,940 KB
testcase_25	AC	58 ms 6,944 KB
testcase_26	AC	59 ms 6,940 KB
testcase_27	AC	118 ms 10,088 KB
testcase_28	AC	116 ms 10,108 KB
testcase_29	AC	120 ms 10,112 KB
testcase_30	AC	119 ms 9,996 KB
testcase_31	AC	120 ms 10,112 KB
testcase_32	AC	119 ms 10,136 KB
testcase_33	AC	120 ms 10,208 KB
testcase_34	AC	119 ms 10,000 KB
testcase_35	AC	119 ms 10,000 KB
testcase_36	AC	118 ms 10,208 KB
testcase_37	AC	133 ms 10,028 KB
testcase_38	AC	131 ms 10,144 KB
testcase_39	AC	130 ms 10,112 KB
testcase_40	AC	131 ms 10,224 KB
testcase_41	AC	130 ms 10,000 KB
testcase_42	AC	132 ms 10,148 KB
testcase_43	AC	119 ms 10,024 KB
testcase_44	AC	120 ms 10,024 KB
testcase_45	AC	119 ms 10,120 KB
testcase_46	AC	117 ms 10,088 KB
testcase_47	AC	121 ms 10,120 KB
testcase_48	AC	121 ms 10,264 KB
testcase_49	AC	121 ms 10,188 KB
testcase_50	AC	120 ms 10,176 KB
testcase_51	AC	121 ms 10,092 KB
testcase_52	AC	102 ms 10,164 KB
testcase_53	AC	102 ms 10,168 KB
testcase_54	AC	102 ms 10,152 KB
testcase_55	AC	102 ms 10,164 KB
testcase_56	AC	103 ms 10,196 KB
testcase_57	AC	51 ms 10,136 KB
testcase_58	AC	133 ms 10,088 KB
testcase_59	AC	132 ms 10,132 KB
testcase_60	AC	131 ms 10,224 KB
testcase_61	AC	134 ms 10,208 KB
testcase_62	AC	135 ms 10,144 KB
testcase_63	AC	132 ms 10,120 KB
testcase_64	AC	134 ms 10,064 KB
testcase_65	AC	124 ms 10,120 KB
testcase_66	AC	125 ms 10,120 KB
testcase_67	AC	125 ms 10,128 KB
testcase_68	AC	124 ms 10,112 KB
testcase_69	AC	124 ms 10,088 KB
testcase_70	AC	124 ms 10,092 KB
testcase_71	AC	127 ms 10,228 KB
testcase_72	AC	126 ms 10,116 KB
testcase_73	AC	127 ms 10,160 KB
testcase_74	AC	2 ms 6,940 KB
testcase_75	AC	118 ms 10,060 KB
testcase_76	AC	118 ms 10,020 KB
testcase_77	AC	119 ms 10,216 KB
testcase_78	AC	118 ms 10,136 KB
testcase_79	AC	120 ms 10,116 KB
testcase_80	AC	118 ms 10,124 KB
testcase_81	AC	118 ms 10,060 KB
testcase_82	AC	118 ms 10,024 KB
testcase_83	AC	118 ms 10,028 KB

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

ソースコード

raw source code

#ifdef NACHIA
// #define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 3001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;
using Modint = atcoder::static_modint<998244353>;

#include <iterator>
#include <functional>

template<class Elem> struct vec;

template<class Iter>
struct seq_view{
    using Ref = typename std::iterator_traits<Iter>::reference;
    using Elem = typename std::iterator_traits<Iter>::value_type;
    Iter a, b;
    Iter begin() const { return a; }
    Iter end() const { return b; }
    int size() const { return (int)(b-a); }
    seq_view(Iter first, Iter last) : a(first), b(last) {}
    seq_view sort() const { std::sort(a, b); return *this; }
    Ref& operator[](int x){ return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(size()); for(int i=0; i<size(); i++) x[i] = i;
        x().sort([&](int l, int r){ return f(a[l],a[r]); });
        return x;
    }
    template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }
    template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>
    ret rle(F eq = F()) const {
        auto x = ret();
        for(auto& a : (*this)){
            if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;
        } return x;
    }
    template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }
    Iter uni() const { return std::unique(a, b); }
    Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }
    Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }
    int lbi(const Elem& x) const { return lb(x) - a; }
    int ubi(const Elem& x) const { return ub(x) - a; }
    seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }
    template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }
    template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }
    template<class F> Iter when_true_to_false(F f) const {
        if(a == b) return a;
        return std::lower_bound(a, b, *a,
            [&](const Elem& x, const Elem&){ return f(x); });
    }
    seq_view same(Elem x) const { return { lb(x), ub(x) }; }
    template<class F> auto map(F f) const {
        vec<typename Iter::value_type> r;
        for(auto& x : *this) r.emp(f(x));
        return r;
    }
    Iter max() const { return std::max_element(a, b); }
    Iter min() const { return std::min_element(a, b); }
    template<class F = std::less<Elem>>
    Iter min(F f) const { return std::min_element(a, b, f); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

template<class Elem>
struct vec {
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using CIter = typename Base::const_iterator;
    using View = seq_view<Iter>;
    using CView = seq_view<CIter>;

    vec(){}
    explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}
    template <class I2> vec(I2 first, I2 last) : a(first, last) {}
    vec(std::initializer_list<Elem> il) : a(std::move(il)) {}
    vec(Base b) : a(std::move(b)) {}
    operator Base() const { return a; }

    Iter begin(){ return a.begin(); }
    CIter begin() const { return a.begin(); }
    Iter end(){ return a.end(); }
    CIter end() const { return a.end(); }
    int size() const { return a.size(); }
    bool empty() const { return a.empty(); }
    Elem& back(){ return a.back(); }
    const Elem& back() const { return a.back(); }
    vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }
    Iter operator()(int x){ return a.begin() + x; }
    CIter operator()(int x) const { return a.begin() + x; }
    View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }
    CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }
    View operator()(){ return (*this)(0,size()); }
    CView operator()() const { return (*this)(0,size()); }
    Elem& operator[](int x){ return a[x]; }
    const Elem& operator[](int x) const { return a[x]; }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    template<class Range>
    vec& app(Range& x){ for(auto& v : a) emp(v); }
    Elem pop(){
        Elem x = std::move(a.back());
        a.pop_back(); return x;
    }
    bool operator==(const vec& r) const { return a == r.a; }
    bool operator!=(const vec& r) const { return a != r.a; }
    bool operator<(const vec& r) const { return a < r.a; }
    bool operator<=(const vec& r) const { return a <= r.a; }
    bool operator>(const vec& r) const { return a > r.a; }
    bool operator>=(const vec& r) const { return a >= r.a; }
    vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }
    template<class F> vec& filter(F f){
        int p = 0;
        for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);
        a.resize(p); return *this;
    }
private: Base a;
};

template<class IStr, class U, class T>
IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }
template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
template<class OStr, class T>
OStr& operator<<(OStr& os, const vec<T>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << v[i];
    } return os;
}

namespace nachia{

template<
    class S,
    S op(S l, S r)
>
struct Segtree {
private:
    int N;
    std::vector<S> A;
    int xN;

    void mergev(int i){
        if(i < N) A[i] = op(A[i*2], A[i*2+1]);
    }

    template<class E>
    int minLeft2(int r, E cmp, int a = 0, int b = 0, int i = -1) const {
        static S x;
        if(i == -1){ a=0; b=N; i=1; x=A[0]; }
        if(r <= a) return a;
        if(b <= r){
            S nx = op(A[i], x);
            if(cmp(nx)){ x = nx; return a; }
        }
        if(b - a == 1) return b;
        int q = minLeft2(r, cmp, (a+b)/2, b, i*2+1);
        if(q > (a+b)/2) return q;
        return minLeft2(r, cmp, a, (a+b)/2, i*2);
    }
    
    template<class E>
    int maxRight2(int l, E cmp, int a = 0, int b = 0, int i = -1) const {
        static S x;
        if(i == -1){ a=0; b=N; i=1; x=A[0]; }
        if(b <= l) return b;
        if(l <= a){
            S nx = op(x, A[i]);
            if(cmp(nx)){ x = nx; return b; }
        }
        if(b - a == 1) return a;
        int q = maxRight2(l, cmp, a, (a+b)/2, i*2);
        if(q < (a+b)/2) return q;
        return maxRight2(l, cmp, (a+b)/2, b, i*2+1);
    }

public:
    Segtree() : N(0) {}
    Segtree(int n, S e) : xN(n) {
        N = 1; while (N < n) N *= 2;
        A.assign(N * 2, e);
    }
    Segtree(const std::vector<S>& a, S e) : Segtree(a.size(), e){
        for(int i=0; i<(int)a.size(); i++) A[i + N] = a[i];
        for(int i=N-1; i>=1; i--) mergev(i);
    }

    void set(int p, S x){
        p += N; A[p] = x;
        for(int d=1; (1<<d)<=N; d++) mergev(p>>d);
    }

    S get(int p) const { return A[N+p]; }

    S prod(int l, int r) const {
        l += N; r += N;
        S ql = A[0], qr = A[0];
        while(l<r){
            if(l&1) ql = op(ql, A[l++]);
            if(r&1) qr = op(A[--r], qr);
            l /= 2;
            r /= 2;
        }
        return op(ql, qr);
    }

    S allProd() const { return A[1]; }

    // bool cmp(S)
    template<class E>
    int minLeft(int r, E cmp) const {
        return minLeft2(r, cmp);
    }

    // bool cmp(S)
    template<class E>
    int maxRight(int l, E cmp) const {
        int x = maxRight2(l, cmp);
        return x > xN ? xN : x;
    }
};

} // namespace nachia

i64 infmult(i64 l, i64 r){
    if(l == 0 || r == 0) return 0;
    if(l == INF || r == INF) return INF;
    if(INF / abs(l) < abs(r)) return INF;
    return l * r;
}
i64 infadd(i64 l, i64 r){
    if(l == INF || r == INF) return INF;
    if(abs(l + r) >= INF) return INF;
    return l + r;
}
i64 nearest_shift(i64 tg, i64 s, i64 x){
    i64 dif = tg - x + s/2;
    return dif / s + (dif >= 0 ? 0 : 1);
}
struct S{
    i64 r;
    i64 x;
    i64 sh;
    i64 apply(i64 i){ return infadd(infmult(i, r), x); }
    void regular(){
        if(x == INF || sh == INF){
            r = INF;
            x = INF;
            sh = INF;
        }
        if(r != INF){
            i64 f = nearest_shift(x, r, 0);
            sh += f; x += f * r;
        }
    }
};
S mergeS(S l, S r){
    if(r.x == INF || l.x == INF || r.sh == INF || l.sh == INF){ return { INF, INF, 0 }; }
    i64 fr = infmult(l.r, r.r);
    if(r.r == INF){
        return { fr, l.apply(r.x - l.sh), r.sh };
    }
    i64 t = nearest_shift(l.sh, r.r, r.x);
    S res = { fr, l.apply(r.x + t * r.r - l.sh), r.sh + t };
    res.regular();
    return res;
}

void testcase(){
    i64 N,Q,K; cin >> N >> Q >> K;
    vec<i64> A(N); cin >> A;
    auto st = nachia::Segtree<S, mergeS>(N, {1,0,0});
    rep(i,N){
        S a = { K,A[i],0 };
        a.regular();
        st.set(i, a);
    }
    rep(i,Q){
        int l,r; cin >> l >> r; l--;
        auto f = st.prod(l, r);
        i64 res = f.apply(-f.sh);
        if(res == 0){
            cout << "No\n";
        } else {
            cout << "Yes\n";
        }
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

ソースコード