結果

問題 No.916 Encounter On A Tree
ユーザー 👑 emthrmemthrm
提出日時 2019-10-25 22:37:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 60 ms / 2,000 ms
コード長 5,058 bytes
コンパイル時間 1,443 ms
コンパイル使用メモリ 127,360 KB
実行使用メモリ 15,448 KB
最終ジャッジ日時 2023-10-11 05:38:59
合計ジャッジ時間 5,419 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 1 ms
4,352 KB
testcase_02 AC 59 ms
15,388 KB
testcase_03 AC 58 ms
15,184 KB
testcase_04 AC 59 ms
15,256 KB
testcase_05 AC 59 ms
15,172 KB
testcase_06 AC 59 ms
15,124 KB
testcase_07 AC 59 ms
15,384 KB
testcase_08 AC 9 ms
4,624 KB
testcase_09 AC 17 ms
6,200 KB
testcase_10 AC 2 ms
4,352 KB
testcase_11 AC 1 ms
4,352 KB
testcase_12 AC 59 ms
15,244 KB
testcase_13 AC 59 ms
15,180 KB
testcase_14 AC 59 ms
15,264 KB
testcase_15 AC 59 ms
15,120 KB
testcase_16 AC 17 ms
6,412 KB
testcase_17 AC 59 ms
15,448 KB
testcase_18 AC 2 ms
4,352 KB
testcase_19 AC 59 ms
15,288 KB
testcase_20 AC 59 ms
15,176 KB
testcase_21 AC 59 ms
15,188 KB
testcase_22 AC 59 ms
15,136 KB
testcase_23 AC 59 ms
15,176 KB
testcase_24 AC 59 ms
15,172 KB
testcase_25 AC 59 ms
15,312 KB
testcase_26 AC 32 ms
9,084 KB
testcase_27 AC 32 ms
9,052 KB
testcase_28 AC 17 ms
6,200 KB
testcase_29 AC 59 ms
15,212 KB
testcase_30 AC 59 ms
15,184 KB
testcase_31 AC 59 ms
15,192 KB
testcase_32 AC 59 ms
15,248 KB
testcase_33 AC 32 ms
9,064 KB
testcase_34 AC 17 ms
6,092 KB
testcase_35 AC 9 ms
4,604 KB
testcase_36 AC 59 ms
15,312 KB
testcase_37 AC 59 ms
15,192 KB
testcase_38 AC 17 ms
6,136 KB
testcase_39 AC 59 ms
15,240 KB
testcase_40 AC 60 ms
15,288 KB
testcase_41 AC 2 ms
4,348 KB
testcase_42 AC 2 ms
4,352 KB
testcase_43 AC 1 ms
4,352 KB
testcase_44 AC 2 ms
4,352 KB
testcase_45 AC 9 ms
4,500 KB
testcase_46 AC 2 ms
4,352 KB
testcase_47 AC 2 ms
4,352 KB
testcase_48 AC 2 ms
4,352 KB
testcase_49 AC 1 ms
4,348 KB
testcase_50 AC 2 ms
4,348 KB
testcase_51 AC 1 ms
4,352 KB
testcase_52 AC 1 ms
4,348 KB
testcase_53 AC 2 ms
4,352 KB
testcase_54 AC 1 ms
4,352 KB
testcase_55 AC 1 ms
4,352 KB
testcase_56 AC 1 ms
4,352 KB
testcase_57 AC 2 ms
4,352 KB
testcase_58 AC 2 ms
4,348 KB
testcase_59 AC 3 ms
4,348 KB
testcase_60 AC 4 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(long long x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(long long exponent) {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &rhs) { if((val += rhs.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &rhs) { if((val += mod - rhs.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &rhs) { val = static_cast<unsigned long long>(val) * rhs.val % mod; return *this; }
  ModInt &operator/=(const ModInt &rhs) { return *this *= rhs.inv(); }
  bool operator==(const ModInt &rhs) const { return val == rhs.val; }
  bool operator!=(const ModInt &rhs) const { return val != rhs.val; }
  bool operator<(const ModInt &rhs) const { return val < rhs.val; }
  bool operator<=(const ModInt &rhs) const { return val <= rhs.val; }
  bool operator>(const ModInt &rhs) const { return val > rhs.val; }
  bool operator>=(const ModInt &rhs) const { return val >= rhs.val; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; }
  ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; }
  ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; }
  ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; }
  friend ostream &operator<<(ostream &os, const ModInt &rhs) { return os << rhs.val; }
  friend istream &operator>>(istream &is, ModInt &rhs) { long long x; is >> x; rhs = ModInt(x); return is; }
private:
  ModInt inv() const {
    // if (__gcd(val, mod) != 1) assert(false);
    unsigned a = val, b = mod; int x = 1, y = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(x -= tmp * y, y);
    }
    return ModInt(x);
  }
};
int abs(const ModInt &x) { return x.val; }
struct Combinatorics {
  int val;
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) {
    if (n < 0 || k < 0) return ModInt(0);
    return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
  }
};

int main() {
  vector<int> left{-1, 1}, right{-1, 1};
  FOR(i, 2, 21) {
    left.emplace_back(left.back() * 2);
    right.emplace_back(left.back() * 2 - 1);
  }
  int d, l, r, k; cin >> d >> l >> r >> k;
  int dep_l, dep_r;
  for (dep_l = 1; dep_l <= d; ++dep_l) {
    if (left[dep_l] <= l && l <= right[dep_l]) break;
  }
  for (dep_r = 1; dep_r <= d; ++dep_r) {
    if (left[dep_r] <= r && r <= right[dep_r]) break;
  }
  // cout << dep_l << ' ' << dep_r << '\n';
  Combinatorics com(1 << d);
  ModInt ans = 0;
  for (int middle = dep_l; middle >= 1; --middle) {
    if (dep_r - dep_l + 2 * (dep_l - middle) != k) continue;
    ans = ModInt(1 << (dep_r - dep_l)) * ModInt(1 << max(dep_l - middle - 1, 0));
    if (dep_l == dep_r) {
      ans *= 1 << (dep_l - 1);
      ans *= com.fact[(1 << (dep_r - 1)) - 2];
    } else {
      ans *= com.fact[(1 << (dep_r - 1)) - 1];
    }
    break;
  }
  for (int i = 1; i <= d; ++i) if (i != dep_r) {
    ans *= com.fact[1 << (i - 1)];
  }
  cout << ans << '\n';
  return 0;
}
0