#606559 (C++17) No.1353 Limited Sequence

提出ソース

結果

問題	No.1353 Limited Sequence
ユーザー	👑 tute7627
提出日時	2021-01-17 13:59:41
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	85 ms / 2,000 ms
コード長	5,314 bytes
コンパイル時間	2,547 ms
コンパイル使用メモリ	208,016 KB
実行使用メモリ	34,704 KB
最終ジャッジ日時	2023-08-19 19:48:33
合計ジャッジ時間	5,853 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,380 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	1 ms 4,376 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	2 ms 4,376 KB
testcase_08	AC	2 ms 4,376 KB
testcase_09	AC	2 ms 4,376 KB
testcase_10	AC	2 ms 4,380 KB
testcase_11	AC	2 ms 4,376 KB
testcase_12	AC	45 ms 16,148 KB
testcase_13	AC	37 ms 11,976 KB
testcase_14	AC	19 ms 11,408 KB
testcase_15	AC	31 ms 20,032 KB
testcase_16	AC	7 ms 5,368 KB
testcase_17	AC	10 ms 8,568 KB
testcase_18	AC	28 ms 16,328 KB
testcase_19	AC	85 ms 27,056 KB
testcase_20	AC	23 ms 10,588 KB
testcase_21	AC	5 ms 4,380 KB
testcase_22	AC	9 ms 7,104 KB
testcase_23	AC	42 ms 14,344 KB
testcase_24	AC	17 ms 10,604 KB
testcase_25	AC	65 ms 22,528 KB
testcase_26	AC	27 ms 11,704 KB
testcase_27	AC	9 ms 6,764 KB
testcase_28	AC	21 ms 12,828 KB
testcase_29	AC	5 ms 4,740 KB
testcase_30	AC	15 ms 9,472 KB
testcase_31	AC	13 ms 9,156 KB
testcase_32	AC	33 ms 14,972 KB
testcase_33	AC	16 ms 7,976 KB
testcase_34	AC	69 ms 21,348 KB
testcase_35	AC	17 ms 9,068 KB
testcase_36	AC	30 ms 9,940 KB
testcase_37	AC	60 ms 34,540 KB
testcase_38	AC	61 ms 34,512 KB
testcase_39	AC	62 ms 34,484 KB
testcase_40	AC	62 ms 34,528 KB
testcase_41	AC	62 ms 34,428 KB
testcase_42	AC	61 ms 34,528 KB
testcase_43	AC	61 ms 34,704 KB
testcase_44	AC	62 ms 34,404 KB
testcase_45	AC	61 ms 34,460 KB
testcase_46	AC	61 ms 34,480 KB
testcase_47	AC	79 ms 34,428 KB

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) += rhs;
  }
  friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) -= rhs;
  }
  friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) *= rhs;
  }
  friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) /= rhs;
  }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};
using modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}
//using modint=ld;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,l,r;cin>>n>>l>>r;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  auto solve=[&](ll lim){
    auto dp1=vec(lim+1,n+1,modint(0));
    auto dp2=vec(lim+1,n+1,modint(0));
    dp1[0][0]=1;
		modint ret=0;
    rep(i,0,lim+1){
			modint sum=0;
      rep(j,0,n+1){
				dp1[i][j]-=dp2[i][j];
				sum+=dp1[i][j];
      }
			rep(j,1,n+1){
				if(i+j<=lim)dp1[i+j][j]+=sum;
				if(i+(a[j-1]+1)*j<=lim)dp2[i+(a[j-1]+1)*j][j]+=sum-dp1[i][j];
			}
			ret+=sum;
    }
		//debug(dp1,lim+1,n+1);cout<<endl;
		return ret;
  };
	cout<<solve(r)-solve(l-1)<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード