#1009883 (C++17) No.2892 Lime and Karin

提出ソース

結果

問題	No.2892 Lime and Karin
ユーザー	👑 tute7627
提出日時	2024-09-13 21:40:30
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	424 ms / 8,000 ms
コード長	13,317 bytes
コンパイル時間	3,360 ms
コンパイル使用メモリ	241,560 KB
実行使用メモリ	31,244 KB
最終ジャッジ日時	2024-09-13 21:40:52
合計ジャッジ時間	12,900 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	3 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	3 ms 5,376 KB
testcase_14	AC	100 ms 8,064 KB
testcase_15	AC	94 ms 7,808 KB
testcase_16	AC	171 ms 10,368 KB
testcase_17	AC	36 ms 5,376 KB
testcase_18	AC	164 ms 10,624 KB
testcase_19	AC	241 ms 12,928 KB
testcase_20	AC	12 ms 5,376 KB
testcase_21	AC	118 ms 8,832 KB
testcase_22	AC	163 ms 10,240 KB
testcase_23	AC	61 ms 6,400 KB
testcase_24	AC	248 ms 13,056 KB
testcase_25	AC	247 ms 13,056 KB
testcase_26	AC	252 ms 13,056 KB
testcase_27	AC	243 ms 13,056 KB
testcase_28	AC	241 ms 13,056 KB
testcase_29	AC	257 ms 13,056 KB
testcase_30	AC	268 ms 13,056 KB
testcase_31	AC	260 ms 13,056 KB
testcase_32	AC	259 ms 13,056 KB
testcase_33	AC	253 ms 13,184 KB
testcase_34	AC	62 ms 22,464 KB
testcase_35	AC	61 ms 22,600 KB
testcase_36	AC	64 ms 22,596 KB
testcase_37	AC	66 ms 22,596 KB
testcase_38	AC	65 ms 22,596 KB
testcase_39	AC	422 ms 31,168 KB
testcase_40	AC	424 ms 31,244 KB
testcase_41	AC	241 ms 17,408 KB
testcase_42	AC	233 ms 17,408 KB
testcase_43	AC	230 ms 17,408 KB
testcase_44	AC	81 ms 7,424 KB
testcase_45	AC	227 ms 12,160 KB
testcase_46	AC	100 ms 7,808 KB
testcase_47	AC	137 ms 9,344 KB
testcase_48	AC	54 ms 6,016 KB
testcase_49	AC	163 ms 10,112 KB
testcase_50	AC	157 ms 18,048 KB
testcase_51	AC	154 ms 17,948 KB
testcase_52	AC	148 ms 17,684 KB
testcase_53	AC	154 ms 17,812 KB
testcase_54	AC	144 ms 17,908 KB

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

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


#ifdef LOCAL
#include <debug_print.hpp>
#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define OUT(...) (static_cast<void>(0))
#endif

#define endl '\n'
#define lfs cout<<fixed<<setprecision(15)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#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--)

