oj.uz

Submission #990490

# Submission time Handle Problem Language Result Execution time Memory
990490 2024-05-30T14:32:26 Z parlimoos Magic Tree (CEOI19_magictree) C++14
3 / 100
 26 ms 10052 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'\

int n , m , k;
vector<int> tr[100000];
ll frt[100000][2] , dp[100000][2];

void dfs(int v = 0){
    dp[v][1] = frt[v][1];
    for(int u : tr[v]){
        dfs(u);
        dp[v][0] += max(dp[u][0] , dp[u][1]);
        if(frt[v][0] >= frt[u][0]) dp[v][1] += max(dp[u][0] , dp[u][1]);
        else dp[v][1] += dp[u][0];
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> k;
    for(int i = 1 ; i < n ; i++){
        int d;
        cin >> d;
        tr[d - 1].pb(i);
    }
    for(int i = 0 ; i < m ; i++){
        int v;
        cin >> v;
        cin >> frt[v - 1][0] >> frt[v - 1][1];
    }
    dfs();
    cout << dp[0][0];
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 1 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Incorrect 1 ms 5724 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 7260 KB Output is correct
2 Correct 17 ms 10052 KB Output is correct
3 Correct 25 ms 6488 KB Output is correct
4 Correct 19 ms 6288 KB Output is correct
5 Correct 26 ms 7248 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 7516 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 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 1 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Incorrect 1 ms 5724 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6236 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 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 1 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Incorrect 1 ms 5724 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 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 1 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Incorrect 1 ms 5724 KB Output isn't correct
6 Halted 0 ms 0 KB -