oj.uz

Submission #998121

# Submission time Handle Problem Language Result Execution time Memory
998121 2024-06-13T10:10:07 Z salmon Jobs (BOI24_jobs) C++14
100 / 100
 288 ms 96708 KB 
#include <bits/stdc++.h>
using namespace std;

#define set multiset

int N;
vector<int> root;
int h,h1;
vector<int> adjlst[300100];
long long int lst[300100];
int parent[300100];
const long long int inf = 2e18;
long long int money;
priority_queue<pair<long long int,long long int>,vector<pair<long long int,long long int>>,greater<pair<long long int,long long int>>> pq;

set<pair<long long int,long long int>>* dfs(int i){
//printf("%d",i);
    pair<int,int> ii = {-1,-1};
    vector<set<pair<long long int,long long int>>*> v;

    for(int j : adjlst[i]){
        v.push_back(dfs(j));

        ii = max({(int)(v.back() -> size()),v.size() - 1},ii);
    }
//printf("%d\n",i);
    set<pair<long long int,long long int>>* sat;

    if(ii.first == -1){
        sat = new set<pair<long long int,long long int>>();
    }
    else{
        sat = v[ii.second];
    }

    if(lst[i] > 0) sat -> insert({0,lst[i]});


    for(int i = 0; i < v.size(); i++){
        if(i == ii.second) continue;
        for(pair<long long int, long long int> pp : *(v[i]) ){
            sat -> insert(pp);
        }
    }

    //offset -= min(0LL,va);
    long long int num = 0;

    if(lst[i] < 0){
        long long int balls = -lst[i];

        num = -lst[i];
        while(num != 0 && !(sat -> empty())){
            auto it = sat -> begin();
            long long int temp = min(num, it -> second);
            balls = max((sat -> begin() -> first) + num, balls);
            num -= temp;
            if(it -> second == temp){
                sat -> erase(it);
            }
            else{
                pair<long long int, long long int> ii = *it;
                ii.second = ii.second - temp ;
                sat -> erase(it);
                sat -> insert(ii);
            }
        }

        if(num != 0) return sat;

        while(sat -> lower_bound({balls,inf}) != sat -> begin()){
            auto it = sat -> lower_bound({balls,inf});
            advance(it,-1);
            num += it -> second;
            sat -> erase(it);
        }

        if(num != 0) sat -> insert({balls, num});

        return sat;
    }
    else{
        return sat;
    }
}

int main(){
    //freopen("jobs.17-2345.in","r",stdin);

	scanf(" %d",&N);
    scanf(" %lld",&money);

    long long int init = money;

	for(int i = 1; i <= N; i++){
		scanf(" %d",&h);
		scanf(" %d",&h1);

		if(h1 == 0){
			root.push_back(i);
		}
		else{
            adjlst[h1].push_back(i);
		}
		lst[i] = h;
	}
	//printf("\n");

	for(int i : root){
        set<pair<long long int,long long int>>* ii = dfs(i);

        for(pair<long long int, long long int> pp : *ii){
            //printf("%d %d\n",pp.first,pp.second);
            pq.push(pp);
        }
	}

	while(!pq.empty()){
        if(money < pq.top().first) break;
        money += pq.top().second;
        pq.pop();
	}

	printf("%lld",money - init);
}
/*
5 104
-103 0
102 1
-103 2
55 3
50 3

1 0
-5 0

*/

Compilation message

