| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1174588 | akool168 | Uzastopni (COCI15_uzastopni) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll = short;
const ll N = 1e4 + 2;
ll dp[N][102][102];
ll c[N];
vector < ll > adj[N];
ll pd[102][102];
void Go(ll node, ll par) {
ll j, r, sz;
for (i = 1; i <= 100; i ++) {
for (j = i + 1; j <= 100; j ++) pd[i][j] = 0;
}
for ( ll chi : adj[node]) {
if ( chi == par) continue;
Go(chi, node);
if ( chi == node ) continue;
for ( j= 1; j <= 100; j ++) {
for ( r = j; r <= 100; r ++) {
pd[j][r] += dp[chi][j][r];
}
}
}
ll p = c[node];
for ( sz = 1; sz <= 100; sz ++) {
for ( r = 1; r< sz; r ++) {
if ( p - sz < 1) continue;
pd[p - sz][p -1] = pd[p - sz][p - 1] + (pd[p - r][p - 1] * pd[p - sz][p - r - 1]);
}
}
for ( sz = 1; sz <= 100; sz ++) {
for ( r = 1; r< sz; r ++) {
if ( p + sz > 100) continue;
pd[p+ 1][p + sz] = pd[p + 1][p + sz] + (pd[p + 1][p + r] * pd[p + r + 1][p+ sz]);
}
}
for ( j= p; j >= 1; j --) {
for ( r = p; r <= 100; r ++) {
if( r== p && j == p) {
dp[node][j][r] = 1;
continue;
}
if ( r == p) {
dp[node][j][r] = pd[j][p - 1];
continue;
}
if ( j == p) {
dp[node][j][r] = pd[p + 1][r];
continue;
}
dp[node][j][r] =dp[node][j][r] + pd[j][p - 1] * pd[p + 1][r];
}
}
}
int main() {
ll n, m, r, x, y, i, j, ans, t;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> c[i];
}
for (i = 1; i < n; i ++) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
Go(1, 1);
ans = 0;
for (i = 1; i<= 100; i ++){
for (j = i; j <= 100; j ++) {
ans += dp[1][i][j];
}
}
cout << ans << endl;
}