oj.uz

Submission #43878

# Submission time Handle Problem Language Result Execution time Memory
43878 2018-03-27T01:13:39 Z ngkan146 Paprike (COI18_paprike) C++11
100 / 100
 94 ms 44348 KB 
#include <bits/stdc++.h>
using namespace std;
int n,cnt,val,w[100005];
vector <int> G[100005];
int dfs(int u,int p){
    int res = w[u];
    vector <int> child;
    for(int i=0;i<G[u].size();i++){
        int v = G[u][i];
        if (v == p) continue;
        child.push_back(dfs(v,u));
    }
    sort(child.begin(),child.end());
    int last = 0;
    for(last = 0;last < child.size();last ++)
        if (res + child[last] > val) break;
        else res += child[last];
    cnt += child.size() - last;
    return res;
}
int solve(){
    cnt = 0;
    dfs(1,1);
    return cnt;
}
int main(){
    scanf("%d %d",&n,&val);
    for(int i=1;i<=n;i++)
        scanf("%d",&w[i]);
    for(int i=1;i<n;i++){
        int x,y;
        scanf("%d %d",&x,&y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    printf("%d",solve());
}

Compilation message

paprike.cpp: In function 'int dfs(int, int)':
paprike.cpp:8:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<G[u].size();i++){
                 ~^~~~~~~~~~~~
paprike.cpp:15:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(last = 0;last < child.size();last ++)
                  ~~~~~^~~~~~~~~~~~~~
paprike.cpp: In function 'int main()':
paprike.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&val);
     ~~~~~^~~~~~~~~~~~~~~~~
paprike.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&w[i]);
         ~~~~~^~~~~~~~~~~~
