結果
問題 | No.916 Encounter On A Tree |
ユーザー | recososo |
提出日時 | 2022-07-06 01:24:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 6,713 bytes |
コンパイル時間 | 6,469 ms |
コンパイル使用メモリ | 304,296 KB |
実行使用メモリ | 15,628 KB |
最終ジャッジ日時 | 2024-05-09 21:52:40 |
合計ジャッジ時間 | 8,552 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 19 ms
15,512 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 20 ms
15,620 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 20 ms
15,628 KB |
testcase_08 | AC | 5 ms
6,944 KB |
testcase_09 | AC | 7 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 19 ms
15,352 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 20 ms
15,468 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 19 ms
15,540 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 19 ms
15,624 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 19 ms
15,500 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 19 ms
15,620 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 19 ms
15,572 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 12 ms
9,216 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 19 ms
15,628 KB |
testcase_30 | AC | 2 ms
6,940 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 | 7 ms
6,940 KB |
testcase_35 | AC | 4 ms
6,940 KB |
testcase_36 | AC | 19 ms
15,416 KB |
testcase_37 | AC | 19 ms
15,476 KB |
testcase_38 | AC | 7 ms
6,944 KB |
testcase_39 | AC | 1 ms
6,940 KB |
testcase_40 | AC | 20 ms
15,504 KB |
testcase_41 | AC | 2 ms
6,944 KB |
testcase_42 | AC | 2 ms
6,940 KB |
testcase_43 | AC | 2 ms
6,940 KB |
testcase_44 | AC | 2 ms
6,940 KB |
testcase_45 | AC | 5 ms
6,944 KB |
testcase_46 | AC | 2 ms
6,940 KB |
testcase_47 | AC | 3 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,940 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,940 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,940 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; #include<atcoder/all> using namespace atcoder; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() #define ALLR(v) (v).rbegin(),(v).rend() #define SORT(v) sort(ALL(v)) #define REV(v) reverse(ALL(v)) #define UNIQUE(x) SORT(x), x.erase(unique(ALL(x)), x.end()) #define fi first #define se second #define PB push_back #define EB emplace_back using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> using vc = vector<T>; template <typename T> using vvc = vector<vc<T>>; template <typename T> using vvvc = vector<vvc<T>>; using vi = vc<int>; using vl = vc<ll>; using vpi = vc<pii>; using vpl = vc<pll>; // noimi #define INT(...) int __VA_ARGS__;IN(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;IN(__VA_ARGS__) #define STR(...) string __VA_ARGS__;IN(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;IN(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size);IN(name) #define VEC2(type, name1, name2, size) vector<type> name1(size), name2(size);for(int i = 0; i < size; i++) IN(name1[i], name2[i]) #define VEC3(type, name1, name2, name3, size) vector<type> name1(size), name2(size), name3(size);for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i]) #define VEC4(type, name1, name2, name3, name4, size) vector<type> name1(size), name2(size), name3(size), name4(size); for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]); #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w));IN(name) int scan() { return getchar(); } void scan(int &a) { cin >> a; } void scan(long long &a) { cin >> a; } void scan(char &a) { cin >> a; } void scan(double &a) { cin >> a; } void scan(string &a) { cin >> a; } template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); } template <class T> void scan(vector<T> &); template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);} template <class T> void scan(T &a) { cin >> a; } void IN() {} template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {scan(head);IN(tail...);} // tute7627 template<typename T> using PQ = priority_queue<T>; template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>; template<typename T>void stout(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j]<<" \n"[j==w-1];}}; template<typename T>void stout(const T &v,ll n){for(ll i=0;i<n;i++)cout<<v[i]<<" \n"[i==n-1];}; template<typename T>void stout(const vector<T>&v){stout(v,v.size());} template<typename T>void stout(const vector<vector<T>>&v){for(auto &vv:v)stout(vv,vv.size());} template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}}; template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];}; template<typename T>void debug(const vector<T>&v){debug(v,v.size());} template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());} template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;} template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;} template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;} template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;} template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;} int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; void OUT() {cout << endl;} template <class Head, class... Tail>void OUT(Head&& head, Tail&&... tail){cout << head;if(sizeof...(tail)) cout << " ";OUT(move(tail)...);} void ERR() {cerr << endl;} template <class Head, class... Tail>void ERR(Head&& head, Tail&&... tail){cerr << head;if(sizeof...(tail)) cerr << " ";ERR(move(tail)...);} void fsp(int n){cout << fixed << setprecision(n);} 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; } const ll INF=1LL<<60; const int inf=(1<<30)-1; const int mod=998244353; // const int mod=1e9+7; int dx[8]={1,0,-1,0,-1,-1,1,1}; int dy[8]={0,1,0,-1,-1,1,-1,1}; // using mint=modint998244353; using mint=modint1000000007; template< typename T > struct Combination { vector< T > _fact, _rfact, _inv; Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) { _fact[0] = _rfact[sz] = _inv[0] = 1; for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i; _rfact[sz] /= _fact[sz]; for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1); for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1]; } inline T fact(int k) const { return _fact[k]; } inline T rfact(int k) const { return _rfact[k]; } inline T inv(int k) const { return _inv[k]; } T P(int n, int r) const { if(r < 0 || n < r) return 0; return fact(n) * rfact(n - r); } T C(int p, int q) const { if(q < 0 || p < q) return 0; return fact(p) * rfact(q) * rfact(p - q); } T H(int n, int r) const { if(n < 0 || r < 0) return (0); return r == 0 ? 1 : C(n + r - 1, r); } }; int main(){ cin.tie(0); ios::sync_with_stdio(false); INT(d,l,r,k); int dl=pophigh(l),dr=pophigh(r); int dd=k-(dr-dl); if(dd<0||dd%2!=0||k>dr+dl){ OUT(0); return 0; } int h=dl-dd/2; mint ans=1; if(dl!=h) ans*=mint(2).pow(dl-h-1)*mint(2).pow(dr-h-1)*mint(2).pow(h)*2; if(dl==h) ans*=mint(2).pow(dl)*mint(2).pow(dr-h-1)*2; // ERR(dl,dr,h,ans.val()); Combination<mint> com(1<<d); REP(i,d){ if(i==dl&&i==dr) ans*=com.fact((1<<i)-2); else if(i==dl||i==dr) ans*=com.fact((1<<i)-1); else ans*=com.fact((1<<i)); } OUT(ans.val()); }