結果

問題 No.916 Encounter On A Tree
ユーザー 👑 tute7627tute7627
提出日時 2019-10-25 22:29:34
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,596 bytes
コンパイル時間 1,808 ms
コンパイル使用メモリ 175,432 KB
実行使用メモリ 20,988 KB
最終ジャッジ日時 2024-09-13 04:40:33
合計ジャッジ時間 5,049 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
20,700 KB
testcase_01 AC 30 ms
20,748 KB
testcase_02 AC 29 ms
20,780 KB
testcase_03 AC 29 ms
20,764 KB
testcase_04 AC 29 ms
20,636 KB
testcase_05 WA -
testcase_06 AC 29 ms
20,752 KB
testcase_07 AC 29 ms
20,784 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 30 ms
20,752 KB
testcase_11 AC 29 ms
20,788 KB
testcase_12 AC 29 ms
20,752 KB
testcase_13 AC 29 ms
20,788 KB
testcase_14 AC 29 ms
20,768 KB
testcase_15 AC 29 ms
20,704 KB
testcase_16 AC 29 ms
20,812 KB
testcase_17 AC 29 ms
20,632 KB
testcase_18 AC 29 ms
20,696 KB
testcase_19 AC 29 ms
20,900 KB
testcase_20 AC 29 ms
20,792 KB
testcase_21 WA -
testcase_22 AC 29 ms
20,784 KB
testcase_23 WA -
testcase_24 AC 29 ms
20,820 KB
testcase_25 AC 29 ms
20,844 KB
testcase_26 AC 29 ms
20,796 KB
testcase_27 AC 29 ms
20,756 KB
testcase_28 AC 29 ms
20,840 KB
testcase_29 WA -
testcase_30 AC 29 ms
20,860 KB
testcase_31 AC 30 ms
20,792 KB
testcase_32 AC 29 ms
20,660 KB
testcase_33 AC 29 ms
20,900 KB
testcase_34 AC 29 ms
20,848 KB
testcase_35 AC 29 ms
20,756 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 29 ms
20,768 KB
testcase_40 WA -
testcase_41 AC 30 ms
20,860 KB
testcase_42 AC 29 ms
20,756 KB
testcase_43 AC 29 ms
20,828 KB
testcase_44 AC 30 ms
20,796 KB
testcase_45 AC 29 ms
20,792 KB
testcase_46 AC 29 ms
20,768 KB
testcase_47 AC 29 ms
20,928 KB
testcase_48 AC 29 ms
20,752 KB
testcase_49 AC 29 ms
20,812 KB
testcase_50 AC 29 ms
20,816 KB
testcase_51 WA -
testcase_52 WA -
testcase_53 AC 29 ms
20,784 KB
testcase_54 AC 29 ms
20,700 KB
testcase_55 AC 29 ms
20,724 KB
testcase_56 AC 29 ms
20,864 KB
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#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 = m - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
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,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-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< 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); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

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

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

  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< MOD >;

template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(ll sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(ll i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(ll i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(ll i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(ll k) const { return _fact[k]; }

  inline T rfact(ll k) const { return _rfact[k]; }

  inline T inv(ll k) const { return _inv[k]; }

  T P(ll n, ll r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(ll p, ll q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(ll n, ll r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
using Comb=Combination<modint>;


int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  //cout<<fixed<<setprecision(10);
  ll res=0,buf=0;
  bool judge = true;
  ll d,l,r,k;cin>>d>>l>>r>>k;
  ll ld=-1,rd=-1;
  while(l){
    l/=2;
    ld++;
  }
  while(r){
    r/=2;
    rd++;
  }
  if(ld>rd)swap(ld,rd);
  modint ret=1;
  Comb comb(1500000);
  rep(i,0,d){
    if(i!=ld&&i!=rd){
      ret*=comb.P(1<<i,1<<i);
    }
    else if(i!=ld||i!=rd){
      ret*=comb.P((1<<i)-1,(1<<i)-1);
    }
    else ret*=comb.P((1<<i)-2,(1<<i)-2);
  }
  judge=false;
  rep(i,0,ld+1){
    if(ld-i+rd-i==k){
      judge=true;
      //cout<<ret spa i spa ld spa rd<<endl;
      ll x=ld-i,y=rd-i;
      //cout<<x spa y<<endl;
      if(ld==rd){
        ret*=1<<i;
        ret*=1<<x;
        //cout<<ret<<endl;
        ret*=1<<x-1;
      }
      else if(ld==i){
        ret*=1<<x;
        ret*=1<<y;
      }
      else{
        ret*=1<<x;
        ret*=1<<y-1;
      }
      break;
    }
  }
  if(judge)cout<<ret<<endl;
  else cout<<0<<endl;
  return 0;
}
0