結果
問題 | No.916 Encounter On A Tree |
ユーザー | kibuna |
提出日時 | 2019-10-25 22:47:12 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 4,050 bytes |
コンパイル時間 | 1,627 ms |
コンパイル使用メモリ | 173,120 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-13 06:20:57 |
合計ジャッジ時間 | 3,410 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 8 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 7 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 7 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 3 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 8 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 7 ms
6,944 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 8 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 7 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 7 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 8 ms
6,944 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 8 ms
6,940 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 5 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 7 ms
6,944 KB |
testcase_30 | AC | 2 ms
6,940 KB |
testcase_31 | AC | 2 ms
6,940 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 2 ms
6,944 KB |
testcase_34 | AC | 3 ms
6,944 KB |
testcase_35 | AC | 3 ms
6,940 KB |
testcase_36 | AC | 7 ms
6,944 KB |
testcase_37 | AC | 7 ms
6,940 KB |
testcase_38 | AC | 3 ms
6,940 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 7 ms
6,944 KB |
testcase_41 | AC | 2 ms
6,940 KB |
testcase_42 | AC | 2 ms
6,940 KB |
testcase_43 | AC | 2 ms
6,944 KB |
testcase_44 | AC | 2 ms
6,944 KB |
testcase_45 | AC | 3 ms
6,940 KB |
testcase_46 | AC | 2 ms
6,944 KB |
testcase_47 | AC | 2 ms
6,944 KB |
testcase_48 | AC | 2 ms
6,944 KB |
testcase_49 | AC | 1 ms
6,944 KB |
testcase_50 | AC | 1 ms
6,944 KB |
testcase_51 | AC | 2 ms
6,944 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 2 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,940 KB |
testcase_55 | AC | 1 ms
6,944 KB |
testcase_56 | AC | 2 ms
6,940 KB |
testcase_57 | AC | 2 ms
6,940 KB |
testcase_58 | AC | 2 ms
6,944 KB |
testcase_59 | AC | 2 ms
6,944 KB |
testcase_60 | AC | 2 ms
6,940 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>; using vvi = vector<vi>; using vvl = vector<vl>; const ll INF = 1LL << 60; const ll MOD = 1000000007; template <class T> bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0; } template <class T> bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0; } template <class C> void print(const C &c, std::ostream &os = std::cout) { std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " ")); os << std::endl; } // mod int struct // original : https://github.com/beet-aizu/library/blob/master/mod/mint.cpp struct mint { ll v; ll mod; mint() : v(0) {} mint(signed v, ll mod = MOD) : v(v), mod(mod) {} mint(ll t, ll mod = MOD) : mod(mod) { v = t % mod; if (v < 0) v += mod; } mint pow(ll k) { mint res(1), tmp(v); while (k) { if (k & 1) res *= tmp; tmp *= tmp; k >>= 1; } return res; } static mint add_identity() { return mint(0); } static mint mul_identity() { return mint(1); } mint inv() { return pow(mod - 2); } mint &operator+=(mint a) { v += a.v; if (v >= mod) v -= mod; return *this; } mint &operator-=(mint a) { v += mod - a.v; if (v >= mod) v -= mod; return *this; } mint &operator*=(mint a) { v = 1LL * v * a.v % mod; return *this; } mint &operator/=(mint a) { return (*this) *= a.inv(); } mint operator+(mint a) const { return mint(v) += a; }; mint operator-(mint a) const { return mint(v) -= a; }; mint operator*(mint a) const { return mint(v) *= a; }; mint operator/(mint a) const { return mint(v) /= a; }; mint operator-() const { return v ? mint(mod - v) : mint(v); } bool operator==(const mint a) const { return v == a.v; } bool operator!=(const mint a) const { return v != a.v; } bool operator<(const mint a) const { return v < a.v; } // find x s.t. a^x = b static ll log(ll a, ll b) { const ll sq = 40000; unordered_map<ll, ll> dp; dp.reserve(sq); mint res(1); for (int r = 0; r < sq; r++) { if (!dp.count(res.v)) dp[res.v] = r; res *= a; } mint p = mint(a).inv().pow(sq); res = b; for (int q = 0; q <= MOD / sq + 1; q++) { if (dp.count(res.v)) { ll idx = q * sq + dp[res.v]; if (idx > 0) return idx; } res *= p; } assert(0); return ll(-1); } static mint comb(long long n, int k) { mint num(1), dom(1); for (int i = 0; i < k; i++) { num *= mint(n - i); dom *= mint(i + 1); } return num / dom; } }; ostream &operator<<(ostream &os, mint m) { os << m.v; return os; } int main() { ll d, l, r, k; cin >> d >> l >> r >> k; ll templ = l; ll tempr = r; ll dl = 0; ll dr = 0; while (templ > 0) { templ /= 2; dl++; } while (tempr > 0) { tempr /= 2; dr++; } ll maxk = max(dl + dr - 2, abs(dl - dr)); if (k > maxk || (abs(dl - dr) % 2 != k % 2)) { cout << 0 << "\n"; return 0; } if (k < abs(dl - dr)) { cout << 0 << "\n"; return 0; } mint ret = 1; ll two = 1; for (int i = 1; i <= d; ++i) { for (ll j = 1; j <= two; ++j) { ret *= j; } two *= 2; } ll up = (k - abs(dl - dr)) / 2; ll down = k - up; ret *= mint(2).pow(down - 1); if (up == 0) ret *= 2; ret /= mint(2).pow(max(dl, dr) - 1) - (dl == dr ? 1 : 0); cout << ret << "\n"; return 0; }