Submission #1033409

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033409		RecursiveCo	Jobs (BOI24_jobs)	C++17	14 / 100	2073 ms	1048576 KiB

Main

// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

vector<vector<int>> adjList;
vector<vector<array<int, 4>>> topnodes;
vector<int> nums;
priority_queue<array<int, 4>> pq;
vector<bool> visited;

void compute(int v, int u, int bal, int minbal) {
    bal += nums[v];
    minbal = min(minbal, bal);
    if (bal > 0) {
        topnodes[u].push_back({minbal, bal, u, v});
    }
    for (int con: adjList[v]) {
        compute(con, u, bal, minbal);
    }
}

bool mark(int u, int v) {
    bool has = false;
    for (int con: adjList[u]) {
        bool here = mark(con, v);
        if (here) has = true;
    }
    if (has || u == v) {
        for (int con: adjList[u]) if (!visited[con]) for (auto path: topnodes[con]) pq.push(path);
        visited[u] = true;
        return true;
    }
    return false;
}

signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        // only solves the path case.
        get(n);
        get(s);
        int ors = s;
        adjList.resize(n);
        topnodes.resize(n);
        vector<int> roots;
        forto(n, i) {
            get(x);
            get(p);
            nums.push_back(x);
            if (p) adjList[p - 1].push_back(i);
            else roots.push_back(i);
        }
        forto(n, i) {
            compute(i, i, 0, 0);
        }
        visited.resize(n, false);
        for (int root: roots) {
            for (auto path: topnodes[root]) pq.push(path);
        }
        while (!pq.empty()) {
            auto top = pq.top();
            pq.pop();
            int minbal = -top[0];
            int bal = top[1];
            int u = top[2];
            int v = top[3];
            if (visited[u]) continue;
            if (s < minbal) break;
            s += bal;
            mark(u, v);
            visited[u] = true;
        }
        out(s - ors);
    //}
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:108:9: note: in expansion of macro 'get'
  108 |         get(n);
      |         ^~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 's' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:109:9: note: in expansion of macro 'get'
  109 |         get(s);
      |         ^~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:114:9: note: in expansion of macro 'forto'
  114 |         forto(n, i) {
      |         ^~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:115:13: note: in expansion of macro 'get'
  115 |             get(x);
      |             ^~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'p' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:116:13: note: in expansion of macro 'get'
  116 |             get(p);
      |             ^~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:121:9: note: in expansion of macro 'forto'
  121 |         forto(n, i) {
      |         ^~~~~

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