Submission #1038564

#	Time	Username	Problem	Language	Result	Execution time	Memory
1038564		Whisper	Jobs (BOI24_jobs)	C++17	11 / 100	129 ms	49744 KiB

Main

#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, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

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


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

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

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;
    }
#define MAX             300005

int label[MAX], pa[MAX];
vector<int> G[MAX];
int numNode, curMoney;

int dp[MAX];
int vis[MAX];

void pre_dfs(int u, int p = -1){
    vis[u] = 1;
    for (int&v : G[u]) if(!vis[v]) pre_dfs(v);
}

void dfs(int u, int p = -1){
    dp[u] = label[u];

    vector<int> store;
    for (int&v : G[u]) if(v ^ p){
        dfs(v, u);
    }
    for (int&v : G[u]) if(v ^ p){
        store.push_back(dp[v]);
    }
    sort(store.rbegin(), store.rend());

    for (int &val : store) if(val > 0){
        dp[u] += val;
    }
}
void process(void){
    cin >> numNode >> curMoney;
    for (int i = 1; i <= numNode; ++i){
        cin >> label[i] >> pa[i];
        if(pa[i] == 0) continue;

        G[pa[i]].emplace_back(i);
        G[i].emplace_back(pa[i]);

        //pa(i) < i -> G is a tree
    }

    int ans = 0;
    for (int i = 1; i <= numNode; ++i){
        if(!vis[i]){
            pre_dfs(i);
            dfs(i, i);
            if(dp[i] > 0) ans += dp[i];
        }
    }

    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31