結果

問題 No.916 Encounter On A Tree
ユーザー hitonanodehitonanode
提出日時 2019-10-25 21:55:57
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,639 bytes
コンパイル時間 1,910 ms
コンパイル使用メモリ 172,916 KB
実行使用メモリ 52,544 KB
最終ジャッジ日時 2024-07-23 19:07:50
合計ジャッジ時間 11,680 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 130 ms
52,368 KB
testcase_01 AC 125 ms
52,348 KB
testcase_02 AC 113 ms
52,368 KB
testcase_03 AC 122 ms
52,404 KB
testcase_04 AC 123 ms
52,376 KB
testcase_05 WA -
testcase_06 AC 109 ms
52,544 KB
testcase_07 AC 119 ms
52,400 KB
testcase_08 AC 135 ms
52,352 KB
testcase_09 AC 135 ms
52,224 KB
testcase_10 AC 137 ms
52,348 KB
testcase_11 AC 137 ms
52,352 KB
testcase_12 AC 135 ms
52,352 KB
testcase_13 AC 131 ms
52,352 KB
testcase_14 AC 138 ms
52,352 KB
testcase_15 AC 135 ms
52,352 KB
testcase_16 AC 136 ms
52,480 KB
testcase_17 WA -
testcase_18 AC 130 ms
52,352 KB
testcase_19 AC 138 ms
52,396 KB
testcase_20 AC 132 ms
52,348 KB
testcase_21 WA -
testcase_22 AC 136 ms
52,216 KB
testcase_23 WA -
testcase_24 AC 134 ms
52,336 KB
testcase_25 AC 130 ms
52,352 KB
testcase_26 AC 133 ms
52,340 KB
testcase_27 AC 138 ms
52,352 KB
testcase_28 AC 137 ms
52,352 KB
testcase_29 WA -
testcase_30 AC 142 ms
52,348 KB
testcase_31 AC 125 ms
52,352 KB
testcase_32 AC 131 ms
52,224 KB
testcase_33 AC 130 ms
52,480 KB
testcase_34 AC 133 ms
52,352 KB
testcase_35 AC 131 ms
52,352 KB
testcase_36 AC 138 ms
52,348 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 133 ms
52,352 KB
testcase_40 AC 134 ms
52,224 KB
testcase_41 AC 130 ms
52,412 KB
testcase_42 AC 132 ms
52,352 KB
testcase_43 AC 127 ms
52,388 KB
testcase_44 AC 132 ms
52,352 KB
testcase_45 AC 125 ms
52,224 KB
testcase_46 AC 128 ms
52,440 KB
testcase_47 AC 131 ms
52,480 KB
testcase_48 AC 131 ms
52,224 KB
testcase_49 AC 129 ms
52,352 KB
testcase_50 AC 135 ms
52,352 KB
testcase_51 AC 126 ms
52,440 KB
testcase_52 WA -
testcase_53 AC 130 ms
52,352 KB
testcase_54 AC 131 ms
52,348 KB
testcase_55 AC 131 ms
52,216 KB
testcase_56 WA -
testcase_57 WA -
testcase_58 AC 132 ms
52,352 KB
testcase_59 WA -
testcase_60 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

constexpr lint MOD = 1000000007;
vector<lint> fac, facInv, inv;
// Solve ax+by=gcd(a, b)
lint extgcd(lint a, lint b, lint &x, lint &y)
{
    lint d = a;
    if (b != 0) d = extgcd(b, a % b, y, x), y -= (a / b) * x;
    else x = 1, y = 0;
    return d;
}
// Calc a^(-1) (MOD m)
lint mod_inverse(lint a, lint m)
{
    lint x, y;
    extgcd(a, m, x, y);
    return (m + x % m) % m;
}
void facInit(int nmax)
{
    fac = facInv = inv = vector<lint>(nmax + 1, 1);
    for (int i = 2; i <= nmax; i++)
    {
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        facInv[i] = facInv[i-1] * inv[i] % MOD;
    }
}
lint nCr(lint n, lint r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return (fac[n] * facInv[r] % MOD) * facInv[n-r] % MOD;
}
lint nPr(lint n, lint r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return fac[n] * facInv[n-r] % MOD;
}
lint power(lint x, lint n, lint mod=MOD)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= mod;
        (x *= x) %= mod;
       n >>= 1;
    }
   return ans;
}

int dd(int x)
{
    return 32 - __builtin_clz(x);
}
void ZERO()
{
    puts("0");
    exit(0);
}

int main()
{
    facInit(1 << 21);
    int D, L, R, K;
    cin >> D >> L >> R >> K;
    int dl = dd(L), dr = dd(R);
    int k = K - abs(dl - dr);
    if (k % 2 or k < 0)
    {
        ZERO();
    }
    k /= 2;
    int r = min(dl, dr) - k;
    if (r <= 0) ZERO();
    dbg(dl);
    dbg(dr);
    dbg(r);

    lint ret = 1;
    REP(i, D) ret = ret * fac[1 << i] % MOD;
    dbg(ret);

    if (r == min(dl, dr))
    {
        ret = ret * mod_inverse(1 << (r + k - 1), MOD) % MOD * (1 << k) % MOD;
    }
    else if (dl == dr)
    {
        ret = ret * mod_inverse((1 << (dr - 1) )- 1, MOD) % MOD * ((1 << (dr - r - 1))) % MOD;
    }
    else
    {
        ret = ret * mod_inverse(1 << (r - 1), MOD) % MOD;
    }

    // ret = ret * mod_inverse(fac[1 << (dl - 1)], MOD) % MOD * fac[1 << (dl - k)] % MOD;
    // ret = ret * mod_inverse(fac[1 << (dr - 1)], MOD) % MOD * fac[1 << (dr - k)] % MOD;
    cout << ret << endl;
}
0