Submission #939250

#	Time	Username	Problem	Language	Result	Execution time	Memory
939250		Whisper	Paprike (COI18_paprike)	C++17	0 / 100	34 ms	9476 KiB

paprike

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode, Lim;
int C[MAX];
vector<int> G[MAX];
int vis[MAX];
void Whisper(){
    cin >> numNode >> Lim;
    for (int i = 1; i <= numNode; ++i) cin >> C[i];
    for (int i = 1; i < numNode; ++i){
        int u, v; cin >> u >> v;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    priority_queue<pair<int, int>> q;
    for (int i = 2; i <= numNode; ++i){
        if ((int)G[i].size() == 1){
            q.emplace(C[i], i);
        }
    }
    int ans = 0;
    while (!q.empty()){
        pair<int, int> f = q.top(); q.pop();
        int du = f.first, u = f.second;
        if (vis[u]) continue;
        vis[u] = 1;
        bool flag = 1;
        for (int &v : G[u]){
            if (du + C[v] <= Lim){
                q.emplace(du + C[v], v);
                flag = 0;
            }
            else{
                q.emplace(C[v], v);
            }
        }
        ans += flag;
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49