oj.uz

답안 #1109961

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109961 2024-11-08T09:10:56 Z ljtunas Magic Tree (CEOI19_magictree) C++17
70 / 100
 137 ms 101704 KB 
// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e6 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e18;

//#define int long long
int n, m, k; vector<int> g[MAXN];

ii c[MAXN];

map<int, ll> mp[MAXN]; bool ok[MAXN];
ll dp[MAXN][2];

void dfs(int u, int par){
    Forv(v, g[u]) if(v ^ par){
        dfs(v, u);
        if(mp[u].size() < mp[v].size()) swap(mp[u], mp[v]);
        Forv(tmp, mp[v]) mp[u][tmp.fi] += tmp.se;
    }
    if (ok[u]){
        auto [day, w] = c[u];
        mp[u][day] += w;
        auto it = mp[u].upper_bound(day);
        while (it != mp[u].end()){
            if (it->se >= w){ it->se -= w; break; }
            auto cur = it; ++it;
            mp[u].erase(cur);
        }
    }
}

void Solve() {
    cin >> n >> m >> k;
    For(i, 2, n){
        int p; cin >> p; g[p].push_back(i);
    }
    For(i, 1, m){
        int node, day, w;
        cin >> node >> day >> w;
        c[node] = {day, w};
        ok[node] = true;
    }
    dfs(1, 0);
    ll ans = 0;
    for(auto [_, w] : mp[1]) ans += w;
    cout << ans << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("CEOI19_magictree.inp", "r")) {
        freopen("CEOI19_magictree.inp", "r", stdin);
        freopen("CEOI19_magictree.out", "w", stdout);
    }

    int t = 1;
//    cin >> t;

    for (int test = 1; test <= t; test++) {
        Solve();
    }
    return 0;
}

Compilation message

magictree.cpp: In function 'int32_t main()':
magictree.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen("CEOI19_magictree.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen("CEOI19_magictree.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 72016 KB Output is correct
2 Correct 24 ms 72032 KB Output is correct
3 Correct 24 ms 72016 KB Output is correct
4 Correct 26 ms 72048 KB Output is correct
5 Correct 24 ms 72060 KB Output is correct
6 Correct 27 ms 72016 KB Output is correct
7 Correct 29 ms 72016 KB Output is correct
8 Correct 24 ms 72016 KB Output is correct
9 Correct 26 ms 72016 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 82772 KB Output is correct
2 Correct 62 ms 82760 KB Output is correct
3 Correct 137 ms 99920 KB Output is correct
4 Correct 87 ms 83276 KB Output is correct
5 Correct 102 ms 84808 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 72180 KB Output is correct
2 Correct 27 ms 72016 KB Output is correct
3 Correct 27 ms 72272 KB Output is correct
4 Correct 79 ms 91264 KB Output is correct
5 Correct 90 ms 95048 KB Output is correct
6 Correct 88 ms 91136 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 78924 KB Output is correct
2 Correct 67 ms 78152 KB Output is correct
3 Correct 80 ms 82128 KB Output is correct
4 Correct 53 ms 79564 KB Output is correct
5 Correct 68 ms 89160 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 72016 KB Output is correct
2 Correct 24 ms 72032 KB Output is correct
3 Correct 24 ms 72016 KB Output is correct
4 Correct 26 ms 72048 KB Output is correct
5 Correct 24 ms 72060 KB Output is correct
6 Correct 27 ms 72016 KB Output is correct
7 Correct 29 ms 72016 KB Output is correct
8 Correct 24 ms 72016 KB Output is correct
9 Correct 26 ms 72016 KB Output is correct
10 Correct 79 ms 84512 KB Output is correct
11 Correct 82 ms 82972 KB Output is correct
12 Correct 69 ms 83820 KB Output is correct
13 Correct 58 ms 80840 KB Output is correct
14 Correct 69 ms 90704 KB Output is correct

Subtask #6
0 / 13.0

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

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 72016 KB Output is correct
2 Correct 24 ms 72032 KB Output is correct
3 Correct 24 ms 72016 KB Output is correct
4 Correct 26 ms 72048 KB Output is correct
5 Correct 24 ms 72060 KB Output is correct
6 Correct 27 ms 72016 KB Output is correct
7 Correct 29 ms 72016 KB Output is correct
8 Correct 24 ms 72016 KB Output is correct
9 Correct 26 ms 72016 KB Output is correct
10 Correct 26 ms 72180 KB Output is correct
11 Correct 27 ms 72016 KB Output is correct
12 Correct 27 ms 72272 KB Output is correct
13 Correct 79 ms 91264 KB Output is correct
14 Correct 90 ms 95048 KB Output is correct
15 Correct 88 ms 91136 KB Output is correct
16 Correct 79 ms 84512 KB Output is correct
17 Correct 82 ms 82972 KB Output is correct
18 Correct 69 ms 83820 KB Output is correct
19 Correct 58 ms 80840 KB Output is correct
20 Correct 69 ms 90704 KB Output is correct
21 Correct 48 ms 76112 KB Output is correct
22 Correct 85 ms 85836 KB Output is correct
23 Correct 91 ms 90004 KB Output is correct
24 Correct 137 ms 101704 KB Output is correct
25 Correct 81 ms 84684 KB Output is correct
26 Correct 112 ms 87428 KB Output is correct
27 Correct 91 ms 86344 KB Output is correct

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 72016 KB Output is correct
2 Correct 24 ms 72032 KB Output is correct
3 Correct 24 ms 72016 KB Output is correct
4 Correct 26 ms 72048 KB Output is correct
5 Correct 24 ms 72060 KB Output is correct
6 Correct 27 ms 72016 KB Output is correct
7 Correct 29 ms 72016 KB Output is correct
8 Correct 24 ms 72016 KB Output is correct
9 Correct 26 ms 72016 KB Output is correct
10 Correct 73 ms 82772 KB Output is correct
11 Correct 62 ms 82760 KB Output is correct
12 Correct 137 ms 99920 KB Output is correct
13 Correct 87 ms 83276 KB Output is correct
14 Correct 102 ms 84808 KB Output is correct
15 Correct 26 ms 72180 KB Output is correct
16 Correct 27 ms 72016 KB Output is correct
17 Correct 27 ms 72272 KB Output is correct
18 Correct 79 ms 91264 KB Output is correct
19 Correct 90 ms 95048 KB Output is correct
20 Correct 88 ms 91136 KB Output is correct
21 Correct 78 ms 78924 KB Output is correct
22 Correct 67 ms 78152 KB Output is correct
23 Correct 80 ms 82128 KB Output is correct
24 Correct 53 ms 79564 KB Output is correct
25 Correct 68 ms 89160 KB Output is correct
26 Correct 79 ms 84512 KB Output is correct
27 Correct 82 ms 82972 KB Output is correct
28 Correct 69 ms 83820 KB Output is correct
29 Correct 58 ms 80840 KB Output is correct
30 Correct 69 ms 90704 KB Output is correct
31 Incorrect 38 ms 72692 KB Output isn't correct
32 Halted 0 ms 0 KB -