oj.uz

Submission #945574

# Submission time Handle Problem Language Result Execution time Memory
945574 2024-03-14T04:57:23 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
0 / 100
 199 ms 7516 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, k; cin >> n >> m >> k;
    vector <vector<int>> G(n);
    for ( int i = 1; i < n; i++ ){
        int p; cin >> p;
        --p;
        G[p].pb(i);
    }
    vector <int> w(n), d(n);
    for ( int i = 0; i < m; i++ ){
        int d_, v, w_; cin >> v >> d_ >> w_;
        --v;
        w[v] = w_;
        d[v] = d_;
    }
    int opt = 0;
    for ( int mask = 0; mask < 1 << n; mask++ ){
        vector <int> dp(n);
        int cnt = 0;
        for ( int i = 0; i < n; i++ ){
            if ( mask >> i & 1 ){
                dp[i] = d[i];
                cnt += w[i];
            }
        }
        auto dfs = [&](auto dfs, int u) -> bool{
            bool ret = true;
            int mx = 0;
            for ( auto &v: G[u] ){
                ret &= dfs(dfs, v);
                chmax(mx, dp[v]);
            }
            if ( mx > dp[u] && (mask >> u & 1)){
                ret = false;
            } return ret;
        };
        chmax(opt, dfs(dfs, 0) * cnt);
    }
    cout << opt;

    cout << '\n';
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 183 ms 424 KB Output is correct
3 Correct 171 ms 344 KB Output is correct
4 Correct 179 ms 424 KB Output is correct
5 Incorrect 199 ms 600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 6992 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 348 KB Output is correct
2 Correct 183 ms 424 KB Output is correct
3 Correct 171 ms 344 KB Output is correct
4 Correct 179 ms 424 KB Output is correct
5 Incorrect 199 ms 600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1880 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 348 KB Output is correct
2 Correct 183 ms 424 KB Output is correct
3 Correct 171 ms 344 KB Output is correct
4 Correct 179 ms 424 KB Output is correct
5 Incorrect 199 ms 600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 183 ms 424 KB Output is correct
3 Correct 171 ms 344 KB Output is correct
4 Correct 179 ms 424 KB Output is correct
5 Incorrect 199 ms 600 KB Output isn't correct
6 Halted 0 ms 0 KB -