-
Notifications
You must be signed in to change notification settings - Fork 0
/
code.cpp
231 lines (180 loc) · 4.86 KB
/
code.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
/* Duarte Emanuel Ramos Meneses - 2019216949
Patricia Beatriz Silva Costa - 2019213995
EA - Trabalho3 - 2021/2022 */
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
struct operation
{
int time;
int num_dep;
vector<int> dependencies;
vector<int> go_to;
int times_vis;
int best_time;
int bottle;
};
int num_op=0, option=-1;
int x=0, y=0, z=0;
int initial=0;
vector<operation> ops;
vector<int> cycles;
int node_fin = 0;
vector<int> visited;
vector<int> aux_visited;
priority_queue<int, vector<int>, greater<int>> pq;
vector<int> res;
int total_time = 0;
vector<int> check_vec;
int valid_final() {
int fin = 0;
for (int i=1; i<=num_op; i++) {
if (ops[i].go_to.size() == 0) {
fin++;
}
if (fin > 1) return 0;
}
return 1;
}
int valid_cycle(int pos) {
visited[pos] = 1;
aux_visited[pos] = 1;
for (size_t i=0; i<ops[pos].go_to.size(); i++) {
if (visited[ops[pos].go_to[i]] == 0) {
if (valid_cycle(ops[pos].go_to[i])) return 1;
}
else if (aux_visited[ops[pos].go_to[i]] == 1) return 1;
}
aux_visited[pos] = 0;
return 0;
}
void option1(){
while(!pq.empty()){
int p1 = pq.top();
pq.pop();
res.emplace_back(p1);
total_time += ops[p1].time;
sort(ops[p1].go_to.begin(), ops[p1].go_to.end());
for(size_t i = 0; i < ops[p1].go_to.size(); i++){
ops[ops[p1].go_to[i]].times_vis ++;
if (ops[ops[p1].go_to[i]].times_vis == ops[ops[p1].go_to[i]].num_dep)
pq.push(ops[p1].go_to[i]);
}
}
}
int option2(int pos) {
if (ops[pos].go_to.size() == 0) {
ops[pos].best_time = ops[pos].time;
return 1;
}
for (size_t i=0; i<ops[pos].go_to.size(); i++) {
if (ops[ops[pos].go_to[i]].best_time == 0)
option2(ops[pos].go_to[i]);
}
int max_time = 0;
for (size_t i=0; i<ops[pos].go_to.size(); i++) {
if (max_time < ops[ops[pos].go_to[i]].best_time) {
max_time = ops[ops[pos].go_to[i]].best_time;
}
}
ops[pos].best_time = max_time + ops[pos].time;
return 0;
}
void check_goto(int pos, int base) {
visited[pos] = 1;
for (size_t i=0; i<ops[pos].go_to.size(); i++) {
if (visited[ops[pos].go_to[i]] == 0) {
ops[base].bottle ++;
check_goto(ops[pos].go_to[i], base);
}
}
}
void check_dependencies(int pos, int base) {
visited[pos] = 1;
for (size_t i=0; i<ops[pos].dependencies.size(); i++) {
if (visited[ops[pos].dependencies[i]] == 0) {
ops[base].bottle ++;
check_dependencies(ops[pos].dependencies[i], base);
}
}
}
void option3() {
while (!pq.empty()) {
visited = vector<int> (num_op + 1);
int p1 = pq.top();
pq.pop();
check_goto(p1, p1);
check_dependencies(p1, p1);
if (ops[p1].bottle == num_op - 1) cout << p1 << "\n";
for (size_t i=0; i<ops[p1].go_to.size(); i++) {
ops[ops[p1].go_to[i]].times_vis ++;
if (ops[ops[p1].go_to[i]].times_vis == ops[ops[p1].go_to[i]].num_dep) {
pq.push(ops[p1].go_to[i]);
}
}
}
}
int main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> num_op;
ops = vector<operation> (num_op + 1);
for (int i=0; i<num_op; i++) {
cin >> x >> y;
ops[i+1].time = x;
ops[i+1].num_dep = y;
ops[i+1].times_vis = 0;
if (y == 0) {
if (initial != 0) {
cout << "INVALID\n";
return 0;
}
else initial = i+1;
}
for (int j=0; j<y; j++) {
cin >> z;
ops[i+1].dependencies.emplace_back(z);
ops[z].go_to.emplace_back(i+1);
}
}
cin >> option;
if (!valid_final()) {
cout << "INVALID\n";
return 0;
}
visited = vector<int> (num_op + 1);
aux_visited = vector<int> (num_op + 1);
if(initial == 0) initial = 1;
if (valid_cycle(initial)) {
cout << "INVALID\n";
return 0;
}
switch (option) {
case 0:
cout << "VALID\n";
break;
case 1:
pq.push(initial);
option1();
cout << total_time << "\n";
for (size_t i = 0; i < res.size(); i++) {
cout << res[i] << "\n";
}
break;
case 2:
option2(initial);
cout << ops[initial].best_time << "\n";
break;
case 3:
pq.push(initial);
option3();
break;
default:
break;
}
return 0;
}