結果
問題 | No.916 Encounter On A Tree |
ユーザー | FF256grhy |
提出日時 | 2019-10-26 00:16:11 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 4,667 bytes |
コンパイル時間 | 1,705 ms |
コンパイル使用メモリ | 172,208 KB |
実行使用メモリ | 11,520 KB |
最終ジャッジ日時 | 2024-09-13 11:12:22 |
合計ジャッジ時間 | 3,519 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 13 ms
11,520 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 13 ms
11,500 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 12 ms
11,516 KB |
testcase_08 | AC | 4 ms
5,376 KB |
testcase_09 | AC | 6 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 13 ms
11,392 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 13 ms
11,392 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 13 ms
11,388 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 13 ms
11,520 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 13 ms
11,392 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 13 ms
11,412 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 13 ms
11,396 KB |
testcase_26 | AC | 2 ms
6,944 KB |
testcase_27 | AC | 8 ms
7,316 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 13 ms
11,444 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 2 ms
6,940 KB |
testcase_32 | AC | 2 ms
6,944 KB |
testcase_33 | AC | 2 ms
6,944 KB |
testcase_34 | AC | 6 ms
6,944 KB |
testcase_35 | AC | 4 ms
6,944 KB |
testcase_36 | AC | 13 ms
11,444 KB |
testcase_37 | AC | 12 ms
11,392 KB |
testcase_38 | AC | 6 ms
6,940 KB |
testcase_39 | AC | 2 ms
6,940 KB |
testcase_40 | AC | 12 ms
11,412 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,940 KB |
testcase_45 | AC | 4 ms
6,940 KB |
testcase_46 | AC | 2 ms
6,940 KB |
testcase_47 | AC | 2 ms
6,944 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | AC | 2 ms
6,944 KB |
testcase_51 | AC | 2 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,944 KB |
testcase_53 | AC | 2 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,940 KB |
testcase_55 | AC | 2 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,940 KB |
testcase_59 | AC | 2 ms
6,944 KB |
testcase_60 | AC | 2 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(LL i = (l) ; i < (r); ++i) #define incII(i, l, r) for(LL i = (l) ; i <= (r); ++i) #define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i) #define decII(i, l, r) for(LL i = (r) ; i >= (l); --i) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() template<typename T> bool setmin (T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template<typename T> bool setmax (T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; } LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); } LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); } template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } #define bit(b, i) (((b) >> (i)) & 1) #define BC __builtin_popcountll #define SC static_cast #define SI(v) SC<int>(v.size()) #define SL(v) SC<LL >(v.size()) #define RF(e, v) for(auto & e: v) #define ef else if #define UR assert(false) // ---- ---- template<LL M> class ModInt { private: LL v = 0; public: ModInt() { } ModInt(LL vv) { setval(vv); } ModInt & setval(LL vv) { v = vv % M; if(v < 0) { v += M; } return (*this); } LL getval() const { return v; } ModInt & operator+=(const ModInt & b) { return setval(v + b.v); } ModInt & operator-=(const ModInt & b) { return setval(v - b.v); } ModInt & operator*=(const ModInt & b) { return setval(v * b.v); } ModInt & operator/=(const ModInt & b) { return setval(v * b.inv()); } ModInt & operator^=( LU b) { return setval(ex(v, b)); } ModInt operator+ ( ) const { return ModInt(+v); } ModInt operator- ( ) const { return ModInt(-v); } ModInt operator+ (const ModInt & b) const { return ModInt(v + b.v); } ModInt operator- (const ModInt & b) const { return ModInt(v - b.v); } ModInt operator* (const ModInt & b) const { return ModInt(v * b.v); } ModInt operator/ (const ModInt & b) const { return ModInt(v * b.inv()); } ModInt operator^ ( LU b) const { return ModInt(ex(v, b)); } LL inv() const { LL x = (ex_gcd(v, M).FI + M) % M; assert(v * x % M == 1); return x; } LL ex(LL a, LU b) const { LL D = 64, x[64], y = 1; inc(i, D) { if((b >> i) == 0) { D = i; break; } } inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % M; } inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= M; } } return y; } pair<LL, LL> ex_gcd(LL a, LL b) const { if(b == 0) { return MP(1, 0); } auto p = ex_gcd(b, a % b); return MP(p.SE, p.FI - (a / b) * p.SE); } }; template<LL M> ModInt<M> operator+(LL a, const ModInt<M> & b) { return b + a; } template<LL M> ModInt<M> operator-(LL a, const ModInt<M> & b) { return -b + a; } template<LL M> ModInt<M> operator*(LL a, const ModInt<M> & b) { return b * a; } template<LL M> ModInt<M> operator/(LL a, const ModInt<M> & b) { return a * b.inv(); } template<LL M> istream & operator>>(istream & is, ModInt<M> & b) { LL v; is >> v; b.setval(v); return is; } template<LL M> ostream & operator<<(ostream & os, const ModInt<M> & b) { return (os << b.getval()); } // ---- ---- typedef ModInt<1'000'000'007> MI; int D(int i) { int c = 0; while(i > 0) { i /= 2; c++; } return c - 1; } int main() { int d, l, r, k; cin >> d >> l >> r >> k; l = D(l); r = D(r); if(! (l <= r)) { swap(l, r); } MI ans = 1; if((l + r + k) % 2 == 0 && inII(k, r - l, l + r)) { vector<MI> f(1 << d); inc(i, 1 << d) { f[i] = (i == 0 ? 1 : f[i - 1] * i); } inc(i, d) { ans *= f[1 << i]; } int m = (l + r - k) / 2; assert(inII(m, 0, l)); if(l == r) { ans *= MI(1 << (r - m - 1)) / ((1 << r) - 1); } ef(l != m) { ans *= MI(1 << (r - m - 1)) / ((1 << r) - 0); } else { ans *= MI(1 << (r - m - 0)) / ((1 << r) - 0); } } else { ans = 0; } cout << ans << endl; return 0; }