Submission #251853

#	Time	Username	Problem	Language	Result	Execution time	Memory
251853		ne4eHbKa	Uzastopni (COCI15_uzastopni)	C++17	160 / 160	87 ms	17144 KiB

uzastopni

//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e4 + 5;
const int M = 101;

typedef bitset<M> bt;

int n;
int vl[N];
bt f[N][M], z[M];
list<int> g[N];

void rec(int v) {
    for(int u : g[v]) rec(u);
    fo(M) {
        z[i].reset();
        z[i].set(i);
        f[v][i] = z[i];
    }
    for(int u : g[v]) {
        for(int i = 0; i < M; ++i)
            z[i] |= f[u][i];
    }
    for(int n = 1; n < M; ++n) {
        for(int i = 0; i < M - n; ++i) {
            if(!z[i][i + n]) continue;
            z[i] |= z[i + n];
        }
    }
    int u = vl[v];
    for(int l = 0; l <= u; ++l) {
        ifn(z[l][u]) continue;
        for(int r = u + 1; r < M; ++r) {
            ifn(z[u + 1][r]) continue;
            f[v][l].set(r);
        }
    }
}

void solve() {
    cin >> n;
    fo(n) cin >> vl[i], --vl[i], g[i].clear();
    fo(n - 1) {
        int x, y;
        cin >> x >> y;
        g[x - 1].pb(y - 1);
    }
    rec(0);
    int ans = 0;
    for(int i = 0; i < M; ++i)
        for(int j = i + 1; j < M; ++j)
            ans += f[0][i][j];
    cout << ans << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message (stderr)

uzastopni.cpp: In function 'int m_bpow(ll, ll)':
uzastopni.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 160 / 160