Submission #945567

# Submission time Handle Problem Language Result Execution time Memory
945567 2024-03-14T04:47:09 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
3 / 100
27 ms 5724 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;
}
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);
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 14 ms 2396 KB Output is correct
2 Correct 13 ms 2628 KB Output is correct
3 Correct 27 ms 5716 KB Output is correct
4 Correct 22 ms 5208 KB Output is correct
5 Correct 24 ms 5724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 4484 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -