結果

問題 No.1785 Inequality Signs
ユーザー eQeeQe
提出日時 2021-12-18 13:59:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 4,738 bytes
コンパイル時間 5,441 ms
コンパイル使用メモリ 285,640 KB
実行使用メモリ 55,556 KB
最終ジャッジ日時 2023-10-13 17:55:45
合計ジャッジ時間 15,113 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 40 ms
11,668 KB
testcase_02 AC 194 ms
40,564 KB
testcase_03 AC 267 ms
53,768 KB
testcase_04 AC 25 ms
32,244 KB
testcase_05 AC 108 ms
24,416 KB
testcase_06 AC 238 ms
48,472 KB
testcase_07 AC 7 ms
4,880 KB
testcase_08 AC 228 ms
47,016 KB
testcase_09 AC 38 ms
11,260 KB
testcase_10 AC 164 ms
34,544 KB
testcase_11 AC 47 ms
12,620 KB
testcase_12 AC 90 ms
21,044 KB
testcase_13 AC 35 ms
10,432 KB
testcase_14 AC 121 ms
27,056 KB
testcase_15 AC 99 ms
22,896 KB
testcase_16 AC 72 ms
17,580 KB
testcase_17 AC 166 ms
34,984 KB
testcase_18 AC 164 ms
34,728 KB
testcase_19 AC 130 ms
28,432 KB
testcase_20 AC 148 ms
31,636 KB
testcase_21 AC 131 ms
28,832 KB
testcase_22 AC 44 ms
11,916 KB
testcase_23 AC 71 ms
17,352 KB
testcase_24 AC 265 ms
53,220 KB
testcase_25 AC 98 ms
22,604 KB
testcase_26 AC 94 ms
21,804 KB
testcase_27 AC 278 ms
55,556 KB
testcase_28 AC 277 ms
55,328 KB
testcase_29 AC 277 ms
55,104 KB
testcase_30 AC 276 ms
55,348 KB
testcase_31 AC 277 ms
55,424 KB
testcase_32 AC 277 ms
55,300 KB
testcase_33 AC 2 ms
4,348 KB
testcase_34 AC 10 ms
5,448 KB
testcase_35 AC 18 ms
7,688 KB
testcase_36 AC 172 ms
38,404 KB
testcase_37 AC 112 ms
31,312 KB
testcase_38 AC 99 ms
27,576 KB
testcase_39 AC 41 ms
12,024 KB
testcase_40 AC 63 ms
16,564 KB
testcase_41 AC 92 ms
23,364 KB
testcase_42 AC 199 ms
43,980 KB
testcase_43 AC 255 ms
51,916 KB
testcase_44 AC 209 ms
43,776 KB
testcase_45 AC 45 ms
13,896 KB
testcase_46 AC 99 ms
27,148 KB
testcase_47 AC 63 ms
18,412 KB
testcase_48 AC 104 ms
26,116 KB
testcase_49 AC 6 ms
4,484 KB
testcase_50 AC 207 ms
43,220 KB
testcase_51 AC 19 ms
7,372 KB
testcase_52 AC 12 ms
5,932 KB
testcase_53 AC 29 ms
9,188 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint& x) { os << x.val(); return os; }
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<(int)v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;}
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }
template<typename V, typename H> void resize(vector<V>& vec, const H head){ vec.resize(head); }
template<typename V, typename H, typename ... T> void resize(vector<V>& vec, const H& head, const T ... tail){ vec.resize(head); for(auto& v: vec) resize(v, tail...); }
template<typename V, typename T> void fill(V& x, const T& val){ x = val; }
template<typename V, typename T> void fill(vector<V>& vec, const T& val){ for(auto& v: vec) fill(v, val); }
template<typename H> void vin(istream& is, const int idx, vector<H>& head){ is >> head[idx]; }
template<typename H, typename ... T> void vin(istream& is, const int idx, vector<H>& head, T& ... tail){ vin(is >> head[idx], idx, tail...); }
template<typename H, typename ... T>
void vin(istream& is, vector<H>& head, T& ... tail){ for(int i=0; i<(int)head.size(); i++) vin(is, i, head, tail...); }
template<typename H, typename ... T> void vin(vector<H>& head, T& ... tail){ vin(cin, head, tail...); }
map<ll,ll>divisor(ll n){map<ll,ll>res;for(ll i=1;i*i<=n;i++)if(n%i==0){res[i]++;res[n/i]++;}return res;}
map<ll,ll>factrization(ll n){map<ll,ll>res;for(ll i=2;i*i<=n;i++)while(n%i==0){res[i]++;n/=i;}if(n>1)res[n]++;return res;}
static const ll inf=1e18+7;
static const ld pi=acos(-1);
static const ld eps=1e-10;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;
using S=ll;
S op(S a,S b){return a+b;}
S e(){return 0;}

template<class T>struct Combination{
  vector<T>fa,rfa,bs;
  vector<vector<pair<bool,T>>>mp;
  ll LIM=5000;
  Combination(ll n){
    fa.resize(n+1);
    rfa.resize(n+1);
    fa[0]=rfa[0]=1;
    for(ll i=1;i<=n;i++)fa[i]=fa[i-1]*i;
    for(ll i=1;i<=n;i++)rfa[i]=rfa[i-1]/i;
    
    bs.resize(n+1);
    bs[0]=1;
    for(ll i=1;i<=n;i++)bs[i]=bs[i-1]+T(-1).pow(i&1)*rfa[i];
    
    if(n<=LIM)mp.resize(n+1,vector<pair<bool,T>>(n+1));
  }
  T C(ll n,ll k){return n<k||n<0||k<0?0:fa[n]*rfa[k]*rfa[n-k];}
  T P(ll n,ll k){return C(n,k)*fa[k];}
  T H(ll n,ll k){return C(n-1+k,k);}
  T S(ll n,ll k){
    T res=0;
    for(ll i=0;i<=k;i++)res+=T(-1).pow((k-i)&1)*C(k,i)*T(i).pow(n);
    res*=rfa[k];
    return res;
  }
  T B(ll n,ll k){
    T res=0;
    for(ll i=0;i<=k;i++)res+=T(i).pow(n)*rfa[i]*bs[k-i];
    return res;
  }
  T p(ll n,ll k){
    if(n==0 and k==0)return 1;
    if(k==0)return 0;
    if(mp[n][k].first)return mp[n][k].second;
    if(n-k>=0)return (mp[n][k]={true,p(n,k-1)+p(n-k,k)}).second;
    return (mp[n][k]={true,p(n,k-1)}).second;
  }
};


int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N,K;cin>>N>>K;
  using mint=modint1000000007;
  Combination<mint>com(N);
  
  map<ll,mint>mem;
  function<mint(ll)>f=[&](ll x)->mint{
    if(x==0 or x==K-N)return mem[x]=1;
    return mem[x]=x*f(x-1);
  };
  f(K+N-1);
  
  mint ans=0;
  for(ll i=0;i<N;i++){
    if(K+i-N<0)continue;
    ans+=com.C(N-1,i)*mem[K+i]/mem[K+i-N]*com.rfa[N];
  }
  pt(ans);
  
  

}


0