oj.uz

Submission #784297

# Submission time Handle Problem Language Result Execution time Memory
784297 2023-07-16T01:25:13 Z horiiseun Paprike (COI18_paprike) C++17
100 / 100
 47 ms 20308 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif

int n, ans;
vector<int> adj[100005];
ll h[100005], k, used[100005];

void dfs(int curr, int par) {
    vector<ll> tmp;
    for (int i : adj[curr]) {
        if (i == par) continue;
        dfs(i, curr);
        tmp.push_back(used[i]);
    }
    used[curr] = h[curr];
    sort(tmp.begin(), tmp.end());
    for (ll i : tmp) {
        if (used[curr] + i <= k) {
            used[curr] += i;
        } else {
            ans++;
        }
    }
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> h[i];
    }
    for (int i = 0, a, b; i < n - 1; i++) {
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    dfs(1, -1);

    cout << ans << "\n";

}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 20264 KB Output is correct
2 Correct 38 ms 20308 KB Output is correct
3 Correct 37 ms 20296 KB Output is correct
4 Correct 37 ms 20184 KB Output is correct
5 Correct 36 ms 20172 KB Output is correct
6 Correct 36 ms 20112 KB Output is correct
7 Correct 35 ms 20212 KB Output is correct
8 Correct 43 ms 19676 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2680 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2676 KB Output is correct
10 Correct 1 ms 2676 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2672 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2672 KB Output is correct
15 Correct 1 ms 2676 KB Output is correct
16 Correct 1 ms 2656 KB Output is correct
17 Correct 2 ms 2672 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2692 KB Output is correct
24 Correct 2 ms 2688 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2684 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2684 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2680 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2676 KB Output is correct
10 Correct 1 ms 2676 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2672 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2672 KB Output is correct
15 Correct 1 ms 2676 KB Output is correct
16 Correct 1 ms 2656 KB Output is correct
17 Correct 2 ms 2672 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 42 ms 20264 KB Output is correct
23 Correct 38 ms 20308 KB Output is correct
24 Correct 37 ms 20296 KB Output is correct
25 Correct 37 ms 20184 KB Output is correct
26 Correct 36 ms 20172 KB Output is correct
27 Correct 36 ms 20112 KB Output is correct
28 Correct 35 ms 20212 KB Output is correct
29 Correct 43 ms 19676 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2692 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2684 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2684 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2688 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 34 ms 13260 KB Output is correct
48 Correct 33 ms 11468 KB Output is correct
49 Correct 34 ms 10856 KB Output is correct
50 Correct 36 ms 10404 KB Output is correct
51 Correct 47 ms 9420 KB Output is correct
52 Correct 35 ms 9388 KB Output is correct
53 Correct 34 ms 9320 KB Output is correct
54 Correct 39 ms 9284 KB Output is correct
55 Correct 32 ms 8828 KB Output is correct
56 Correct 34 ms 8844 KB Output is correct
57 Correct 32 ms 10388 KB Output is correct