oj.uz

답안 #921751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921751 2024-02-04T09:50:09 Z sleepntsheep Magic Tree (CEOI19_magictree) C++17
3 / 100
 2000 ms 236880 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

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


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

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

    for (auto v : g[u])
    {
        dfs(v);
        nocur += dp[v];
        if (s[v].size() > s[u].size()) s[v].swap(s[u]);
        for (auto &[x, x2] : s[v])
        {
            auto it = s[u].lower_bound(make_pair(x, 0));
            if (it != s[u].end())
            {
                int nw = it->second + x2;
                s[u].erase(it);
                s[u].emplace(x, nw);
            }
            else s[u].emplace(x, x2);
        }
    }

    {
        pre[u].emplace_back(k+1, 0);
        for (auto &[x, x2] : s[u]) pre[u].emplace_back(x, x2);
        for (int i = (int)pre[u].size() - 2; i >= 0; --i)
            pre[u][i].second += pre[u][i+1].second;
    }

    if (!fruit) return void(dp[u] = nocur);

    cur = w;

    for (auto v : g[u])
    {
        dfs(v);
        int l = 0, r = (int)pre[v].size() - 1, z = -1;
        while (l <= r)
        {
            int m = (l+r)/2;
            if (pre[v][m].first <= d) l = m + 1, z = m;
            else r = m - 1;
        }
        if (z != -1) cur += pre[v][z].second;
    }

    dp[u] = max(cur, nocur);
}

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;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 76308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 79788 KB Output is correct
2 Correct 264 ms 236880 KB Output is correct
3 Correct 121 ms 87340 KB Output is correct
4 Correct 119 ms 84824 KB Output is correct
5 Correct 214 ms 150640 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2045 ms 79972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2017 ms 93528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 76308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 76632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 76308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 76308 KB Output isn't correct
2 Halted 0 ms 0 KB -