-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrr.cpp
68 lines (55 loc) · 1.21 KB
/
rr.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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using vpi = vector<pi>;
using vb = vector<bool>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll k;
cin >> k;
vi p(n);
vector<set<int>> ed(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
ed[p[i]].insert(i);
}
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll lo = 1;
ll hi = k;
ll mid = 0;
function<bool(int)> ok = [&](int v) {
if(a[v] == "max") {
bool works = false;
for(int ch : ed[v]) {
if (ok(ch)) works = true;
}
return works;
} else if (a[v] == "min") {
bool works = true;
for(int ch : ed[v]) {
if (!ok(ch)) works = false;
}
return works;
} else if(a[v] == 0) {
}
return false;
};
while (lo < hi) {
mid = (lo + hi + 1) / 2;
if (ok(0)) {
lo = mid;
} else {
hi = mid - 1;
}
}
return 0;
}