#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 10001;
int N, V[MX];
vi child[MX];
bitset<101> lo[MX], hi[MX];
void solve(int x) {
vi oklo[101], okhi[101];
lo[x][V[x]] = hi[x][V[x]] = 1;
for (int i: child[x]) {
solve(i);
FOR(a,1,101) if (lo[i][a]) FOR(b,1,101) if (hi[i][b]) {
if (V[x] < a) okhi[a].pb(b);
if (b < V[x]) oklo[b].pb(a);
}
}
FORd(i,2,V[x]+1) if (lo[x][i]) for (int t: oklo[i-1]) lo[x][t] = 1;
FOR(i,V[x],100) if (hi[x][i]) for (int t: okhi[i+1]) hi[x][t] = 1;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N;
FOR(i,1,N+1) cin >> V[i];
F0R(i,N-1) {
int a,b; cin >> a >> b;
child[a].pb(b);
}
solve(1);
cout << lo[1].count()*hi[1].count();
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
632 KB |
Output is correct |
| 2 |
Correct |
3 ms |
744 KB |
Output is correct |
| 3 |
Correct |
3 ms |
920 KB |
Output is correct |
| 4 |
Correct |
5 ms |
920 KB |
Output is correct |
| 5 |
Correct |
3 ms |
920 KB |
Output is correct |
| 6 |
Correct |
5 ms |
1168 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1168 KB |
Output is correct |
| 8 |
Correct |
3 ms |
1168 KB |
Output is correct |
| 9 |
Correct |
3 ms |
1168 KB |
Output is correct |
| 10 |
Correct |
4 ms |
1168 KB |
Output is correct |
| 11 |
Correct |
26 ms |
1604 KB |
Output is correct |
| 12 |
Correct |
25 ms |
1900 KB |
Output is correct |
| 13 |
Correct |
23 ms |
1932 KB |
Output is correct |
| 14 |
Runtime error |
243 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 15 |
Runtime error |
168 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 16 |
Runtime error |
183 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 17 |
Runtime error |
27 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 18 |
Runtime error |
24 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 19 |
Runtime error |
21 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 20 |
Runtime error |
28 ms |
33792 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
