oj.uz

Submission #991228

# Submission time Handle Problem Language Result Execution time Memory
991228 2024-06-01T15:30:22 Z model_code Jobs (BOI24_jobs) C++17
100 / 100
 331 ms 54856 KB 
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

const int N_MAX = 300000;

struct block {
    // Minimum prefix sum of the block -> we need at least "requirement" money to take all of block's elements
    long long requirement;
    // Sum of all elements of the block
    long long sum;

    // Allows sorting blocks in non-decreasing order by "requirement"
    bool operator>(const block& other) const {
        return requirement > other.requirement || (requirement == other.requirement && sum > other.sum);
    }
};

int x[N_MAX + 1];
vector <int> children[N_MAX + 1];

// Index of the 'leader' vertex of a priority queue containing vertex i
int p_queue_index[N_MAX + 1];
// Structure allowing to extract block with the smallest "requirement" value
priority_queue <block, vector<block>, greater<block>> blocks[N_MAX + 1];


int merge_priority_queues(int id_a, int id_b) {
    if (blocks[id_b].size() > blocks[id_a].size()) {
        // Trick: merge smaller queue to a larger one
        swap(id_a, id_b);
    }
    while (blocks[id_b].size() > 0) {
        blocks[id_a].push(blocks[id_b].top());
        blocks[id_b].pop();
    }
    return id_a;
}


// Combine new_block with the current list of blocks at vertex v until the sum of the new_block becomes positive
void combine_blocks(int v, block new_block) {
    while (blocks[v].size() > 0) {
        block top_block = blocks[v].top();
        if (new_block.sum <= 0) {
            blocks[v].pop();
            new_block = {max(new_block.requirement, top_block.requirement - new_block.sum), new_block.sum + top_block.sum};
        }
        else {
            // If sum is positive, we want to keep "requirement" sorted in non-decreasing order
            if (new_block.requirement > top_block.requirement) {
                blocks[v].pop();
                new_block = {new_block.requirement, new_block.sum + top_block.sum};
            }
            else {
                // new_block satisfies the requirements, push it to the list of the blocks at vertex v.
                blocks[v].push(new_block);
                break;
            }
        }
    }
    if (blocks[v].size() == 0) {
        blocks[v].push(new_block);
    }
    if (blocks[v].size() == 1 && blocks[v].top().sum <= 0) {
        blocks[v].pop();
    }
}


void dfs(int v) {
    if (children[v].size() == 0) {
        // For a new priority queue, set the graph child node as the 'leader' of the priority queue
        p_queue_index[v] = v;
    }
    for (int i = 0; i < children[v].size(); i++) {
        int a = children[v][i];
        dfs(a);
        if (i == 0) {
            p_queue_index[v] = p_queue_index[a];
        }
        else {
            // Merge priority queues of children vertices
            p_queue_index[v] = merge_priority_queues(p_queue_index[v], p_queue_index[a]);
        }
    }
    // Add block formed by vertex v to the list of merged blocks from children of v
    combine_blocks(p_queue_index[v], {max(0, -x[v]), x[v]});
}


int main() {
    int N;
    long long s, profit = 0;  // Profit starts from 0, and not from s.
    cin >> N >> s;
    for (int i = 1; i <= N; i++) {
        int p;
        cin >> x[i] >> p;
        children[p].push_back(i);
    }

    // Perform dfs which constructs the order of blocks to be visited independently on the s.
    dfs(0);

    // Once the block order is set, take all blocks that we can with the given value of s.
    while (blocks[p_queue_index[0]].size() > 0) {
        long long min_requirement = blocks[p_queue_index[0]].top().requirement;
        long long sum = blocks[p_queue_index[0]].top().sum;
        blocks[p_queue_index[0]].pop();
        if (s + profit >= min_requirement) {
            profit += sum;
        }
    }

    cout << profit << endl;
    return 0;
}

Compilation message

