# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236008 | ant101 | Uzastopni (COCI15_uzastopni) | C++14 | 145 ms | 25976 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 <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
using namespace std;
//#define RDEBUG 1
#ifdef RDEBUG
#define D(x) x
#else
#define D(x)
#endif
#define inf 0x7fffffff
#define MOD 1000000007
int add(int a, int b) {
a += b;
if(a >= MOD) {
a -= MOD;
}
return a;
}
int sub(int a, int b) {
a -= b;
if(a < 0) {
a += MOD;
}
return a;
}
int mul(int a, int b) {
return (a * b)%MOD;
}
void add_self(int& a, int b) {
a = add(a, b);
}
void sub_self(int& a, int b) {
a = sub(a, b);
}
void mul_self(int& a, int b) {
a = mul(a, b);
}
const int MAXN = 10010;
int N;
int V[MAXN];
vector<int> adj[MAXN];
set<int> lrange[101];
set<int> rrange[101];
set<int> st[MAXN];
set<int> en[MAXN];
void dfsleft(int node, int u) {
st[node].insert(u);
if (u <= 1) {
return;
}
for (auto v : lrange[u-1]) {
dfsleft(node, v);
}
}
void dfsright(int node, int u) {
en[node].insert(u);
if (u >= 100) {
return;
}
for (auto v : rrange[u+1]) {
dfsright(node, v);
}
}
void f(int u, int p) {
for (int i = 0; i<adj[u].size(); i++) {
int v = adj[u][i];
if (v == p) {
continue;
}
f(v, u);
}
for (int i = 0; i<101; i++) {
lrange[i].clear();
rrange[i].clear();
}
for (int i = 0; i<adj[u].size(); i++) {
int v = adj[u][i];
if (v == p) {
continue;
}
for (auto first : st[v]) {
for (auto second : en[v]) {
if (first > second) {
continue;
}
lrange[second].insert(first);
rrange[first].insert(second);
}
}
}
dfsleft(u, V[u]);
dfsright(u, V[u]);
}
int main() {
ios_base :: sync_with_stdio(false);
cin >> N;
for (int i = 1; i<=N; i++) {
cin >> V[i];
}
for (int i = 0; i<N-1; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
f(1, -1);
cout << st[1].size()*en[1].size() << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |