oj.uz

Submission #210109

# Submission time Handle Problem Language Result Execution time Memory
210109 2020-03-16T14:53:05 Z casperwang Paprike (COI18_paprike) C++14
13 / 100
 69 ms 12152 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

const int MAXN = 100000;
int n, k;
int a, b;
int cnt;
int v[MAXN+1];
int deg[MAXN+1];
bool vis[MAXN+1];
vector <int> path[MAXN+1];

void DFS(int now, int par) {
  vis[now] = 1;
  for (int i : path[now]) {
    if (vis[i] || i == par) continue;
    if (v[now] + v[i] > k) cnt++;
    else v[i] += v[now];
    deg[i]--;
    if (deg[i] == 1) DFS(i, now);
  }
}

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++)
    cin >> v[i];
  for (int i = 1; i < n; i++) {
    cin >> a >> b;
    path[a].pb(b), deg[a]++;
    path[b].pb(a), deg[b]++;
  }
  for (int i = 1; i <= n; i++)
    if (deg[i] == 1 && !vis[i]) DFS(i, 0);
  cout << cnt << "\n";
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 7 ms 2680 KB Output is correct
3 Correct 6 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Incorrect 6 ms 2680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 11992 KB Output is correct
2 Correct 69 ms 12024 KB Output is correct
3 Correct 59 ms 12024 KB Output is correct
4 Correct 61 ms 12152 KB Output is correct
5 Correct 58 ms 12024 KB Output is correct
6 Correct 56 ms 12024 KB Output is correct
7 Correct 56 ms 12024 KB Output is correct
8 Correct 51 ms 12024 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 7 ms 2680 KB Output is correct
3 Correct 6 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Incorrect 6 ms 2680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 7 ms 2680 KB Output is correct
3 Correct 6 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Incorrect 6 ms 2680 KB Output isn't correct
9 Halted 0 ms 0 KB -