oj.uz

Submission #1090238

# Submission time Handle Problem Language Result Execution time Memory
1090238 2024-09-18T05:38:39 Z pmqwerty Magic Tree (CEOI19_magictree) C++17
3 / 100
 79 ms 5776 KB 
#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));
             long long cnt = 0;
             for (int i = 0; i < m; i++){
                  if (mask & (1 << i)){
                      mark[v[i + 1]] = true;
                      cnt += w[i + 1];
                  }
             }
             flag = true;
             dfs(1, 1e9);
             if (flag){
                 ans = max(ans, cnt);
             }
        }
        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';
    }
}
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]++;
    }
    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();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 79 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4712 KB Output is correct
2 Correct 13 ms 5724 KB Output is correct
3 Correct 23 ms 4948 KB Output is correct
4 Correct 20 ms 4316 KB Output is correct
5 Correct 29 ms 4700 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 5776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 79 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 79 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 79 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -