oj.uz

Submission #144542

# Submission time Handle Problem Language Result Execution time Memory
144542 2019-08-17T06:07:32 Z Abelyan Paprike (COI18_paprike) C++17
100 / 100
 98 ms 25052 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define FOR(i,a) for (int i=0;i<(a);++i)
#define FORD(i,a) for (int i=(a)-1;i>=0;i--)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORTD(i,b,a) for (int i=(b);i>=(a);--i)
#define trav(i,v) for (auto i : v)
#define all(v) v.begin(),v.end()
#define ad push_back
#define fr first
#define sc second
#define mpr(a,b) make_pair(a,b)
#define pir pair<int,int>
#define all(v) v.begin(),v.end()
#define make_unique(v) v.erase(unique(all(v)),v.end())
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define srng mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define y1 EsiHancagorcRepa

const int N=4e5+10;
const ll MOD2=998244353;
const ll MOD=1e9+7;

ll w[N],ans,k;
vector<int> g[N];
ll dfs(int v,int par=-1){
    //cout<<v<<endl;
    ll sum=0;
    vector<int> vc;
    trav(to,g[v])if(to!=par)vc.ad(dfs(to,v));
    sum+=w[v];
    sort(all(vc));
    ll ver=-1;
    trav(tv,vc){
        //if (to==par)continue;
        if (sum>k){
            ans++;
            continue;
        }
        sum+=tv;

        if (sum>k){
            ans++;
            ver=sum-tv;
        }
    }
    if (ver!=-1)return ver;
    return sum;
}

int main(){
    fastio;
    int n;
    cin>>n>>k;
    FORT(i,1,n){
        cin>>w[i];
    }
    FOR(i,n-1){
        int a,b;
        cin>>a>>b;
        g[a].ad(b);
        g[b].ad(a);
    }
    dfs(1);
    cout<<ans<<endl;
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 11 ms 9720 KB Output is correct
7 Correct 8 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9932 KB Output is correct
12 Correct 11 ms 9848 KB Output is correct
13 Correct 11 ms 9720 KB Output is correct
14 Correct 11 ms 9760 KB Output is correct
15 Correct 13 ms 9720 KB Output is correct
16 Correct 10 ms 9720 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 11 ms 9720 KB Output is correct
20 Correct 10 ms 9720 KB Output is correct
21 Correct 10 ms 9848 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 25052 KB Output is correct
2 Correct 73 ms 24988 KB Output is correct
3 Correct 73 ms 25032 KB Output is correct
4 Correct 73 ms 25000 KB Output is correct
5 Correct 72 ms 24952 KB Output is correct
6 Correct 73 ms 24952 KB Output is correct
7 Correct 71 ms 24952 KB Output is correct
8 Correct 67 ms 24552 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 11 ms 9720 KB Output is correct
7 Correct 8 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9932 KB Output is correct
12 Correct 11 ms 9848 KB Output is correct
13 Correct 11 ms 9720 KB Output is correct
14 Correct 11 ms 9760 KB Output is correct
15 Correct 13 ms 9720 KB Output is correct
16 Correct 10 ms 9720 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 11 ms 9720 KB Output is correct
20 Correct 10 ms 9720 KB Output is correct
21 Correct 10 ms 9848 KB Output is correct
22 Correct 11 ms 9848 KB Output is correct
23 Correct 11 ms 9848 KB Output is correct
24 Correct 11 ms 9848 KB Output is correct
25 Correct 11 ms 9848 KB Output is correct
26 Correct 12 ms 9720 KB Output is correct
27 Correct 11 ms 9848 KB Output is correct
28 Correct 11 ms 9820 KB Output is correct
29 Correct 11 ms 9720 KB Output is correct
30 Correct 11 ms 9720 KB Output is correct
31 Correct 11 ms 9848 KB Output is correct
32 Correct 11 ms 9748 KB Output is correct
33 Correct 11 ms 9720 KB Output is correct
34 Correct 11 ms 9720 KB Output is correct
35 Correct 11 ms 9720 KB Output is correct
36 Correct 11 ms 9976 KB Output is correct
37 Correct 11 ms 9848 KB Output is correct
38 Correct 11 ms 9848 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 11 ms 9720 KB Output is correct
7 Correct 8 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 10 ms 9720 KB Output is correct
11 Correct 10 ms 9932 KB Output is correct
12 Correct 11 ms 9848 KB Output is correct
13 Correct 11 ms 9720 KB Output is correct
14 Correct 11 ms 9760 KB Output is correct
15 Correct 13 ms 9720 KB Output is correct
16 Correct 10 ms 9720 KB Output is correct
17 Correct 10 ms 9720 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 11 ms 9720 KB Output is correct
20 Correct 10 ms 9720 KB Output is correct
21 Correct 10 ms 9848 KB Output is correct
22 Correct 75 ms 25052 KB Output is correct
23 Correct 73 ms 24988 KB Output is correct
24 Correct 73 ms 25032 KB Output is correct
25 Correct 73 ms 25000 KB Output is correct
26 Correct 72 ms 24952 KB Output is correct
27 Correct 73 ms 24952 KB Output is correct
28 Correct 71 ms 24952 KB Output is correct
29 Correct 67 ms 24552 KB Output is correct
30 Correct 11 ms 9848 KB Output is correct
31 Correct 11 ms 9848 KB Output is correct
32 Correct 11 ms 9848 KB Output is correct
33 Correct 11 ms 9848 KB Output is correct
34 Correct 12 ms 9720 KB Output is correct
35 Correct 11 ms 9848 KB Output is correct
36 Correct 11 ms 9820 KB Output is correct
37 Correct 11 ms 9720 KB Output is correct
38 Correct 11 ms 9720 KB Output is correct
39 Correct 11 ms 9848 KB Output is correct
40 Correct 11 ms 9748 KB Output is correct
41 Correct 11 ms 9720 KB Output is correct
42 Correct 11 ms 9720 KB Output is correct
43 Correct 11 ms 9720 KB Output is correct
44 Correct 11 ms 9976 KB Output is correct
45 Correct 11 ms 9848 KB Output is correct
46 Correct 11 ms 9848 KB Output is correct
47 Correct 73 ms 19068 KB Output is correct
48 Correct 76 ms 17700 KB Output is correct
49 Correct 98 ms 16988 KB Output is correct
50 Correct 71 ms 16632 KB Output is correct
51 Correct 93 ms 15780 KB Output is correct
52 Correct 93 ms 15864 KB Output is correct
53 Correct 93 ms 15736 KB Output is correct
54 Correct 91 ms 15752 KB Output is correct
55 Correct 89 ms 15180 KB Output is correct
56 Correct 84 ms 15096 KB Output is correct
57 Correct 52 ms 16620 KB Output is correct