#510748 (C++14) No.916 Encounter On A Tree

提出ソース

結果

問題	No.916 Encounter On A Tree
ユーザー	haruki_K
提出日時	2020-07-11 17:55:52
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,864 bytes
コンパイル時間	1,563 ms
コンパイル使用メモリ	170,668 KB
実行使用メモリ	15,264 KB
最終ジャッジ日時	2024-10-13 07:24:08
合計ジャッジ時間	4,976 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	26 ms 15,232 KB
testcase_01	AC	28 ms 15,144 KB
testcase_02	AC	25 ms 15,100 KB
testcase_03	AC	26 ms 15,104 KB
testcase_04	AC	27 ms 15,168 KB
testcase_05	AC	27 ms 15,060 KB
testcase_06	AC	26 ms 15,104 KB
testcase_07	AC	27 ms 15,028 KB
testcase_08	AC	26 ms 15,104 KB
testcase_09	AC	27 ms 15,104 KB
testcase_10	AC	28 ms 15,024 KB
testcase_11	AC	27 ms 15,020 KB
testcase_12	AC	26 ms 15,084 KB
testcase_13	AC	27 ms 15,084 KB
testcase_14	AC	27 ms 15,212 KB
testcase_15	AC	27 ms 15,108 KB
testcase_16	AC	28 ms 15,200 KB
testcase_17	AC	26 ms 15,128 KB
testcase_18	AC	26 ms 15,232 KB
testcase_19	AC	28 ms 15,104 KB
testcase_20	AC	25 ms 15,072 KB
testcase_21	AC	26 ms 15,104 KB
testcase_22	AC	25 ms 15,104 KB
testcase_23	AC	26 ms 15,104 KB
testcase_24	AC	27 ms 15,232 KB
testcase_25	AC	27 ms 15,024 KB
testcase_26	AC	25 ms 15,228 KB
testcase_27	AC	26 ms 15,232 KB
testcase_28	AC	26 ms 15,104 KB
testcase_29	AC	27 ms 15,104 KB
testcase_30	AC	26 ms 15,024 KB
testcase_31	WA	-
testcase_32	AC	27 ms 15,040 KB
testcase_33	WA	-
testcase_34	AC	27 ms 15,232 KB
testcase_35	AC	27 ms 15,104 KB
testcase_36	AC	27 ms 15,200 KB
testcase_37	AC	27 ms 15,088 KB
testcase_38	AC	28 ms 15,044 KB
testcase_39	WA	-
testcase_40	AC	26 ms 15,024 KB
testcase_41	AC	27 ms 14,976 KB
testcase_42	AC	27 ms 15,104 KB
testcase_43	AC	26 ms 15,104 KB
testcase_44	AC	26 ms 15,028 KB
testcase_45	AC	26 ms 15,148 KB
testcase_46	AC	27 ms 15,104 KB
testcase_47	AC	27 ms 15,056 KB
testcase_48	AC	26 ms 15,232 KB
testcase_49	AC	26 ms 15,104 KB
testcase_50	AC	26 ms 15,104 KB
testcase_51	AC	28 ms 15,136 KB
testcase_52	AC	26 ms 15,104 KB
testcase_53	AC	26 ms 15,048 KB
testcase_54	AC	27 ms 15,104 KB
testcase_55	AC	27 ms 15,156 KB
testcase_56	AC	27 ms 15,104 KB
testcase_57	AC	26 ms 15,104 KB
testcase_58	AC	27 ms 15,200 KB
testcase_59	AC	26 ms 15,136 KB
testcase_60	AC	27 ms 15,192 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<
// >>> modint
template <uint32_t md>
class modint {
    static_assert(md < (1u<<31), "");
    using M = modint;
    using i64 = int64_t;
    uint32_t x;
public:
    static constexpr uint32_t mod = md;
    constexpr modint(i64 x = 0) : x((x%=md) < 0 ? x+md : x) { }
    constexpr i64 val() const { return x; }
    constexpr explicit operator i64() const { return x; }
    constexpr bool operator==(M r) const { return x == r.x; }
    constexpr bool operator!=(M r) const { return x != r.x; }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { return M()-*this; }
    constexpr M& operator+=(M r) { x += r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator-=(M r) { x += md-r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator*=(M r) { x = (uint64_t(x)*r.x)%md; return *this; }
    constexpr M& operator/=(M r) { return *this *= r.inv(); }
    constexpr M operator+(M r) const { return M(*this) += r; }
    constexpr M operator-(M r) const { return M(*this) -= r; }
    constexpr M operator*(M r) const { return M(*this) *= r; }
    constexpr M operator/(M r) const { return M(*this) /= r; }
    friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
    friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
    friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
    friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
    constexpr M inv() const { assert(x > 0); return pow(md-2); }
    constexpr M pow(i64 n) const {
        assert(not (x == 0 && n == 0));
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
#ifdef LOCAL
    friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;

// >>> mod table
template <int32_t mod>
struct ModTable {
    static constexpr int32_t Size = 1e6 + 10;
    static_assert(Size <= mod, "");
    using ll = int64_t;
    int32_t fact[Size], finv[Size], inv[Size];
    ModTable() {
        fact[0] = fact[1] = finv[0] = finv[1] = inv[1] = 1;
        for (int i = 2; i < Size; i++) {
            fact[i] = ll(fact[i-1])*i % mod;
            inv[i] = mod - ll(inv[mod%i])*(mod/i) % mod;
            finv[i] = ll(finv[i-1])*inv[i] % mod;
        }
    }
};
const ModTable<MOD> mod_tab;

modint<MOD> fact(int n) {
    assert(0 <= n); assert(n < ModTable<MOD>::Size);
    return mod_tab.fact[n];
}
modint<MOD> finv(int n) {
    assert(0 <= n); assert(n < ModTable<MOD>::Size);
    return mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fact(n)*finv(k)*finv(n-k);
}
modint<MOD> P(int n, int k) {
    assert(k >= 0);
    return fact(n)*finv(n-k);
}
modint<MOD> sgn(int n) { return n%2 == 0 ? +1 : -1; }
// <<<

int32_t main() {
    int d,l,r,k; cin >> d >> l >> r >> k;

    int dl = __lg(l);
    int dr = __lg(r);
    if (not (dr-dl <= k && (k-(dr-dl))%2 == 0)) quit(0);
    int dm = (dl+dr-k)/2;
    dump(dl,dr,dm);

    mint ans = 1;
    ans *= 2 * (1LL<<dm);
    if (dl > dm) ans *= mint(2).pow(dl-dm-1);
    if (dr > dm) ans *= mint(2).pow(dr-dm-1);
    rep (i,d) ans *= fact(1LL<<i);
    if (dl == dr) {
        ans /= (1LL<<dl);
        ans /= (1LL<<dl)-1;
    } else {
        ans /= (1LL<<dl);
        ans /= (1LL<<dr);
    }

    cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード