#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "" && str != "input") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e4 + 10, M = 1e2 + 10;
bitset<M> bit[N][M];
vector<int> adj[N];
int n, v[N];
void dfs(int node, int parent) {
bitset<M> bitik[M];
for(auto i: adj[node]) {
if(i == parent) continue;
dfs(i, node);
for(int j = 1; j < M; j++) {
bitik[j] |= bit[i][j];
}
}
for(int i = M - 10; i >= 1; i--) {
for(int j = i + 1; j <= M - 10; j++) {
if(bitik[i][j - 1]) {
bitik[i] |= bitik[j];
}
}
}
// compare with node
for(int i = 1; i <= v[node]; i++) {
for(int j = v[node]; j <= M - 10; j++) {
if((i == v[node] || bitik[i][v[node] - 1]) && (j == v[node] || bitik[v[node] + 1][j])) {
bit[node][i][j] = 1;
}
}
}
}
void solve_() {
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> v[i];
}
for(int i = 1; i <= n - 1; i++) {
int a, b; cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(1, 0);
long long answ = 0;
for(int i = 1; i <= M - 10; i++) {
answ += bit[1][i].count();
}
cout << answ << "\n";
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
for(int i = 1; i <= test_case; i++) {
// cout << "Case #" << i << ": ";
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
uzastopni.cpp: In function 'void setIO(std::string)':
uzastopni.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uzastopni.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uzastopni.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
72 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
uzastopni.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
73 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
680 KB |
Output is correct |
| 3 |
Correct |
1 ms |
708 KB |
Output is correct |
| 4 |
Correct |
1 ms |
704 KB |
Output is correct |
| 5 |
Correct |
1 ms |
724 KB |
Output is correct |
| 6 |
Correct |
1 ms |
852 KB |
Output is correct |
| 7 |
Correct |
2 ms |
852 KB |
Output is correct |
| 8 |
Correct |
2 ms |
852 KB |
Output is correct |
| 9 |
Correct |
1 ms |
724 KB |
Output is correct |
| 10 |
Correct |
2 ms |
724 KB |
Output is correct |
| 11 |
Correct |
90 ms |
18380 KB |
Output is correct |
| 12 |
Correct |
75 ms |
18280 KB |
Output is correct |
| 13 |
Correct |
80 ms |
18208 KB |
Output is correct |
| 14 |
Runtime error |
94 ms |
35448 KB |
Memory limit exceeded |
| 15 |
Runtime error |
96 ms |
35476 KB |
Memory limit exceeded |
| 16 |
Runtime error |
100 ms |
35536 KB |
Memory limit exceeded |
| 17 |
Correct |
73 ms |
18244 KB |
Output is correct |
| 18 |
Correct |
75 ms |
18280 KB |
Output is correct |
| 19 |
Correct |
87 ms |
18244 KB |
Output is correct |
| 20 |
Correct |
89 ms |
18252 KB |
Output is correct |
