oj.uz

답안 #571547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571547 2022-06-02T10:53:20 Z teki Paprike (COI18_paprike) C++11
0 / 100
 42 ms 17596 KB 
#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 ll nsize = 100001;
ll n,m,q;
ll parent[nsize];
ll sajz[nsize];
vector<ll> pat[nsize];
bool vis[nsize];
ll vred[nsize];

void dfsConst(ll pos, ll parnt) {
    if (vis[pos]) return;

    vis[pos] = true;
    parent[pos] = parnt;

    for (auto it:pat[pos]) dfsConst(it,pos);
}

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

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

ll res = 1;

void dfs(ll pos) {
    vector<ll> deca;
    ll bris = pat[pos].size()-1;

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

        dfs(it);
        deca.pb(sajz[it]);
    }

    sort(deca.begin(),deca.end());
    for (auto it:deca) {
        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);

    ll zbir = 0;

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

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

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

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

    MS(vis,0);
    for (ll i = 0; i<n; i++) sajz[i] = vred[i];
    dfsConst(0,0);

    dfs(0);

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

    cout<<res<<endl;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 17596 KB Output is correct
2 Correct 40 ms 17520 KB Output is correct
3 Correct 40 ms 17496 KB Output is correct
4 Incorrect 40 ms 17556 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 49.0

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