# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442715 | FlowerOfSorrow | Fireworks (APIO16_fireworks) | C++17 | 187 ms | 83652 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.
#include <bits/stdc++.h>
using namespace std;
template<class F>
struct y_combinator_result{
F f;
template<class T> explicit y_combinator_result(T &&f): f(forward<T>(f)){ }
template<class ...Args> decltype(auto) operator()(Args &&...args){ return f(ref(*this), forward<Args>(args)...); }
};
template<class F>
decltype(auto) y_combinator(F &&f){
return y_combinator_result<decay_t<F>>(forward<F>(f));
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(ios::badbit | ios::failbit);
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n + m);
vector<int> par_w(n + m);
for(auto u = 1; u < n + m; ++ u){
int p;
cin >> p >> par_w[u], -- p;
adj[p].push_back(u);
}
auto res = y_combinator([&](auto self, int u)->pair<pair<int, long long>, priority_queue<long long>>{
pair<int, long long> line{};
priority_queue<long long> pq;
if(u >= n){
# | 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... |