結果
問題 | No.916 Encounter On A Tree |
ユーザー | renjyaku_int |
提出日時 | 2020-03-17 19:56:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 11 ms / 2,000 ms |
コード長 | 2,882 bytes |
コンパイル時間 | 1,463 ms |
コンパイル使用メモリ | 169,880 KB |
実行使用メモリ | 11,740 KB |
最終ジャッジ日時 | 2024-05-08 01:21:36 |
合計ジャッジ時間 | 3,470 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 10 ms
11,588 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 10 ms
11,524 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 10 ms
11,704 KB |
testcase_08 | AC | 10 ms
11,620 KB |
testcase_09 | AC | 10 ms
11,736 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 11 ms
11,592 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 10 ms
11,660 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 9 ms
11,740 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 9 ms
11,692 KB |
testcase_18 | AC | 9 ms
11,624 KB |
testcase_19 | AC | 9 ms
11,624 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 9 ms
11,628 KB |
testcase_22 | AC | 1 ms
6,940 KB |
testcase_23 | AC | 8 ms
11,688 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 9 ms
11,740 KB |
testcase_26 | AC | 2 ms
6,944 KB |
testcase_27 | AC | 10 ms
11,628 KB |
testcase_28 | AC | 1 ms
6,940 KB |
testcase_29 | AC | 9 ms
11,540 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 2 ms
6,944 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 2 ms
6,944 KB |
testcase_34 | AC | 9 ms
11,528 KB |
testcase_35 | AC | 9 ms
11,668 KB |
testcase_36 | AC | 10 ms
11,660 KB |
testcase_37 | AC | 10 ms
11,624 KB |
testcase_38 | AC | 10 ms
11,536 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 9 ms
11,584 KB |
testcase_41 | AC | 9 ms
11,664 KB |
testcase_42 | AC | 10 ms
11,680 KB |
testcase_43 | AC | 9 ms
11,628 KB |
testcase_44 | AC | 2 ms
6,944 KB |
testcase_45 | AC | 9 ms
11,516 KB |
testcase_46 | AC | 1 ms
6,944 KB |
testcase_47 | AC | 9 ms
11,536 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 10 ms
11,660 KB |
testcase_50 | AC | 10 ms
11,672 KB |
testcase_51 | AC | 8 ms
11,628 KB |
testcase_52 | AC | 10 ms
11,736 KB |
testcase_53 | AC | 10 ms
11,700 KB |
testcase_54 | AC | 2 ms
6,940 KB |
testcase_55 | AC | 9 ms
11,680 KB |
testcase_56 | AC | 9 ms
11,668 KB |
testcase_57 | AC | 10 ms
11,500 KB |
testcase_58 | AC | 9 ms
11,592 KB |
testcase_59 | AC | 9 ms
11,524 KB |
testcase_60 | AC | 8 ms
11,628 KB |
ソースコード
//#include <tourist> #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> p; const int INF = 1e9; const ll LINF = ll(1e18) + 1; const int MOD = 1000000007; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } //cout<<fixed<<setprecision(15);有効数字15桁 //-std=c++14 ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } ll d, l, r, k; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> d >> l >> r >> k; ll base = 1; ll lrank, rrank; ll count = 0; while (true) { base *= 2; if (l < base) { lrank = count; break; } count++; } base = 1; count = 0; while (true) { base *= 2; if (r < base) { rrank = count; break; } count++; } //cout << lrank << " " << rrank << "\n"; ll lcarank=0; while(lrank+rrank-2*lcarank>k&&lcarank<=min(lrank,rrank)){ lcarank++; } ll ans = 1; if(rrank+lrank==k+2*lcarank){ if(lrank==lcarank){ ans=(1<<lrank); ans*=(1<<(rrank-lrank));//lcaから到達する頂点数 ans%=MOD; } else{ ans=(1<<(lrank-lcarank-1)); ans *= (1 << (rrank - lcarank - 1)); ans%=MOD; ans *= (1 << lcarank); ans%=MOD; ans*=2; ans%=MOD; } } else{ return cout<<0<<"\n",0; } vector<ll> factm((1 << 20), 1); ll fact = 1; for (int i = 1; i < (1 << 20); i++) { fact *= i; fact %= MOD; factm[i] = fact; } for (int i = 1; i < d; i++) { ll now = pow(2, i); if (i == lrank && i == rrank) { ans *= factm[now-2]; ans %= MOD; } else if (i == lrank || i == rrank) { ans *= factm[now-1]; ans %= MOD; } else { ans *= factm[now]; ans %= MOD; } } cout << ans << "\n"; }