Main.cpp: In function 'std::multiset<std::pair<long long int, long long int> >* dfs(int)':
Main.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::multiset<std::pair<long long int, long long int> >*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i = 0; i < v.size(); i++){
      |                    ~~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:90:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |  scanf(" %d",&N);
      |  ~~~~~^~~~~~~~~~
Main.cpp:91:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     scanf(" %lld",&money);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:96:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |   scanf(" %d",&h);
      |   ~~~~~^~~~~~~~~~
Main.cpp:97:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |   scanf(" %d",&h1);
      |   ~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 84996 KB Output is correct
2 Correct 183 ms 53604 KB Output is correct
3 Correct 120 ms 36664 KB Output is correct
4 Correct 174 ms 48068 KB Output is correct
5 Correct 154 ms 59844 KB Output is correct
6 Correct 135 ms 44480 KB Output is correct
7 Correct 218 ms 66012 KB Output is correct
8 Correct 135 ms 36032 KB Output is correct
9 Correct 148 ms 53956 KB Output is correct
10 Correct 131 ms 60096 KB Output is correct
11 Correct 277 ms 88504 KB Output is correct
12 Correct 200 ms 70732 KB Output is correct
13 Correct 237 ms 77872 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 3 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 3 ms 10844 KB Output is correct
5 Correct 4 ms 11112 KB Output is correct
6 Correct 2 ms 11096 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 3 ms 10940 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 3 ms 11100 KB Output is correct
12 Correct 3 ms 11100 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 4 ms 11096 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 10844 KB Output is correct
20 Correct 3 ms 10844 KB Output is correct
21 Correct 2 ms 11000 KB Output is correct
22 Correct 3 ms 10844 KB Output is correct
23 Correct 2 ms 11112 KB Output is correct
24 Correct 3 ms 11100 KB Output is correct
25 Correct 2 ms 10844 KB Output is correct
26 Correct 2 ms 10844 KB Output is correct
27 Correct 2 ms 10844 KB Output is correct
28 Correct 2 ms 11100 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 3 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 3 ms 10844 KB Output is correct
5 Correct 4 ms 11112 KB Output is correct
6 Correct 2 ms 11096 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 3 ms 10940 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 3 ms 11100 KB Output is correct
12 Correct 3 ms 11100 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 4 ms 11096 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 10844 KB Output is correct
20 Correct 3 ms 10844 KB Output is correct
21 Correct 2 ms 11000 KB Output is correct
22 Correct 3 ms 10844 KB Output is correct
23 Correct 2 ms 11112 KB Output is correct
24 Correct 3 ms 11100 KB Output is correct
25 Correct 2 ms 10844 KB Output is correct
26 Correct 2 ms 10844 KB Output is correct
27 Correct 2 ms 10844 KB Output is correct
28 Correct 2 ms 11100 KB Output is correct
29 Correct 101 ms 32452 KB Output is correct
30 Correct 97 ms 33824 KB Output is correct
31 Correct 90 ms 38336 KB Output is correct
32 Correct 169 ms 66016 KB Output is correct
33 Correct 170 ms 52668 KB Output is correct
34 Correct 121 ms 39736 KB Output is correct
35 Correct 69 ms 20164 KB Output is correct
36 Correct 108 ms 36772 KB Output is correct
37 Correct 102 ms 32644 KB Output is correct
38 Correct 191 ms 67528 KB Output is correct
39 Correct 172 ms 51920 KB Output is correct
40 Correct 147 ms 39808 KB Output is correct
41 Correct 112 ms 30660 KB Output is correct
42 Correct 45 ms 26564 KB Output is correct
43 Correct 120 ms 42204 KB Output is correct
44 Correct 182 ms 70848 KB Output is correct
45 Correct 155 ms 51712 KB Output is correct
46 Correct 133 ms 40472 KB Output is correct
47 Correct 121 ms 30844 KB Output is correct
48 Correct 93 ms 35776 KB Output is correct
49 Correct 103 ms 32960 KB Output is correct
50 Correct 180 ms 70828 KB Output is correct
51 Correct 107 ms 39884 KB Output is correct
52 Correct 170 ms 40640 KB Output is correct
53 Correct 85 ms 30676 KB Output is correct
54 Correct 99 ms 36676 KB Output is correct
55 Correct 104 ms 32704 KB Output is correct
56 Correct 188 ms 71524 KB Output is correct
57 Correct 177 ms 52412 KB Output is correct
58 Correct 189 ms 41668 KB Output is correct
59 Correct 126 ms 36796 KB Output is correct
60 Correct 81 ms 35260 KB Output is correct
61 Correct 118 ms 40024 KB Output is correct
62 Correct 211 ms 42176 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 3 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 3 ms 10844 KB Output is correct
5 Correct 4 ms 11112 KB Output is correct
6 Correct 2 ms 11096 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 3 ms 10940 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 3 ms 11100 KB Output is correct
12 Correct 3 ms 11100 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 4 ms 11096 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 10844 KB Output is correct
20 Correct 3 ms 10844 KB Output is correct
21 Correct 2 ms 11000 KB Output is correct
22 Correct 3 ms 10844 KB Output is correct
23 Correct 2 ms 11112 KB Output is correct
24 Correct 3 ms 11100 KB Output is correct
25 Correct 2 ms 10844 KB Output is correct
26 Correct 2 ms 10844 KB Output is correct
27 Correct 2 ms 10844 KB Output is correct
28 Correct 2 ms 11100 KB Output is correct
29 Correct 1 ms 10588 KB Output is correct
30 Correct 2 ms 11088 KB Output is correct
31 Correct 2 ms 11100 KB Output is correct
32 Correct 2 ms 10844 KB Output is correct
33 Correct 2 ms 10844 KB Output is correct
34 Correct 2 ms 11100 KB Output is correct
35 Correct 2 ms 11100 KB Output is correct
36 Correct 2 ms 11100 KB Output is correct
37 Correct 3 ms 10844 KB Output is correct
38 Correct 2 ms 10844 KB Output is correct
39 Correct 2 ms 10840 KB Output is correct
40 Correct 3 ms 11100 KB Output is correct
41 Correct 2 ms 11100 KB Output is correct
42 Correct 3 ms 11100 KB Output is correct
43 Correct 3 ms 10948 KB Output is correct
44 Correct 3 ms 10844 KB Output is correct
45 Correct 2 ms 10844 KB Output is correct
46 Correct 2 ms 11100 KB Output is correct
47 Correct 2 ms 10888 KB Output is correct
48 Correct 2 ms 11100 KB Output is correct
49 Correct 3 ms 11100 KB Output is correct
50 Correct 2 ms 10844 KB Output is correct
51 Correct 2 ms 10844 KB Output is correct
52 Correct 2 ms 11088 KB Output is correct
53 Correct 3 ms 11100 KB Output is correct
54 Correct 2 ms 11100 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 84996 KB Output is correct
2 Correct 183 ms 53604 KB Output is correct
3 Correct 120 ms 36664 KB Output is correct
4 Correct 174 ms 48068 KB Output is correct
5 Correct 154 ms 59844 KB Output is correct
6 Correct 135 ms 44480 KB Output is correct
7 Correct 218 ms 66012 KB Output is correct
8 Correct 135 ms 36032 KB Output is correct
9 Correct 148 ms 53956 KB Output is correct
10 Correct 131 ms 60096 KB Output is correct
11 Correct 277 ms 88504 KB Output is correct
12 Correct 200 ms 70732 KB Output is correct
13 Correct 237 ms 77872 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 3 ms 10844 KB Output is correct
18 Correct 4 ms 11112 KB Output is correct
19 Correct 2 ms 11096 KB Output is correct
20 Correct 2 ms 10840 KB Output is correct
21 Correct 2 ms 10844 KB Output is correct
22 Correct 3 ms 10940 KB Output is correct
23 Correct 2 ms 10844 KB Output is correct
24 Correct 3 ms 11100 KB Output is correct
25 Correct 3 ms 11100 KB Output is correct
26 Correct 2 ms 10844 KB Output is correct
27 Correct 2 ms 10844 KB Output is correct
28 Correct 3 ms 10844 KB Output is correct
29 Correct 3 ms 10844 KB Output is correct
30 Correct 4 ms 11096 KB Output is correct
31 Correct 3 ms 11100 KB Output is correct
32 Correct 3 ms 10844 KB Output is correct
33 Correct 3 ms 10844 KB Output is correct
34 Correct 2 ms 11000 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 2 ms 11112 KB Output is correct
37 Correct 3 ms 11100 KB Output is correct
38 Correct 2 ms 10844 KB Output is correct
39 Correct 2 ms 10844 KB Output is correct
40 Correct 2 ms 10844 KB Output is correct
41 Correct 2 ms 11100 KB Output is correct
42 Correct 101 ms 32452 KB Output is correct
43 Correct 97 ms 33824 KB Output is correct
44 Correct 90 ms 38336 KB Output is correct
45 Correct 169 ms 66016 KB Output is correct
46 Correct 170 ms 52668 KB Output is correct
47 Correct 121 ms 39736 KB Output is correct
48 Correct 69 ms 20164 KB Output is correct
49 Correct 108 ms 36772 KB Output is correct
50 Correct 102 ms 32644 KB Output is correct
51 Correct 191 ms 67528 KB Output is correct
52 Correct 172 ms 51920 KB Output is correct
53 Correct 147 ms 39808 KB Output is correct
54 Correct 112 ms 30660 KB Output is correct
55 Correct 45 ms 26564 KB Output is correct
56 Correct 120 ms 42204 KB Output is correct
57 Correct 182 ms 70848 KB Output is correct
58 Correct 155 ms 51712 KB Output is correct
59 Correct 133 ms 40472 KB Output is correct
60 Correct 121 ms 30844 KB Output is correct
61 Correct 93 ms 35776 KB Output is correct
62 Correct 103 ms 32960 KB Output is correct
63 Correct 180 ms 70828 KB Output is correct
64 Correct 107 ms 39884 KB Output is correct
65 Correct 170 ms 40640 KB Output is correct
66 Correct 85 ms 30676 KB Output is correct
67 Correct 99 ms 36676 KB Output is correct
68 Correct 104 ms 32704 KB Output is correct
69 Correct 188 ms 71524 KB Output is correct
70 Correct 177 ms 52412 KB Output is correct
71 Correct 189 ms 41668 KB Output is correct
72 Correct 126 ms 36796 KB Output is correct
73 Correct 81 ms 35260 KB Output is correct
74 Correct 118 ms 40024 KB Output is correct
75 Correct 211 ms 42176 KB Output is correct
76 Correct 1 ms 10588 KB Output is correct
77 Correct 2 ms 11088 KB Output is correct
78 Correct 2 ms 11100 KB Output is correct
79 Correct 2 ms 10844 KB Output is correct
80 Correct 2 ms 10844 KB Output is correct
81 Correct 2 ms 11100 KB Output is correct
82 Correct 2 ms 11100 KB Output is correct
83 Correct 2 ms 11100 KB Output is correct
84 Correct 3 ms 10844 KB Output is correct
85 Correct 2 ms 10844 KB Output is correct
86 Correct 2 ms 10840 KB Output is correct
87 Correct 3 ms 11100 KB Output is correct
88 Correct 2 ms 11100 KB Output is correct
89 Correct 3 ms 11100 KB Output is correct
90 Correct 3 ms 10948 KB Output is correct
91 Correct 3 ms 10844 KB Output is correct
92 Correct 2 ms 10844 KB Output is correct
93 Correct 2 ms 11100 KB Output is correct
94 Correct 2 ms 10888 KB Output is correct
95 Correct 2 ms 11100 KB Output is correct
96 Correct 3 ms 11100 KB Output is correct
97 Correct 2 ms 10844 KB Output is correct
98 Correct 2 ms 10844 KB Output is correct
99 Correct 2 ms 11088 KB Output is correct
100 Correct 3 ms 11100 KB Output is correct
101 Correct 2 ms 11100 KB Output is correct
102 Correct 205 ms 75856 KB Output is correct
103 Correct 196 ms 60704 KB Output is correct
104 Correct 118 ms 41660 KB Output is correct
105 Correct 96 ms 37316 KB Output is correct
106 Correct 155 ms 62368 KB Output is correct
107 Correct 119 ms 49096 KB Output is correct
108 Correct 225 ms 87088 KB Output is correct
109 Correct 83 ms 35068 KB Output is correct
110 Correct 137 ms 47296 KB Output is correct
111 Correct 165 ms 43452 KB Output is correct
112 Correct 119 ms 35364 KB Output is correct
113 Correct 134 ms 48844 KB Output is correct
114 Correct 128 ms 61888 KB Output is correct
115 Correct 97 ms 38344 KB Output is correct
116 Correct 224 ms 78396 KB Output is correct
117 Correct 147 ms 51148 KB Output is correct
118 Correct 140 ms 40928 KB Output is correct
119 Correct 125 ms 34492 KB Output is correct
120 Correct 146 ms 50992 KB Output is correct
121 Correct 119 ms 48072 KB Output is correct
122 Correct 264 ms 96708 KB Output is correct
123 Correct 207 ms 75976 KB Output is correct
124 Correct 139 ms 48788 KB Output is correct
125 Correct 141 ms 42948 KB Output is correct
126 Correct 101 ms 36284 KB Output is correct
127 Correct 70 ms 28172 KB Output is correct
128 Correct 50 ms 29392 KB Output is correct
129 Correct 252 ms 96444 KB Output is correct
130 Correct 210 ms 75504 KB Output is correct
131 Correct 173 ms 56396 KB Output is correct
132 Correct 125 ms 41148 KB Output is correct
133 Correct 103 ms 36572 KB Output is correct
134 Correct 194 ms 62240 KB Output is correct
135 Correct 121 ms 54220 KB Output is correct
136 Correct 239 ms 89536 KB Output is correct
137 Correct 245 ms 91332 KB Output is correct