Submission #1057193

#	Time	Username	Problem	Language	Result	Execution time	Memory
1057193		slivajan	Jobs (BOI24_jobs)	C++17	0 / 100	111 ms	24296 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long un;
typedef vector<un> vuc;

#define REP(i, a, b) for (un i = (un)a; i < (un)b; i++)
#define FEAC(i, a) for (auto&& i : a)
#define vec vector
#define ALL(x) (x).begin(), (x).end()

vuc penize;
vuc predek;
vec<vuc> graph;
un N, s;

un rekurze(un v){

    un ret = 0;

    FEAC(s, graph[v]) ret += rekurze(s);

    return max((un)0, ret);
}

void easy(){
    un ret = s;

    REP(i, 0, N) {
        if (predek[i] == -1) ret += rekurze(i);
    }

    cout << ret;
}


int main(){
    cin >> N >> s;

    penize = vuc(N);
    predek = vuc(N);

    REP(i, 0, N){
        cin >> penize[i] >> predek[i];
        predek[i]--;
    }

    graph = vec<vuc>(N);

    REP(i, 0, N){
        if (predek[i] != -1) graph[predek[i]].push_back(i);
    }

    if (s == 1e18) {
        easy();
    }
}

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