oj.uz

답안 #884403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884403 2023-12-07T09:49:05 Z noiaint Nestabilnost (COI23_nestabilnost) C++17
0 / 100
 172 ms 99408 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 5e3 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n;
vector<int> adj[N];
int a[N];
int fk[N];
int f[N][N];
int ans[N];

void dfs(int u, int p) {
    for (int i = a[u] + 1; i <= n; ++i) f[u][i] = fk[i];

    for (int v : adj[u]) if (v != p) {
        dfs(v, u);
        for (int k = a[u] + 1; k <= n; ++k) {
            if (a[v] == (a[u] + 1) % k) f[u][k] += min(ans[v], f[v][k] - fk[k]);
            else f[u][k] += ans[v];
        }
    }

    ans[u] = *min_element(f[u] + a[u] + 1, f[u] + n + 1);
}

void process() {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) cin >> fk[i];

    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs(1, 0);

    cout << ans[1];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #else
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    #endif

    int tc = 1;
    // cin >> tc;

    while (tc--) {
        process();
    }

    return 0;
}

/*

*/

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 99152 KB Output is correct
2 Correct 145 ms 99148 KB Output is correct
3 Correct 129 ms 99160 KB Output is correct
4 Incorrect 146 ms 99408 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Incorrect 1 ms 2652 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 99152 KB Output is correct
2 Correct 145 ms 99148 KB Output is correct
3 Correct 129 ms 99160 KB Output is correct
4 Incorrect 146 ms 99408 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 99152 KB Output is correct
2 Correct 145 ms 99148 KB Output is correct
3 Correct 129 ms 99160 KB Output is correct
4 Incorrect 146 ms 99408 KB Output isn't correct
5 Halted 0 ms 0 KB -