oj.uz

답안 #252152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252152 2020-07-24T11:16:07 Z Vimmer Uzastopni (COCI15_uzastopni) C++14
0 / 160
 254 ms 16376 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 <101> f[N][101], nul, can[101];

void dfs(int v)
{
    for (int i = 0; i < 101; i++) can[i] = nul;

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

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

        for (int l = 1; l < 101; l++)
          for (int r = l; r < 101; r++)
            if (f[it][l][r]) can[l][r] = 1;
    }

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

    for (int l = 0; l < 101; l++)
        for (int r = 0; r < 101; r++)
            if (can[l][r] && l <= a[v] && a[v] <= 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++) ans += f[1][l][r];

    cout << ans << endl;
}

Subtask #1
0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 640 KB Output isn't correct
2 Incorrect 2 ms 640 KB Output isn't correct
3 Incorrect 3 ms 640 KB Output isn't correct
4 Incorrect 3 ms 640 KB Output isn't correct
5 Incorrect 3 ms 640 KB Output isn't correct
6 Incorrect 3 ms 640 KB Output isn't correct
7 Incorrect 3 ms 640 KB Output isn't correct
8 Incorrect 3 ms 640 KB Output isn't correct
9 Incorrect 3 ms 640 KB Output isn't correct
10 Incorrect 3 ms 640 KB Output isn't correct
11 Incorrect 240 ms 12688 KB Output isn't correct
12 Incorrect 236 ms 13048 KB Output isn't correct
13 Incorrect 246 ms 13508 KB Output isn't correct
14 Incorrect 236 ms 2704 KB Output isn't correct
15 Incorrect 227 ms 2680 KB Output isn't correct
16 Incorrect 254 ms 2764 KB Output isn't correct
17 Incorrect 235 ms 13688 KB Output isn't correct
18 Incorrect 239 ms 13816 KB Output isn't correct
19 Incorrect 249 ms 16376 KB Output isn't correct
20 Incorrect 235 ms 16376 KB Output isn't correct