結果

問題 No.916 Encounter On A Tree
ユーザー first_vilfirst_vil
提出日時 2020-06-22 11:05:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,282 bytes
コンパイル時間 2,100 ms
コンパイル使用メモリ 203,748 KB
実行使用メモリ 17,732 KB
最終ジャッジ日時 2024-07-03 18:38:22
合計ジャッジ時間 4,891 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 20 ms
17,360 KB
testcase_02 AC 19 ms
17,536 KB
testcase_03 AC 19 ms
17,460 KB
testcase_04 AC 19 ms
17,408 KB
testcase_05 AC 18 ms
17,440 KB
testcase_06 WA -
testcase_07 AC 19 ms
17,408 KB
testcase_08 AC 18 ms
17,536 KB
testcase_09 AC 20 ms
17,368 KB
testcase_10 AC 19 ms
17,388 KB
testcase_11 AC 19 ms
17,424 KB
testcase_12 AC 18 ms
17,440 KB
testcase_13 AC 18 ms
17,408 KB
testcase_14 AC 17 ms
17,536 KB
testcase_15 AC 18 ms
17,452 KB
testcase_16 AC 17 ms
17,536 KB
testcase_17 AC 18 ms
17,384 KB
testcase_18 AC 20 ms
17,408 KB
testcase_19 AC 18 ms
17,536 KB
testcase_20 WA -
testcase_21 AC 19 ms
17,408 KB
testcase_22 AC 20 ms
17,356 KB
testcase_23 AC 19 ms
17,424 KB
testcase_24 AC 20 ms
17,536 KB
testcase_25 AC 20 ms
17,536 KB
testcase_26 AC 18 ms
17,504 KB
testcase_27 AC 19 ms
17,436 KB
testcase_28 AC 23 ms
17,408 KB
testcase_29 AC 20 ms
17,408 KB
testcase_30 AC 19 ms
17,388 KB
testcase_31 AC 19 ms
17,408 KB
testcase_32 AC 20 ms
17,460 KB
testcase_33 AC 21 ms
17,536 KB
testcase_34 AC 19 ms
17,408 KB
testcase_35 AC 21 ms
17,536 KB
testcase_36 AC 20 ms
17,472 KB
testcase_37 AC 20 ms
17,512 KB
testcase_38 AC 21 ms
17,536 KB
testcase_39 AC 19 ms
17,432 KB
testcase_40 AC 20 ms
17,536 KB
testcase_41 AC 20 ms
17,368 KB
testcase_42 AC 22 ms
17,380 KB
testcase_43 AC 21 ms
17,380 KB
testcase_44 AC 19 ms
17,536 KB
testcase_45 AC 21 ms
17,408 KB
testcase_46 AC 22 ms
17,536 KB
testcase_47 AC 24 ms
17,384 KB
testcase_48 AC 23 ms
17,408 KB
testcase_49 AC 24 ms
17,432 KB
testcase_50 AC 23 ms
17,408 KB
testcase_51 AC 23 ms
17,428 KB
testcase_52 AC 22 ms
17,408 KB
testcase_53 AC 23 ms
17,436 KB
testcase_54 AC 23 ms
17,536 KB
testcase_55 AC 23 ms
17,500 KB
testcase_56 AC 24 ms
17,456 KB
testcase_57 AC 24 ms
17,400 KB
testcase_58 AC 23 ms
17,408 KB
testcase_59 AC 23 ms
17,532 KB
testcase_60 AC 23 ms
17,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//四則演算 #pragma GCC target("avx")
//並列計算 #pragma GCC optimize("O3")
//条件分岐を減らす #pragma GCC optimize("unroll-loops")
//浮動小数点演算 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

template<int modulo> struct ModInt {
    int x;

    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}

    ModInt& operator+=(const ModInt& p) {
        if ((x += p.x) >= modulo) x -= modulo;
        return *this;
    }
    ModInt& operator-=(const ModInt& p) {
        if ((x += modulo - p.x) >= modulo) x -= modulo;
        return *this;
    }
    ModInt& operator*=(const ModInt& p) {
        x = (int)(1LL * x * p.x % modulo);
        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 = modulo, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt pow(int e) {
        long long a = 1, p = x;
        while (e > 0) {
            if (e % 2 == 0) { p = (p * p) % modulo; e /= 2; }
            else { a = (a * p) % modulo; e--; }
        }
        return ModInt(a);
    }

    friend ostream& operator<<(ostream& os, const ModInt<modulo>& p) {
        return os << p.x;
    }
    friend istream& operator>>(istream& is, ModInt<modulo>& a) {
        long long x;
        is >> x;
        a = ModInt<modulo>(x);
        return (is);
    }
};
using modint = ModInt<mod>;

const int MAX = 600000;
ll fac[MAX], finv[MAX], inv[MAX];
bool Pre = true;
void cominit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    FOR(i, 2, MAX) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}
ll com(int n, int k) {
    if (Pre) {
        cominit();
        Pre = false;
    }
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

int main() {
    init();
    com(0, 0);
    int d, l, r, k; cin >> d >> l >> r >> k;
    int a = 31 - __builtin_clz(l);
    int b = 31 - __builtin_clz(r);
    k -= b - a;
    if (k & 1) {
        print(0);
        return 0;
    }
    else if (k == 0) {
        modint ans = 1;
        FOR(i, 0, d) {
            if (i == b)ans *= fac[(1 << i) - 1];
            else ans *= fac[1 << i];
        }
        ans *= 1 << (b - a);
        print(ans);
    }
    else if (a * 2 < k) {
        print(0);
        return 0;
    }
    else {
        modint ans = 1;
        FOR(i, 0, d) {
            if (i == a && i == b)ans *= fac[(1 << i) - 2];
            else if (i == a || i == b)ans *= fac[(1 << i) - 1];
            else ans *= fac[1 << i];
        }
        if (a == b) {
            ans *= modint(1 << a) * (1 << (k / 2 - 1));
        }
        else {
            ans *= modint(1 << a) * (1 << (k / 2 - 1 + b - a));
        }
        print(ans);
    }

    return 0;
}
0