oj.uz

Submission #48458

# Submission time Handle Problem Language Result Execution time Memory
48458 2018-05-13T16:38:11 Z WLZ Paprike (COI18_paprike) C++17
0 / 100
 80 ms 8972 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;
typedef long long ll;
const int INF = 1e9;
const int MAXN = 1e5 + 5;
const ll LINF = 1e18;
const double pi = acos(-1);
const double EPS = 1e-9;
template <class T> using MinPQ = priority_queue<T, vector<T>, greater<T>>;
template <class T> using MaxPQ = priority_queue<T>;
void scan() { return; } template<typename T, typename... Args> void scan(T& a, Args&... args) { cin >> a; scan(args...); }
void print() { return; } template<typename T, typename... Args> void print(T a, Args... args) { cout << a << " "; print(args...); }

int n, k;
int a[MAXN];
vector<vector<int>> g;
ll curSize;
bitset<MAXN> vis;

void dfs(int u) {
    vis[u] = 1;
    curSize += a[u];
        for (int v : g[u]) {
        if (!vis[v]) {
            if (a[v] + curSize <= k) {
                dfs(v);
            }
        }
    }
}

bool comp(int i, int j) {
    if (g[i].size() != g[j].size()) return g[i].size() < g[j].size();
    if (a[i] != a[j]) return a[i] < a[j];
    return i < j;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    scan(n, k);
    for (int i = 0; i < n; i++) scan(a[i]);
    g.assign(n, vector<int>());
    vector<int> v = {0};
    for (int i = 1; i < n; i++) {
        int x, y;
        scan(x, y); --x; --y;
        g[x].emplace_back(y);
        g[y].emplace_back(x);
        v.emplace_back(i);
    }
    sort(v.begin(), v.end(), comp);
    int ans = 0;
    for (auto x : v) {
        if (!vis[x]) {
            curSize = 0LL;
            dfs(x);
            ans++;
        }
    }
    printf("%d\n", ans - 1);
    return 0;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 49.0

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