Main.cpp: In function 'void dfs(int)':
Main.cpp:78:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int i = 0; i < children[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 49024 KB Output is correct
2 Correct 237 ms 38836 KB Output is correct
3 Correct 206 ms 33384 KB Output is correct
4 Correct 201 ms 36800 KB Output is correct
5 Correct 182 ms 41388 KB Output is correct
6 Correct 144 ms 33892 KB Output is correct
7 Correct 235 ms 42492 KB Output is correct
8 Correct 204 ms 33588 KB Output is correct
9 Correct 156 ms 38404 KB Output is correct
10 Correct 162 ms 41732 KB Output is correct
11 Correct 274 ms 50128 KB Output is correct
12 Correct 255 ms 42180 KB Output is correct
13 Correct 309 ms 47396 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 7 ms 16732 KB Output is correct
3 Correct 7 ms 16732 KB Output is correct
4 Correct 8 ms 16988 KB Output is correct
5 Correct 7 ms 16988 KB Output is correct
6 Correct 9 ms 16984 KB Output is correct
7 Correct 8 ms 16988 KB Output is correct
8 Correct 8 ms 16988 KB Output is correct
9 Correct 9 ms 16984 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 8 ms 16988 KB Output is correct
12 Correct 9 ms 16988 KB Output is correct
13 Correct 8 ms 16984 KB Output is correct
14 Correct 7 ms 16876 KB Output is correct
15 Correct 7 ms 16912 KB Output is correct
16 Correct 8 ms 16988 KB Output is correct
17 Correct 8 ms 16988 KB Output is correct
18 Correct 8 ms 16964 KB Output is correct
19 Correct 8 ms 16988 KB Output is correct
20 Correct 8 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 8 ms 16988 KB Output is correct
23 Correct 8 ms 16988 KB Output is correct
24 Correct 8 ms 16988 KB Output is correct
25 Correct 8 ms 16988 KB Output is correct
26 Correct 8 ms 16768 KB Output is correct
27 Correct 8 ms 16972 KB Output is correct
28 Correct 9 ms 16936 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 7 ms 16732 KB Output is correct
3 Correct 7 ms 16732 KB Output is correct
4 Correct 8 ms 16988 KB Output is correct
5 Correct 7 ms 16988 KB Output is correct
6 Correct 9 ms 16984 KB Output is correct
7 Correct 8 ms 16988 KB Output is correct
8 Correct 8 ms 16988 KB Output is correct
9 Correct 9 ms 16984 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 8 ms 16988 KB Output is correct
12 Correct 9 ms 16988 KB Output is correct
13 Correct 8 ms 16984 KB Output is correct
14 Correct 7 ms 16876 KB Output is correct
15 Correct 7 ms 16912 KB Output is correct
16 Correct 8 ms 16988 KB Output is correct
17 Correct 8 ms 16988 KB Output is correct
18 Correct 8 ms 16964 KB Output is correct
19 Correct 8 ms 16988 KB Output is correct
20 Correct 8 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 8 ms 16988 KB Output is correct
23 Correct 8 ms 16988 KB Output is correct
24 Correct 8 ms 16988 KB Output is correct
25 Correct 8 ms 16988 KB Output is correct
26 Correct 8 ms 16768 KB Output is correct
27 Correct 8 ms 16972 KB Output is correct
28 Correct 9 ms 16936 KB Output is correct
29 Correct 157 ms 35012 KB Output is correct
30 Correct 170 ms 35224 KB Output is correct
31 Correct 184 ms 32448 KB Output is correct
32 Correct 209 ms 49128 KB Output is correct
33 Correct 195 ms 43336 KB Output is correct
34 Correct 181 ms 38176 KB Output is correct
35 Correct 91 ms 24732 KB Output is correct
36 Correct 204 ms 35028 KB Output is correct
37 Correct 196 ms 35332 KB Output is correct
38 Correct 174 ms 49360 KB Output is correct
39 Correct 216 ms 42568 KB Output is correct
40 Correct 199 ms 37976 KB Output is correct
41 Correct 192 ms 32964 KB Output is correct
42 Correct 86 ms 26972 KB Output is correct
43 Correct 164 ms 39620 KB Output is correct
44 Correct 190 ms 50944 KB Output is correct
45 Correct 163 ms 42660 KB Output is correct
46 Correct 163 ms 38316 KB Output is correct
47 Correct 177 ms 33232 KB Output is correct
48 Correct 173 ms 33476 KB Output is correct
49 Correct 184 ms 35144 KB Output is correct
50 Correct 184 ms 50888 KB Output is correct
51 Correct 121 ms 35144 KB Output is correct
52 Correct 169 ms 38116 KB Output is correct
53 Correct 120 ms 31676 KB Output is correct
54 Correct 178 ms 33336 KB Output is correct
55 Correct 182 ms 35204 KB Output is correct
56 Correct 183 ms 50884 KB Output is correct
57 Correct 171 ms 43304 KB Output is correct
58 Correct 173 ms 38132 KB Output is correct
59 Correct 166 ms 35992 KB Output is correct
60 Correct 148 ms 33472 KB Output is correct
61 Correct 184 ms 39104 KB Output is correct
62 Correct 182 ms 38724 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 7 ms 16732 KB Output is correct
3 Correct 7 ms 16732 KB Output is correct
4 Correct 8 ms 16988 KB Output is correct
5 Correct 7 ms 16988 KB Output is correct
6 Correct 9 ms 16984 KB Output is correct
7 Correct 8 ms 16988 KB Output is correct
8 Correct 8 ms 16988 KB Output is correct
9 Correct 9 ms 16984 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 8 ms 16988 KB Output is correct
12 Correct 9 ms 16988 KB Output is correct
13 Correct 8 ms 16984 KB Output is correct
14 Correct 7 ms 16876 KB Output is correct
15 Correct 7 ms 16912 KB Output is correct
16 Correct 8 ms 16988 KB Output is correct
17 Correct 8 ms 16988 KB Output is correct
18 Correct 8 ms 16964 KB Output is correct
19 Correct 8 ms 16988 KB Output is correct
20 Correct 8 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 8 ms 16988 KB Output is correct
23 Correct 8 ms 16988 KB Output is correct
24 Correct 8 ms 16988 KB Output is correct
25 Correct 8 ms 16988 KB Output is correct
26 Correct 8 ms 16768 KB Output is correct
27 Correct 8 ms 16972 KB Output is correct
28 Correct 9 ms 16936 KB Output is correct
29 Correct 7 ms 16732 KB Output is correct
30 Correct 8 ms 16988 KB Output is correct
31 Correct 8 ms 16988 KB Output is correct
32 Correct 8 ms 16952 KB Output is correct
33 Correct 8 ms 16984 KB Output is correct
34 Correct 8 ms 16988 KB Output is correct
35 Correct 8 ms 16900 KB Output is correct
36 Correct 7 ms 16804 KB Output is correct
37 Correct 11 ms 16988 KB Output is correct
38 Correct 11 ms 16988 KB Output is correct
39 Correct 8 ms 16812 KB Output is correct
40 Correct 8 ms 16988 KB Output is correct
41 Correct 8 ms 16988 KB Output is correct
42 Correct 8 ms 16988 KB Output is correct
43 Correct 8 ms 16988 KB Output is correct
44 Correct 8 ms 16988 KB Output is correct
45 Correct 7 ms 16988 KB Output is correct
46 Correct 7 ms 16892 KB Output is correct
47 Correct 7 ms 16988 KB Output is correct
48 Correct 8 ms 16988 KB Output is correct
49 Correct 11 ms 16888 KB Output is correct
50 Correct 10 ms 16984 KB Output is correct
51 Correct 9 ms 16984 KB Output is correct
52 Correct 8 ms 16988 KB Output is correct
53 Correct 7 ms 16988 KB Output is correct
54 Correct 8 ms 16896 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 49024 KB Output is correct
2 Correct 237 ms 38836 KB Output is correct
3 Correct 206 ms 33384 KB Output is correct
4 Correct 201 ms 36800 KB Output is correct
5 Correct 182 ms 41388 KB Output is correct
6 Correct 144 ms 33892 KB Output is correct
7 Correct 235 ms 42492 KB Output is correct
8 Correct 204 ms 33588 KB Output is correct
9 Correct 156 ms 38404 KB Output is correct
10 Correct 162 ms 41732 KB Output is correct
11 Correct 274 ms 50128 KB Output is correct
12 Correct 255 ms 42180 KB Output is correct
13 Correct 309 ms 47396 KB Output is correct
14 Correct 7 ms 16732 KB Output is correct
15 Correct 7 ms 16732 KB Output is correct
16 Correct 7 ms 16732 KB Output is correct
17 Correct 8 ms 16988 KB Output is correct
18 Correct 7 ms 16988 KB Output is correct
19 Correct 9 ms 16984 KB Output is correct
20 Correct 8 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 9 ms 16984 KB Output is correct
23 Correct 8 ms 16988 KB Output is correct
24 Correct 8 ms 16988 KB Output is correct
25 Correct 9 ms 16988 KB Output is correct
26 Correct 8 ms 16984 KB Output is correct
27 Correct 7 ms 16876 KB Output is correct
28 Correct 7 ms 16912 KB Output is correct
29 Correct 8 ms 16988 KB Output is correct
30 Correct 8 ms 16988 KB Output is correct
31 Correct 8 ms 16964 KB Output is correct
32 Correct 8 ms 16988 KB Output is correct
33 Correct 8 ms 16988 KB Output is correct
34 Correct 8 ms 16988 KB Output is correct
35 Correct 8 ms 16988 KB Output is correct
36 Correct 8 ms 16988 KB Output is correct
37 Correct 8 ms 16988 KB Output is correct
38 Correct 8 ms 16988 KB Output is correct
39 Correct 8 ms 16768 KB Output is correct
40 Correct 8 ms 16972 KB Output is correct
41 Correct 9 ms 16936 KB Output is correct
42 Correct 157 ms 35012 KB Output is correct
43 Correct 170 ms 35224 KB Output is correct
44 Correct 184 ms 32448 KB Output is correct
45 Correct 209 ms 49128 KB Output is correct
46 Correct 195 ms 43336 KB Output is correct
47 Correct 181 ms 38176 KB Output is correct
48 Correct 91 ms 24732 KB Output is correct
49 Correct 204 ms 35028 KB Output is correct
50 Correct 196 ms 35332 KB Output is correct
51 Correct 174 ms 49360 KB Output is correct
52 Correct 216 ms 42568 KB Output is correct
53 Correct 199 ms 37976 KB Output is correct
54 Correct 192 ms 32964 KB Output is correct
55 Correct 86 ms 26972 KB Output is correct
56 Correct 164 ms 39620 KB Output is correct
57 Correct 190 ms 50944 KB Output is correct
58 Correct 163 ms 42660 KB Output is correct
59 Correct 163 ms 38316 KB Output is correct
60 Correct 177 ms 33232 KB Output is correct
61 Correct 173 ms 33476 KB Output is correct
62 Correct 184 ms 35144 KB Output is correct
63 Correct 184 ms 50888 KB Output is correct
64 Correct 121 ms 35144 KB Output is correct
65 Correct 169 ms 38116 KB Output is correct
66 Correct 120 ms 31676 KB Output is correct
67 Correct 178 ms 33336 KB Output is correct
68 Correct 182 ms 35204 KB Output is correct
69 Correct 183 ms 50884 KB Output is correct
70 Correct 171 ms 43304 KB Output is correct
71 Correct 173 ms 38132 KB Output is correct
72 Correct 166 ms 35992 KB Output is correct
73 Correct 148 ms 33472 KB Output is correct
74 Correct 184 ms 39104 KB Output is correct
75 Correct 182 ms 38724 KB Output is correct
76 Correct 7 ms 16732 KB Output is correct
77 Correct 8 ms 16988 KB Output is correct
78 Correct 8 ms 16988 KB Output is correct
79 Correct 8 ms 16952 KB Output is correct
80 Correct 8 ms 16984 KB Output is correct
81 Correct 8 ms 16988 KB Output is correct
82 Correct 8 ms 16900 KB Output is correct
83 Correct 7 ms 16804 KB Output is correct
84 Correct 11 ms 16988 KB Output is correct
85 Correct 11 ms 16988 KB Output is correct
86 Correct 8 ms 16812 KB Output is correct
87 Correct 8 ms 16988 KB Output is correct
88 Correct 8 ms 16988 KB Output is correct
89 Correct 8 ms 16988 KB Output is correct
90 Correct 8 ms 16988 KB Output is correct
91 Correct 8 ms 16988 KB Output is correct
92 Correct 7 ms 16988 KB Output is correct
93 Correct 7 ms 16892 KB Output is correct
94 Correct 7 ms 16988 KB Output is correct
95 Correct 8 ms 16988 KB Output is correct
96 Correct 11 ms 16888 KB Output is correct
97 Correct 10 ms 16984 KB Output is correct
98 Correct 9 ms 16984 KB Output is correct
99 Correct 8 ms 16988 KB Output is correct
100 Correct 7 ms 16988 KB Output is correct
101 Correct 8 ms 16896 KB Output is correct
102 Correct 262 ms 45916 KB Output is correct
103 Correct 249 ms 40900 KB Output is correct
104 Correct 226 ms 34484 KB Output is correct
105 Correct 223 ms 33220 KB Output is correct
106 Correct 172 ms 41924 KB Output is correct
107 Correct 176 ms 37420 KB Output is correct
108 Correct 280 ms 50056 KB Output is correct
109 Correct 125 ms 28616 KB Output is correct
110 Correct 231 ms 36808 KB Output is correct
111 Correct 232 ms 35008 KB Output is correct
112 Correct 227 ms 32188 KB Output is correct
113 Correct 182 ms 37252 KB Output is correct
114 Correct 190 ms 41876 KB Output is correct
115 Correct 141 ms 30152 KB Output is correct
116 Correct 281 ms 47084 KB Output is correct
117 Correct 242 ms 37820 KB Output is correct
118 Correct 238 ms 34756 KB Output is correct
119 Correct 211 ms 31856 KB Output is correct
120 Correct 200 ms 37428 KB Output is correct
121 Correct 195 ms 36996 KB Output is correct
122 Correct 299 ms 54708 KB Output is correct
123 Correct 274 ms 45464 KB Output is correct
124 Correct 237 ms 36364 KB Output is correct
125 Correct 240 ms 35264 KB Output is correct
126 Correct 213 ms 33468 KB Output is correct
127 Correct 115 ms 28104 KB Output is correct
128 Correct 101 ms 26316 KB Output is correct
129 Correct 283 ms 54856 KB Output is correct
130 Correct 266 ms 45760 KB Output is correct
131 Correct 248 ms 39620 KB Output is correct
132 Correct 203 ms 34616 KB Output is correct
133 Correct 211 ms 33472 KB Output is correct
134 Correct 177 ms 41700 KB Output is correct
135 Correct 213 ms 38596 KB Output is correct
136 Correct 296 ms 50168 KB Output is correct
137 Correct 331 ms 53444 KB Output is correct