結果
問題 | No.2892 Lime and Karin |
ユーザー | apricity |
提出日時 | 2024-11-30 01:18:34 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,669 bytes |
コンパイル時間 | 1,564 ms |
コンパイル使用メモリ | 142,880 KB |
実行使用メモリ | 13,568 KB |
最終ジャッジ日時 | 2024-11-30 01:18:45 |
合計ジャッジ時間 | 9,657 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 WA * 35 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<numeric>#include<cmath>#include<utility>#include<tuple>#include<cstdint>#include<cstdio>#include<iomanip>#include<map>#include<queue>#include<set>#include<stack>#include<deque>#include<unordered_map>#include<unordered_set>#include<bitset>#include<cctype>#include<chrono>#include<random>#include<cassert>#include<cstddef>#include<iterator>#include<string_view>#include<type_traits>#ifdef LOCAL# include "debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing namespace std;#define rep1(a) for(int i = 0; i < a; i++)#define rep2(i, a) for(int i = 0; i < a; i++)#define rep3(i, a, b) for(int i = a; i < b; i++)#define rep4(i, a, b, c) for(int i = a; i < b; i += c)#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep1(a) for(int i = (a)-1; i >= 0; i--)#define rrep2(i, a) for(int i = (a)-1; i >= 0; i--)#define rrep3(i, a, b) for(int i = (b)-1; i >= a; i--)#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define pb push_backusing ll = long long;using D = double;using LD = long double;using P = pair<int, int>;using vi = vector<int>;using vl = vector<ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vector<vc<T>>;template <class T> using vvvc = vector<vvc<T>>;template <class T> using vvvvc = vector<vvvc<T>>;template <class T> using vvvvvc = vector<vvvvc<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))template<typename T> using PQ = priority_queue<T,vector<T>>;template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;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; }void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}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();for (int i = 0; i < s; i++) 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, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template<typename T, class... U, char sep = ' '>void outr(const T &t, const U &...u) {cout << t;outr(u...);}string s;int f[101010];int freqf[202020];int maxf = -101010, minf = 101010;ll ans = 0;struct CentroidDecomposition {int n;const vector<vector<int>> &g;vector<int> sz, par;vector<bool> removed;CentroidDecomposition(const vector<vector<int>> &g) :n(g.size()), g(g), sz(g.size(), 0), par(g.size(), -1), removed(g.size(), false) {}void calcSubtreeSize(int u, int p) {sz[u] = 1;for (int v : g[u]) {if (!removed[v] and v != p) {calcSubtreeSize(v, u);sz[u] += sz[v];}}}void calcF(int u, int p) {f[u] += (s[u] == '1' ? 1 : -1);freqf[f[u]+n]++;chmax(maxf, f[u]);chmin(minf, f[u]);for (int v : g[u]) {if (!removed[v] and v != p) {f[v] = f[u];calcF(v, u);}}}void clearF(int u, int p) {f[u] = 0;for (int v : g[u]) {if (!removed[v] and v != p) {clearF(v, u);}}}void build(int u, int p) {calcSubtreeSize(u, -1);int sz_root = sz[u];bool found = false;int pr = -1;while (!found) {found = true;for (int v : g[u]) {if (!removed[v] and v != pr and 2*sz[v] > sz_root) {pr = u, u = v, found = false;break;}}}par[u] = p;maxf = -101010, minf = 101010;f[u] = 0;calcF(u, -1);ll cs = 0;rep(i,f[u]-minf+1, maxf+1) cs += freqf[i+n];rep(i,minf,maxf+1){ans += freqf[i+n] * cs;cs += freqf[f[u]-i+n];if(i*2 > f[u]) {ans -= (ll)freqf[i+n] * freqf[i+n];ans += (ll)freqf[i+n] * (freqf[i+n]-1);}}rep(i,minf,maxf+1) freqf[i+n] = 0;for(int v : g[u]) if(!removed[v]){maxf = -101010, minf = 101010;cs = 0;f[v] = 0;calcF(v, u);rep(i,f[v]-minf+1, maxf+1) cs += freqf[i+n];rep(i,minf,maxf+1){ans -= freqf[i+n] * cs;cs += freqf[f[v]-i+n];if(i*2 > f[v]) {ans += (ll)freqf[i+n] * freqf[i+n];ans -= (ll)freqf[i+n] * (freqf[i+n]-1);}}rep(i,minf,maxf+1) freqf[i+n] = 0;}removed[u] = true;for (int v : g[u]) if (!removed[v]) build(v, u);}};int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int n; in(n);vector<vector<int>> g(n);rep(i,n-1){int u,v; in(u,v); u--; v--;g[u].push_back(v);g[v].push_back(u);}in(s);CentroidDecomposition cd(g);cd.build(0,-1);ans /= 2;rep(i,n) if(s[i] == '1') ans++;out(ans);}