oj.uz

Submission #636742

# Submission time Handle Problem Language Result Execution time Memory
636742 2022-08-30T01:28:26 Z iee Transport (COCI19_transport) C++17
13 / 130
 1000 ms 9568 KB 
// iee
#include <bits/stdc++.h>

#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using namespace std;
void work(int);

template <class T> void read(T &x) {
  x = 0;
  int f = 1, ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + (ch - '0');
    ch = getchar();
  }
  x *= f;
}

int main() {
  int TT = 1; // cin >> TT;
  rep(CAS, 1, TT)
    work(CAS);
  return 0;
}
const int N = 1e5 + 5;
int n, a[N];
ll ans;
vector<pair<int, int>> e[N];
void dfs(int u, int pr = -1, int W = 0) {
  if (W < 0) return;
  W += a[u], ++ans;
  for (auto ver: e[u]) {
    int v, w;
    tie(v, w) = ver;
    if (v != pr)
      dfs(v, u, W - w);
  }
}
void work(int CASE) {
  read(n);
  rep(i, 1, n) read(a[i]);
  rep(i, 1, n - 1) {
    int u, v, w;
    read(u), read(v), read(w);
    e[u].emplace_back(v, w);
    e[v].emplace_back(u, w);
  }
  rep(i, 1, n) dfs(i);
  cout << ans - n;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2772 KB Output is correct
2 Correct 9 ms 2940 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 2924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 536 ms 5420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 641 ms 6712 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 8012 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 4416 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 5708 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 6612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 7764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 9568 KB Time limit exceeded
2 Halted 0 ms 0 KB -