oj.uz

Submission #625301

# Submission time Handle Problem Language Result Execution time Memory
625301 2022-08-10T00:50:57 Z MinaRagy06 Paprike (COI18_paprike) C++17
13 / 100
 27 ms 4588 KB 
#include <bits/stdc++.h>
using namespace std;
#define lesgooo ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl    '\n'
#define int     long long

vector<int> par, sum, sz;
int n, x, y, k;
int find(int u) {return par[u] = (u == par[u]? u : find(par[u]));}
int unionn(int u, int v)
{
    u = find(u), v = find(v);
    if (sum[u]+sum[v] > k) return 1;
    if (sz[u] < sz[v]) swap(u, v);
    sz[u]+=sz[v], par[v] = u, sum[u]+=sum[v];
    return 0; 
}
signed main()
{
    lesgooo;
    cin >> n >> k;
    par.resize(n), sum.resize(n), sz.resize(n);
    for (int i =0 ; i < n; i++) cin >> sum[i], par[i] = i, sz[i] = 1;
    int ans =0 ;
    for (int i = 0; i < n-1; i++) cin >> x >> y, ans+=unionn(--x, --y);
    cout << ans;
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 316 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 4556 KB Output is correct
2 Correct 25 ms 4584 KB Output is correct
3 Correct 25 ms 4580 KB Output is correct
4 Correct 27 ms 4584 KB Output is correct
5 Correct 25 ms 4584 KB Output is correct
6 Correct 25 ms 4556 KB Output is correct
7 Correct 26 ms 4588 KB Output is correct
8 Correct 22 ms 4048 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 316 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 316 KB Output isn't correct
4 Halted 0 ms 0 KB -