oj.uz

Submission #678152

# Submission time Handle Problem Language Result Execution time Memory
678152 2023-01-05T08:57:22 Z Tien_Noob Paprike (COI18_paprike) C++17
100 / 100
 70 ms 19052 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5;
vector<int> adj[N + 1];
int res, a[N + 1], n, h;
void read()
{
    cin >> n >> h;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
    }
    for (int i = 1; i < n; ++ i)
    {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
}
int DFS(int u, int p)
{
    vector<int> f;
    for (int v : adj[u])
    {
        if (v == p)
        {
            continue ;
        }
        f.push_back(DFS(v, u));
    }
    sort(f.begin(), f.end());
    int x = a[u];
    for (int i : f)
    {
        if (x + i <= h)
        {
            x += i;
        }
        else
        {
            ++res;
        }
    }
    return x;
}
void solve()
{
    DFS(1, 0);
    cout << res;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

paprike.cpp: In function 'int main()':
paprike.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 19020 KB Output is correct
2 Correct 70 ms 19052 KB Output is correct
3 Correct 43 ms 19040 KB Output is correct
4 Correct 46 ms 19016 KB Output is correct
5 Correct 48 ms 19024 KB Output is correct
6 Correct 45 ms 19024 KB Output is correct
7 Correct 42 ms 19020 KB Output is correct
8 Correct 38 ms 18488 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2672 KB Output is correct
5 Correct 3 ms 2644 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2672 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 3 ms 2772 KB Output is correct
23 Correct 4 ms 2684 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2700 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 3 ms 2672 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 3 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2696 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2672 KB Output is correct
5 Correct 3 ms 2644 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2672 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 46 ms 19020 KB Output is correct
23 Correct 70 ms 19052 KB Output is correct
24 Correct 43 ms 19040 KB Output is correct
25 Correct 46 ms 19016 KB Output is correct
26 Correct 48 ms 19024 KB Output is correct
27 Correct 45 ms 19024 KB Output is correct
28 Correct 42 ms 19020 KB Output is correct
29 Correct 38 ms 18488 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 4 ms 2684 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2700 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 3 ms 2672 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 3 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2696 KB Output is correct
46 Correct 3 ms 2688 KB Output is correct
47 Correct 46 ms 12156 KB Output is correct
48 Correct 50 ms 10380 KB Output is correct
49 Correct 40 ms 9620 KB Output is correct
50 Correct 42 ms 9264 KB Output is correct
51 Correct 48 ms 8196 KB Output is correct
52 Correct 50 ms 8256 KB Output is correct
53 Correct 45 ms 8108 KB Output is correct
54 Correct 45 ms 8156 KB Output is correct
55 Correct 52 ms 7596 KB Output is correct
56 Correct 44 ms 7636 KB Output is correct
57 Correct 31 ms 8980 KB Output is correct