結果

問題 No.2170 Left Addition Machine
ユーザー tko919tko919
提出日時 2022-12-22 04:02:56
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 152 ms / 2,000 ms
コード長 7,400 bytes
コンパイル時間 2,456 ms
コンパイル使用メモリ 205,632 KB
実行使用メモリ 5,596 KB
最終ジャッジ日時 2023-08-11 13:00:13
合計ジャッジ時間 17,949 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 129 ms
5,332 KB
testcase_04 AC 49 ms
4,376 KB
testcase_05 AC 76 ms
4,380 KB
testcase_06 AC 75 ms
4,600 KB
testcase_07 AC 117 ms
4,508 KB
testcase_08 AC 18 ms
4,384 KB
testcase_09 AC 93 ms
4,380 KB
testcase_10 AC 13 ms
4,380 KB
testcase_11 AC 57 ms
4,428 KB
testcase_12 AC 142 ms
5,392 KB
testcase_13 AC 141 ms
5,596 KB
testcase_14 AC 142 ms
5,484 KB
testcase_15 AC 143 ms
5,468 KB
testcase_16 AC 138 ms
5,284 KB
testcase_17 AC 140 ms
5,276 KB
testcase_18 AC 142 ms
5,280 KB
testcase_19 AC 142 ms
5,408 KB
testcase_20 AC 140 ms
5,412 KB
testcase_21 AC 70 ms
4,380 KB
testcase_22 AC 71 ms
4,376 KB
testcase_23 AC 70 ms
4,380 KB
testcase_24 AC 73 ms
4,380 KB
testcase_25 AC 71 ms
4,380 KB
testcase_26 AC 73 ms
4,376 KB
testcase_27 AC 71 ms
4,380 KB
testcase_28 AC 72 ms
4,380 KB
testcase_29 AC 70 ms
4,380 KB
testcase_30 AC 141 ms
5,412 KB
testcase_31 AC 142 ms
5,480 KB
testcase_32 AC 141 ms
5,396 KB
testcase_33 AC 147 ms
5,592 KB
testcase_34 AC 152 ms
5,348 KB
testcase_35 AC 145 ms
5,340 KB
testcase_36 AC 143 ms
5,416 KB
testcase_37 AC 148 ms
5,284 KB
testcase_38 AC 145 ms
5,332 KB
testcase_39 AC 66 ms
4,376 KB
testcase_40 AC 66 ms
4,384 KB
testcase_41 AC 66 ms
4,376 KB
testcase_42 AC 68 ms
4,376 KB
testcase_43 AC 70 ms
4,384 KB
testcase_44 AC 68 ms
4,380 KB
testcase_45 AC 68 ms
4,380 KB
testcase_46 AC 69 ms
4,380 KB
testcase_47 AC 69 ms
4,376 KB
testcase_48 AC 138 ms
5,412 KB
testcase_49 AC 133 ms
5,396 KB
testcase_50 AC 137 ms
5,344 KB
testcase_51 AC 134 ms
5,408 KB
testcase_52 AC 142 ms
5,416 KB
testcase_53 AC 120 ms
5,468 KB
testcase_54 AC 138 ms
5,472 KB
testcase_55 AC 147 ms
5,396 KB
testcase_56 AC 144 ms
5,408 KB
testcase_57 AC 142 ms
5,404 KB
testcase_58 AC 138 ms
5,416 KB
testcase_59 AC 143 ms
5,392 KB
testcase_60 AC 147 ms
5,288 KB
testcase_61 AC 139 ms
5,484 KB
testcase_62 AC 138 ms
5,332 KB
testcase_63 AC 146 ms
5,388 KB
testcase_64 AC 150 ms
5,288 KB
testcase_65 AC 142 ms
5,396 KB
testcase_66 AC 8 ms
4,384 KB
testcase_67 AC 131 ms
5,408 KB
testcase_68 AC 144 ms
5,284 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...); 
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...); 
    }
};

/**
 * @brief Fast IO
 */
#line 3 "sol.cpp"

#line 2 "library/Math/modint.hpp"

template<int mod=1000000007>struct fp {
    int v; static int get_mod(){return mod;}
    int inv() const{
        int tmp,a=v,b=mod,x=1,y=0;
        while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
        if(x<0){x+=mod;} return x;
    }
    fp(ll x=0){init(x%mod+mod);}
    fp& init(ll x){v=(x<mod?x:x-mod); return *this;}
    fp operator-()const{return fp()-*this;}
    fp pow(ll t){assert(t>=0); fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
    fp& operator+=(const fp& x){return init(v+x.v);}
    fp& operator-=(const fp& x){return init(v+mod-x.v);}
    fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
    fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
    fp operator+(const fp& x)const{return fp(*this)+=x;}
    fp operator-(const fp& x)const{return fp(*this)-=x;}
    fp operator*(const fp& x)const{return fp(*this)*=x;}
    fp operator/(const fp& x)const{return fp(*this)/=x;}
    bool operator==(const fp& x)const{return v==x.v;}
    bool operator!=(const fp& x)const{return v!=x.v;}
    friend istream& operator>>(istream& is,fp& x){return is>>x.v;}
    friend ostream& operator<<(ostream& os,const fp& x){return os<<x.v;}
};
template<typename T>struct factorial {
    vector<T> Fact,Finv,Inv;
    factorial(int maxx){
        Fact.resize(maxx); Finv.resize(maxx); Inv.resize(maxx);
        Fact[0]=Fact[1]=Finv[0]=Finv[1]=Inv[1]=1;
        rep(i,2,maxx){Fact[i]=Fact[i-1]*i;} Finv[maxx-1]=Fact[maxx-1].inv();
        for(int i=maxx-1;i>=2;i--){Finv[i-1]=Finv[i]*i; Inv[i]=Finv[i]*Fact[i-1];}
    }
    T fact(int n,bool inv=0){if(n<0)return 0; return (inv?Finv[n]:Fact[n]);}
    T inv(int n){if(n<0)return 0; return Inv[n];}
    T nPr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(n-r,inv^1);}
    T nCr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(r,inv^1)*fact(n-r,inv^1);}
    T nHr(int n,int r,bool inv=0){return nCr(n+r-1,r,inv);}
};

/**
 * @brief Modint
 */
#line 5 "sol.cpp"
using Fp=fp<998244353>;

FastIO io;
int main(){
    int n,q;
    io.read(n,q);
    vector<int> a(n);
    io.read(a);

    vector<int> inc(n);
    vector<Fp> rui(n+1);
    rep(i,0,n-1)inc[i+1]=(a[i+1]>a[i])+inc[i];
    rep(i,0,n)rui[i+1]=Fp(2).pow(i)*a[i]+rui[i];

    while(q--){
        int L,R;
        io.read(L,R);
        L--;
        int lb=L-1,rb=R;
        while(rb-lb>1){
            int mid=(lb+rb)>>1;
            if(inc[R-1]-inc[mid]<R-1-mid)lb=mid;
            else rb=mid;
        }
        Fp ret=rui[R]-rui[rb+1];
        ret/=Fp(2).pow(rb+1);
        ret+=a[rb];
        io.write(ret.v);
    }
    return 0;
}
0