# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329403 | tnk2908 | Fireworks (APIO16_fireworks) | C++14 | 213 ms | 53368 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.
//
// main.cpp
// fireworks
//
// Created by Trần Nam Khánh on 11/21/20.
//
#include <iostream>
#include <queue>
using namespace std;
const long long nax=3e5+1;
struct data
{
long long a,b,p,c;
priority_queue<long long>*q;
data operator +(data tmp)
{
data s;
s.p=p;
s.c=c;
s.a=a+tmp.a;
s.b=b+tmp.b;
if(q->size()<tmp.q->size())swap(q,tmp.q);
s.q=q;
while(!tmp.q->empty())
{
s.q->push(tmp.q->top());
tmp.q->pop();
}
return s;
# | 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... |