oj.uz

답안 #932736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932736 2024-02-24T05:44:35 Z gaga999 Uzastopni (COCI15_uzastopni) C++17
160 / 160
 3 ms 2260 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 1e4 + 7;
int vl[N];
vector<int> eg[N];
bitset<105> bs[N];

bool cmp(int a, int b)
{
    return vl[a] < vl[b];
}

void dfs(int u, int fa)
{
    sort(iter(eg[u]), cmp);
    int ln = eg[u].size(), p = 0;
    while (p < ln && vl[eg[u][p]] < vl[u])
        p++;
    bs[u][vl[u]] = 1;
    for (int i = p - 1; i >= 0; i--)
    {
        const int v = eg[u][i];
        if (v == fa)
            continue;
        dfs(v, u);
        bool ok = 0;
        for (int k = vl[v]; k < vl[u]; k++)
        {
            if (bs[v][k] && bs[u][k + 1])
            {
                ok = 1;
                break;
            }
        }
        if (ok)
            for (int k = vl[v]; k > 0; k--)
                if (bs[v][k])
                    bs[u][k] = 1;
    }
    for (int i = p; i < ln; i++)
    {
        const int v = eg[u][i];
        if (v == fa)
            continue;
        dfs(v, u);
        bool ok = 0;
        for (int k = vl[v]; k > vl[u]; k--)
        {
            if (bs[v][k] && bs[u][k - 1])
            {
                ok = 1;
                break;
            }
        }
        if (ok)
            for (int k = vl[v]; k <= 100; k++)
                if (bs[v][k])
                    bs[u][k] = 1;
    }
}

signed main()
{
    int n, x, y;
    rd(n);
    for (int i = 1; i <= n; i++)
        rd(vl[i]);
    for (int i = 1; i < n; i++)
    {
        rd(x, y);
        eg[x].pb(y);
        eg[y].pb(x);
    }
    dfs(1, -1);
    x = y = 0;
    for (int i = 1; i <= vl[1]; i++)
        x += bs[1][i];
    for (int i = vl[1]; i <= 100; i++)
        y += bs[1][i];
    prt(x * y), putchar('\n');
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 3 ms 1304 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 3 ms 1372 KB Output is correct
19 Correct 2 ms 1300 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct