#552170 (C++17) No.1227 I hate ThREE

提出ソース

結果

問題	No.1227 I hate ThREE
ユーザー	👑 tute7627
提出日時	2020-09-12 02:19:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	50 ms / 2,000 ms
コード長	5,582 bytes
コンパイル時間	2,424 ms
コンパイル使用メモリ	211,472 KB
実行使用メモリ	11,256 KB
最終ジャッジ日時	2023-08-30 14:58:02
合計ジャッジ時間	4,493 ms
ジャッジサーバーID （参考情報）	judge11 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	3 ms 4,376 KB
testcase_05	AC	4 ms 4,384 KB
testcase_06	AC	2 ms 4,376 KB
testcase_07	AC	1 ms 4,376 KB
testcase_08	AC	14 ms 5,744 KB
testcase_09	AC	12 ms 5,376 KB
testcase_10	AC	10 ms 4,964 KB
testcase_11	AC	38 ms 10,712 KB
testcase_12	AC	39 ms 11,120 KB
testcase_13	AC	6 ms 4,376 KB
testcase_14	AC	12 ms 5,464 KB
testcase_15	AC	15 ms 6,204 KB
testcase_16	AC	24 ms 7,764 KB
testcase_17	AC	18 ms 6,704 KB
testcase_18	AC	29 ms 8,932 KB
testcase_19	AC	26 ms 8,120 KB
testcase_20	AC	30 ms 9,196 KB
testcase_21	AC	4 ms 4,380 KB
testcase_22	AC	26 ms 8,272 KB
testcase_23	AC	47 ms 10,952 KB
testcase_24	AC	45 ms 11,216 KB
testcase_25	AC	50 ms 11,256 KB
testcase_26	AC	38 ms 10,700 KB
testcase_27	AC	39 ms 10,992 KB
testcase_28	AC	40 ms 11,056 KB
testcase_29	AC	40 ms 11,060 KB
testcase_30	AC	38 ms 10,792 KB
testcase_31	AC	38 ms 10,788 KB
testcase_32	AC	38 ms 11,020 KB
testcase_33	AC	38 ms 10,792 KB
testcase_34	AC	39 ms 10,692 KB
testcase_35	AC	37 ms 10,692 KB

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
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< MOD1 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}
//using modint=ld;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,c;cin>>n>>c;
  vector<vector<ll>>g(n);
  rep(i,0,n-1){
    ll u,v;cin>>u>>v;u--;v--;
    g[u].PB(v);
    g[v].PB(u);
  }
  modint te=modint(1)/2;
  auto solve=[&](ll sz){
    ll lim=1005;
    auto dp=make_v(n,min(sz,2*lim),modint(1));
    //cout<<sz spa lim<<endl;
    bool t=sz>2*lim;
    vector<modint>rem(n,2);
    auto dfs=[&](auto &&f,ll k,ll par)->void{
      for(auto to:g[k]){
        if(to==par)continue;
        f(f,to,k);
        if(t){
          rep(i,0,lim){
            modint mul=0;
            if(i>0)mul+=dp[to][i-1];
            if(i<lim-1)mul+=dp[to][i+1];
            if(i==lim-1)mul+=rem[to]*te;
            dp[k][i]*=mul;
          }
          rep(i,lim,2*lim){
            modint mul=0;
            if(i>lim)mul+=dp[to][i-1];
            if(i<2*lim-1)mul+=dp[to][i+1];
            if(i==lim)mul+=rem[to]*te;
            dp[k][i]*=mul;
          }
          rem[k]*=rem[to];
        }
        else{
          rep(i,0,sz){
            modint mul=0;
            if(i>0)mul+=dp[to][i-1];
            if(i<sz-1)mul+=dp[to][i+1];
            dp[k][i]*=mul;
          }
        }
      }
      //debug(dp,n);
    };
    dfs(dfs,0,-1);
    //debug(dp[0],dp[0].size());
    //debug(rem,n);
    modint ret=rem[0]*max(0LL,sz-2*lim)*te;
    for(auto z:dp[0])ret+=z;
    return ret;
  };
  modint ret=0;
  rep(i,0,3)ret+=solve((c-1-i)/3+1);
  cout<<ret<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード