結果

問題 No.2892 Lime and Karin
ユーザー dyktr_06dyktr_06
提出日時 2024-09-14 00:50:00
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 7,402 bytes
コンパイル時間 5,010 ms
コンパイル使用メモリ 271,884 KB
実行使用メモリ 256,784 KB
最終ジャッジ日時 2024-09-14 00:50:15
合計ジャッジ時間 14,990 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 11 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return
    os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v
    .size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";
    } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr
    << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<
    *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os
    << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;
    cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
ll T;
void input(){
in(T);
}
void solve(){
ll n; in(n);
vector<vll> G(n);
rep(i, n - 1){
ll a, b; in(a, b);
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
string s; in(s);
vll used(n), siz(n), par(n);
auto calcSize = [&](auto &self, ll cur, ll prv) -> void {
siz[cur] = 1;
for(auto v : G[cur]){
if(!used[v] && v != prv){
self(self, v, cur);
siz[cur] += siz[v];
}
}
};
ll cnt = 0;
auto f = [&](auto &self, ll cur, ll prv) -> vll {
calcSize(calcSize, cur, -1);
ll tot = siz[cur];
bool ok = false;
ll pp = -1;
//
while(!ok){
ok = true;
for(auto v : G[cur]){
if(!used[v] && v != pp && 2 * siz[cur] > tot){
pp = cur, cur = v, ok = false;
break;
}
}
}
par[cur] = prv;
// -siz siz
ll cursiz = tot;
vll res(cursiz * 2 + 1), fres(cursiz * 2 + 1), memo(cursiz * 2 + 1);
ll d = (s[cur] == '1' ? 1 : -1);
fres[cursiz + d] = 1;
vll f;
auto countCS = [&](auto &self, ll cur, ll prv, ll cs) -> void {
if(s[cur] == '1') cs++;
else cs--;
ll fsiz = (f.size() - 1) / 2;
f[cs + fsiz]++;
for(auto v : G[cur]){
if(!used[v] && v != prv){
self(self, v, cur, cs);
}
}
};
calcSize(calcSize, cur, -1);
used[cur] = true;
if(cursiz == 1) return fres;
// 辿
for(auto v : G[cur]){
if(!used[v]){
f.assign(siz[v] * 2 + 1, 0);
countCS(countCS, v, cur, 0);
ll fsiz = (ll) (f.size() - 1) / 2;
rep(i, (ll) f.size()){
res[i - fsiz + cursiz] += f[i];
fres[i - fsiz + cursiz + d] += f[i];
}
vll f2 = convolution_ll(f, f);
rep(i, (ll) f2.size()){
ll idx = i - fsiz * 2 + cursiz;
if(idx < 0 || idx > cursiz * 2) continue;
memo[idx] -= f2[i];
}
vll sub = self(self, v, cur);
ll subsiz = (ll) (sub.size() - 1) / 2;
rep(i, (ll) sub.size()){
fres[i - subsiz + cursiz] += sub[i];
}
}
}
res = convolution_ll(res, res);
rep(i, cursiz, (ll) res.size()){
ll idx = i - cursiz;
if(idx < 0 || idx > cursiz * 2) break;
memo[idx] += res[i];
}
rep(i, cursiz * 2 + 1){
memo[i] /= 2;
if(0 <= i + d && i + d < cursiz * 2 + 1) fres[i + d] += memo[i];
}
// out(fres);
return fres;
};
vll res = f(f, 0, -1);
// out(res);
ll ans = 0;
rep(i, n + 1, 2 * n + 1){
ans += res[i];
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
T = 1;
// input();
while(T--) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0