oj.uz

Submission #921787

# Submission time Handle Problem Language Result Execution time Memory
921787 2024-02-04T10:15:06 Z sleepntsheep Magic Tree (CEOI19_magictree) C++17
0 / 100
 1586 ms 1048576 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>

using u32 = unsigned;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

#define int long long
using namespace std;
using pt = complex<f80>;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 100005

multiset<pair<int, i64>> s[N];


int n, m, k; 
i64 dp[N];
basic_string<int> g[N];

void dfs(int u)
{
    i64 nocur = 0, cur = 0, fruit = s[u].size(), d;
    if (fruit) tie(d, cur) = *s[u].begin();


    for (auto v : g[u])
    {
        dfs(v);
        nocur += dp[v];

        for (auto [x, y] : s[v])
        {
            if (fruit and x <= d) cur += y;
        }
    }


    if (fruit and cur > nocur)
    {
        dp[u] = cur;
        for (auto v : g[u])
        {
            for (auto [x, y] : s[v])
            {
                if (x <= d) s[u].insert({x, y});
            }
        }
    }
    else
    {
        dp[u] = nocur;
        s[u].clear();
        for (auto v : g[u])
        {
            for (auto [x, y] : s[v])
                s[u].insert({x, y});
        }
    }
}

signed main()
{
    ShinLena;
    cin >> n >> m >> k;
    for (int i = 2, p; i <= n; ++i) cin >> p, g[p].push_back(i);
    for (int v, d, w, i = 0; i < m; ++i)
    {
        cin >> v >> d >> w;
        s[v].emplace(d, w);
    }
    dfs(1);
    cout << dp[1];

    return 0;
}

Compilation message

magictree.cpp: In function 'void dfs(long long int)':
magictree.cpp:49:23: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
   49 |             if (fruit and x <= d) cur += y;
      |                 ~~~~~~^~~~~~~~~~

Subtask #1
0 / 6.0

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

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 28752 KB Output is correct
2 Runtime error 1586 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 16.0

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

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 16 ms 11100 KB Output is correct
3 Correct 16 ms 11100 KB Output is correct
4 Correct 22 ms 11412 KB Output is correct
5 Correct 9 ms 10460 KB Output is correct
6 Incorrect 403 ms 234720 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

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

Subtask #8
0 / 17.0

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