#827534 (C++17) No.2170 Left Addition Machine

提出ソース

結果

問題	No.2170 Left Addition Machine
ユーザー	snuke
提出日時	2022-12-22 02:13:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	299 ms / 2,000 ms
コード長	5,940 bytes
コンパイル時間	2,504 ms
コンパイル使用メモリ	214,072 KB
実行使用メモリ	16,000 KB
最終ジャッジ日時	2024-04-29 05:23:27
合計ジャッジ時間	19,865 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	215 ms 11,008 KB
testcase_04	AC	48 ms 5,376 KB
testcase_05	AC	114 ms 6,912 KB
testcase_06	AC	128 ms 8,320 KB
testcase_07	AC	176 ms 8,576 KB
testcase_08	AC	52 ms 6,656 KB
testcase_09	AC	104 ms 5,376 KB
testcase_10	AC	16 ms 5,376 KB
testcase_11	AC	99 ms 7,424 KB
testcase_12	AC	239 ms 11,264 KB
testcase_13	AC	234 ms 11,136 KB
testcase_14	AC	245 ms 11,264 KB
testcase_15	AC	249 ms 11,136 KB
testcase_16	AC	241 ms 11,264 KB
testcase_17	AC	247 ms 11,136 KB
testcase_18	AC	244 ms 11,264 KB
testcase_19	AC	248 ms 11,264 KB
testcase_20	AC	233 ms 11,136 KB
testcase_21	AC	64 ms 5,376 KB
testcase_22	AC	65 ms 5,376 KB
testcase_23	AC	63 ms 5,376 KB
testcase_24	AC	64 ms 5,376 KB
testcase_25	AC	59 ms 5,376 KB
testcase_26	AC	65 ms 5,376 KB
testcase_27	AC	65 ms 5,376 KB
testcase_28	AC	60 ms 5,376 KB
testcase_29	AC	65 ms 5,376 KB
testcase_30	AC	150 ms 6,528 KB
testcase_31	AC	143 ms 6,784 KB
testcase_32	AC	134 ms 6,656 KB
testcase_33	AC	141 ms 6,656 KB
testcase_34	AC	139 ms 6,784 KB
testcase_35	AC	142 ms 6,784 KB
testcase_36	AC	143 ms 6,784 KB
testcase_37	AC	140 ms 6,656 KB
testcase_38	AC	139 ms 6,656 KB
testcase_39	AC	52 ms 5,376 KB
testcase_40	AC	51 ms 5,376 KB
testcase_41	AC	52 ms 5,376 KB
testcase_42	AC	52 ms 5,376 KB
testcase_43	AC	51 ms 5,376 KB
testcase_44	AC	49 ms 5,376 KB
testcase_45	AC	51 ms 5,376 KB
testcase_46	AC	52 ms 5,376 KB
testcase_47	AC	51 ms 5,376 KB
testcase_48	AC	138 ms 6,656 KB
testcase_49	AC	135 ms 6,656 KB
testcase_50	AC	142 ms 6,656 KB
testcase_51	AC	137 ms 6,784 KB
testcase_52	AC	136 ms 6,656 KB
testcase_53	AC	136 ms 6,656 KB
testcase_54	AC	138 ms 6,656 KB
testcase_55	AC	140 ms 6,528 KB
testcase_56	AC	138 ms 6,656 KB
testcase_57	AC	275 ms 15,872 KB
testcase_58	AC	273 ms 15,872 KB
testcase_59	AC	276 ms 16,000 KB
testcase_60	AC	299 ms 16,000 KB
testcase_61	AC	276 ms 16,000 KB
testcase_62	AC	270 ms 16,000 KB
testcase_63	AC	269 ms 16,000 KB
testcase_64	AC	266 ms 16,000 KB
testcase_65	AC	279 ms 15,872 KB
testcase_66	AC	20 ms 5,376 KB
testcase_67	AC	218 ms 16,000 KB
testcase_68	AC	277 ms 15,872 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// Mod int
const uint mod = 998244353;
struct mint {
  uint x;
  mint(): x(0) {}
  mint(ll x):x((x%mod+mod)%mod) {}
  mint operator-() const { return mint(0) - *this;}
  mint operator~() const { return mint(1) / *this;}
  mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;}
  mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;}
  mint operator+(const mint& a) const { return mint(*this) += a;}
  mint operator-(const mint& a) const { return mint(*this) -= a;}
  mint operator*(const mint& a) const { return mint(*this) *= a;}
  mint operator/(const mint& a) const { return mint(*this) /= a;}
  mint pow(ll t) const {
    mint res = 1; for (mint p=x;t;p*=p,t>>=1) if (t&1) res *= p; return res;
  }
  mint ppow(ll t) const { int p=mod-1; return pow((t%p+p)%p);}
  bool operator<(const mint& a) const { return x < a.x;}
  bool operator==(const mint& a) const { return x == a.x;}
  bool operator!=(const mint& a) const { return x != a.x;}
};
mint ex(mint x, ll t) { return x.pow(t);}
istream& operator>>(istream&i,mint&a) {i>>a.x;return i;}
//*
ostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;}
/*/
ostream& operator<<(ostream&o, const mint&x) {
  int a = x.x, b = 1;
  rep(s,2)rep1(i,1000) {
    int y = ((s?-x:x)*i).x; if (abs(a)+b > y+i) a = s?-y:y, b = i;
  }
  o<<a; if (b != 1) o<<'/'<<b; return o;
}//*/
using vm = vector<mint>;
using vvm = vector<vm>;
struct modinv {
  int n; vm d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(-d[mod%n]*(mod/n)), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vm d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} facs;
struct modfactinv {
  int n; vm d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} ifacs;
mint comb(int a, int b) {
  if (a < b || b < 0) return 0;
  return facs(a)*ifacs(b)*ifacs(a-b);
}
//

struct Solver {
  void solve() {
    int n,q;
    scanf("%d%d",&n,&q);
    vi a(n);
    cin>>a;
    vm s(n+1), two(n+1,1), owt(n+1,1);
    rep(i,n) two[i+1] = two[i]*2;
    rep(i,n) owt[i+1] = owt[i]*invs(2);
    rep(i,n) s[i+1] = s[i]+two[i]*a[i];
    set<int> st;
    rep(i,n-1) if (a[i] >= a[i+1]) st.insert(i+1);
    st.insert(0);
    rep(i,q) {
      int l,r;
      scanf("%d%d",&l,&r);
      --l;
      auto it = st.lower_bound(r); --it;
      l = max(l,*it);
      mint ans = s[r]-s[l];
      ans += two[l]*a[l];
      ans *= owt[l+1];
      printf("%d\n",ans.x);
    }
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード