| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1090259 | pmqwerty | Magic Tree (CEOI19_magictree) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 100;
vector<int> a[MAXN];
int v[MAXN];
int w[MAXN];
int d[MAXN];
int n, m, k;
int par[MAXN];
int outdegree[MAXN];
namespace sub1{
bool check(){
if (!(n <= 20 && k <= 20)) return 0;
for (int i = 1; i <= m; i++){
if (w[i] > 1) return 0;
}
return 1;
}
int mark[21];
bool flag = true;
void dfs(int u, int t){
if (mark[u]){
if (d[u] > t){
flag = false;
}
}
for (int v: a[u]){
dfs(v, (mark[u] ? d[u]: t));
}
}
void solve(){
long long ans = 0;
for (int mask = 0; mask < (1 << m); mask++){
memset(mark, 0, sizeof(mark));
for (int i = 0; i < m; i++){
if (mask & (1 << i)){
mark[v[i + 1]] = true;
}
}
flag = true;
dfs(1, 1e9);
if (flag){
ans = max(ans, __builtin_popcount(mask));
}
}
cout << ans << '\n';
}
}
namespace sub2{
bool check(){
for (int i = 1; i <= m; i++){
if (outdegree[v[i]] != 0) return 0;
}
return 1;
}
void solve(){
long long ans = 0;
for (int i = 1; i <= m; i++){
ans += w[i];
}
cout << ans << '\n';
}
}
bool sub3_flag = true;
namespace sub3{
bool check(){
if (!sub3_flag) return false;
for (int i = 1; i <= m; i++){
if (w[i] > 1) return false;
}
return true;
}
int lis(vector<int> const& a) {
int n = a.size();
const int INF = 1e9;
vector<int> l(n+1, INF);
l[0] = -INF;
for (int i = 0; i < n; i++) {
int last = upper_bound(l.begin(), l.end(), a[i]) - l.begin();
if (l[last-1] < a[i] && a[i] < l[last])
l[last] = a[i];
}
int ans = 0;
for (int i = 0; i <= n; i++) {
if (l[i] < INF)
ans = i;
}
return ans;
}
void solve(){
vector<int> temp(n, 1e9);
for (int i = 1; i <= m; i++){
temp[v[i] - 1] = d[i];
}
cout << lis(temp) << '\n';
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 2; i <= n; i++){
int x;
cin >> x;
a[x].push_back(i);
outdegree[x]++;
sub3_flag &= ((x == (i - 1)));
}
for (int i = 1; i <= m; i++){
cin >> v[i] >> d[i] >> w[i];
}
if (sub1::check()) sub1::solve();
else if (sub2::check()) sub2::solve();
else if (sub3::check()) sub3::solve();
}