# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
675484 | messiuuuuu | Uzastopni (COCI15_uzastopni) | C++17 | 152 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///
#include<bits/stdc++.h>
#define task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e4 + 5;
const ll INF = 1e18 + 5;
int n;
int c[MAXN];
vector<int> Adj[MAXN];
void Input()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> c[i];
for (int i = 1; i < n; i++)
{
int u, v;
cin >> u >> v;
Adj[u].pb(v);
Adj[v].pb(u);
}
}
bitset<105> dp[MAXN][105], t[105];
vector<int> pl[MAXN][105], pr[MAXN][105];
void DFS(int u, int par)
{
for (int v : Adj[u])
{
if (v == par)
continue;
DFS(v, u);
for (int l = 1; l <= 100; l++)
for (int r = l; r <= 100; r++)
if (dp[v][l][r])
{
pl[u][l].pb(r);
pr[u][r].pb(l);
}
}
for (int i = 1; i <= 100; i++)
t[i].reset();
t[c[u] - 1][c[u]] = t[c[u] + 1][c[u]] = 1;
for (int i = 100; i >= c[u] + 1; i--)
{
for (int j : pl[u][i])
{
t[i][j] = 1;
t[i] |= t[j + 1];
}
}
for (int i = 1; i <= c[u] - 1; i++)
{
for (int j : pr[u][i])
{
t[i][j] = 1;
t[i] |= t[j - 1];
}
}
for (int x = 1; x <= 100; x++)
{
if (t[c[u] - 1][x] == 0)
continue;
for (int y = x; y <= 100; y++)
{
if (t[c[u] + 1][y] == 0)
continue;
dp[u][x][y] = 1;
}
}
}
void Solve()
{
DFS(1, 0);
int res = 0;
for (int i = 1; i <= 100; i++)
{
for (int j = i; j <= 100; j++)
{
//if (dp[1][i][j])
// cout << i << ' ' << j << '\n';
res += dp[1][i][j];
}
}
cout << res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (fopen(task".INP","r"))
{
freopen(task".INP","r",stdin);
//freopen(task".OUT","w",stdout);
}
Input();
Solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |