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

提出ソース

結果

問題	No.916 Encounter On A Tree
ユーザー	NyaanNyaan
提出日時	2019-10-25 23:19:58
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,805 bytes
コンパイル時間	1,681 ms
コンパイル使用メモリ	174,720 KB
実行使用メモリ	50,264 KB
最終ジャッジ日時	2024-09-13 08:47:51
合計ジャッジ時間	7,378 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	71 ms 50,156 KB
testcase_01	AC	68 ms 50,048 KB
testcase_02	AC	70 ms 50,084 KB
testcase_03	AC	64 ms 50,160 KB
testcase_04	AC	73 ms 50,124 KB
testcase_05	AC	67 ms 50,176 KB
testcase_06	AC	71 ms 50,084 KB
testcase_07	AC	72 ms 50,176 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	69 ms 49,980 KB
testcase_11	WA	-
testcase_12	AC	63 ms 50,124 KB
testcase_13	WA	-
testcase_14	AC	73 ms 50,048 KB
testcase_15	WA	-
testcase_16	AC	73 ms 50,120 KB
testcase_17	AC	65 ms 49,976 KB
testcase_18	AC	68 ms 50,100 KB
testcase_19	AC	65 ms 50,180 KB
testcase_20	AC	72 ms 50,204 KB
testcase_21	AC	68 ms 50,176 KB
testcase_22	AC	69 ms 50,128 KB
testcase_23	WA	-
testcase_24	AC	64 ms 50,176 KB
testcase_25	AC	68 ms 50,152 KB
testcase_26	AC	70 ms 50,108 KB
testcase_27	AC	73 ms 50,176 KB
testcase_28	AC	71 ms 50,168 KB
testcase_29	WA	-
testcase_30	AC	66 ms 50,176 KB
testcase_31	AC	65 ms 50,104 KB
testcase_32	AC	75 ms 50,048 KB
testcase_33	AC	67 ms 50,096 KB
testcase_34	AC	68 ms 50,128 KB
testcase_35	AC	65 ms 50,108 KB
testcase_36	AC	67 ms 50,176 KB
testcase_37	WA	-
testcase_38	AC	66 ms 50,132 KB
testcase_39	AC	71 ms 50,040 KB
testcase_40	WA	-
testcase_41	AC	68 ms 50,108 KB
testcase_42	AC	68 ms 50,176 KB
testcase_43	AC	66 ms 50,048 KB
testcase_44	AC	71 ms 49,968 KB
testcase_45	AC	67 ms 50,096 KB
testcase_46	AC	71 ms 50,048 KB
testcase_47	WA	-
testcase_48	AC	72 ms 50,192 KB
testcase_49	WA	-
testcase_50	AC	75 ms 50,048 KB
testcase_51	WA	-
testcase_52	AC	69 ms 50,048 KB
testcase_53	WA	-
testcase_54	AC	64 ms 50,164 KB
testcase_55	AC	79 ms 50,172 KB
testcase_56	AC	69 ms 50,048 KB
testcase_57	WA	-
testcase_58	WA	-
testcase_59	AC	67 ms 50,176 KB
testcase_60	AC	66 ms 50,160 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
////////////////

vector<ll> fac,finv,inv;
void COMinit(int MAX) {
  MAX++;
  fac.resize(MAX , 0);
  finv.resize(MAX , 0);
  inv.resize(MAX , 0);
  fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
  for (int i = 2; i < MAX; i++){
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
// nCk combination 
inline long long COM(int n,int k){
  if(n < k || k < 0 || n < 0) return 0;
  else return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// nPk permutation
inline long long PER(int n,int k){
  if (n < k || k < 0 || n < 0) return 0;
  else return (fac[n] * finv[n - k]) % MOD;
}
// nHk homogeneous polynomial
inline long long HGP(int n,int k){
  if(n == 0 && k == 0) return 1; //問題依存?
  else if(n < 1 || k < 0) return 0;
  else return fac[n + k - 1] * (finv[k] * finv[n - 1] % MOD) % MOD;
}

template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< MOD >;

ll ppow[3001];

void solve(){
  inl(d , l , r , k);
  ppow[0] = 1; rep1(i , 3000) ppow[i] = ppow[i-1] * 2 % MOD;
  COMinit(2000000);
  modint ans = 0;
  modint zenbu = 1;
  rep1(i , d) zenbu *= fac[ppow[i - 1]];
  trc(zenbu);
  int nl = 0 , nr = 0;
  {int nya = l; while(nya){nl++ , nya >>= 1;}}
  {int nya = r; while(nya){nr++ , nya >>= 1;}}
  trc(nl , nr);
  if(nl == nr){zenbu /= ppow[nl - 1]; zenbu /= ppow[nl - 1] - 1; }
  if(nl != nr){zenbu /= ppow[nl - 1]; zenbu /= ppow[nl - 1];}
  //
  rep1(lca , min(nl , nr)){
    if(nl + nr - lca * 2 != k) continue;
    zenbu *= ppow[nl - lca];
    zenbu *= ppow[nr - lca];
    zenbu *= ppow[lca];
    if(lca != nl) zenbu /= 2;
    if(lca != nr) zenbu /= 2;
    if(nl != nr) zenbu /= 2;
    die(zenbu);
  }
  out(0);


}

yukicoder

結果

テストケース

ソースコード