Submission #571564

#	Time	Username	Problem	Language	Result	Execution time	Memory
571564		teki	Paprike (COI18_paprike)	C++11	0 / 100	43 ms	15112 KiB

paprike

#include <bits/stdc++.h>

typedef long long ll;

#define pb push_back
#define MS(x,y) memset((x),(y),sizeof((x)))
#define MN 1000000001

using namespace std;

const int nsize = 100001;
int n,m,q;
int sajz[nsize];
vector<int> pat[nsize];
int vred[nsize];

bool custComp(int a, int b) {
    if (sajz[a] == sajz[b]) return a < b;

    return sajz[a] > sajz[b];
}

int res = 1;
int ctr = 0;

void dfs(int pos, int parent) {
    int bris = pat[pos].size()-1;

    for (auto it:pat[pos]) {
        if (it == parent) continue;

        dfs(it,pos);
    }

    sort(pat[pos].begin(),pat[pos].end());
    for (auto it2:pat[pos]) {
        if (it2 == parent) continue;
        auto it = sajz[it2];

        if (sajz[pos]+it <= q) {
            sajz[pos] += it;
            bris--;
        } else {
            res += bris;
            return;
        }
    }
}

int main()
{
    #if LOCAL_DEBUG
        fstream cin("in.txt");
    #endif

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

    int zbir = 0;

    cin>>n>>q;
    m = n-1;

    for (int i = 0; i<n; i++) cin>>vred[i];
    for (int i = 0; i<n; i++) zbir += vred[i];

    for (int i = 0; i<m; i++) {
        int a,b;
        cin>>a>>b;
        a--; b--;

        pat[a].pb(b);
        pat[b].pb(a);
    }

    for (int i = 0; i<n; i++) sajz[i] = vred[i];

    dfs(0,-1);

    if (zbir <= q) {
        cout<<0<<endl;
        return 0;
    }

    cout<<res<<endl;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49