oj.uz

답안 #210106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210106 2020-03-16T14:41:52 Z Utaha Paprike (COI18_paprike) C++14
100 / 100
 86 ms 25080 KB 
/*input
6 9
5 4 1 3 3 3
3 1
3 5
4 3
4 2
2 6
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define eb emplace_back
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (int)(lower_bound(c.begin(),c.end(),x)-c.begin())
#define EL cout<<'\n'
#define BS(a,x) binary_search(ALL(a),x)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<'('<<P.F<<','<<P.S<<')';
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,SZ(V)) out<<V[i]<<((i!=SZ(V)-1)?" ":"");
    return out;
}
//}}}
const ll maxn=300005;
const ll maxlg=20;
const ll INF64=1e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;

ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        b>>=1;
    }
    return res;
}

ll a[maxn];
vector<int> edge[maxn];
int ans=0;

ll n,k;
ll rem[maxn];

void dfs(int u,int p){
    vector<ll> tmp;
    for(int v:edge[u]) if(v!=p){
        dfs(v,u);
        tmp.pb(rem[v]);
    }
    sort(ALL(tmp));
    ll cur=a[u];

    for(ll i:tmp){
        if(cur+i>k){
            ans++;
        }
        else cur+=i;
    }
    rem[u]=cur;
}

int main(){
    IOS;
    cin>>n>>k;
    REP(i,n) cin>>a[i];
    REP(i,n-1){
        int u,v;
        cin>>u>>v;
        u--;v--;
        edge[u].pb(v);
        edge[v].pb(u);
    }
    dfs(0,-1);
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 9 ms 7416 KB Output is correct
6 Correct 9 ms 7416 KB Output is correct
7 Correct 9 ms 7416 KB Output is correct
8 Correct 9 ms 7416 KB Output is correct
9 Correct 9 ms 7416 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct
11 Correct 9 ms 7416 KB Output is correct
12 Correct 9 ms 7416 KB Output is correct
13 Correct 10 ms 7416 KB Output is correct
14 Correct 9 ms 7416 KB Output is correct
15 Correct 10 ms 7416 KB Output is correct
16 Correct 9 ms 7416 KB Output is correct
17 Correct 9 ms 7416 KB Output is correct
18 Correct 9 ms 7416 KB Output is correct
19 Correct 10 ms 7420 KB Output is correct
20 Correct 9 ms 7416 KB Output is correct
21 Correct 9 ms 7416 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 25080 KB Output is correct
2 Correct 70 ms 25080 KB Output is correct
3 Correct 71 ms 25080 KB Output is correct
4 Correct 71 ms 25080 KB Output is correct
5 Correct 69 ms 24952 KB Output is correct
6 Correct 71 ms 24952 KB Output is correct
7 Correct 72 ms 24952 KB Output is correct
8 Correct 67 ms 24568 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 9 ms 7416 KB Output is correct
6 Correct 9 ms 7416 KB Output is correct
7 Correct 9 ms 7416 KB Output is correct
8 Correct 9 ms 7416 KB Output is correct
9 Correct 9 ms 7416 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct
11 Correct 9 ms 7416 KB Output is correct
12 Correct 9 ms 7416 KB Output is correct
13 Correct 10 ms 7416 KB Output is correct
14 Correct 9 ms 7416 KB Output is correct
15 Correct 10 ms 7416 KB Output is correct
16 Correct 9 ms 7416 KB Output is correct
17 Correct 9 ms 7416 KB Output is correct
18 Correct 9 ms 7416 KB Output is correct
19 Correct 10 ms 7420 KB Output is correct
20 Correct 9 ms 7416 KB Output is correct
21 Correct 9 ms 7416 KB Output is correct
22 Correct 10 ms 7544 KB Output is correct
23 Correct 10 ms 7456 KB Output is correct
24 Correct 10 ms 7416 KB Output is correct
25 Correct 10 ms 7416 KB Output is correct
26 Correct 9 ms 7416 KB Output is correct
27 Correct 10 ms 7416 KB Output is correct
28 Correct 10 ms 7416 KB Output is correct
29 Correct 10 ms 7416 KB Output is correct
30 Correct 9 ms 7416 KB Output is correct
31 Correct 9 ms 7416 KB Output is correct
32 Correct 10 ms 7420 KB Output is correct
33 Correct 9 ms 7416 KB Output is correct
34 Correct 10 ms 7420 KB Output is correct
35 Correct 9 ms 7416 KB Output is correct
36 Correct 9 ms 7416 KB Output is correct
37 Correct 9 ms 7416 KB Output is correct
38 Correct 10 ms 7416 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 9 ms 7416 KB Output is correct
6 Correct 9 ms 7416 KB Output is correct
7 Correct 9 ms 7416 KB Output is correct
8 Correct 9 ms 7416 KB Output is correct
9 Correct 9 ms 7416 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct
11 Correct 9 ms 7416 KB Output is correct
12 Correct 9 ms 7416 KB Output is correct
13 Correct 10 ms 7416 KB Output is correct
14 Correct 9 ms 7416 KB Output is correct
15 Correct 10 ms 7416 KB Output is correct
16 Correct 9 ms 7416 KB Output is correct
17 Correct 9 ms 7416 KB Output is correct
18 Correct 9 ms 7416 KB Output is correct
19 Correct 10 ms 7420 KB Output is correct
20 Correct 9 ms 7416 KB Output is correct
21 Correct 9 ms 7416 KB Output is correct
22 Correct 71 ms 25080 KB Output is correct
23 Correct 70 ms 25080 KB Output is correct
24 Correct 71 ms 25080 KB Output is correct
25 Correct 71 ms 25080 KB Output is correct
26 Correct 69 ms 24952 KB Output is correct
27 Correct 71 ms 24952 KB Output is correct
28 Correct 72 ms 24952 KB Output is correct
29 Correct 67 ms 24568 KB Output is correct
30 Correct 10 ms 7544 KB Output is correct
31 Correct 10 ms 7456 KB Output is correct
32 Correct 10 ms 7416 KB Output is correct
33 Correct 10 ms 7416 KB Output is correct
34 Correct 9 ms 7416 KB Output is correct
35 Correct 10 ms 7416 KB Output is correct
36 Correct 10 ms 7416 KB Output is correct
37 Correct 10 ms 7416 KB Output is correct
38 Correct 9 ms 7416 KB Output is correct
39 Correct 9 ms 7416 KB Output is correct
40 Correct 10 ms 7420 KB Output is correct
41 Correct 9 ms 7416 KB Output is correct
42 Correct 10 ms 7420 KB Output is correct
43 Correct 9 ms 7416 KB Output is correct
44 Correct 9 ms 7416 KB Output is correct
45 Correct 9 ms 7416 KB Output is correct
46 Correct 10 ms 7416 KB Output is correct
47 Correct 69 ms 18160 KB Output is correct
48 Correct 70 ms 16376 KB Output is correct
49 Correct 75 ms 15608 KB Output is correct
50 Correct 68 ms 15224 KB Output is correct
51 Correct 86 ms 14200 KB Output is correct
52 Correct 85 ms 14200 KB Output is correct
53 Correct 83 ms 14072 KB Output is correct
54 Correct 80 ms 14072 KB Output is correct
55 Correct 76 ms 13560 KB Output is correct
56 Correct 73 ms 13560 KB Output is correct
57 Correct 51 ms 15120 KB Output is correct