oj.uz

Submission #734710

# Submission time Handle Problem Language Result Execution time Memory
734710 2023-05-03T00:15:42 Z buffering Paprike (COI18_paprike) C++17
100 / 100
 794 ms 23388 KB 
#include <bits/stdc++.h>
using namespace std;

int MAXN = 100001;
vector<int> parent(MAXN);
vector<vector<int>> children(MAXN);
vector<pair<int, int>> layer(MAXN);
vector<vector<int>> adj(MAXN);
vector<pair<int, int>> dp(MAXN, {0, 0}); //{max size with node, min cuts}
 
void IO(string s = "")
{
    if (s == "")
    {
        freopen("input.txt", "r", stdin);
        freopen("output 2.txt", "w", stdout);
    }
    if (s != "")
    {
        freopen((s + ".in").c_str(), "r", stdin);
        freopen((s + ".out").c_str(), "w", stdout);
    }
}

void dfs(int node, int p, int l) {
    layer[node] = {l, node};
    for (int c: adj[node]) {
        if (c != p) {
            parent[c] = node;
            children[node].push_back(c);
            dfs(c, node, l + 1);
        }
    }
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    //IO();

    int n; int k;
    cin >> n >> k;
    
    vector<int> h(n);
    for (int i = 0; i < n; i++) {
        cin >> h[i];
    }

    for (int i = 0; i < n - 1; i++) {
        int u; int v;
        cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs(0, 0, 0);

    sort(layer.begin(), layer.end());
    reverse(layer.begin(), layer.end());


    for (int i = 0; i < layer.size(); i++) {
        int node = layer[i].second;
        if (layer[node].first == 0) {
            dp[node] = {h[node], 0};
        }
        else {
            vector<int> s;
            int totcuts = 0;
            for (auto c: children[node]) {
                s.push_back(dp[c].first);
                totcuts += dp[c].second;
            }
            sort(s.begin(), s.end());
            int cuts = children[node].size();
            int curr = h[node];
            //cout << node << " " << " " << h[node] << " " << cuts << endl;
            for (int i = 0; i < s.size(); i++) {
                if (curr + s[i] > k) break;
                else {
                    cuts--;
                    curr += s[i];
                }
            }
            totcuts += cuts;
            //cout << node << " " << " " << h[node] << " " << totcuts << endl;
            dp[node] = {curr, totcuts};
        }
    }
    //cout << dp[6].second << endl;

    cout << dp[0].second << endl;

    

    
}

Compilation message

paprike.cpp: In function 'int main()':
paprike.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int i = 0; i < layer.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
paprike.cpp:81:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for (int i = 0; i < s.size(); i++) {
      |                             ~~^~~~~~~~~~
paprike.cpp: In function 'void IO(std::string)':
paprike.cpp:15:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
paprike.cpp:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen("output 2.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
paprike.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen((s + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
paprike.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen((s + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 6868 KB Output is correct
2 Correct 15 ms 6992 KB Output is correct
3 Correct 17 ms 6868 KB Output is correct
4 Correct 18 ms 6992 KB Output is correct
5 Correct 17 ms 6996 KB Output is correct
6 Correct 13 ms 6868 KB Output is correct
7 Correct 8 ms 6868 KB Output is correct
8 Correct 13 ms 6996 KB Output is correct
9 Correct 18 ms 6996 KB Output is correct
10 Correct 16 ms 6988 KB Output is correct
11 Correct 19 ms 6868 KB Output is correct
12 Correct 15 ms 6988 KB Output is correct
13 Correct 10 ms 6992 KB Output is correct
14 Correct 12 ms 6996 KB Output is correct
15 Correct 17 ms 6996 KB Output is correct
16 Correct 16 ms 6900 KB Output is correct
17 Correct 21 ms 6992 KB Output is correct
18 Correct 12 ms 6996 KB Output is correct
19 Correct 22 ms 6996 KB Output is correct
20 Correct 9 ms 6996 KB Output is correct
21 Correct 10 ms 6996 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 23352 KB Output is correct
2 Correct 55 ms 23388 KB Output is correct
3 Correct 52 ms 23364 KB Output is correct
4 Correct 53 ms 23372 KB Output is correct
5 Correct 55 ms 23356 KB Output is correct
6 Correct 52 ms 23364 KB Output is correct
7 Correct 54 ms 23284 KB Output is correct
8 Correct 48 ms 22860 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 6868 KB Output is correct
2 Correct 15 ms 6992 KB Output is correct
3 Correct 17 ms 6868 KB Output is correct
4 Correct 18 ms 6992 KB Output is correct
5 Correct 17 ms 6996 KB Output is correct
6 Correct 13 ms 6868 KB Output is correct
7 Correct 8 ms 6868 KB Output is correct
8 Correct 13 ms 6996 KB Output is correct
9 Correct 18 ms 6996 KB Output is correct
10 Correct 16 ms 6988 KB Output is correct
11 Correct 19 ms 6868 KB Output is correct
12 Correct 15 ms 6988 KB Output is correct
13 Correct 10 ms 6992 KB Output is correct
14 Correct 12 ms 6996 KB Output is correct
15 Correct 17 ms 6996 KB Output is correct
16 Correct 16 ms 6900 KB Output is correct
17 Correct 21 ms 6992 KB Output is correct
18 Correct 12 ms 6996 KB Output is correct
19 Correct 22 ms 6996 KB Output is correct
20 Correct 9 ms 6996 KB Output is correct
21 Correct 10 ms 6996 KB Output is correct
22 Correct 13 ms 7012 KB Output is correct
23 Correct 15 ms 6996 KB Output is correct
24 Correct 11 ms 6996 KB Output is correct
25 Correct 16 ms 7072 KB Output is correct
26 Correct 19 ms 6996 KB Output is correct
27 Correct 24 ms 6996 KB Output is correct
28 Correct 20 ms 6996 KB Output is correct
29 Correct 20 ms 7048 KB Output is correct
30 Correct 16 ms 6996 KB Output is correct
31 Correct 20 ms 7016 KB Output is correct
32 Correct 23 ms 7040 KB Output is correct
33 Correct 21 ms 6996 KB Output is correct
34 Correct 25 ms 6996 KB Output is correct
35 Correct 20 ms 7000 KB Output is correct
36 Correct 19 ms 6996 KB Output is correct
37 Correct 20 ms 6996 KB Output is correct
38 Correct 794 ms 7048 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 6868 KB Output is correct
2 Correct 15 ms 6992 KB Output is correct
3 Correct 17 ms 6868 KB Output is correct
4 Correct 18 ms 6992 KB Output is correct
5 Correct 17 ms 6996 KB Output is correct
6 Correct 13 ms 6868 KB Output is correct
7 Correct 8 ms 6868 KB Output is correct
8 Correct 13 ms 6996 KB Output is correct
9 Correct 18 ms 6996 KB Output is correct
10 Correct 16 ms 6988 KB Output is correct
11 Correct 19 ms 6868 KB Output is correct
12 Correct 15 ms 6988 KB Output is correct
13 Correct 10 ms 6992 KB Output is correct
14 Correct 12 ms 6996 KB Output is correct
15 Correct 17 ms 6996 KB Output is correct
16 Correct 16 ms 6900 KB Output is correct
17 Correct 21 ms 6992 KB Output is correct
18 Correct 12 ms 6996 KB Output is correct
19 Correct 22 ms 6996 KB Output is correct
20 Correct 9 ms 6996 KB Output is correct
21 Correct 10 ms 6996 KB Output is correct
22 Correct 55 ms 23352 KB Output is correct
23 Correct 55 ms 23388 KB Output is correct
24 Correct 52 ms 23364 KB Output is correct
25 Correct 53 ms 23372 KB Output is correct
26 Correct 55 ms 23356 KB Output is correct
27 Correct 52 ms 23364 KB Output is correct
28 Correct 54 ms 23284 KB Output is correct
29 Correct 48 ms 22860 KB Output is correct
30 Correct 13 ms 7012 KB Output is correct
31 Correct 15 ms 6996 KB Output is correct
32 Correct 11 ms 6996 KB Output is correct
33 Correct 16 ms 7072 KB Output is correct
34 Correct 19 ms 6996 KB Output is correct
35 Correct 24 ms 6996 KB Output is correct
36 Correct 20 ms 6996 KB Output is correct
37 Correct 20 ms 7048 KB Output is correct
38 Correct 16 ms 6996 KB Output is correct
39 Correct 20 ms 7016 KB Output is correct
40 Correct 23 ms 7040 KB Output is correct
41 Correct 21 ms 6996 KB Output is correct
42 Correct 25 ms 6996 KB Output is correct
43 Correct 20 ms 7000 KB Output is correct
44 Correct 19 ms 6996 KB Output is correct
45 Correct 20 ms 6996 KB Output is correct
46 Correct 794 ms 7048 KB Output is correct
47 Correct 59 ms 17124 KB Output is correct
48 Correct 59 ms 15896 KB Output is correct
49 Correct 63 ms 15628 KB Output is correct
50 Correct 68 ms 15304 KB Output is correct
51 Correct 74 ms 14184 KB Output is correct
52 Correct 77 ms 14084 KB Output is correct
53 Correct 72 ms 14020 KB Output is correct
54 Correct 74 ms 14052 KB Output is correct
55 Correct 75 ms 13648 KB Output is correct
56 Correct 85 ms 13628 KB Output is correct
57 Correct 45 ms 13764 KB Output is correct