paprike.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2780 KB Output is correct
2 Correct 4 ms 2804 KB Output is correct
3 Correct 3 ms 2876 KB Output is correct
4 Correct 3 ms 2876 KB Output is correct
5 Correct 4 ms 2876 KB Output is correct
6 Correct 3 ms 2888 KB Output is correct
7 Correct 3 ms 3104 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 3 ms 3308 KB Output is correct
10 Correct 4 ms 3308 KB Output is correct
11 Correct 4 ms 3308 KB Output is correct
12 Correct 4 ms 3308 KB Output is correct
13 Correct 4 ms 3308 KB Output is correct
14 Correct 4 ms 3436 KB Output is correct
15 Correct 4 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 4 ms 3436 KB Output is correct
18 Correct 3 ms 3452 KB Output is correct
19 Correct 3 ms 3452 KB Output is correct
20 Correct 3 ms 3452 KB Output is correct
21 Correct 4 ms 3468 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 18496 KB Output is correct
2 Correct 77 ms 20692 KB Output is correct
3 Correct 71 ms 22640 KB Output is correct
4 Correct 76 ms 24664 KB Output is correct
5 Correct 68 ms 26660 KB Output is correct
6 Correct 71 ms 28568 KB Output is correct
7 Correct 67 ms 30508 KB Output is correct
8 Correct 63 ms 32044 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2780 KB Output is correct
2 Correct 4 ms 2804 KB Output is correct
3 Correct 3 ms 2876 KB Output is correct
4 Correct 3 ms 2876 KB Output is correct
5 Correct 4 ms 2876 KB Output is correct
6 Correct 3 ms 2888 KB Output is correct
7 Correct 3 ms 3104 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 3 ms 3308 KB Output is correct
10 Correct 4 ms 3308 KB Output is correct
11 Correct 4 ms 3308 KB Output is correct
12 Correct 4 ms 3308 KB Output is correct
13 Correct 4 ms 3308 KB Output is correct
14 Correct 4 ms 3436 KB Output is correct
15 Correct 4 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 4 ms 3436 KB Output is correct
18 Correct 3 ms 3452 KB Output is correct
19 Correct 3 ms 3452 KB Output is correct
20 Correct 3 ms 3452 KB Output is correct
21 Correct 4 ms 3468 KB Output is correct
22 Correct 4 ms 32044 KB Output is correct
23 Correct 4 ms 32044 KB Output is correct
24 Correct 4 ms 32044 KB Output is correct
25 Correct 4 ms 32044 KB Output is correct
26 Correct 4 ms 32044 KB Output is correct
27 Correct 4 ms 32044 KB Output is correct
28 Correct 4 ms 32044 KB Output is correct
29 Correct 4 ms 32044 KB Output is correct
30 Correct 4 ms 32044 KB Output is correct
31 Correct 4 ms 32044 KB Output is correct
32 Correct 4 ms 32044 KB Output is correct
33 Correct 4 ms 32044 KB Output is correct
34 Correct 4 ms 32044 KB Output is correct
35 Correct 4 ms 32044 KB Output is correct
36 Correct 4 ms 32044 KB Output is correct
37 Correct 4 ms 32044 KB Output is correct
38 Correct 4 ms 32044 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2780 KB Output is correct
2 Correct 4 ms 2804 KB Output is correct
3 Correct 3 ms 2876 KB Output is correct
4 Correct 3 ms 2876 KB Output is correct
5 Correct 4 ms 2876 KB Output is correct
6 Correct 3 ms 2888 KB Output is correct
7 Correct 3 ms 3104 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 3 ms 3308 KB Output is correct
10 Correct 4 ms 3308 KB Output is correct
11 Correct 4 ms 3308 KB Output is correct
12 Correct 4 ms 3308 KB Output is correct
13 Correct 4 ms 3308 KB Output is correct
14 Correct 4 ms 3436 KB Output is correct
15 Correct 4 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 4 ms 3436 KB Output is correct
18 Correct 3 ms 3452 KB Output is correct
19 Correct 3 ms 3452 KB Output is correct
20 Correct 3 ms 3452 KB Output is correct
21 Correct 4 ms 3468 KB Output is correct
22 Correct 71 ms 18496 KB Output is correct
23 Correct 77 ms 20692 KB Output is correct
24 Correct 71 ms 22640 KB Output is correct
25 Correct 76 ms 24664 KB Output is correct
26 Correct 68 ms 26660 KB Output is correct
27 Correct 71 ms 28568 KB Output is correct
28 Correct 67 ms 30508 KB Output is correct
29 Correct 63 ms 32044 KB Output is correct
30 Correct 4 ms 32044 KB Output is correct
31 Correct 4 ms 32044 KB Output is correct
32 Correct 4 ms 32044 KB Output is correct
33 Correct 4 ms 32044 KB Output is correct
34 Correct 4 ms 32044 KB Output is correct
35 Correct 4 ms 32044 KB Output is correct
36 Correct 4 ms 32044 KB Output is correct
37 Correct 4 ms 32044 KB Output is correct
38 Correct 4 ms 32044 KB Output is correct
39 Correct 4 ms 32044 KB Output is correct
40 Correct 4 ms 32044 KB Output is correct
41 Correct 4 ms 32044 KB Output is correct
42 Correct 4 ms 32044 KB Output is correct
43 Correct 4 ms 32044 KB Output is correct
44 Correct 4 ms 32044 KB Output is correct
45 Correct 4 ms 32044 KB Output is correct
46 Correct 4 ms 32044 KB Output is correct
47 Correct 84 ms 32044 KB Output is correct
48 Correct 92 ms 32044 KB Output is correct
49 Correct 75 ms 32044 KB Output is correct
50 Correct 80 ms 32044 KB Output is correct
51 Correct 94 ms 32992 KB Output is correct
52 Correct 84 ms 35056 KB Output is correct
53 Correct 89 ms 37004 KB Output is correct
54 Correct 94 ms 38824 KB Output is correct
55 Correct 84 ms 40372 KB Output is correct
56 Correct 79 ms 41708 KB Output is correct
57 Correct 47 ms 44348 KB Output is correct