oj.uz

Submission #252158

# Submission time Handle Problem Language Result Execution time Memory
252158 2020-07-24T12:11:33 Z Vimmer Uzastopni (COCI15_uzastopni) C++14
160 / 160
 266 ms 17836 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10005
#define M ll(998244353)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int a[N], n;

vector <int> g[N];

bitset <105> f[N][105], can[105];

void dfs(int v) {

    for (auto it : g[v]) dfs(it);

    for (int i = 0; i < 105; i++) {f[v][i].reset(); can[i].reset();}

    can[a[v]][a[v]] = 1;

    for (auto it : g[v])
        for (int l = 1; l <= 100; l++)
            for (int r = l; r <= 100; r++)
              if ((r < a[v] || l > a[v]) && f[it][l][r]) can[l][r] = 1;

    for (int l = 100; l >= 1; l--)
      for (int r = l; r <= 100; r++)
        if (can[l][r]) can[l] |= can[r + 1];

    for (int l = 1; l <= 100; l++)
        for (int r = l; r <= 100; r++)
          if (l <= a[v] && a[v] <= r && can[l][r]) f[v][l][r] = 1;
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    for (int i = 1; i <= n; i++) cin >> a[i];

    for (int i = 1; i < n; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x].pb(y);
    }

    dfs(1);

    int ans = 0;

    for (int l = 1; l <= 100; l++)
        for (int r = l; r <= 100; r++)
          if (f[1][l][r])
          {

              ans++;
          }

    cout << ans << endl;
}

Subtask #1
160.0 / 160.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 240 ms 17272 KB Output is correct
12 Correct 266 ms 17272 KB Output is correct
13 Correct 244 ms 17144 KB Output is correct
14 Correct 241 ms 17784 KB Output is correct
15 Correct 241 ms 17836 KB Output is correct
16 Correct 239 ms 17784 KB Output is correct
17 Correct 246 ms 17272 KB Output is correct
18 Correct 251 ms 17144 KB Output is correct
19 Correct 233 ms 17144 KB Output is correct
20 Correct 261 ms 17144 KB Output is correct