結果
| 問題 | No.2115 Making Forest Easy |
| ユーザー |
 mtsd
|
| 提出日時 | 2022-10-28 23:19:22 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 660 ms / 2,000 ms |
| コード長 | 15,964 bytes |
| コンパイル時間 | 3,001 ms |
| コンパイル使用メモリ | 229,956 KB |
| 実行使用メモリ | 321,712 KB |
| 最終ジャッジ日時 | 2023-09-20 06:35:36 |
| 合計ジャッジ時間 | 25,548 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 3 ms
5,872 KB |
| testcase_01 | AC | 4 ms
5,996 KB |
| testcase_02 | AC | 660 ms
321,048 KB |
| testcase_03 | AC | 529 ms
123,768 KB |
| testcase_04 | AC | 616 ms
252,528 KB |
| testcase_05 | AC | 507 ms
190,184 KB |
| testcase_06 | AC | 650 ms
321,376 KB |
| testcase_07 | AC | 502 ms
85,516 KB |
| testcase_08 | AC | 652 ms
321,108 KB |
| testcase_09 | AC | 499 ms
84,992 KB |
| testcase_10 | AC | 657 ms
321,460 KB |
| testcase_11 | AC | 531 ms
123,612 KB |
| testcase_12 | AC | 501 ms
85,280 KB |
| testcase_13 | AC | 471 ms
111,052 KB |
| testcase_14 | AC | 499 ms
85,052 KB |
| testcase_15 | AC | 498 ms
85,776 KB |
| testcase_16 | AC | 513 ms
104,528 KB |
| testcase_17 | AC | 52 ms
16,444 KB |
| testcase_18 | AC | 113 ms
58,184 KB |
| testcase_19 | AC | 353 ms
169,472 KB |
| testcase_20 | AC | 415 ms
71,968 KB |
| testcase_21 | AC | 48 ms
23,464 KB |
| testcase_22 | AC | 112 ms
29,908 KB |
| testcase_23 | AC | 483 ms
219,500 KB |
| testcase_24 | AC | 516 ms
104,684 KB |
| testcase_25 | AC | 252 ms
92,536 KB |
| testcase_26 | AC | 501 ms
84,920 KB |
| testcase_27 | AC | 276 ms
57,868 KB |
| testcase_28 | AC | 502 ms
85,864 KB |
| testcase_29 | AC | 75 ms
40,196 KB |
| testcase_30 | AC | 503 ms
85,660 KB |
| testcase_31 | AC | 613 ms
249,748 KB |
| testcase_32 | AC | 652 ms
321,712 KB |
| testcase_33 | AC | 653 ms
320,868 KB |
| testcase_34 | AC | 64 ms
19,216 KB |
| testcase_35 | AC | 153 ms
76,552 KB |
| testcase_36 | AC | 652 ms
320,924 KB |
| testcase_37 | AC | 257 ms
55,056 KB |
| testcase_38 | AC | 140 ms
32,232 KB |
| testcase_39 | AC | 271 ms
133,524 KB |
| testcase_40 | AC | 501 ms
85,128 KB |
| testcase_41 | AC | 495 ms
85,032 KB |
| testcase_42 | AC | 530 ms
123,636 KB |
| testcase_43 | AC | 226 ms
42,220 KB |
| testcase_44 | AC | 139 ms
32,156 KB |
| testcase_45 | AC | 380 ms
65,540 KB |
| testcase_46 | AC | 533 ms
123,532 KB |
| testcase_47 | AC | 202 ms
37,664 KB |
| testcase_48 | AC | 608 ms
241,392 KB |
| testcase_49 | AC | 618 ms
259,304 KB |
| testcase_50 | AC | 328 ms
78,724 KB |
| testcase_51 | AC | 205 ms
45,172 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
os << "{";
for (int i = 0; i<(int)vec.size(); i++) {
os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "{";
for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
os << "{";
for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
os << (*itr);
++itr;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// tuple 出力
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
if(N)os<<", ";
os<<get<N>(t);
out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
os<<"(";
out<0,tuple<Ts...>,Ts...>(os,t);
os<<")";
return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#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__))))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, typename T>
std::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
array = val;
}
template<typename A, typename T>
std::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
for (auto& a : array) {
fill(a, val);
}
}
template <typename T, typename S> T ceil(T x, S y) {
assert(y);
return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));
}
template <typename T, typename S> T floor(T x, S y) {
assert(y);
return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));
}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto e : a) v.emplace_back(e);
fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto &&e : a) e = lb(v, e);
renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
vector<S> v;
fold_in(v, head, args...);
sort(all(v)), v.erase(unique(all(v)), v.end());
renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
template <unsigned int mod>
class ModInt {
private:
unsigned int v;
static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
static unsigned int inverse(int a, int m){
int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
while(*v){
t = *u / *v;
swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
}
return (u[1] % m + m) % m;
}
public:
ModInt() : v{0}{}
ModInt(const long long val) : v{norm(val % mod + mod)} {}
ModInt(const ModInt<mod>& n) : v{n()} {}
explicit operator bool() const noexcept { return v != 0; }
bool operator!() const noexcept { return !static_cast<bool>(*this); }
ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
ModInt operator+() const { return *this; }
ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
ModInt operator/(const ModInt& val) const { return *this * inv(val); }
ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
ModInt operator+(const long long val) const { return ModInt{v + val}; }
ModInt operator-(const long long val) const { return ModInt{v - val}; }
ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
ModInt& operator+=(const long long val){ return *this = *this + val; }
ModInt& operator-=(const long long val){ return *this = *this - val; }
ModInt& operator*=(const long long val){ return *this = *this * val; }
ModInt& operator/=(const long long val){ return *this = *this / val; }
bool operator==(const ModInt& val) const { return v == val.v; }
bool operator!=(const ModInt& val) const { return !(*this == val); }
bool operator==(const long long val) const { return v == norm(val % mod + mod); }
bool operator!=(const long long val) const { return !(*this == val); }
unsigned int operator()() const { return v; }
friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
friend bool operator==(const long long val, const ModInt& n) { return n == val; }
friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
friend istream& operator>>(istream& is, ModInt& n){
unsigned int v;
return is >> v, n = v, is;
}
friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
friend ModInt mod_pow(ModInt x, long long n){
ModInt ans = 1;
while(n){
if(n & 1) ans *= x;
x *= x, n >>= 1;
}
return ans;
}
};
#define MOD 998244353
using mod = ModInt<MOD>;
#define MAX_N 200000
mod inv[MAX_N],fac[MAX_N],finv[MAX_N];
void make()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i=2;i<MAX_N;i++){
inv[i] = MOD - inv[MOD % i] * (MOD / i);
fac[i] = fac[i-1] * i;
finv[i] = finv[i-1] * inv[i];
}
}
mod comb(int a, int b)
{
if(a<b) return 0;
return fac[a] * finv[b] * finv[a-b];
}
template <typename T>
struct ReRooting {
using F = function<T(T, int)>;
using F2 = function<T(T, T)>;
int V;
vector<vector<int>> G;
vector<vector<T>> dp;
// dp_v = g(merge(f(dp_c1,c1), f(dp_c2,c2), ..., f(dp_ck,ck)), v)
F f, g;
F2 merge;
T mi; // identity of merge
ReRooting() {}
ReRooting(int V, F f, F2 merge, T mi, F g)
: V(V), f(f), merge(merge), mi(mi), g(g) {
G.resize(V);
dp.resize(V);
}
void read(int idx = 1) {
int a, b;
for (int i = 0; i < V - 1; ++i) {
cin >> a >> b;
a -= idx, b -= idx;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
}
void add_edge(int a, int b) {
G[a].emplace_back(b);
G[b].emplace_back(a);
}
T dfs1(int p, int v) {
T res = mi;
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] == p) continue;
dp[v][i] = dfs1(v, G[v][i]);
res = merge(res, f(dp[v][i], G[v][i]));
}
return g(res, v);
}
void dfs2(int p, int v, T from_par) {
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] == p) {
dp[v][i] = from_par;
break;
}
}
vector<T> pR(G[v].size() + 1);
pR[G[v].size()] = mi;
for (int i = G[v].size(); i > 0; --i)
pR[i - 1] = merge(pR[i], f(dp[v][i - 1], G[v][i - 1]));
T pL = mi;
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] != p) {
T val = merge(pL, pR[i + 1]);
dfs2(v, G[v][i], g(val, v));
}
pL = merge(pL, f(dp[v][i], G[v][i]));
}
}
void calc(int root = 0) {
for (int i = 0; i < V; ++i) dp[i].resize(G[i].size());
dfs1(-1, root);
dfs2(-1, root, mi);
}
T solve(int v) {
T ans = mi;
for (int i = 0; i < G[v].size(); ++i)
ans = merge(ans, f(dp[v][i], G[v][i]));
return g(ans, v);
}
};
//https://null-mn.hatenablog.com/entry/2020/04/14/124151
int main(){
INT(n);
VEC(int,p,n);
using state = vector<pair<mod,mod> >;
auto f = [&](state a, int v) {
rep(i,1001){
a[i].second = a[i].second * 2 + a[i].first;
}
return a;
};
auto merge = [&](state a, state b) {
state s(1001);
rep(i,1001){
mod S = (a[i].first + a[i].second)*(b[i].first + b[i].second);
s[i].first = S - a[i].second * b[i].second;
s[i].second = a[i].second * b[i].second;
}
return s;
};
auto g = [&](state a, int v) {
rep(i,1001){
if(p[v] >= i){
a[i].first += a[i].second;
a[i].second = 0;
}
}
return a;
};
state ttt(1001,{(mod)0,(mod)1});
ReRooting<state> rt(n,f,merge,ttt,g);
rep(i,n-1){
INT(u,v);
u--;v--;
rt.add_edge(u,v);
}
rt.calc();
mod res = 0;
rep(i,n){
auto X = rt.solve(i);
rep(j,1001){
if(j!=1000)X[j].first -= X[j+1].first;
res += j * X[j].first;
}
}
cout << res << endl;
return 0;
}