namespace template_tute{
  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 T> using PQ = priority_queue<T>;
  template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
  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<ll>({a,b,c})-min<ll>({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 T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
  template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
  template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
  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()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
  template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
  template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
  template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
  template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
  template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
  template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
  template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
  template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";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;}
  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){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;}
  template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
    auto tmp = v;
    for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
  }
  template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
    rearrange(ord, head);
    rearrange(ord, tail...);
  }
  template<typename T> vector<int> ascend(const vector<T>&v){
    vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
    sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
    return ord;
  }
  template<typename T> vector<int> descend(const vector<T>&v){
    vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
    sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
    return ord;
  }
  template<typename T> vector<T> inv_perm(const vector<T>&ord){
    vector<T>inv(ord.size());
    for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
    return inv;
  }
  ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
  ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
  ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
  ll modulo(ll n,ll d){return (n%d+d)%d;};
  template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
  template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
  template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
  template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
  //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
  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);};
  template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
  template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
  template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
  template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
  ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
  ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
  ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
  std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
      __uint128_t tmp = value < 0 ? -value : value;
      char buffer[128];
      char *d = std::end(buffer);
      do {
        --d;
        *d = "0123456789"[tmp % 10];
        tmp /= 10;
      } while (tmp != 0);
      if (value < 0) {
        --d;
        *d = '-';
      }
      int len = std::end(buffer) - d;
      if (dest.rdbuf()->sputn(d, len) != len) {
        dest.setstate(std::ios_base::badbit);
      }
    }
    return dest;
  }
  namespace converter{
    int dict[500];
    const string lower="abcdefghijklmnopqrstuvwxyz";
    const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    const string digit="0123456789";
    const string digit1="123456789";
    void regi_str(const string &t){
      for(int i=0;i<t.size();i++){
        dict[t[i]]=i;
      }
    }
    void regi_int(const string &t){
      for(int i=0;i<t.size();i++){
        dict[i]=t[i];
      }
    }
    vector<int>to_int(const string &s,const string &t){
      regi_str(t);
      vector<int>ret(s.size());
      for(int i=0;i<s.size();i++){
        ret[i]=dict[s[i]];
      }
      return ret;
    }
    vector<int>to_int(const string &s){
      auto t=s;
      sort(t.begin(),t.end());
      t.erase(unique(t.begin(),t.end()),t.end());
      return to_int(s,t);
    }
    
    vector<vector<int>>to_int(const vector<string>&s,const string &t){
      regi_str(t);
      vector<vector<int>>ret(s.size(),vector<int>(s[0].size()));
      for(int i=0;i<s.size();i++){
        for(int j=0;j<s[0].size();j++){
          ret[i][j]=dict[s[i][j]];
        }
      }
      return ret;
    }
    vector<vector<int>>to_int(const vector<string>&s){
      string t;
      for(int i=0;i<s.size();i++){
        t+=s[i];
      }
      sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());
      return to_int(s,t);
    }
    string to_str(const vector<int>&s,const string &t){
      regi_int(t);
      string ret;
      for(auto z:s)ret+=dict[z];
      return ret;
    }
    vector<string> to_str(const vector<vector<int>>&s,const string &t){
      regi_int(t);
      vector<string>ret(s.size());
      for(int i=0;i<s.size();i++){
        for(auto z:s[i])ret[i]+=dict[z];
      }
      return ret;
    }
  }
  template< typename T = int >
  struct edge {
    int to;
    T cost;
    int id;
    edge():to(-1),id(-1){};
    edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
    operator int() const { return to; }
  };

  template<typename T>
  using Graph = vector<vector<edge<T>>>;
  template<typename T>
  Graph<T>revgraph(const Graph<T> &g){
    Graph<T>ret(g.size());
    for(int i=0;i<g.size();i++){
      for(auto e:g[i]){
        int to = e.to;
        e.to = i;
        ret[to].push_back(e);
      }
    }
    return ret;
  }
  template<typename T>
  Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
    Graph<T> ret(n);
    for(int es = 0; es < m; es++){
      int u,v;
      T w=1;
      cin>>u>>v;u-=indexed,v-=indexed;
      if(weighted)cin>>w;
      ret[u].emplace_back(v,w,es);
      if(!directed)ret[v].emplace_back(u,w,es);
    }
    return ret;
  }
  template<typename T>
  Graph<T> readParent(int n,int indexed=1,bool directed=true){
    Graph<T>ret(n);
    for(int i=1;i<n;i++){
      int p;cin>>p;
      p-=indexed;
      ret[p].emplace_back(i);
      if(!directed)ret[i].emplace_back(p);
    }
    return ret;
  }
}
using namespace template_tute;
template<typename T>
struct CentroidDecomposition{
  int n;
  const Graph<T> &g;
  vector<bool> used;//既に重心として選ばれたか
  vector<int> sub;//部分木のサイズ
  CentroidDecomposition(const Graph<T> &g):n(g.size()),g(g){
    sub.assign(g.size(), 0);
    used.assign(g.size(), false);
  }
  int search_centroid(int root){
    return dfs_search(root, -1, dfs_sz(root, -1) / 2 );
  }
  int dfs_sz(int k, int par){
    sub[k] = 1;
    for(auto e:g[k]){
      if(e.to == par || used[e.to])continue;
      sub[k] += dfs_sz(e.to, k);
    }
    return sub[k];
  }
  int dfs_search(int k,int par, int mid){
    for(auto e:g[k]){
      if(e.to == par || used[e.to])continue;
      if(sub[e.to] > mid)return dfs_search(e.to, k, mid);
    }
    return k;
  }
  vector<int> centroid_enum(int root = 0){
    vector<int>ret;
    ret.push_back(search_centroid(root));
    for(auto e:g[ret[0]]){
      if(used[e.to] || n != 2 * sub[e.to])continue;
      ll c = search_centroid(e.to);
      if(c != ret[0]){
        ret.push_back(c);
        break;
      }
    }
    return ret;
  }
  vector<vector<int>>belong;//所属する重心の一覧
  vector<int>pr;//重心木における深さ？
  void build_all(){
    belong.resize(n);pr.resize(n);
    build(0,0);
  }
  void build(int root,int num){
    int cent = search_centroid(root);
    used[cent] = true;
    pr[cent]=num;
    build_dfs(cent, -1, cent);
    for(auto e:g[cent])if(!used[e.to])build(e.to,num+1);
    used[cent] = false;
  }
  void build_dfs(int k,int par,int cent){
    belong[k].push_back(cent);
    for(auto e:g[k]){
      if(e.to == par || used[e.to])continue;
      build_dfs(e.to, k, cent);
    }
  }
  ll ret;
  string s;
  void run(){
    //何か前処理を書くなら
    ret=0;
    solve(0);
  }

