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

提出ソース

結果

問題	No.916 Encounter On A Tree
ユーザー	hitonanode
提出日時	2019-10-25 22:10:20
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,951 bytes
コンパイル時間	1,726 ms
コンパイル使用メモリ	172,872 KB
実行使用メモリ	101,696 KB
最終ジャッジ日時	2024-09-13 04:05:06
合計ジャッジ時間	18,547 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	228 ms 101,524 KB
testcase_01	AC	246 ms 101,368 KB
testcase_02	AC	247 ms 101,436 KB
testcase_03	AC	245 ms 101,580 KB
testcase_04	AC	241 ms 101,672 KB
testcase_05	WA	-
testcase_06	AC	243 ms 101,640 KB
testcase_07	AC	250 ms 101,588 KB
testcase_08	AC	229 ms 101,520 KB
testcase_09	AC	241 ms 101,364 KB
testcase_10	AC	237 ms 101,636 KB
testcase_11	AC	246 ms 101,424 KB
testcase_12	AC	242 ms 101,524 KB
testcase_13	AC	251 ms 101,488 KB
testcase_14	AC	253 ms 101,544 KB
testcase_15	AC	251 ms 101,592 KB
testcase_16	AC	253 ms 101,544 KB
testcase_17	WA	-
testcase_18	AC	255 ms 101,568 KB
testcase_19	AC	236 ms 101,524 KB
testcase_20	AC	241 ms 101,364 KB
testcase_21	WA	-
testcase_22	AC	241 ms 101,364 KB
testcase_23	WA	-
testcase_24	AC	257 ms 101,364 KB
testcase_25	AC	233 ms 101,368 KB
testcase_26	AC	230 ms 101,592 KB
testcase_27	AC	238 ms 101,528 KB
testcase_28	AC	234 ms 101,432 KB
testcase_29	WA	-
testcase_30	AC	233 ms 101,528 KB
testcase_31	AC	240 ms 101,572 KB
testcase_32	AC	246 ms 101,432 KB
testcase_33	AC	238 ms 101,536 KB
testcase_34	AC	236 ms 101,512 KB
testcase_35	AC	239 ms 101,572 KB
testcase_36	AC	244 ms 101,424 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	234 ms 101,520 KB
testcase_40	AC	221 ms 101,500 KB
testcase_41	AC	232 ms 101,428 KB
testcase_42	AC	232 ms 101,544 KB
testcase_43	AC	242 ms 101,500 KB
testcase_44	AC	234 ms 101,488 KB
testcase_45	AC	242 ms 101,376 KB
testcase_46	AC	238 ms 101,696 KB
testcase_47	AC	232 ms 101,664 KB
testcase_48	AC	233 ms 101,368 KB
testcase_49	AC	258 ms 101,432 KB
testcase_50	AC	245 ms 101,508 KB
testcase_51	AC	267 ms 101,488 KB
testcase_52	WA	-
testcase_53	AC	234 ms 101,364 KB
testcase_54	AC	238 ms 101,436 KB
testcase_55	AC	245 ms 101,548 KB
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	241 ms 101,548 KB
testcase_59	WA	-
testcase_60	WA	-

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

ソースコード

raw source code

#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=MOD)
{
    if (a == 0) exit(8);
    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;
    }
}

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

int main()
{
    facInit(1 << 22);
    int D, L, R, K;
    cin >> D >> L >> R >> K;
    int dl = dd(L), dr = dd(R);
    int k = K - (dr - dl);
    if (k % 2 or k < 0)
    {
        ZERO();
    }
    k /= 2;
    int r = dl - 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 (dl == r)
    {
        ret = ret * mod_inverse(1 << (r - 1)) % MOD;
    }
    else if (dl == dr)
    {
        ret = ret * mod_inverse((1 << (dr - 1)) - 1) % MOD * ((1 << (dr - r - 1))) % MOD;
    }
    else
    {
        ret = ret * mod_inverse(1 << (r - 1)) % MOD;
    }
    cout << ret % MOD << endl;
}

yukicoder

結果

テストケース

ソースコード