# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996605 | jj_master | Jobs (BOI24_jobs) | C++17 | 114 ms | 61656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/** Baltic Olympiad in Informatics 2024 **/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 300001;
vector<int> adj[maxn];
int a[maxn];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> v[maxn];
void dfs(int x) {
for(int i : adj[x]) {
dfs(i);
if(v[i].size() > v[x].size()) {
swap(v[i], v[x]);
}
while(v[i].size()) {
v[x].push(v[i].top());
v[i].pop();
}
}
if(a[x] >= 0) {
v[x].push({0, a[x]});
} else {
pair<int, int> cur = {-a[x], a[x]};
while(v[x].size() && cur.second < 0) {
pair<int, int> tmp = v[x].top();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |