結果
問題 | No.916 Encounter On A Tree |
ユーザー | commy |
提出日時 | 2022-01-24 03:23:09 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 19 ms / 2,000 ms |
コード長 | 5,141 bytes |
コンパイル時間 | 1,440 ms |
コンパイル使用メモリ | 83,164 KB |
実行使用メモリ | 19,712 KB |
最終ジャッジ日時 | 2024-05-07 17:51:14 |
合計ジャッジ時間 | 3,149 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 18 ms
19,584 KB |
testcase_03 | AC | 17 ms
19,584 KB |
testcase_04 | AC | 16 ms
19,456 KB |
testcase_05 | AC | 17 ms
19,584 KB |
testcase_06 | AC | 17 ms
19,584 KB |
testcase_07 | AC | 19 ms
19,712 KB |
testcase_08 | AC | 4 ms
5,376 KB |
testcase_09 | AC | 8 ms
7,296 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 18 ms
19,440 KB |
testcase_13 | AC | 17 ms
19,708 KB |
testcase_14 | AC | 17 ms
19,456 KB |
testcase_15 | AC | 16 ms
19,584 KB |
testcase_16 | AC | 7 ms
7,296 KB |
testcase_17 | AC | 17 ms
19,712 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 19 ms
19,584 KB |
testcase_20 | AC | 17 ms
19,584 KB |
testcase_21 | AC | 18 ms
19,584 KB |
testcase_22 | AC | 17 ms
19,584 KB |
testcase_23 | AC | 16 ms
19,456 KB |
testcase_24 | AC | 17 ms
19,584 KB |
testcase_25 | AC | 17 ms
19,712 KB |
testcase_26 | AC | 10 ms
11,384 KB |
testcase_27 | AC | 10 ms
11,312 KB |
testcase_28 | AC | 6 ms
7,296 KB |
testcase_29 | AC | 18 ms
19,584 KB |
testcase_30 | AC | 17 ms
19,584 KB |
testcase_31 | AC | 17 ms
19,456 KB |
testcase_32 | AC | 17 ms
19,584 KB |
testcase_33 | AC | 10 ms
11,392 KB |
testcase_34 | AC | 6 ms
7,296 KB |
testcase_35 | AC | 4 ms
5,376 KB |
testcase_36 | AC | 17 ms
19,608 KB |
testcase_37 | AC | 17 ms
19,584 KB |
testcase_38 | AC | 6 ms
7,168 KB |
testcase_39 | AC | 17 ms
19,504 KB |
testcase_40 | AC | 17 ms
19,456 KB |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | AC | 1 ms
5,376 KB |
testcase_43 | AC | 1 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 4 ms
5,376 KB |
testcase_46 | AC | 1 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
testcase_48 | AC | 2 ms
5,376 KB |
testcase_49 | AC | 1 ms
5,376 KB |
testcase_50 | AC | 2 ms
5,376 KB |
testcase_51 | AC | 2 ms
5,376 KB |
testcase_52 | AC | 1 ms
5,376 KB |
testcase_53 | AC | 1 ms
5,376 KB |
testcase_54 | AC | 2 ms
5,376 KB |
testcase_55 | AC | 2 ms
5,376 KB |
testcase_56 | AC | 2 ms
5,376 KB |
testcase_57 | AC | 2 ms
5,376 KB |
testcase_58 | AC | 2 ms
5,376 KB |
testcase_59 | AC | 2 ms
5,376 KB |
testcase_60 | AC | 2 ms
5,376 KB |
ソースコード
#include <algorithm> #include <iostream> #include <numeric> #include <string> #include <tuple> #include <utility> #include <vector> #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; using P = pair<ll, ll>; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false) template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; } #else #define dump(...) do{ } while(false) #endif 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 T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; } template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; } template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; } template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); } template<typename T> istream &operator,(istream &in, T &t) { return in >> t; } // clang-format on template<ll MOD = 1000000007> class ModInt { ll n; ModInt constexpr inverse() const { return ModInt::pow(*this, MOD - 2); } public: ModInt() : n(0) {} ModInt(ll _n) : n(((_n % MOD) + MOD) % MOD) {} ModInt operator+=(const ModInt &m) { n += m.n; if (n >= MOD) n -= MOD; return *this; } ModInt operator-=(const ModInt &m) { n -= m.n; if (n < 0) n += MOD; return *this; } ModInt operator*=(const ModInt &m) { n *= m.n; if (n >= MOD) n %= MOD; return *this; } ModInt operator/=(const ModInt &m) { (*this) *= m.inverse(); return *this; } friend ModInt operator+(ModInt t, const ModInt &m) { return t += m; } friend ModInt operator-(ModInt t, const ModInt &m) { return t -= m; } friend ModInt operator*(ModInt t, const ModInt &m) { return t *= m; } friend ModInt operator/(ModInt t, const ModInt &m) { return t /= m; } ModInt operator=(const ll l) { n = l % MOD; if (n < 0) n += MOD; return *this; } friend ostream &operator<<(ostream &out, const ModInt &m) { out << m.n; return out; } friend istream &operator>>(istream &in, ModInt &m) { ll l; in >> l; m = l; return in; } static constexpr ModInt pow(const ModInt x, ll p) { ModInt<MOD> ans = 1; for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) { if (p % 2) ans *= m; } return ans; } static constexpr ll mod() { return MOD; } }; using mint = ModInt<>; mint operator"" _m(unsigned long long m) { return mint(m); } class Combination { vector<mint> factor, rfactor; public: Combination(int n) { factor.resize(n, 1); rfactor.resize(n, 1); for (int i = 1; i < n; i++) { factor[i] = i * factor[i - 1]; } rfactor[n - 1] = 1 / factor[n - 1]; for (int i = n - 1; i > 0; i--) { rfactor[i - 1] = rfactor[i] * i; } } mint nCr(int n, int r) { if (n < r) return 0; if (n < mint::mod()) return factor[n] * rfactor[r] * rfactor[n - r]; // Lucasの定理 mint res = 1; while (n || r) { int nn = n % mint::mod(), rr = r % mint::mod(); n /= mint::mod(); r /= mint::mod(); res *= nCr(nn, rr); } return res; } mint nPr(int n, int r) { return factor[n] * rfactor[n - r]; } mint nSr(ll n, int r) { mint ans = 0; for (int i = r, s = 1; i >= 0; i--, s *= -1) { ans += s * nCr(r, i) * mint::pow(i, n); } return ans * rfactor[r]; } mint factorial(int n) { return factor[n]; } }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int d, l, r, k; cin, d, l, r, k; d--; int dl = 0, dr = 0; for (int i = d; i >= 0; i--) { if (l < (1 << (i + 1))) { dl = i; } if (r < (1 << (i + 1))) { dr = i; } } if (dl < dr) { swap(dl, dr); swap(l, r); } // dl >= dr mint ans = 0; mint m = 1; Combination comb(2 << d); rep(i, 0, d + 1) { if (i != dr) { m *= comb.factorial(1 << i); } else { if (dl == dr) { m *= (1 << i) * comb.factorial((1 << i) - 2); } else { m *= comb.factorial((1 << i) - 1); } } } for (int dd = dr; dd >= 0; dd--) { if (dl + dr - 2 * dd == k) { int rest = max(dr - dd - 1, 0); ans += m * (1 << rest); } } print(ans); return 0; }