oj.uz

답안 #252156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252156 2020-07-24T11:39:05 Z Vimmer Uzastopni (COCI15_uzastopni) C++14
32 / 160
 426 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 + 1; r <= 100; r++) ans += f[1][l][r];

    cout << ans << endl;
}

Subtask #1
32.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 640 KB Output isn't correct
2 Incorrect 3 ms 640 KB Output isn't correct
3 Incorrect 4 ms 768 KB Output isn't correct
4 Correct 4 ms 768 KB Output is correct
5 Incorrect 5 ms 768 KB Output isn't correct
6 Incorrect 5 ms 768 KB Output isn't correct
7 Incorrect 4 ms 768 KB Output isn't correct
8 Incorrect 7 ms 768 KB Output isn't correct
9 Incorrect 4 ms 768 KB Output isn't correct
10 Incorrect 5 ms 768 KB Output isn't correct
11 Incorrect 403 ms 17352 KB Output isn't correct
12 Incorrect 410 ms 17272 KB Output isn't correct
13 Incorrect 426 ms 17400 KB Output isn't correct
14 Correct 397 ms 17908 KB Output is correct
15 Correct 415 ms 17912 KB Output is correct
16 Correct 402 ms 17912 KB Output is correct
17 Incorrect 404 ms 17400 KB Output isn't correct
18 Incorrect 404 ms 17144 KB Output isn't correct
19 Incorrect 398 ms 17088 KB Output isn't correct
20 Incorrect 403 ms 17124 KB Output isn't correct