oj.uz

Submission #640582

# Submission time Handle Problem Language Result Execution time Memory
640582 2022-09-15T01:45:06 Z anhduc2701 Paprike (COI18_paprike) C++17
24 / 100
 111 ms 23048 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using pii = pair<pair<ll, ll>, ll>;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
int dp[100005];
vector<int> G[100005];
int ans = 0;
int n;
int a[100005];
int root;
int k;
priority_queue<int> pq[100005];
int dfs(int u, int p)
{
    dp[u] = a[u];
    for (auto v : G[u])
    {
        if (v == p)
            continue;
        int d = dfs(v, u);
        pq[u].push(d);
        dp[u] += d;
        if (dp[u] > k)
        {
            dp[u] -= pq[u].top();
            pq[u].top();
            ans++;
        }
    }
    return dp[u];
}
signed main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n - 1; i++)
    {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs(1, 1);
    cout << ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5752 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 3 ms 5716 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 23048 KB Output is correct
2 Correct 105 ms 22860 KB Output is correct
3 Correct 102 ms 22936 KB Output is correct
4 Correct 101 ms 22980 KB Output is correct
5 Correct 100 ms 22904 KB Output is correct
6 Correct 103 ms 22912 KB Output is correct
7 Correct 101 ms 22912 KB Output is correct
8 Correct 89 ms 22908 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5752 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 3 ms 5716 KB Output is correct
22 Incorrect 4 ms 5844 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5752 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5716 KB Output is correct
21 Correct 3 ms 5716 KB Output is correct
22 Correct 111 ms 23048 KB Output is correct
23 Correct 105 ms 22860 KB Output is correct
24 Correct 102 ms 22936 KB Output is correct
25 Correct 101 ms 22980 KB Output is correct
26 Correct 100 ms 22904 KB Output is correct
27 Correct 103 ms 22912 KB Output is correct
28 Correct 101 ms 22912 KB Output is correct
29 Correct 89 ms 22908 KB Output is correct
30 Incorrect 4 ms 5844 KB Output isn't correct
31 Halted 0 ms 0 KB -