답안 #735303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
735303	2023-05-03T22:40:58 Z	DrearyJoke	Paprike (COI18_paprike)	C++17	100 / 100	57 ms	24224 KB

paprike

#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define END "\n"
#define rall(v) (v).rbegin(), (v).rend()
#define all(v) (v).begin(), (v).end()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve(){
    int n, k;
    cin >> n >> k;
    vector<ll> A(n);
    for (int i = 0; i < n; ++i) cin >> A[i];
    vector<vector<int>> adj(n);
    for (int i = 0; i < n - 1; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    vector<ll> sum(n), dp(n);
    auto dfs = [&] (auto&& self, int v, int p) -> void {
        sum[v] += A[v];
        for (auto u: adj[v]) {
            if (u != p) {
                self(self, u, v);
                dp[v] += dp[u];
                sum[v] += sum[u];
            }
        }
        if (sum[v] <= k) return;
        vector<int> idxes;
        for (auto u: adj[v]) {
            if (u != p) idxes.push_back(u);
        }
        sort(all(idxes), [&] (int a, int b) {
            return sum[a] > sum[b];
        });
        for (auto u: idxes) {
            sum[v] -= sum[u];
            ++dp[v];
            if (sum[v] <= k) break;
        }
    };
    dfs(dfs, 0, -1);
    cout << dp[0] << END;
}
int main()
{
    fastio
    int t = 1;
    // cin>> t;
    while(t--) solve();
    return 0;
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	320 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	47 ms	24152 KB	Output is correct
2	Correct	46 ms	24160 KB	Output is correct
3	Correct	44 ms	24224 KB	Output is correct
4	Correct	48 ms	24220 KB	Output is correct
5	Correct	45 ms	24060 KB	Output is correct
6	Correct	44 ms	24136 KB	Output is correct
7	Correct	42 ms	24132 KB	Output is correct
8	Correct	41 ms	23628 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	412 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	372 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	320 KB	Output is correct
22	Correct	47 ms	24152 KB	Output is correct
23	Correct	46 ms	24160 KB	Output is correct
24	Correct	44 ms	24224 KB	Output is correct
25	Correct	48 ms	24220 KB	Output is correct
26	Correct	45 ms	24060 KB	Output is correct
27	Correct	44 ms	24136 KB	Output is correct
28	Correct	42 ms	24132 KB	Output is correct
29	Correct	41 ms	23628 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	412 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	336 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	372 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	43 ms	14836 KB	Output is correct
48	Correct	40 ms	12700 KB	Output is correct
49	Correct	42 ms	11916 KB	Output is correct
50	Correct	43 ms	11464 KB	Output is correct
51	Correct	57 ms	10224 KB	Output is correct
52	Correct	55 ms	10188 KB	Output is correct
53	Correct	49 ms	10052 KB	Output is correct
54	Correct	52 ms	10052 KB	Output is correct
55	Correct	48 ms	9676 KB	Output is correct
56	Correct	55 ms	9676 KB	Output is correct
57	Correct	33 ms	11068 KB	Output is correct

답안 #735303

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 13.0 / 13.0

Subtask #3 27.0 / 27.0

Subtask #4 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
13.0 / 13.0

Subtask #3
27.0 / 27.0

Subtask #4
49.0 / 49.0