oj.uz

Submission #748287

# Submission time Handle Problem Language Result Execution time Memory
748287 2023-05-26T03:28:47 Z Username4132 Paprike (COI18_paprike) C++14
100 / 100
 62 ms 21052 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define dforn(i, n) for(int i=n-1; i>=0; --i)
#define dforsn(i, s, n) for(int i=n-1; i>=s; --i)
#define PB push_back

const int MAXN=100010;
int n, k, ans, arr[MAXN], par[MAXN], dep[MAXN], order[MAXN];
vector<int> g[MAXN], lis[MAXN];

void dfs(int v, int p){
    par[v]=p;
    for(int to:g[v]) if(to!=p) {
        dep[to]=dep[v]+1;
        dfs(to, v);
    }
}

int main(){
    scanf("%d %d", &n, &k);
    forn(i, n) scanf("%d", &arr[i]), order[i]=i;
    forn(i, n-1){
        int a, b; scanf("%d %d", &a, &b); --a, --b;
        g[a].PB(b), g[b].PB(a);
    }
    dfs(0, 0);
    forn(i, n) lis[dep[i]].PB(i);
    dforsn(d, 1, n){
        sort(lis[d].begin(), lis[d].end(), [](int a, int b){
            return arr[a]<arr[b];
        });
        for(int ind:lis[d]){
            if(arr[ind]+arr[par[ind]]<=k) arr[par[ind]]+=arr[ind];
            else ans++;
        }
    }
    printf("%d\n", ans);
}

Compilation message

paprike.cpp: In function 'int main()':
paprike.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
paprike.cpp:25:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     forn(i, n) scanf("%d", &arr[i]), order[i]=i;
      |                ~~~~~^~~~~~~~~~~~~~~
paprike.cpp:27:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         int a, b; scanf("%d %d", &a, &b); --a, --b;
      |                   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5000 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4988 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4988 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5008 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5008 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 21052 KB Output is correct
2 Correct 51 ms 21032 KB Output is correct
3 Correct 50 ms 21028 KB Output is correct
4 Correct 52 ms 21004 KB Output is correct
5 Correct 55 ms 20932 KB Output is correct
6 Correct 48 ms 20940 KB Output is correct
7 Correct 48 ms 20896 KB Output is correct
8 Correct 49 ms 20500 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5000 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4988 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4988 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5008 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5008 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5084 KB Output is correct
23 Correct 3 ms 5128 KB Output is correct
24 Correct 3 ms 5024 KB Output is correct
25 Correct 3 ms 5020 KB Output is correct
26 Correct 3 ms 5084 KB Output is correct
27 Correct 3 ms 5020 KB Output is correct
28 Correct 3 ms 5084 KB Output is correct
29 Correct 4 ms 5024 KB Output is correct
30 Correct 3 ms 5084 KB Output is correct
31 Correct 4 ms 5084 KB Output is correct
32 Correct 3 ms 5084 KB Output is correct
33 Correct 3 ms 5084 KB Output is correct
34 Correct 3 ms 5084 KB Output is correct
35 Correct 3 ms 5084 KB Output is correct
36 Correct 3 ms 5084 KB Output is correct
37 Correct 3 ms 5084 KB Output is correct
38 Correct 3 ms 5084 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5000 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4988 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4988 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5008 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5008 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 50 ms 21052 KB Output is correct
23 Correct 51 ms 21032 KB Output is correct
24 Correct 50 ms 21028 KB Output is correct
25 Correct 52 ms 21004 KB Output is correct
26 Correct 55 ms 20932 KB Output is correct
27 Correct 48 ms 20940 KB Output is correct
28 Correct 48 ms 20896 KB Output is correct
29 Correct 49 ms 20500 KB Output is correct
30 Correct 3 ms 5084 KB Output is correct
31 Correct 3 ms 5128 KB Output is correct
32 Correct 3 ms 5024 KB Output is correct
33 Correct 3 ms 5020 KB Output is correct
34 Correct 3 ms 5084 KB Output is correct
35 Correct 3 ms 5020 KB Output is correct
36 Correct 3 ms 5084 KB Output is correct
37 Correct 4 ms 5024 KB Output is correct
38 Correct 3 ms 5084 KB Output is correct
39 Correct 4 ms 5084 KB Output is correct
40 Correct 3 ms 5084 KB Output is correct
41 Correct 3 ms 5084 KB Output is correct
42 Correct 3 ms 5084 KB Output is correct
43 Correct 3 ms 5084 KB Output is correct
44 Correct 3 ms 5084 KB Output is correct
45 Correct 3 ms 5084 KB Output is correct
46 Correct 3 ms 5084 KB Output is correct
47 Correct 50 ms 14836 KB Output is correct
48 Correct 49 ms 13516 KB Output is correct
49 Correct 52 ms 13116 KB Output is correct
50 Correct 50 ms 12948 KB Output is correct
51 Correct 60 ms 12236 KB Output is correct
52 Correct 62 ms 12336 KB Output is correct
53 Correct 56 ms 12232 KB Output is correct
54 Correct 55 ms 12196 KB Output is correct
55 Correct 53 ms 11680 KB Output is correct
56 Correct 60 ms 11724 KB Output is correct
57 Correct 37 ms 12508 KB Output is correct