結果

問題 No.1785 Inequality Signs
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-12-14 00:11:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 133 ms / 2,000 ms
コード長 5,238 bytes
コンパイル時間 5,232 ms
コンパイル使用メモリ 264,692 KB
実行使用メモリ 74,036 KB
最終ジャッジ日時 2023-09-30 06:10:57
合計ジャッジ時間 11,763 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 106 ms
73,692 KB
testcase_01 AC 104 ms
73,692 KB
testcase_02 AC 120 ms
73,704 KB
testcase_03 AC 131 ms
73,892 KB
testcase_04 AC 101 ms
74,036 KB
testcase_05 AC 113 ms
73,732 KB
testcase_06 AC 126 ms
73,696 KB
testcase_07 AC 104 ms
73,732 KB
testcase_08 AC 130 ms
73,756 KB
testcase_09 AC 99 ms
73,900 KB
testcase_10 AC 116 ms
73,700 KB
testcase_11 AC 109 ms
73,760 KB
testcase_12 AC 112 ms
73,836 KB
testcase_13 AC 103 ms
73,836 KB
testcase_14 AC 111 ms
73,708 KB
testcase_15 AC 108 ms
73,896 KB
testcase_16 AC 105 ms
73,908 KB
testcase_17 AC 119 ms
73,700 KB
testcase_18 AC 119 ms
73,676 KB
testcase_19 AC 111 ms
73,780 KB
testcase_20 AC 113 ms
73,708 KB
testcase_21 AC 109 ms
73,952 KB
testcase_22 AC 107 ms
73,672 KB
testcase_23 AC 111 ms
73,972 KB
testcase_24 AC 128 ms
73,760 KB
testcase_25 AC 108 ms
73,752 KB
testcase_26 AC 109 ms
73,896 KB
testcase_27 AC 128 ms
73,836 KB
testcase_28 AC 124 ms
73,680 KB
testcase_29 AC 124 ms
73,704 KB
testcase_30 AC 126 ms
73,684 KB
testcase_31 AC 125 ms
73,692 KB
testcase_32 AC 133 ms
73,704 KB
testcase_33 AC 108 ms
74,000 KB
testcase_34 AC 107 ms
73,896 KB
testcase_35 AC 105 ms
73,672 KB
testcase_36 AC 119 ms
73,760 KB
testcase_37 AC 110 ms
73,756 KB
testcase_38 AC 110 ms
73,696 KB
testcase_39 AC 108 ms
73,892 KB
testcase_40 AC 106 ms
73,876 KB
testcase_41 AC 118 ms
73,832 KB
testcase_42 AC 123 ms
73,696 KB
testcase_43 AC 125 ms
73,676 KB
testcase_44 AC 120 ms
73,692 KB
testcase_45 AC 101 ms
73,952 KB
testcase_46 AC 105 ms
73,704 KB
testcase_47 AC 110 ms
73,716 KB
testcase_48 AC 114 ms
73,696 KB
testcase_49 AC 103 ms
73,684 KB
testcase_50 AC 121 ms
73,992 KB
testcase_51 AC 104 ms
73,688 KB
testcase_52 AC 104 ms
73,676 KB
testcase_53 AC 115 ms
73,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int,int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
typedef string::const_iterator State;
class ParseError {};
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>void print(T a){cout<<a<<endl;}
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
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;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout() {
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
constexpr ll MAX = 3000000;
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%mod;
    inv[i]=mod-inv[mod%i]*(mod/i)%mod;
    finv[i]=finv[i-1]*inv[i]%mod;
  }
}
ll binom(ll n,ll k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}
ll HOM(ll n,ll k){
  if(n==0&&k==0) return 1;
  return binom(n+k-1,k);
}
ll POM(ll n,ll k){
  if(n<k) return 0;
  return fac[n]*finv[n-k]%mod;
}
int main(){
  COMinit();
  cincout();
  ll n,k;
  cin>>n>>k;
  ll ans=0;
  ll now=1;
  for(ll i=k+0-n+1;i<=k+0;i++) (now*=i)%=mod;
  for(int i=0;i<=n-1;i++){
    //binom(a,b) -> prod a-b+1 から a まで /fac[n]
    // k+i-n+1 から k+i の積
    if(k+i==n){
      now=1;
      for(ll j=1;j<=n;j++) (now*=j)%=mod;
    }
    else if(k+i>n&&i!=0){
      now*=k+i;
      now%=mod;
      now*=modPow(k+i-n,mod-2,mod);
      now%=mod;
    }
    //cout<<now<<endl;
    if(k+i>=n) (ans+=now*binom(n-1,i))%=mod;
  }
  ans*=modPow(fac[n],mod-2,mod);
  ans%=mod;
  cout<<ans<<endl;
}
0