  void solve(int root){
    int cent = search_centroid(root);
    int size = sub[root];
    used[cent] = true;
    vector<map<ll,ll>>ver;
    ll sz=0;
    if(s[cent]=='1')ret+=2;
    int val=s[cent]=='1'?1:-1;
    for(auto e:g[cent]){
      if(!used[e.to]){
        ver.emplace_back();
        dfs(e.to,-1,val,ver.back());
        for(auto z:ver.back()){
          chmax(sz,abs(z.fi));
        }
      }
    }
    ll off=sz+4;
    vector<ll>all(2*sz+7);
    for(auto &z:ver){
      for(auto zz:z){
        all[zz.fi+off]+=zz.se;
      }
    }
    rrep(i,0,all.size()-1){
      all[i]+=all[i+1];
    }
    OUT(ver);
    for(auto &z:ver){
      ll nsz=0;
      for(auto zz:z){
        chmax(nsz,abs(zz.fi));
      }
      ll noff=nsz+4;
      vector<ll>tmp(2*nsz+7);
      for(auto zz:z){
        tmp[zz.fi+noff]+=zz.se;
      }
      rrep(i,0,tmp.size()-1){
        tmp[i]+=tmp[i+1];
      }
      //OUT(z);
      for(auto zz:z){
        ret+=(all[-zz.fi+off+1+val]-tmp[-zz.fi+noff+1+val])*zz.se;
      }
    }
    for(auto e:g[cent]){
      if(!used[e.to]){
        solve(e.to);
      }
    }
    used[cent] = false;

    return;
  }
  void dfs(int k,int par,ll sum,map<ll,ll>&mp){
    sum+=(s[k]=='1'?1:-1);
    mp[sum]++;
    if(sum>0)ret+=2;
    for(auto e:g[k]){
      if(e.to==par||used[e.to])continue;
      dfs(e.to,k,sum,mp);
    }
  }
};
void solve(){
	ll res=0,buf=0;
  bool judge = true;

  ll n;cin>>n;
  auto g=readGraph<ll>(n,n-1);
  string s;cin>>s;
  CentroidDecomposition<ll> cd(g);
  cd.s=s;
  cd.run();
  cout<<cd.ret/2<<endl;
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  int T = 1;
  //cin>>T;
  while(T--){
    solve();
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード