oj.uz

답안 #240752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240752 2020-06-21T06:40:27 Z kartel Paprike (COI18_paprike) C++14
13 / 100
 65 ms 20728 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +200500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x.begin(), x.end())
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

vector <int> g[N];
ll f[N], cost[N], k;
int i, n, u, v, ans;

bool cmp(int u, int v)
{
    return cost[u] < cost[v];
}

void dfs(int v, int pr)
{
    vector <int> vec;
    f[v] = cost[v];

    for (auto u : g[v])
    {
        if (u == pr) continue;

        dfs(u, v);

        f[v] += f[u];

        vec.pb(u);
    }

    if (f[v] > k)
    {
        sort(vec.begin(), vec.end(), cmp);

//        cerr << el;
//        for (auto x : vec) cerr << v << " " << x << el;

        while (f[v] > k)
        {
//            cerr << v << " " << vec.back() << el;
            f[v] -= f[vec.back()];
            vec.pop_back();
            ans++;
        }
    }
//    cerr << v << " " << f[v] << el;
//    cerr << el;
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> k;

    for (i = 1; i <= n; i++) cin >> cost[i];

    for (i = 1; i < n; i++)
    {
        cin >> u >> v;

        g[u].pb(v);
        g[v].pb(u);
    }

    dfs(1, -1);

    cout << ans;
}

//
//00000
//00110
//00111
//00011
//00000

Subtask #1
0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 20728 KB Output is correct
2 Correct 63 ms 20728 KB Output is correct
3 Correct 64 ms 20728 KB Output is correct
4 Correct 64 ms 20680 KB Output is correct
5 Correct 64 ms 20728 KB Output is correct
6 Correct 65 ms 20728 KB Output is correct
7 Correct 63 ms 20728 KB Output is correct
8 Correct 60 ms 20728 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 49.0

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