oj.uz

답안 #945664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945664 2024-03-14T06:08:02 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
48 / 100
 741 ms 806748 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
  return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
  return a < b ? (a = b) == b : false;
}

void compress(vector<int>& a) {
  vector<int> v;
  map<int, int> mp;
  for (int i = 1; i < size(a); ++i) {
    if (mp.count(a[i])) continue;
    v.push_back(a[i]);
    mp[a[i]];
  }
  sort(all(v));
  for (int i = 0; i < size(v); ++i) {
    mp[v[i]] = i + 1;
  }
  for (int i = 1; i < size(a); ++i) {
    a[i] = mp[a[i]];
  }
}

const int N = 1e5 + 1;

int dp[N][1001];
vector<vector<int>> g;
vector<pair<int, int>> f;

void dfs(int v) {
  for (int to : g[v]) {
    dfs(to);
    int Max = 0;
    for (int k = 0; k <= 1000; ++k) {
      chmax(Max, dp[to][k]);
      dp[v][k] += Max;
    }
  }
  if (f[v].second != -1) {
    int cur = 0;
    for (int to : g[v]) {
      cur += dp[to][f[v].second];
    }
    chmax(dp[v][f[v].second], cur + f[v].first);
  }
  for (int k = 1; k <= 1000; ++k) {
    chmax(dp[v][k], dp[v][k - 1]);
  }
}

struct fenwick {
  int n;
  vector<int> t;
  fenwick(int n) {
    this -> n = n;
    t.assign(n + 1, 0);
  }
  void upd(int i, int delta) {
    for (; i <= n; i += i & -i) {
      chmax(t[i], delta);
    }
  }
  int get(int i) {
    int res = 0;
    for (; i > 0; i -= i & -i) {
      chmax(res, t[i]);
    }
    return res;
  }
};

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  int p[n + 1];
  p[1] = -1;
  vector<int> u(m + 1), d(m + 1), w(m + 1);
  g.resize(n + 1);
  f.assign(n + 1, {-1, -1});
  for (int i = 2; i <= n; ++i) {
    cin >> p[i];
    g[p[i]].push_back(i);
  }
  bool flag = true;
  for (int i = 1; i <= m; ++i) {
    cin >> u[i] >> d[i] >> w[i];
    if (!g[u[i]].empty()) flag = false;
  }
  if (flag) {
    cout << accumulate(w.begin() + 1, w.end(), 0ll);
    return 0;
  }
  compress(d);
  for (int i = 1; i <= m; ++i) {
    f[u[i]] = {w[i], d[i]};
  }
  if (k <= 20) {
    dfs(1);
    cout << *max_element(dp[1], dp[1] + k + 1);
    return 0;
  }
  fenwick fenw(k);
  for (int i = n; i >= 1; --i) {
    if (f[i].second != -1) {
      fenw.upd(f[i].second, fenw.get(f[i].second) + f[i].first);
    }
  }
  cout << fenw.get(k);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 604 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 7260 KB Output is correct
2 Correct 15 ms 8028 KB Output is correct
3 Correct 30 ms 8492 KB Output is correct
4 Correct 25 ms 8408 KB Output is correct
5 Correct 28 ms 8540 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 73 ms 15052 KB Output is correct
5 Correct 63 ms 15052 KB Output is correct
6 Correct 84 ms 14844 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 719 ms 774480 KB Output is correct
2 Correct 710 ms 776088 KB Output is correct
3 Correct 611 ms 792488 KB Output is correct
4 Correct 741 ms 750976 KB Output is correct
5 Correct 497 ms 806748 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 623 ms 776264 KB Output is correct
11 Correct 608 ms 776212 KB Output is correct
12 Correct 493 ms 792776 KB Output is correct
13 Correct 600 ms 749812 KB Output is correct
14 Correct 438 ms 806548 KB Output is correct

Subtask #6
0 / 13.0

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

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 73 ms 15052 KB Output is correct
14 Correct 63 ms 15052 KB Output is correct
15 Correct 84 ms 14844 KB Output is correct
16 Correct 623 ms 776264 KB Output is correct
17 Correct 608 ms 776212 KB Output is correct
18 Correct 493 ms 792776 KB Output is correct
19 Correct 600 ms 749812 KB Output is correct
20 Correct 438 ms 806548 KB Output is correct
21 Incorrect 9 ms 2652 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 18 ms 7260 KB Output is correct
11 Correct 15 ms 8028 KB Output is correct
12 Correct 30 ms 8492 KB Output is correct
13 Correct 25 ms 8408 KB Output is correct
14 Correct 28 ms 8540 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 73 ms 15052 KB Output is correct
19 Correct 63 ms 15052 KB Output is correct
20 Correct 84 ms 14844 KB Output is correct
21 Correct 719 ms 774480 KB Output is correct
22 Correct 710 ms 776088 KB Output is correct
23 Correct 611 ms 792488 KB Output is correct
24 Correct 741 ms 750976 KB Output is correct
25 Correct 497 ms 806748 KB Output is correct
26 Correct 623 ms 776264 KB Output is correct
27 Correct 608 ms 776212 KB Output is correct
28 Correct 493 ms 792776 KB Output is correct
29 Correct 600 ms 749812 KB Output is correct
30 Correct 438 ms 806548 KB Output is correct
31 Incorrect 4 ms 2392 KB Output isn't correct
32 Halted 0 ms 0 KB -