oj.uz

Submission #675188

# Submission time Handle Problem Language Result Execution time Memory
675188 2022-12-27T02:38:27 Z vjudge1 Uzastopni (COCI15_uzastopni) C++17
160 / 160
 110 ms 17920 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>

using namespace std;
const int maxn = 1e4 + 5;
int n, a[maxn], p[maxn];
vector <int> adj[maxn];
bitset <105> f[maxn][105];
vector <int> vt;

bool cmp(int i, int j) {
    return a[i] < a[j];
}

void DFS1(int u) {
    vt.push_back(u);
    for(int v : adj[u]) {
        if(v == p[u]) continue;
        p[v] = u;
        DFS1(v);
    }
}



int main()
{
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for(int i = 1; i <= n; ++i) sort(adj[i].begin(), adj[i].end(), cmp);
    DFS1(1);
    for(int id = int(vt.size()) - 1; id >= 0; --id) {
        int u = vt[id];
        int d = lower_bound(adj[u].begin(), adj[u].end(), u, cmp) - adj[u].begin();
        f[u][a[u]][a[u]] = 1;
        for(int i = d - 1; i >= 0; --i) {
            int v = adj[u][i];
            if(v == p[u]) continue;
            for(int j = 1; j < a[u]; ++j) {
                for(int j1 = j; j1 < a[u]; ++j1) f[u][j][a[u]] = f[u][j][a[u]] | (f[u][j1 + 1][a[u]] & f[v][j][j1]);
            }
        }
        for(int i = d; i < int(adj[u].size()); ++i) {
            int v = adj[u][i];
            if(v == p[u]) continue;
            for(int j = a[u] + 1; j <= 100; ++j) {
                if(!f[u][a[u]][j - 1]) continue;
                for(int j1 = j; j1 <= 100; ++j1) f[u][a[u]][j1] = f[u][a[u]][j1] | (f[u][a[u]][j - 1] & f[v][j][j1]);
            }
        }
        for(int i = 1; i <= a[u]; ++i) {
            for(int j = a[u]; j <= 100; ++j) f[u][i][j] = f[u][i][j] | (f[u][i][a[u]] & f[u][a[u]][j]);
        }
    }
    int res =0 ;
    for(int i = 1; i <= 100; ++i) {
        for(int j = i; j <= 100; ++j) {
            if(f[1][i][j]) ++res;
        }
    }
    cout << res;
    return 0;
}

Subtask #1
160.0 / 160.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 37 ms 17372 KB Output is correct
12 Correct 30 ms 17484 KB Output is correct
13 Correct 26 ms 17460 KB Output is correct
14 Correct 107 ms 17828 KB Output is correct
15 Correct 104 ms 17816 KB Output is correct
16 Correct 110 ms 17920 KB Output is correct
17 Correct 27 ms 17464 KB Output is correct
18 Correct 28 ms 17492 KB Output is correct
19 Correct 86 ms 17432 KB Output is correct
20 Correct 80 ms 17512 KB Output is correct