oj.uz

답안 #252153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252153 2020-07-24T11:27:18 Z Vimmer Uzastopni (COCI15_uzastopni) C++14
80 / 160
 416 ms 17912 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 = 1; i <= 100; i++)
      for (int j = 1; j <= 100; j++) can[i][j] = 0;

    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 (f[it][l][r]) can[l][r] = 1;


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

    for (int l = 1; l <= 100; l++)
        for (int r = 1; r <= 100; 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
80.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Incorrect 4 ms 768 KB Output isn't correct
4 Incorrect 3 ms 768 KB Output isn't correct
5 Incorrect 5 ms 768 KB Output isn't correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Incorrect 404 ms 17308 KB Output isn't correct
12 Incorrect 415 ms 17144 KB Output isn't correct
13 Correct 416 ms 17228 KB Output is correct
14 Incorrect 398 ms 17776 KB Output isn't correct
15 Incorrect 408 ms 17912 KB Output isn't correct
16 Incorrect 408 ms 17912 KB Output isn't correct
17 Correct 408 ms 17236 KB Output is correct
18 Correct 390 ms 17272 KB Output is correct
19 Incorrect 401 ms 17272 KB Output isn't correct
20 Incorrect 388 ms 17144 KB Output isn't correct