oj.uz

답안 #571525

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

int dfsConst(int pos, int parnt) {
    if (vis[pos]) return 0;

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

    for (auto it:pat[pos]) {
        sajz[pos] += dfsConst(it,pos);
    }

    return sajz[pos];
}

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

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

int res = 0;

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

        if (zbir+vred[it] > q) {
            dfs(it,vred[it]);
            res++;
        } else {
            zbir = dfs(it,zbir+vred[it]);
        }
    }

    return zbir;
}

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

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

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

    for (int i = 0; i<n; i++) cin>>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);
    }

    MS(vis,0);
    for (int i = 0; i<n; i++) sajz[i] = vred[i];
    dfsConst(0,0);
    for (int i = 0; i<n; i++) sort(pat[i].begin(),pat[i].end(),custComp);

    dfs(0,vred[0]);

    cout<<res<<endl;
}

Subtask #1
0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 15264 KB Output is correct
2 Correct 55 ms 15276 KB Output is correct
3 Correct 43 ms 15268 KB Output is correct
4 Correct 45 ms 15208 KB Output is correct
5 Correct 39 ms 15224 KB Output is correct
6 Correct 40 ms 15172 KB Output is correct
7 Correct 39 ms 15136 KB Output is correct
8 Correct 38 ms 14708 KB Output is correct

Subtask #3
0 / 27.0

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