oj.uz

Submission #675328

# Submission time Handle Problem Language Result Execution time Memory
675328 2022-12-27T04:11:49 Z vjudge1 Uzastopni (COCI15_uzastopni) C++17
160 / 160
 78 ms 24388 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair <int, int>

using namespace std;

const int mxN = 1e4 + 5;
const int BIT = 1e2 + 5;

int numNode, a[mxN];
vector <int> adj[mxN], q[BIT];
vector <pii> s[mxN];
bitset <BIT> bit[mxN][BIT];

void Shiba_Read()
{
    cin >> numNode;
    for (int i = 1; i <= numNode; ++i)
        cin >> a[i];
    for (int i = 2; i <= numNode; ++i)
    {
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
}

void Shiba_Dfs(int u, int p)
{
    for (int v : adj[u])
    {
        if (v != p)
            Shiba_Dfs(v, u);
    }

    for (int i = 0; i < BIT; ++i) q[i].clear();

    for (int v : adj[u])
    {
        if (v != p)
        {
            for (pii it : s[v])
                q[it.fi].push_back(it.se);
        }
    }

    for (int i = BIT - 1; i >= 1; --i)
    {
        if (i == a[u])
        {
            bit[u][i] |= bit[u][i + 1];
            bit[u][i].set(i);
        }
        else
        {
            for (int j : q[i])
            {
                if (i > a[u] || j < a[u])
                {
                    bit[u][i] |= bit[u][j + 1];
                    bit[u][i].set(j);
                }
            }
        }

        for (int j = BIT - 1; j >= i; --j)
        {
            if (bit[u][i].test(j) && a[u] >= i && a[u] <= j)
                s[u].push_back(make_pair(i, j));
        }
    }
}

void Shiba_Process()
{
    Shiba_Dfs(1, 0);
    cout << s[1].size();
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    Shiba_Read();
    Shiba_Process();
    return 0;
}

Subtask #1
160.0 / 160.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 1 ms 904 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 67 ms 17900 KB Output is correct
12 Correct 67 ms 17788 KB Output is correct
13 Correct 66 ms 17924 KB Output is correct
14 Correct 76 ms 24328 KB Output is correct
15 Correct 76 ms 24276 KB Output is correct
16 Correct 78 ms 24388 KB Output is correct
17 Correct 69 ms 17908 KB Output is correct
18 Correct 72 ms 17852 KB Output is correct
19 Correct 68 ms 20412 KB Output is correct
20 Correct 68 ms 20520 KB Output is correct