Submission #945567

#	Time	Username	Problem	Language	Result	Execution time	Memory
945567		vjudge1	Magic Tree (CEOI19_magictree)	C++17	3 / 100	27 ms	5724 KiB

magictree

#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;
}
const int mod = 1e9 + 7;

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  int p[n + 1];
  p[1] = -1;
  for (int i = 2; i <= n; ++i) {
    cin >> p[i];
  }
  int u[m + 1], d[m + 1], w[m + 1];
  for (int i = 1; i <= m; ++i) {
    cin >> u[i] >> d[i] >> w[i];
  }
  cout << accumulate(w + 1, w + m + 1, 0ll);
}

• Subtask 1: 0 / 6
• Subtask 2: 3 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17